Fast heuristic algorithms to solve a single-stage Fixed-Charge Transportation Problem

K. Antony Arokia Durai Raj and Chandrasekharan Rajendran

International Journal of Operational Research, 2009, vol. 6, issue 3, 304-329

Abstract: The Fixed-Charge Transportation Problem (FCTP) is an extension of the classical transportation problem. It considers a fixed charge (or a fixed cost) and a transportation cost per unit transported associated with each route. The presence of the fixed cost in the objective function makes the problem difficult to solve, thereby requiring the use of heuristic methods. In this paper, simple heuristic algorithms are proposed, and their performances are compared with the existing best method by making use of benchmark problem instances.

Keywords: single-stage fixed charge transportation; heuristic algorithms; fixed costs; FCTP; fixed charges; benchmarking. (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.inderscience.com/link.php?id=26936 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:6:y:2009:i:3:p:304-329

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().