Modeling of Transport Problem in Linear Programming with Python (PULP)

Amit K Jha; Govind S Sharma; Nitesh Kaushik

Amit K Jha Department of Computer Science and Engineering, Poornima University, Jaipur, India
Govind S Sharma Department of Mathematics, Suresh Gyan Vihar University, India
Nitesh Kaushik Department of Computer Science and Engineering, Poornima University, Jaipur, India

Keywords: Zero-One programming, Transportation, Integer programming, Minimization, Python, PULP, Algorithm.

Abstract

Integer programming is a framework for rapid conversion and global optimum. The basic issue in transportation problem is to minimize the cost or time (distance) of delivery. There are two things in our consideration, one is cost of transportation and other demand or how much can be supply. This paper will discuss the transportation problem and apply the zero-one integer assignment to reduce the complexity of the transportation solving concept. The paper will develop the concept to solve the transportation problem and apply the zero-one integer to find the optimum cost of transportation. This paper convert transportation problem in integer programming than solve with machine learning. The paper will present a model of transportation problem solution with the PULP software. We will introduce the programming in Python to make a model to minimize the cost (time or distance) in any transportation problem and Mathematical algorithm of zero-one Transportation programming to solve these types of problems.

Downloads

Download data is not yet available.