A Particle Swarm Optimization hyper-heuristic for the Dynamic Vehicle Routing Problem

This paper presents a method for choosing a Particle Swarm Optimization based optimizer for the Dynamic Vehicle Routing Problem on the basis of the initially available data of a given problem instance. The optimization algorithm is chosen on the basis of a prediction made by a linear model trained on that data and the relative results obtained by the optimization algorithms. The achieved results suggest that such a model can be used in a hyper-heuristic approach as it improved the average results, obtained on the set of benchmark instances, by choosing the appropriate algorithm in 82% of significant cases. Two leading multi-swarm Particle Swarm Optimization based algorithms for solving the Dynamic Vehicle Routing Problem are used as the basic optimization algorithms: Khouadjia's et al. Multi-Environmental Multi-Swarm Optimizer and authors' 2--Phase Multiswarm Particle Swarm Optimization.

[1]  Éric D. Taillard,et al.  Parallel iterative search methods for vehicle routing problems , 1993, Networks.

[2]  Marshall L. Fisher,et al.  A generalized assignment heuristic for vehicle routing , 1981, Networks.

[3]  Yue Shi,et al.  A modified particle swarm optimizer , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[4]  G. Croes.  A Method for Solving Traveling-Salesman Problems , 1958 .

[5]  Jacek Mandziuk,et al.  Application of Particle Swarm Optimization Algorithm to Dynamic Vehicle Routing Problem , 2013, ICAISC.

[6]  Ahmed El Hilali Alaoui,et al.  Solving the dynamic Vehicle Routing Problem using genetic algorithms , 2014, GOL.

[7]  Ioan Cristian Trelea,et al.  The particle swarm optimization algorithm: convergence analysis and parameter selection , 2003, Inf. Process. Lett..

[8]  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 .

[9]  Enrique Alba,et al.  Multi-Swarm Optimization for Dynamic Combinatorial Problems: A Case Study on Dynamic Vehicle Routing Problem , 2010, ANTS Conference.

[10]  El-Ghazali Talbi,et al.  Multi-environmental cooperative parallel metaheuristics for solving dynamic optimization problems , 2012, The Journal of Supercomputing.

[11]  Nicos Christofides,et al.  The period routing problem , 1984, Networks.

[12]  Roberto Montemanni,et al.  A new algorithm for a Dynamic Vehicle Routing Problem based on Ant Colony System , 2002 .

[13]  Jacek Mandziuk,et al.  Two-phase multi-swarm PSO and the dynamic vehicle routing problem , 2014, 2014 IEEE Symposium on Computational Intelligence for Human-like Intelligence (CIHLI).

[14]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[15]  Graham Kendall,et al.  Hyper-Heuristics: An Emerging Direction in Modern Search Technology , 2003, Handbook of Metaheuristics.

[16]  George B. Dantzig,et al.  The Truck Dispatching Problem , 1959 .

[17]  Andries Petrus Engelbrecht,et al.  Particle swarm variants: standardized convergence analysis , 2015, Swarm Intelligence.

[18]  Patrick Prosser,et al.  Dynamic VRPs: A Study of Scenarios , 1998 .

[19]  Beatrice M. Ombuki-Berman,et al.  Dynamic vehicle routing using genetic algorithms , 2007, Applied Intelligence.

[20]  Harilaos N. Psaraftis,et al.  Dynamic vehicle routing: Status and prospects , 1995, Ann. Oper. Res..

[21]  Michel Gendreau,et al.  A review of dynamic vehicle routing problems , 2013, Eur. J. Oper. Res..

[22]  Jacek Mańdziuk,et al.  Dynamic Vehicle Routing Problem: A Monte Carlo approach , 2020, ArXiv.

[23]  Harilaos N. Psaraftis,et al.  A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem , 1980 .