Solving heterogeneous fleet multiple depot vehicle scheduling problem as an asymmetric traveling salesman problem

Authors:
Jorge Alpedrinha Ramos;Luís Paulo Reis;Dulce Pedrosa
Affiliations:
Departamento de Engenharia Informática, Faculdade de Engenharia da Universidade do Porto;Laboratório de Inteligência Artificial e Ciência de Computadores da, Universidade do Porto, Faculdade de Engenharia da Universidade do Porto;Optimização e Planeamento de Transportes
Venue:
EPIA'11 Proceedings of the 15th Portugese conference on Progress in artificial intelligence
Year:
2011

Citing 1
Cited 1

Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation

Web Portal for Matching Loan Requests and Investment Offers in Peer-To-Peer Lending

International Journal of Web Portals

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.