Solving Heterogeneous Fleet Multiple Depot Vehicle Scheduling Problem as an Asymmetric Traveling Salesman Problem

• Type: Article in International Conference Proceedings Book
• Date: 2011

Authors

ramos, ja (Author) Other; reis, lp (Author) FEUP; pedrosa, d (Author) Other

Conference proceedings International

Title: PROGRESS IN ARTIFICIAL INTELLIGENCE

Pages: 98-109

15th Portuguese Conference on Artificial Intelligence (EPIA 2011)

Lisbon, PORTUGAL, OCT 10-13, 2011

Indexing

ISI Web of Knowledge - 5 Citations

Scopus - 5 Citations

Scientific classification

FOS: Natural sciences > Computer and information sciences

Other information

Authenticus ID: P-002-VY6

DOI: 10.1007/978-3-642-24769-9_8

Abstract (EN): 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 clay 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.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 12