Improved artificial bee colony algorithm for vehicle routing problem with time windows

Baozhen Yao, Qianqian Yan, Mengjie Zhang and Yunong Yang

PLOS ONE, 2017, vol. 12, issue 9, 1-18

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.

Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0181275 (text/html)
https://journals.plos.org/plosone/article/file?id= ... 81275&type=printable (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:plo:pone00:0181275

DOI: 10.1371/journal.pone.0181275

Access Statistics for this article

More articles in PLOS ONE from Public Library of Science
Bibliographic data for series maintained by plosone ().