Ant Colony-based Tabu List Optimization for Minimizing the Number of Vehicles in Vehicle Routing Problem with Time Window Constraints
The Vehicle Routing Problem consists in finding a routing plan for vehicles of identical capacity to satisfy the demands of a set of customers. Time window constraints mean that customers can only be served within a pre-defined time window. Researchers have intensively studied this problem because o...
| 發表在: | EAI Endorsed Transactions on Context-aware Systems and Applications |
|---|---|
| Main Authors: | , , |
| 格式: | Article |
| 語言: | 英语 |
| 出版: |
European Alliance for Innovation (EAI)
2020-09-01
|
| 主題: | |
| 在線閱讀: | https://eudl.eu/pdf/10.4108/eai.12-5-2020.166041 |