IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v24y2015i2p184-213.html
   My bibliography  Save this article

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

Author

Listed:
  • Jie Liu
  • Voratas Kachitvichyanukul

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.

Suggested Citation

  • Jie Liu & Voratas Kachitvichyanukul, 2015. "A particle swarm optimisation algorithm for the capacitated location-routing problem," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 24(2), pages 184-213.
  • Handle: RePEc:ids:ijores:v:24:y:2015:i:2:p:184-213
    as

    Download full text from publisher

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

    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.