Solving Heterogeneous Fleet Multiple Depot Vehicle Scheduling Problem as an Asymmetric Traveling Salesman Problem
- Cite this paper as:
- Ramos J.A., Reis L.P., Pedrosa D. (2011) Solving Heterogeneous Fleet Multiple Depot Vehicle Scheduling Problem as an Asymmetric Traveling Salesman Problem. In: Antunes L., Pinto H.S. (eds) Progress in Artificial Intelligence. EPIA 2011. Lecture Notes in Computer Science, vol 7026. Springer, Berlin, Heidelberg
The Vehicle Scheduling Problem is a well-known combinatorial optimization problem that emerges in mobility and transportation sectors. The heterogeneous fleet with multiple depots extension arises in major urban public transportation companies due to different demands throughout the day and some restrictions in the use of different vehicle types. This extension introduces complexity to the problem and makes the known deterministic methods unable to solve it efficiently. This paper describes an approach to create a comprehensive model to represent the Multiple Depot Vehicle Scheduling Problem as an Asymmetric Traveling Salesman Problem. To solve the A-TSP problem an Ant Colony based meta-heuristic was developed. The results achieved on solving problems from a Portuguese major public transportation planning database show the usefulness of the proposed approach.
KeywordsHFMDVSP Multiple Depot Vehicle Scheduling Problem Traveling Salesman Problem A-TSP Ant Colony System
Unable to display preview. Download preview PDF.