Improved artificial bee colony algorithm for vehicle routing problem with time windows.
other · Level V
Where this comes from
- Record sourced from PubMed, PMID 28961252.
- Also identified by DOI 10.1371/journal.pone.0181275 and PMC identifier 5621664.
- No licence information is recorded for this record.
- Because redistribution is not established, this page shows the abstract only. Follow the links below for the full text.
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.
Medical subject headings
- Algorithms
- Bees