Optimisation of distribution networks using Genetic Algorithms. Part 2 – the Genetic Algorithm and Genetic Operators
Romeo M. Marian,
Lee H.S. Luong and
Raknoi Akararungruangkul
International Journal of Manufacturing Technology and Management, 2008, vol. 15, issue 1, 84-101
Abstract:
This paper presents a methodology developed for the optimisation of distribution networks based on Genetic Algorithms (GA), specifically capacitated location-allocation problems. Due to the complexity and extent of the paper, it was split into two parts. Modelling issues and automatic generation of initial population of chromosomes were treated in the first part. This second part details the rest of the GA. Due to the intricacy of the problem, the GA was designed to work only with feasible chromosomes and modified operators were chosen to handle its highly constrained character. They are presented in detail. An example of applying the algorithm for 25 Production Facilities (PF), 10 Distribution Centres (DCs) and 25 Retailers (R) – including 520 variables, tightly interconnected – is presented, demonstrating the robustness of GA and its capacity to tackle problems of considerable size.
Keywords: capacitated location–allocation problem; distribution networks; genetic algorithms; GAs; optimisation; transportation costs; warehousing costs; genetic operators. (search for similar items in EconPapers)
Date: 2008
References: Add references at CitEc
Citations:
Downloads: (external link)
http://www.inderscience.com/link.php?id=18241 (text/html)
Access to full text is restricted to subscribers.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmtma:v:15:y:2008:i:1:p:84-101
Access Statistics for this article
More articles in International Journal of Manufacturing Technology and Management from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().