Chapter

Progress in Artificial Intelligence

Volume 7026 of the series Lecture Notes in Computer Science pp 98-109

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

  • Jorge Alpedrinha RamosAffiliated withDEI - Departamento de Engenharia Informática, Faculdade de Engenharia da Universidade do Porto
  • , Luís Paulo ReisAffiliated withLIACC - Laboratório de Inteligência Artificial e Ciência de Computadores da Universidade do Porto, Faculdade de Engenharia da Universidade do Porto
  • , Dulce PedrosaAffiliated withOPT - Optimização e Planeamento de Transportes

* Final gross prices may vary according to local VAT.

Get Access

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.

Keywords

HFMDVSP Multiple Depot Vehicle Scheduling Problem Traveling Salesman Problem A-TSP Ant Colony System