IDEAS home Printed from https://ideas.repec.org/a/ids/ijmtma/v15y2008i1p64-83.html
   My bibliography  Save this article

Optimisation of distribution networks using Genetic Algorithms. Part 1 – problem modelling and automatic generation of solutions

Author

Listed:
  • Romeo M. Marian
  • Lee H.S. Luong
  • Raknoi Akararungruangkul

Abstract

This paper presents a generalised methodology developed for the optimisation of the distribution networks based on Genetic Algorithms (GA). Specifically, it focuses on capacitated Location–Allocation problems. The approach is general, permitting, at this stage, the use of any combination of transportation and warehousing costs for a deterministic demand. Moreover, the methodology has been designed to have the flexibility to be adapted, in the future, for other realistic conditions and constraints: stochastic conditions, multi-echelon Supply Chain, direct and reverse logistics, single or multi-commodities, seasonal production, etc. Due to the complexity and extent of the problem, the paper was split into two parts. The first part deals with modelling of the problem and the automatic generation of the initial population of chromosomes – a set of solutions to the problem. The second part of the paper details the full GA and the genetic operators. An example of applying the algorithm for 25 Production Facilities (PFs), 10 warehouses and 25 retailers (520 variables interrelated with complex constraints) is presented, demonstrating the robustness of the algorithm and its capacity to tackle problems of practical size.

Suggested Citation

  • Romeo M. Marian & Lee H.S. Luong & Raknoi Akararungruangkul, 2008. "Optimisation of distribution networks using Genetic Algorithms. Part 1 – problem modelling and automatic generation of solutions," International Journal of Manufacturing Technology and Management, Inderscience Enterprises Ltd, vol. 15(1), pages 64-83.
  • Handle: RePEc:ids:ijmtma:v:15:y:2008:i:1:p:64-83
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=18240
    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:ijmtma:v:15:y:2008:i:1:p:64-83. 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=21 .

    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.