A probability matrix based particle swarm optimization for the capacitated vehicle routing problem

Authors:
Byung-In Kim;So-Jung Son
Affiliations:
Department of Industrial and Management Engineering, Pohang University of Science and Technology (POSTECH), Pohang, Republic of Korea 790-784;Department of Industrial and Management Engineering, Pohang University of Science and Technology (POSTECH), Pohang, Republic of Korea 790-784
Venue:
Journal of Intelligent Manufacturing
Year:
2012

Citing 0
Cited 3

Combinatorial neighborhood topology particle swarm optimization algorithm for the vehicle routing problem

EvoCOP'13 Proceedings of the 13th European conference on Evolutionary Computation in Combinatorial Optimization
A flexible three-level logistic network design considering cost and time criteria with a multi-objective evolutionary algorithm

Journal of Intelligent Manufacturing
Particle swarm optimization algorithm for a vehicle routing problem with heterogeneous fleet, mixed backhauls, and time windows

Journal of Intelligent Manufacturing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Particle swam optimization (PSO) is a relatively new metaheuristic that has recently drawn much attention from researchers in various optimization areas. However, application of PSO for the capacitated vehicle routing problem (CVRP) is very limited. This paper proposes a simple PSO approach for solving the CVRP. The proposed PSO approach uses a probability matrix as the main device for particle encoding and decoding. While existing research used the PSO solely for assignment of customers to routes and used other algorithms to sequence customers within the routes, the proposed approach applies the PSO approach to both simultaneously. The computational results show the effectiveness of the proposed PSO approach compared to the previous approaches.