Abstract
Capacitated vehicle routing problem with pickups and deliveries (CVRPPD) is one of the most challenging combinatorial optimization problems which include goods delivery/pickup optimization, vehicle number optimization, routing path optimization and transportation cost minimization. The conventional particle swarm optimization (PSO) is difficult to find an optimal solution of the CVRPPD due to its simple search strategy. A PSO with adaptive multi-swarm strategy (AMSPSO) is proposed to solve the CVRPPD in this paper. The proposed AMSPSO employs multiple PSO algorithms and an adaptive algorithm with punishment mechanism to search the optimal solution, which can deal with large-scale optimization problems. The simulation results prove that the proposed AMSPSO can solve the CVRPPD with the least number of vehicles and less transportation cost, simultaneously.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 2015 1st International Conference on Industrial Networks and Intelligent Systems, INISCom 2015 |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 79-83 |
| Number of pages | 5 |
| ISBN (Print) | 9781631900228 |
| DOIs | |
| Publication status | Published - 2015 Jul 14 |
| Event | 1st International Conference on Industrial Networks and Intelligent Systems, INISCom 2015 - Tokyo, Japan Duration: 2015 Mar 2 → 2015 Mar 4 |
Other
| Other | 1st International Conference on Industrial Networks and Intelligent Systems, INISCom 2015 |
|---|---|
| Country/Territory | Japan |
| City | Tokyo |
| Period | 15/3/2 → 15/3/4 |
Keywords
- adaptive algorithm
- multi-swarm
- particle swarm optimization
- vehicle routing problem
ASJC Scopus subject areas
- Artificial Intelligence
- Computer Networks and Communications
- Industrial and Manufacturing Engineering
- Human-Computer Interaction