Abstract
This article paper presents a hybrid metaheuristic algorithm to solve the time-dependent vehicle routing problem with hard time windows. Time-dependent travel times are influenced by different congestion levels experienced throughout the day. Vehicle scheduling without consideration of congestion might lead to underestimation of travel times and consequently missed deliveries. The algorithm presented in this paper makes use of Large Neighbourhood Search approaches and Variable Neighbourhood Search techniques to guide the search. A first stage is specifically designed to reduce the number of vehicles required in a search space by the reduction of penalties generated by time-window violations with Large Neighbourhood Search procedures. A second stage minimises the travel distance and travel time in an ‘always feasible’ search space. Comparison of results with available test instances shows that the proposed algorithm is capable of obtaining a reduction in the number of vehicles (4.15%), travel distance (10.88%) and travel time (12.00%) compared to previous implementations in reasonable time.
| Original language | English |
|---|---|
| Pages (from-to) | 141-160 |
| Number of pages | 20 |
| Journal | International Journal of Industrial Engineering Computations |
| Volume | 8 |
| Issue number | 1 |
| DOIs | |
| State | Published - Jan 2017 |
Keywords
- Hybrid metaheuristic algorithm
- Time-dependent travel time
- Vehicle routing problem
Fingerprint
Dive into the research topics of 'A hybrid metaheuristic for the time-dependent vehicle routing problem with hard time windows'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver