A particle swarm optimisation algorithm for the capacitated location-routing problem

Jie Liu and Voratas Kachitvichyanukul

International Journal of Operational Research, 2015, vol. 24, issue 2, 184-213

Abstract: This article presents a particle swarm optimisation algorithm for solving a capacitated location routing problem (LRP). Based on the framework of particle swarm optimisation with multiple social learning terms (GLNPSO), a solution representation is designed as a multi-dimensional particle representing depot element and customer element. Each particle is decoded into a solution by using the position of a particle to determine depot location, customer assignment, and route construction. The proposed algorithm is evaluated using a set of benchmark problem instances. The results show that the solution quality is good for large problem instances and a total of nine new best solutions are found. Additional performance indices are also proposed as additional indicators to assess the operational performance of the location selection and route forming decisions.

Keywords: location routing problem; capacitated LRP; PSO; particle swarm optimisation; social learning terms; solution representation; decoding; depot location; customer assignment; route construction. (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=71494 (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:ijores:v:24:y:2015:i:2:p:184-213

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().