Metaheuristics for time-dependent vehicle routing problem with time windows Online publication date: Mon, 16-Dec-2024
by Yun-Chia Liang; Vanny Minanda; Aldy Gunawan; Hsiang-Ling Chen
International Journal of Operational Research (IJOR), Vol. 51, No. 4, 2024
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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:
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
Our Blog 
Follow us on Twitter 
Visit us on Facebook