Vehicle routing problem with limited refueling halts using particle swarm optimization with greedy mutation operator

2015 ◽  
Vol 49 (4) ◽  
pp. 689-716 ◽  
Author(s):  
Ganesan Poonthalir ◽  
Rethnaswamy Nadarajan ◽  
Shanmugam Geetha
Keyword(s):  
Particle Swarm Optimization ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Particle Swarm ◽  
Mutation Operator ◽  
Swarm Optimization ◽  
Routing Problem

Study on Multi-Depot Vehicle Routing Problem Based on Cloud Adaptive Particle Swarm Optimization

2012 ◽  
Vol 253-255 ◽  
pp. 1369-1373
Author(s):  
Tie Jun Wang ◽  
Kai Jun Wu
Keyword(s):  
Particle Swarm Optimization ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Cloud Model ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Swarm Optimization ◽  
Routing Problem ◽  
Adaptive Particle Swarm Optimization ◽  
Searching Ability

Multi-depots vehicle routing problem (MDVRP) is a kind of NP combination problem which possesses important practical value. In order to overcome PSO’s premature convergence and slow astringe, a Cloud Adaptive Particle Swarm Optimization(CAPSO) is put forward, it uses the randomicity and stable tendentiousness characteristics of cloud model, adopts different inertia weight generating methods in different groups, the searching ability of the algorithm in local and overall situation is balanced effectively. In this paper, the algorithm is used to solve MDVRP, a kind of new particles coding method is constructed and the solution algorithm is developed. The simulation results of example indicate that the algorithm has more search speed and stronger optimization ability than GA and the PSO algorithm.

Sign in / Sign up

Export Citation Format

Share Document