Release Time:2019-03-11  Hits:

Indexed by: Journal Article

Date of Publication: 2017-09-29

Journal: PLOS ONE

Included Journals: PubMed、SCIE、Scopus

Volume: 12

Issue: 9

Page Number: e0181275

ISSN: 1932-6203

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.