IDEAS home Printed from https://ideas.repec.org/a/ids/ijlsma/v40y2021i1p52-69.html
   My bibliography  Save this article

A multiple ant colony system with random variable neighbourhood descent for the vehicle routing problem with time windows

Author

Listed:
  • Orivalde S. Silva Júnior
  • José E. Leal

Abstract

This paper proposes hybrid heuristics that use the multiple ant colony system (MACS) and random variable neighbourhood descent (RVND) algorithms to solve the vehicle routing problem with time windows (VRPTW). This problem involves determining the minimum-cost routes for a fleet of vehicles of the same capacity to visit a set of customers within a specified time interval, called a time window. The proposed heuristic, called MACS-RVND, uses two ant colonies to reduce the number of vehicles and the total distance travelled, and a RVND algorithm is used in the local search procedure. The algorithm was tested using standard benchmark problems in the literature and produced competitive results. The use of the RVND algorithm improved the MACS-VRPTW algorithm.

Suggested Citation

  • Orivalde S. Silva Júnior & José E. Leal, 2021. "A multiple ant colony system with random variable neighbourhood descent for the vehicle routing problem with time windows," International Journal of Logistics Systems and Management, Inderscience Enterprises Ltd, vol. 40(1), pages 52-69.
    • Handle: RePEc:ids:ijlsma:v:40:y:2021:i:1:p:52-69
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=117687
    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:ijlsma:v:40:y:2021:i:1:p:52-69. 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=134 .

    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.