IDEAS home Printed from https://ideas.repec.org/a/ids/ijsoma/v18y2014i2p115-141.html
   My bibliography  Save this article

Efficient heuristics for cost optimisation in multi stage supply chain network with a fixed transportation charge

Author

Listed:
  • P. Manimaran
  • V. Selladurai

Abstract

This paper addresses multi stage supply chain network (MSCN) problem associated with fixed cost. The MSCN problem involves the selection of suppliers, locating manufacturing plants and distribution centres and determining the optimum/best strategy for distributing the products from the plants to the distribution centres and from the distribution centres to the customers. The objective is to select the optimum numbers, locations and capacities of plants and distribution centres to open so that all customer demand is satisfied at minimum cost. The problem chosen goes beyond the traditional mathematical programming and it becomes a non-polynomial (NP) hard while considering the fixed costs. We develop a mixed integer programming model and provide an efficient heuristic solution procedure for this distribution system problem. Several numerical experimental results are presented and compared with the approximate and lower bound solutions to show the effectiveness of the proposed method. The comparison reveals that the proposed heuristics generates better solution than the approximation method and closer to lower bound solutions.

Suggested Citation

  • P. Manimaran & V. Selladurai, 2014. "Efficient heuristics for cost optimisation in multi stage supply chain network with a fixed transportation charge," International Journal of Services and Operations Management, Inderscience Enterprises Ltd, vol. 18(2), pages 115-141.
    • Handle: RePEc:ids:ijsoma:v:18:y:2014:i:2:p:115-141
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=61997
    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.

    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:ijsoma:v:18:y:2014:i:2:p:115-141. 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=150 .

    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.