Simulated Annealing with Restart Strategy for the Path Cover Problem with Time Windows

This research presents a variant of the vehicle routing problem known as the path cover problem with time windows (PCPTW), in which each vehicle starts with a particular customer and finishes its route at another customer. The vehicles serve each customer within the customer’s time windows. PCPTW is motivated by a practical strategy for companies to reduce operational cost by hiring freelance workers, thus allowing workers to directly service customers without reporting to the office. A mathematical programming model is formulated for the problem. This research also proposes a simulated annealing heuristic with restart strategy (SARS) to solve PCPTW and test it on several benchmark datasets. Computational results indicate that the proposed SARS effectively solves PCPTW.

[1]  D Sariklis,et al.  A heuristic method for the open vehicle routing problem , 2000, J. Oper. Res. Soc..

[2]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[3]  Tom Van Woensel,et al.  Time-dependent vehicle routing problem with path flexibility , 2017 .

[4]  Martijn Mes,et al.  Mathematical formulations and improvements for the multi-depot open vehicle routing problem , 2020, Optim. Lett..

[5]  Panagiotis P. Repoussis,et al.  The open vehicle routing problem with time windows , 2007, J. Oper. Res. Soc..

[6]  Richard W. Eglese,et al.  Simulated annealing: A tool for operational research , 1990 .

[7]  Jianhua Xiao,et al.  Optimizing the green open vehicle routing problem with time windows by minimizing comprehensive routing cost , 2018 .

[8]  Raman Maini,et al.  Vehicle routing problem with time windows having stochastic customers demands and stochastic service times: Modelling and solution , 2019, J. Comput. Sci..

[9]  Danijel Marković,et al.  THE VEHICLE ROUTING PROBLEM WITH STOCHASTIC DEMANDS IN AN URBAN AREA – A CASE STUDY , 2020 .

[10]  Shin-Yu Lin,et al.  A simulated annealing heuristic for the open location-routing problem , 2015, Comput. Oper. Res..

[11]  Zhuo Fu,et al.  Tabu search algorithm for the distance-constrained vehicle routing problem with split deliveries by order , 2018, PloS one.

[12]  Alain Quilliot,et al.  Multigraph modeling and adaptive large neighborhood search for the vehicle routing problem with time windows , 2019, Comput. Oper. Res..

[13]  Gilbert Laporte,et al.  Tabu Search Heuristics for the Vehicle Routing Problem , 2005 .

[14]  Zhuo Fu,et al.  Improved tabu search algorithm for the open vehicle routing problem with soft time windows and satisfaction rate , 2018, Cluster Computing.

[15]  George C. Runger,et al.  Using Experimental Design to Find Effective Parameter Settings for Heuristics , 2001, J. Heuristics.

[16]  Kay Chen Tan,et al.  A Hybrid Multiobjective Evolutionary Algorithm for Solving Vehicle Routing Problem with Time Windows , 2003, Comput. Optim. Appl..

[17]  Billy E. Gillet,et al.  Vehicle dispatching — Sweep algorithm and extensions , 1979 .

[18]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[19]  Geraldo Robson Mateus,et al.  A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows , 2007, Comput. Oper. Res..

[20]  Alexander Mendiburu,et al.  Multi-start Methods , 2018, Handbook of Heuristics.

[21]  Vincent F. Yu,et al.  The path cover problem: Formulation and a hybrid metaheuristic , 2020, Expert Syst. Appl..

[22]  David M. Ryan,et al.  An Integer Programming Approach to the Vehicle Scheduling Problem , 1976 .

[23]  Mei-xian Song,et al.  Metaheuristics for solving the vehicle routing problem with the time windows and energy consumption in cold chain logistics , 2020, Appl. Soft Comput..

[24]  Luca Bertazzi,et al.  Faster rollout search for the vehicle routing problem with stochastic demands and restocking , 2018, Eur. J. Oper. Res..

[25]  Ching-Jung Ting,et al.  A simulated annealing heuristic for the capacitated location routing problem , 2010, Comput. Ind. Eng..

[26]  Reza Tavakkoli-Moghaddam,et al.  Modified particle swarm optimization in a time-dependent vehicle routing problem: minimizing fuel consumption , 2017, Optim. Lett..

[27]  Trung Thanh Nguyen,et al.  A hybrid algorithm for a vehicle routing problem with realistic constraints , 2017, Inf. Sci..

[28]  Yosi Agustina Hidayat,et al.  A simulated annealing heuristic for the hybrid vehicle routing problem , 2017, Appl. Soft Comput..

[29]  S.M.T. Fatemi Ghomi,et al.  Network configuration multi-factory scheduling with batch delivery: A learning-oriented simulated annealing approach , 2019, Comput. Ind. Eng..

[30]  Nasser R. Sabar,et al.  Meta-harmony search algorithm for the vehicle routing problem with time windows , 2015, Inf. Sci..

[31]  Zhenzhen Zhang,et al.  A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints , 2018, Eur. J. Oper. Res..

[32]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[33]  Xia Li,et al.  A novel hybrid shuffled frog leaping algorithm for vehicle routing problem with time windows , 2015, Inf. Sci..

[34]  Bochra Rabbouch,et al.  Empirical-type simulated annealing for solving the capacitated vehicle routing problem , 2020, J. Exp. Theor. Artif. Intell..

[35]  Marcella Bernardo Papini,et al.  A simulation-based solution approach for the robust capacitated vehicle routing problem with uncertain demands , 2020, Transportation Letters.

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

[37]  Jean-François Cordeau,et al.  A parallel iterated tabu search heuristic for vehicle routing problems , 2012, Comput. Oper. Res..

[38]  Zhuo Fu,et al.  An Adaptive Tabu Search Algorithm for the Open Vehicle Routing Problem with Split Deliveries by Order , 2018, Wirel. Pers. Commun..

[39]  Shih-Wei Lin,et al.  A simulated annealing heuristic for the multiconstraint team orienteering problem with multiple time windows , 2015, Appl. Soft Comput..

[40]  Ping Chen,et al.  A novel approach to solve the split delivery vehicle routing problem , 2017, Int. Trans. Oper. Res..

[41]  Aldy Gunawan,et al.  Design of a two-echelon freight distribution system in an urban area considering third-party logistics and loading-unloading zones , 2020, Appl. Soft Comput..

[42]  Bülent Çatay,et al.  A matheuristic method for the electric vehicle routing problem with time windows and fast chargers , 2018, Comput. Oper. Res..

[43]  Alain Chabrier,et al.  Vehicle Routing Problem with elementary shortest path based column generation , 2006, Comput. Oper. Res..

[44]  Fengming Tao,et al.  Multi-Depot Open Vehicle Routing Problem with Time Windows Based on Carbon Trading , 2018, International journal of environmental research and public health.

[45]  B. Yu,et al.  A hybrid algorithm for vehicle routing problem with time windows , 2011, Expert Syst. Appl..

[46]  Dariusz Barbucha,et al.  A cooperative population learning algorithm for vehicle routing problem with time windows , 2014, Neurocomputing.

[47]  Ben Waterson,et al.  A metaheuristic for the time-dependent vehicle routing problem considering driving hours regulations – An application in city logistics , 2020 .

[48]  Stefan Irnich,et al.  Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem , 2019, Eur. J. Oper. Res..

[49]  Paolo Toth,et al.  An ILP improvement procedure for the Open Vehicle Routing Problem , 2008, Comput. Oper. Res..

[50]  Jun Zhang,et al.  Optimizing the Vehicle Routing Problem With Time Windows: A Discrete Particle Swarm Optimization Approach , 2012, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).