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

A Simulated Annealing Algorithm for a two-stage fixed charge distribution problem of a Supply Chain

Author

Listed:
  • A.N. Balaji
  • N. Jawahar

Abstract

This article considers a two-stage distribution problem of a Supply Chain that is associated with a fixed charge. Two kinds of cost are involved in this problem: a continuous cost that linearly increases with the amount transported between a source and a destination, and secondly, a fixed charge, that incurs whenever there exists a transportation of a non-zero quantity between a source and a destination. The objective criterion is the minimisation of the total cost of distribution. A Simulated Annealing Algorithm (SAA) that belongs to heuristic search method is proposed and illustrated. The proposed methodology is evaluated for its solution quality by comparing it with the approximate and lower bound solutions. Thus, the comparison reveals that the SAA generates better solution than the approximation method and is capable of providing solution either equal or closer to the lower bound solution of the problem.

Suggested Citation

  • A.N. Balaji & N. Jawahar, 2010. "A Simulated Annealing Algorithm for a two-stage fixed charge distribution problem of a Supply Chain," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 7(2), pages 192-215.
    • Handle: RePEc:ids:ijores:v:7:y:2010:i:2:p:192-215
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=30803
    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. A. N. Balaji & J. Mukund Nilakantan & Izabela Nielsen & N. Jawahar & S. G. Ponnambalam, 2019. "Solving fixed charge transportation problem with truck load constraint using metaheuristics," Annals of Operations Research, Springer, vol. 273(1), pages 207-236, February.

    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:7:y:2010:i:2:p:192-215. 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.