An improved artificial bee colony algorithm for vehicle routing problem with time windows: A real case in Dalian

作     者：Yu, Shaoqiang Tai, Cuicui Liu, Yanan Gao, Linjie 

作者机构：Dalian Maritime Univ Transportat Management Coll Dalian Peoples R China Shanghai Jiao Tong Univ Sch Naval Architecture Ocean & Civil Engn Shanghai 200240 Peoples R China 

出 版 物：《ADVANCES IN MECHANICAL ENGINEERING》 (机械工程进展)

年 卷 期：2016年第8卷第8期

页      面：1687814016665298-1687814016665298页

核心收录：

学科分类：08[工学] 0807[工学-动力工程及工程热物理] 0802[工学-机械工程] 

基　　金：The author(s) received no financial support for the research  authorship  and/or publication of this article 

主　　题：Artificial bee colony algorithm adaptive strategy crossover operation mutation operation vehicle routing problem 

摘      要：This study has been motivated from a real western-style food delivery problem in Dalian city, China, which can be described as a vehicle routing problem with time windows. An integer linear model for the problem is developed, and an improved artificial bee colony algorithm, which possesses a new strategy called an adaptive strategy, a crossover operation, and a mutation operation, is proposed to solve the problem. Then, the effectiveness of the proposed improved artificial bee colony is first validated by some benchmark instances. Furthermore, results obtained on a real-case instance for western-style food delivery problem in Dalian city are also discussed. In this case, the results indicate that the improved artificial bee colony algorithm is a feasible method to solve the real vehicle routing problem with time windows such as western-style food delivery.