Abstract
The Vehicle Routing Problem with Alternative Time Windows (VRPATW) was studied. Based on the model of VRP with single time window constraint, a model of VRPATW was built, and an improved Tabu Search algorithm was introduced. The algorithm first generates a good feasible initial solution, using improved PFIH algorithm, then improves the initial solution using Tabu Search. Finally the experiment results show that the algorithm can solve 100 customers VRPATW efficiently.
| Original language | English |
|---|---|
| Pages (from-to) | 4454-4457 |
| Number of pages | 4 |
| Journal | Xitong Fangzhen Xuebao / Journal of System Simulation |
| Volume | 20 |
| Issue number | 16 |
| State | Published - 20 Aug 2008 |
| Externally published | Yes |
Keywords
- Alternative time windows
- PFIH
- Tabu Search
- VRP