点击次数：

论文类型：期刊论文

发表时间：2015-06-01

发表刊物：SCIENTIA IRANICA

收录刊物：SCIE、EI、Scopus

卷号：22

期号：3

页面范围：1258-1270

ISSN号：1026-3098

关键字：Automobile maintenance parts delivery problem; Multi-depot vehicle routing problem; Voronoi diagram; Adaptive strategy; Artificial bee colony algorithm; Merged

摘要：The merged automobile parts maintenance delivery problem has attracted interest from merged companies due to reduced delivery costs by collaborative delivery between several automobile part depots. Since the delivery problem is very complex, a Voronoi diagram is adopted to simplify it by splitting customers into several sets, and by attempting to solve it using the artificial bee colony algorithm. To improve the performance of the artificial bee colony algorithm, an adaptive strategy is used to control the proportion of scouts and leaders. Finally, the computational results for 23 benchmark problems indicate that the proposed algorithm is an effective method for solving multi-depot vehicle routing problems. Furthermore, the results of the merged automobile parts maintenance delivery problem also indicate that the improved artificial bee colony algorithm with the Voronoi diagram is feasible for solving this kind of delivery problem. (C) 2015 Sharif University of Technology. All rights reserved.