A hybrid metaheuristic for the time-dependent vehicle routing problem with hard time windows

This article paper presents a hybrid metaheuristic algorithm to solve the time-dependent vehicle routing problem with hard time windows. Time-dependent travel times are influenced by different congestion levels experienced throughout the day. Vehicle scheduling without consideration of congestion might lead to underestimation of travel times and consequently missed deliveries. The algorithm presented in this paper makes use of Large Neighbourhood Search approaches and Variable Neighbourhood Search techniques to guide the search. A first stage is specifically designed to reduce the number of vehicles required in a search space by the reduction of penalties generated by time-window violations with Large Neighbourhood Search procedures. A second stage minimises the travel distance and travel time in an ‘always feasible’ search space. Comparison of results with available test instances shows that the proposed algorithm is capable of obtaining a reduction in the number of vehicles (4.15%), travel distance (10.88%) and travel time (12.00%) compared to previous implementations in reasonable time

[1]  Yu Sang Chang,et al.  More Traffic Congestion in Larger Cities? - Scaling Analysis of the Large 101 U.S Urban Centers , 2015 .

[2]  Richard F. Hartl,et al.  Variable Neighborhood Search for the Time-Dependent Vehicle Routing Problem with Soft Time Windows , 2011, LION.

[3]  Michael Drexl,et al.  Rich vehicle routing in theory and practice , 2012, Logist. Res..

[4]  Richard F. Hartl,et al.  A Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows , 2004, J. Heuristics.

[5]  Pierre Hansen,et al.  Variable neighborhood search , 1997, Eur. J. Oper. Res..

[6]  David Pisinger,et al.  An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows , 2006, Transp. Sci..

[7]  Tom Cherrett,et al.  Requirements from vehicle routing software: perspectives from literature, developers and the freight industry , 2018 .

[8]  Will Maden,et al.  A Road TimetableTM to aid vehicle routing and scheduling , 2006, Comput. Oper. Res..

[9]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[10]  Michel Gendreau,et al.  A guide to vehicle routing heuristics , 2002, J. Oper. Res. Soc..

[11]  Pierre Hansen,et al.  Variable neighbourhood search: methods and applications , 2010, Ann. Oper. Res..

[12]  Paul Shaw,et al.  A new local search algorithm providing high quality solutions to vehicle routing problems , 1997 .

[13]  Kenneth Sörensen,et al.  Metaheuristics - the metaphor exposed , 2015, Int. Trans. Oper. Res..

[14]  Michel Gendreau,et al.  An efficient variable neighborhood search heuristic for very large scale vehicle routing problems , 2007, Comput. Oper. Res..

[15]  Emmanouil E. Zachariadis,et al.  A strategy for reducing the computational complexity of local search-based methods for the vehicle routing problem , 2010, Comput. Oper. Res..

[16]  Jan Fabian Ehmke,et al.  Advanced routing for city logistics service providers based on time-dependent travel times , 2012, J. Comput. Sci..

[17]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[18]  Roberto Montemanni,et al.  Time dependent vehicle routing problem with a multi ant colony system , 2008, Eur. J. Oper. Res..

[19]  Paul Shaw,et al.  Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems , 1998, CP.

[20]  Miguel A. Figliozzi,et al.  The time dependent vehicle routing problem with time windows: Benchmark problems, an efficient solution algorithm, and solution characteristics , 2012 .

[21]  Wout Dullaert,et al.  A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows , 2010, Comput. Oper. Res..

[22]  Michel Gendreau,et al.  Vehicle dispatching with time-dependent travel times , 2003, Eur. J. Oper. Res..

[23]  Michel Gendreau,et al.  Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms , 2005, Transp. Sci..

[24]  Erwin W. Hans,et al.  Vehicle routing under time-dependent travel times: The impact of congestion avoidance , 2012, Comput. Oper. Res..

[25]  Glaydston Mattos Ribeiro,et al.  An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem , 2012, Comput. Oper. Res..

[26]  Tom Van Woensel,et al.  Branch and Price for the Time-Dependent Vehicle Routing Problem with Time Windows , 2013, Transp. Sci..

[27]  Michel Gendreau,et al.  Vehicle Routing Problem with Time Windows, Part II: Metaheuristics , 2005, Transp. Sci..

[28]  David Pisinger,et al.  A general heuristic for vehicle routing problems , 2007, Comput. Oper. Res..

[29]  Michel Gendreau,et al.  A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows , 2013, Comput. Oper. Res..

[30]  Michael Browne,et al.  Home Delivery and the Impacts on Urban Freight Transport: A Review , 2014 .

[31]  Ali Haghani,et al.  A dynamic vehicle routing problem with time-dependent travel times , 2005, Comput. Oper. Res..

[32]  Kien Ming Ng,et al.  Vehicle routing problem with a heterogeneous fleet and time windows , 2014, Expert Syst. Appl..

[33]  Mark S. Daskin,et al.  Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms , 1992, Transp. Sci..

[34]  F.-H. Liu,et al.  The fleet size and mix vehicle routing problem with time windows , 1999, J. Oper. Res. Soc..

[35]  Olli Bräysy,et al.  A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows , 2003, INFORMS J. Comput..

[36]  James P. Kelly,et al.  The Impact of Metaheuristics on Solving the Vehicle Routing Problem: Algorithms, Problem Sets, and Computational Results , 1998 .

[37]  G. Dueck,et al.  Record Breaking Optimization Results Using the Ruin and Recreate Principle , 2000 .

[38]  Michel Gendreau,et al.  Time-dependent routing problems: A review , 2015, Comput. Oper. Res..

[39]  Geir Hasle,et al.  Software Tools and Emerging Technologies for Vehicle Routing and Intermodal Transportation , 2014, Vehicle Routing.

[40]  Bernhard Fleischmann,et al.  Time-Varying Travel Times in Vehicle Routing , 2004, Transp. Sci..

[41]  S. Chopra,et al.  Supply Chain Management: Strategy, Planning & Operation , 2007 .

[42]  Chryssi Malandraki,et al.  Time dependent vehicle routing problems : formulations, solution algorithms and computational experiments , 1989 .

[43]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..