IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v6y2009i3p304-329.html
   My bibliography  Save this article

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

Author

Listed:
  • K. Antony Arokia Durai Raj
  • Chandrasekharan Rajendran

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.

Suggested Citation

  • K. Antony Arokia Durai Raj & Chandrasekharan Rajendran, 2009. "Fast heuristic algorithms to solve a single-stage Fixed-Charge Transportation Problem," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 6(3), pages 304-329.
  • Handle: RePEc:ids:ijores:v:6:y:2009:i:3:p:304-329
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=26936
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Hong, Jiangtao & Diabat, Ali & Panicker, Vinay V. & Rajagopalan, Sridharan, 2018. "A two-stage supply chain problem with fixed costs: An ant colony optimization approach," International Journal of Production Economics, Elsevier, vol. 204(C), pages 214-226.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijores:v:6:y:2009:i:3:p:304-329. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=170 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.