Solving Dynamic Vehicle Routing Problem with Soft Time Window by iLNS and hPSO

Vehicle Routing Problem (VRP) is widely studied under the real logistics environments. For the reason that customers’ demands could appear dynamically and need to be served within fuzzy time windows, the dynamic vehicle routing problem with soft time windows (DVRPSTW) is studied in this paper. We use the improved large neighborhood search algorithm(iLNS) and the hybrid Particle Swarm Optimization(hPSO) to solve the problem. The performance of both algorithms comparing with benchmarks shows that our methods can solve DVRPSTW efficiently with more customers.

[1]  Herminia I. Calvete,et al.  Vehicle routing problems with soft time windows: an optimization based approach , 2003 .

[2]  Miguel A. Figliozzi,et al.  An iterative route construction and improvement algorithm for the vehicle routing problem with soft time windows , 2010 .

[3]  Steven Li,et al.  Vehicle routing optimization with soft time windows in a fuzzy random environment , 2011 .

[4]  Enrique Alba,et al.  Applied Soft Computing a Comparative Study between Dynamic Adapted Pso and Vns for the Vehicle Routing Problem with Dynamic Requests , 2022 .

[5]  Denis Borenstein,et al.  Real-time vehicle rerouting problems with time windows , 2009, Eur. J. Oper. Res..

[6]  Toshihide Ibaraki,et al.  The vehicle routing problem with flexible time windows and traveling times , 2006, Discret. Appl. Math..

[7]  Eiichi Taniguchi,et al.  Exact solution for the vehicle routing problem with semi soft time windows and its application , 2010 .

[8]  Magdalene Marinaki,et al.  A hybrid genetic - Particle Swarm Optimization Algorithm for the vehicle routing problem , 2010, Expert Syst. Appl..

[9]  Zhen-hua Liu,et al.  Research on vehicle routing problem with soft time windows based on tabu search algorithm , 2011, 2011 IEEE 18th International Conference on Industrial Engineering and Engineering Management.

[10]  Marius M. Solomon,et al.  Partially dynamic vehicle routing—models and algorithms , 2002, J. Oper. Res. Soc..

[11]  Hongwei Du,et al.  A Hybrid Large Neighborhood Search for Dynamic Vehicle Routing Problem with Time Deadline , 2015, COCOA.

[12]  Lianxi Hong.  An improved LNS algorithm for real-time vehicle routing problem with time windows , 2012, Comput. Oper. Res..

[13]  Celso C. Ribeiro,et al.  Greedy Randomized Adaptive Search Procedures , 2003, Handbook of Metaheuristics.

[14]  M. S. Rahman,et al.  Vehicle Routing Problems with Soft Time Windows , 2012, 2012 7th International Conference on Electrical and Computer Engineering.