
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
2009 WRI World Congress on Computer Science and Information Engineering
A Heuristic Algorithm for Solving FixedCharge Transportation Problem
Los Angeles, California USA
March 31April 02
ISBN: 9780769535074
ASCII Text  x  
Fanrong Xie, Renan Jia, "A Heuristic Algorithm for Solving FixedCharge Transportation Problem," Computer Science and Information Engineering, World Congress on, vol. 2, pp. 574580, 2009 WRI World Congress on Computer Science and Information Engineering, 2009.  
BibTex  x  
@article{ 10.1109/CSIE.2009.110, author = {Fanrong Xie and Renan Jia}, title = {A Heuristic Algorithm for Solving FixedCharge Transportation Problem}, journal ={Computer Science and Information Engineering, World Congress on}, volume = {2}, year = {2009}, isbn = {9780769535074}, pages = {574580}, doi = {http://doi.ieeecomputersociety.org/10.1109/CSIE.2009.110}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  CONF JO  Computer Science and Information Engineering, World Congress on TI  A Heuristic Algorithm for Solving FixedCharge Transportation Problem SN  9780769535074 SP574 EP580 A1  Fanrong Xie, A1  Renan Jia, PY  2009 KW  transportation problem KW  fixedcharge KW  maximum flow KW  minimum cost maximum flow VL  2 JA  Computer Science and Information Engineering, World Congress on ER   
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CSIE.2009.110
Fixedcharge 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 FCTPHA, is presented to solve FCTP. The theory, on which FCTPHA is based, is strictly proved. FCTPHA 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 FCTPHA is an efficient and robust method to solve FCTP.
Index Terms:
transportation problem, fixedcharge, maximum flow, minimum cost maximum flow
Citation:
Fanrong Xie, Renan Jia, "A Heuristic Algorithm for Solving FixedCharge Transportation Problem," csie, vol. 2, pp.574580, 2009 WRI World Congress on Computer Science and Information Engineering, 2009
Usage of this product signifies your acceptance of the Terms of Use.