Back to Search
Start Over
Improved artificial bee colony algorithm for vehicle routing problem with time windows.
- Source :
- PLoS ONE; 9/29/2017, Vol. 12 Issue 9, p1-18, 18p
- Publication Year :
- 2017
-
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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 19326203
- Volume :
- 12
- Issue :
- 9
- Database :
- Complementary Index
- Journal :
- PLoS ONE
- Publication Type :
- Academic Journal
- Accession number :
- 125421559
- Full Text :
- https://doi.org/10.1371/journal.pone.0181275