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

Authors: K. Antony Arokia Durai Raj, Chandrasekharan Rajendran

Addresses: Department of Management Studies, Indian Institute of Technology Madras, Chennai 600 036, India. ' Department of Management Studies, Indian Institute of Technology Madras, Chennai 600 036, India

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.

DOI: 10.1504/IJOR.2009.026936

International Journal of Operational Research, 2009 Vol.6 No.3, pp.304 - 329

Published online: 09 Jul 2009 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article