TITLE:
Minimum Cost of Capacity Expansion for Time-Limited Transportation Problem On-Demand
AUTHORS:
Hui Ding, Zhimin Zou
KEYWORDS:
Capacity Expansion, Minimum Cost Maximum Flow, Transportation Problem, Network with Lower and Upper Arc Capacities
JOURNAL NAME:
Journal of Computer and Communications,
Vol.10 No.7,
July
27,
2022
ABSTRACT: 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.