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

Metaheuristics for time-dependent vehicle routing problem with time windows

Author

Listed:
  • Yun-Chia Liang
  • Vanny Minanda
  • Aldy Gunawan
  • Hsiang-Ling Chen

Abstract

Vehicle routing problem (VRP), a combinatorial problem, deals with the vehicle's capacity visiting a particular set of nodes while its variants attempt to fit real-world scenarios. Our study aims to minimise total travelling time, total distance, and the number of vehicles under time-dependent and time windows constraints (TDVRPTW). The harmony search algorithm (HSA) focuses on the harmony memory and pitch adjustment mechanism for new solution construction. Several local search operators and a roulette wheel for the performance improvement were verified via 56 Solomon's VRP instances by adding a speed matrix. The performance comparison with a genetic algorithm (GA) was completed with the same number of parameters and ran in the same computer specification to justify its performance. The results show that HSA can outperform the GA in some instances. The research outcomes suggest that HSA can solve TDVRPTW with comparable results to other commonly used metaheuristic approaches.

Suggested Citation

  • Yun-Chia Liang & Vanny Minanda & Aldy Gunawan & Hsiang-Ling Chen, 2024. "Metaheuristics for time-dependent vehicle routing problem with time windows," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 51(4), pages 449-468.
    • Handle: RePEc:ids:ijores:v:51:y:2024:i:4:p:449-468
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=143338
    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:51:y:2024:i:4:p:449-468. 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.