We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
Improved artificial bee colony algorithm for vehicle routing problem with time windows.
- Authors
Yao, Baozhen; Yan, Qianqian; Zhang, Mengjie; Yang, Yunong
- Abstract
This paper investigates a well-known complex combinatorial problem known as the vehicle routing problem with time windows (VRPTW). Unlike the standard vehicle routing problem, each customer in the VRPTW is served within a given time constraint. This paper solves the VRPTW using an improved artificial bee colony (IABC) algorithm. The performance of this algorithm is improved by a local optimization based on a crossover operation and a scanning strategy. Finally, the effectiveness of the IABC is evaluated on some well-known benchmarks. The results demonstrate the power of IABC algorithm in solving the VRPTW.
- Subjects
BEES algorithm; VEHICLE routing problem; APPLIED mathematics; PROBLEM solving; TASK performance
- Publication
PLoS ONE, 2017, Vol 12, Issue 9, p1
- ISSN
1932-6203
- Publication type
Article
- DOI
10.1371/journal.pone.0181275