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

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...

Full description

Bibliographic Details
Main Authors: J.L.E.K Fendji, M.V.K. Yakam, M.D. Fendji
Format: Article
Language:English
Published: European Alliance for Innovation (EAI) 2020-09-01
Series:EAI Endorsed Transactions on Context-aware Systems and Applications
Subjects:
vehicle routing problem with time window
ant colony-based tabu list
number of vehicles
capex minimisation
Online Access:https://eudl.eu/pdf/10.4108/eai.12-5-2020.166041

Similar Items

Similar Items