용량제한이 있는 차량경로문제를 위한 관계행렬 기반 Particle Swarm Optimization 알고리즘

Abstract

Particle swarm optimization (PSO) is relatively a new meta-heuristic 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 main idea of the proposed algorithm is using a probability matrix for particle encoding and decoding. The computational results show that the effectiveness of the proposed PSO approach compared to the previous approaches.