A particle swarm optimisation algorithm for the capacitated location-routing problem
by Jie Liu; Voratas Kachitvichyanukul
International Journal of Operational Research (IJOR), Vol. 24, No. 2, 2015

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.

Online publication date: Mon, 31-Aug-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com