This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 WRI World Congress on Computer Science and Information Engineering
A Heuristic Algorithm for Solving Fixed-Charge Transportation Problem
Los Angeles, California USA
March 31-April 02
ISBN: 978-0-7695-3507-4
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:
Fanrong Xie, Renan Jia, "A Heuristic Algorithm for Solving Fixed-Charge Transportation Problem," csie, vol. 2, pp.574-580, 2009 WRI World Congress on Computer Science and Information Engineering, 2009
Usage of this product signifies your acceptance of the Terms of Use.