泰森多边形的离散蝙蝠算法求解多车场车辆路径问题

Translated title of the contribution: Voronoi diagram-based discrete bat algorithm for multi-depot vehicle routing problem

Yuan Hang Qi, Yan Guang Cai*, Hao Cai, He Lie Huang, Ole K. Hejlesen

*Corresponding author for this work

Research output: Contribution to journalJournal articleResearchpeer-review

6 Citations (Scopus)

Abstract

This paper presents a voronoi diagram-based discrete bat algorithm to solve the multi-depot vehicle routing problem(MDVRP) which is a well-known NP-hard problem. The proposed algorithm takes the discrete bat algorithm as the core and integrates encoding and decoding strategies based on the multi-depot and multi-vehicle problem. The proposed algorithm also uses an initialized strategy based on the voronoi diagram to accelerate the previous convergent speed, and adopts a fitness function based on the vectorial comparison mechanism to control the convergent direction, as well as utilizing a local search algorithm based on the nearest neighbor strategy and the prior distribution strategy to enhance the optimization capability. Experimental results show that the proposed algorithm can effectively solve the MDVRP within a reasonable time consumption, especially the MDVRP with a delivery distance constraint; compared with contrast algorithms, the proposed algorithm has the stronger optimization ability and stability.

Translated title of the contributionVoronoi diagram-based discrete bat algorithm for multi-depot vehicle routing problem
Original languageChinese
JournalKongzhi Lilun Yu Yingyong/Control Theory and Applications
Volume35
Issue number8
Pages (from-to)1142-1150
Number of pages9
ISSN1000-8152
DOIs
Publication statusPublished - 1 Aug 2018

Fingerprint

Dive into the research topics of 'Voronoi diagram-based discrete bat algorithm for multi-depot vehicle routing problem'. Together they form a unique fingerprint.

Cite this