Metaheuristics for time-dependent vehicle routing problem with time windows

Yun-Chia Liang, Vanny Minanda, Aldy Gunawan and Hsiang-Ling Chen

International Journal of Operational Research, 2024, vol. 51, issue 4, 449-468

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.

Keywords: vehicle routing problem; VRP; time window; harmony search algorithm; HSA; genetic algorithm; metaheuristic. (search for similar items in EconPapers)
Date: 2024
References: Add references at CitEc
Citations:

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

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 ().