Computer Science and Information Engineering, World Congress on (2009)

Los Angeles, California USA

Mar. 31, 2009 to Apr. 2, 2009

ISBN: 978-0-7695-3507-4

pp: 574-580

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CSIE.2009.110

ABSTRACT

Fixed-charge transportation problem (FCTP) is an extension of classical transportation problem in which a fixed cost is incurred, independent of the amount transported, along with a variable cost that is proportional to the amount shipped. In this paper, FCTP is formulated using a mixed integer programming model, and transformed into a series of minimum cost maximum flow (MCMF) problems for solution. Based on MCMF algorithm, a heuristic algorithm, named FCTP-HA, is presented to solve FCTP. The theory, on which FCTP-HA is based, is strictly proved. FCTP-HA not only can find good heuristic even optimal solution to FCTP, but also has good performance in the sense of being implemented on computer, computational time and required memory for computation. Numerical experiments demonstrate that FCTP-HA is an efficient and robust method to solve FCTP.

INDEX TERMS

transportation problem, fixed-charge, maximum flow, minimum cost maximum flow

CITATION

Renan Jia,
Fanrong Xie,
"A Heuristic Algorithm for Solving Fixed-Charge Transportation Problem",

*Computer Science and Information Engineering, World Congress on*, vol. 02, no. , pp. 574-580, 2009, doi:10.1109/CSIE.2009.110