IDEAS home Printed from https://ideas.repec.org/a/igg/jisscm/v2y2009i4p24-42.html
   My bibliography  Save this article

Genetic Algorithm to Solve Multi-Period, Multi-Product, Bi-Echelon Supply Chain Network Design Problem

Author

Listed:
  • R. Dhanalakshmi

    (IBM India Pvt. Ltd, Bangalore, India)

  • P. Parthiban

    (National Institute of Technology, India)

  • K. Ganesh

    (Tata Consultancy Services Limited, India)

  • T. Arunkumar

    (Vellore Institute of Technology, India)

Abstract

In many multi-stage manufacturing supply chains, transportation related costs are a significant portion of final product costs. It is often crucial for successful decision making approaches in multi-stage manufacturing supply chains to explicitly account for non-linear transportation costs. In this article, we have explored this problem by considering a Two-Stage Production-Transportation (TSPT). A two-stage supply chain that faces a deterministic stream of external demands for a single product is considered. A finite supply of raw materials, and finite production at stage one has been assumed. Items are manufactured at stage one and transported to stage two, where the storage capacity of the warehouses is limited. Packaging is completed at stage two (that is, value is added to each item, but no new items are created), and the finished goods inventories are stored which is used to meet the final demand of customers. During each period, the optimized production levels in stage one, as well as transportation levels between stage one and stage two and routing structure from the production plant to warehouses and then to customers, must be determined. The authors consider “different cost structures,” for both manufacturing and transportation. This TSPT model with capacity constraint at both stages is optimized using Genetic Algorithms (GA) and the results obtained are compared with the results of other optimization techniques of complete enumeration, LINDO, and CPLEX.

Suggested Citation

  • R. Dhanalakshmi & P. Parthiban & K. Ganesh & T. Arunkumar, 2009. "Genetic Algorithm to Solve Multi-Period, Multi-Product, Bi-Echelon Supply Chain Network Design Problem," International Journal of Information Systems and Supply Chain Management (IJISSCM), IGI Global, vol. 2(4), pages 24-42, October.
  • Handle: RePEc:igg:jisscm:v:2:y:2009:i:4:p:24-42
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jisscm.2009062902
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:igg:jisscm:v:2:y:2009:i:4:p:24-42. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    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.