A hybrid chaos-particle swarm optimization algorithm for the vehicle routing problem with time window (Q742692)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A hybrid chaos-particle swarm optimization algorithm for the vehicle routing problem with time window |
scientific article |
Statements
A hybrid chaos-particle swarm optimization algorithm for the vehicle routing problem with time window (English)
0 references
19 September 2014
0 references
Summary: State-of-the-art heuristic algorithms to solve the vehicle routing problem with time windows (VRPTW) usually present slow speeds during the early iterations and easily fall into local optimal solutions. Focusing on solving the above problems, this paper analyzes the particle encoding and decoding strategy of the particle swarm optimization algorithm, the construction of the vehicle route and the judgment of the local optimal solution. Based on these, a hybrid chaos-particle swarm optimization algorithm (HPSO) is proposed to solve VRPTW. The chaos algorithm is employed to re-initialize the particle swarm. An efficient insertion heuristic algorithm is also proposed to build the valid vehicle route in the particle decoding process. A particle swarm premature convergence judgment mechanism is formulated and combined with the chaos algorithm and Gaussian mutation into HPSO when the particle swarm falls into the local convergence. Extensive experiments are carried out to test the parameter settings in the insertion heuristic algorithm and to evaluate that they are corresponding to the data's real-distribution in the concrete problem. It is also revealed that the HPSO achieves a better performance than the other state-of-the-art algorithms on solving VRPTW.
0 references
VRPTW
0 references
PSO
0 references
chaos algorithm
0 references
insertion heuristic algorithm
0 references
Gaussian mutation
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references