Abstract
In this paper, we present an effective memetic algorithm for the vehicle routing problem with time windows (VRPTW). The paper builds upon an existing edge assembly crossover (EAX) developed for the capacitated VRP. The adjustments of the EAX operator and the introduction of a novel penalty function to eliminate violations of the time window constraint as well as the capacity constraint from offspring solutions generated by the EAX operator have proven essential to the heuristic's performance. Experimental results on Solomon's and Gehring and Homberger benchmarks demonstrate that our algorithm outperforms previous approaches and is able to improve 184 best-known solutions out of 356 instances.
| Original language | English |
|---|---|
| Pages (from-to) | 724-737 |
| Number of pages | 14 |
| Journal | Computers and Operations Research |
| Volume | 37 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - Apr 2010 |
UN SDGs
This output contributes to the following UN Sustainable Development Goals (SDGs)
-
SDG 16 Peace, Justice and Strong Institutions
Keywords
- Memetic algorithm
- Penalty function
- Time windows
- Vehicle routing
Fingerprint
Dive into the research topics of 'A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver