Multi-Swarm Optimization for Dynamic Combinatorial Problems: A Case Study on Dynamic Vehicle Routing Problem

Many combinatorial real-world problems are mostly dynamic. They are dynamic in the sense that the global optimum location and its value change over the time, in contrast to static problems. The task of the optimization algorithm is to track this shifting optimum. Particle Swarm Optimization (PSO) has been previously used to solve continuous dynamic optimization problems, whereas only a few works have been proposed for combinatorial ones. One of the most interesting dynamic problems is the Dynamic Vehicle Routing Problem (DVRP). This paper presents a Multi-Adaptive Particle Swarm Optimization (MAPSO) for solving the Vehicle Routing Problem with Dynamic Requests (VRPDR). In this approach the population of particles is split into a set of interacting swarms. Such a multi-swarm helps to maintain population diversity and good tracking is achieved. The effectiveness of this approach is tested on a well-known set of benchmarks, and compared to other metaheuristics from literature. The experimental results show that our multiswarm optimizer significantly outperforms single solution and population based metaheuristics on this problem.

[1]  M. F. Fuller,et al.  Practical Nonparametric Statistics; Nonparametric Statistical Inference , 1973 .

[2]  Jürgen Branke,et al.  Evolutionary Optimization in Dynamic Environments , 2001, Genetic Algorithms and Evolutionary Computation.

[3]  Xiaodong Li,et al.  A particle swarm model for tracking multiple peaks in a dynamic environment using speciation , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

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

[5]  Enrique Alba,et al.  Parallel Metaheuristics: A New Class of Algorithms , 2005 .

[6]  Shengxiang Yang,et al.  Explicit Memory Schemes for Evolutionary Algorithms in Dynamic Environments , 2007, Evolutionary Computation in Dynamic and Uncertain Environments.

[7]  Xiaodong Li,et al.  Particle swarm with speciation and adaptation in a dynamic environment , 2006, GECCO.

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

[9]  Rolf Drechsler,et al.  Applications of Evolutionary Computing, EvoWorkshops 2008: EvoCOMNET, EvoFIN, EvoHOT, EvoIASP, EvoMUSART, EvoNUM, EvoSTOC, and EvoTransLog, Naples, Italy, March 26-28, 2008. Proceedings , 2008, EvoWorkshops.

[10]  Mark Wineberg,et al.  The Shifting Balance Genetic Algorithm: improving the GA in a dynamic environment , 1999 .

[11]  Shengxiang Yang,et al.  Evolutionary Computation in Dynamic and Uncertain Environments , 2007, Studies in Computational Intelligence.

[12]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .

[13]  Tim Blackwell,et al.  Particle Swarm Optimization in Dynamic Environments , 2007, Evolutionary Computation in Dynamic and Uncertain Environments.

[14]  Voratas Kachitvichyanukul,et al.  A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery , 2009, Comput. Oper. Res..

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

[16]  César Rego,et al.  Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms , 2001, Parallel Comput..

[17]  Russell Bent,et al.  Online Stochastic and Robust Optimization , 2004, ASIAN.

[18]  El-Ghazali Talbi,et al.  Metaheuristics - From Design to Implementation , 2009 .

[19]  Jürgen Branke,et al.  Memory enhanced evolutionary algorithms for changing optimization problems , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[20]  Roberto Montemanni,et al.  Ant Colony System for a Dynamic Vehicle Routing Problem , 2005, J. Comb. Optim..

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

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

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

[24]  Rasmus K. Ursem,et al.  Multinational GAs: Multimodal Optimization Techniques in Dynamic Environments , 2000, GECCO.

[25]  Jürgen Branke,et al.  Multiswarms, exclusion, and anti-convergence in dynamic environments , 2006, IEEE Transactions on Evolutionary Computation.

[26]  Jürgen Branke,et al.  Multi-swarm Optimization in Dynamic Environments , 2004, EvoWorkshops.