Author(s)

Hui Ding^*, Zhimin Zou

School of Mathematics and Statistics, Sichuan University of Science and Engineering, Zigong, China.

The minimum cost of capacity expansion for time-limited transportation problem on-demand (MCCETLTPD) is to find such a practicable capacity expansion transportation scheme satisfying the time-limited T along with all origins’ supply and all destinations’ demands as well as the expanding cost is minimum. Actually, MCCETLTPD is a balance transportation problem and a variant problem of minimum cost maximum flow problem. In this paper, by creating a mathematical model and constructing a network with lower and upper arc capacities, MCCETLTPD is transformed into searching feasible flow in the constructed network, and consequently, an algorithm MCCETLTPD-A is developed as MCCETLTPD’s solution method basing minimum cost maximum flow algorithm. Computational study validates that the MCCETLTPD-A algorithm is an efficient approach to solving the MCCETLTPD.

Capacity Expansion, Minimum Cost Maximum Flow, Transportation Problem, Network with Lower and Upper Arc Capacities

Ding, H. and Zou, Z. (2022) Minimum Cost of Capacity Expansion for Time-Limited Transportation Problem On-Demand. Journal of Computer and Communications, 10, 53-71. doi: 10.4236/jcc.2022.107004.