Ant Colony-based Tabu List Optimization for Minimizing the Number of Vehicles in Vehicle Routing Problem with Time Window Constraints

Fendji, J.L.E.K and Yakam, M.V.K. and Fendji, M.D. (2020) Ant Colony-based Tabu List Optimization for Minimizing the Number of Vehicles in Vehicle Routing Problem with Time Window Constraints. EAI Endorsed Transactions on Context-aware Systems and Applications.

[thumbnail of 40405.pdf] PDF
40405.pdf

Download (2MB)

Abstract

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

Item Type: Article
Date Deposited: 04 Mar 2026 13:35
Last Modified: 11 Apr 2026 21:01
URI: http://eprints.eai.eu/id/eprint/30585

Actions (login required)

View Item
View Item