|
|
|
|
Merged automobile parts maintenance delivery problem using an improved artificial bee colony algorithm
|
|
|
|
|
|
|
|
نویسنده
|
Yao B. ,Hu P. ,Yu L. ,Zhang M. ,Gao J.
|
|
منبع
|
scientia iranica - 2015 - دوره : 22 - شماره : 3-E1 - صفحه:1258 -1270
|
|
چکیده
|
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.
|
|
کلیدواژه
|
Automobile maintenance parts delivery problem; Multi-depot vehicle routing problem; Voronoi diagram; Adaptive strategy; Artificial bee colony algorithm; Merged
|
|
آدرس
|
Dalian University of Technology, School of Automotive Engineering, China, Dalian University of Technology, School of Automotive Engineering, China, Yanching Institute of Technology, School of International Trade and Commerce, China, Dalian University of Technology, School of Automotive Engineering, China, Dalian University of Technology, School of Automotive Engineering, China
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|