A particle swarm optimization with adaptive multi-swarm strategy for capacitated vehicle routing problem

Kui Ting Chen, Yijun Dai, Ke Fan, Takaaki Baba

研究成果: Conference contribution

5 被引用数 (Scopus)

抄録

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.

本文言語English
ホスト出版物のタイトルProceedings of the 2015 1st International Conference on Industrial Networks and Intelligent Systems, INISCom 2015
出版社Institute of Electrical and Electronics Engineers Inc.
ページ79-83
ページ数5
ISBN(印刷版)9781631900228
DOI
出版ステータスPublished - 2015 7 14
イベント1st International Conference on Industrial Networks and Intelligent Systems, INISCom 2015 - Tokyo, Japan
継続期間: 2015 3 22015 3 4

Other

Other1st International Conference on Industrial Networks and Intelligent Systems, INISCom 2015
CountryJapan
CityTokyo
Period15/3/215/3/4

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computer Networks and Communications
  • Industrial and Manufacturing Engineering
  • Human-Computer Interaction

フィンガープリント 「A particle swarm optimization with adaptive multi-swarm strategy for capacitated vehicle routing problem」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル