Mathematical Model and Solving Method Based on Software for the Shortest Time Limited Transportation Problem

The shortest time limited transportation problem and its extension case are studied in this paper. By introducing the 0-1 variables, the shortest time limited transportation problem can be formulated into a linear programming model while its extension case can be formulated into a nonlinear programming model. The programs for solving both models based on Lingo software are compiled. The models and algorithms are tested by two examples. The results show that the solving method base on software is both effect and exact, so it is an efficient method for solving large size of real problems.