| Autor: |
M. V. K. Yakam, Jean Louis Ebongue Kedieng Fendji, Marie Danielle Fendji |
| Jazyk: |
angličtina |
| Rok vydání: |
2020 |
| Předmět: |
|
| Zdroj: |
EAI Endorsed Transactions on Context-aware Systems and Applications, Vol 7, Iss 21 (2020) |
| ISSN: |
2409-0026 |
| DOI: |
10.4108/eai.12-5-2020.166041 |
| Popis: |
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 of its wide range of applications in logistics. In this paper, we tackle the problem on an economical point of view with a focus on capital expenditure (CAPEX), where the minimizationof the number of vehicles is more important than the total traveling distance. This customization finds its applications in scenarios with limited CAPEX or seasonal/temporary operations. In these cases, the CAPEX should be minimized as much as possible to reduce the overall cost of the operation, while satisfying time window constraints. We provide an Ant Colony Optimization-based Tabu List (ACOTL). We test the proposed approach on the well-known Solomon’s benchmarks. We compare experiments results to Dynamic Programming on small size instances and later to the best-known results in the literature on large size instances. ACOTL allows to reduce the number of vehicles used sometimes up to three units, compared to the best-known results, especially for instances where customers are geographically in clusters randomly distributed with vehicles of low or medium charges. |
| Databáze: |
OpenAIRE |
| Externí odkaz: |
|
