Vehicle Routing Problem Based on Particle Swarm Optimization Algorithm with Gauss Mutation
Ting Xiang,
Dazhi Pan,
Haijie Pei
Issue:
Volume 5, Issue 1, February 2016
Pages:
1-6
Received:
30 November 2015
Accepted:
10 December 2015
Published:
25 December 2015
Abstract: In order to solve the vehicle routing problem, this paper introduces the Gauss mutation, which is based on the common particle swarm algorithm, to constitute an improved particle swarm algorithm (NPSO). In the process of solving vehicle routing problem, the NPSO is encoded by integer and proposes a new way to adjust the infeasible solutions. The particles are divided into two overlapping subgroups, and join the two-two exchange neighborhood search to iterate. Finally, the simulation experiments show that the proposed algorithm can get the optimal solution faster and better, and it has a certain validity and practicability.
Abstract: In order to solve the vehicle routing problem, this paper introduces the Gauss mutation, which is based on the common particle swarm algorithm, to constitute an improved particle swarm algorithm (NPSO). In the process of solving vehicle routing problem, the NPSO is encoded by integer and proposes a new way to adjust the infeasible solutions. The pa...
Show More
