Skip to main content
SpringerLink
Log in

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

  • Conference paper
Progress in Artificial Intelligence (EPIA 2011)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 7026))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bunte, S., Kliewer, N.: An overview on vehicle scheduling models. DSOR Arbeitspapiere / DSOR Working Papers (2006)

    Google Scholar 

  2. Freling, R., Paixão, J.P., Wagelmans, A.: Models and Algorithms for Vehicle Scheduling (2004)

    Google Scholar 

  3. Dorigo, M., Gambardella, L.M.: Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Transactions on Evolutionary Computation I (April 1997)

    Google Scholar 

  4. Dorigo, M.: Optimization, Learning and Natural Algorithms. PhD thesis, Politecnico di Milano. Italie (1992)

    Google Scholar 

  5. Paixão, J.P., Branco, I.M.: A quasi-assignment algorithm for bus scheduling. Networks 17, 249–269 (1987), doi:10.1002/net.3230170302

    Article  MathSciNet  MATH  Google Scholar 

  6. Rechenberg, I.: Evolutionsstrategie. Werkstatt Bionik und Evolutionstechnik, vol. 1. Frommann-Holzboog Verlag, Stuttgart (1994)

    Google Scholar 

  7. Lenstra, J., Kahn, A.R.: Complexity of vehicle routing and scheduling problems. Networks 11(2), 221–227 (1981)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DEI - Departamento de Engenharia Informática, Faculdade de Engenharia da Universidade do Porto, Portugal

    Jorge Alpedrinha Ramos

  2. LIACC - Laboratório de Inteligência Artificial e Ciência de Computadores da Universidade do Porto, Faculdade de Engenharia da Universidade do Porto, Portugal

    Luís Paulo Reis

  3. OPT - Optimização e Planeamento de Transportes, Portugal

    Dulce Pedrosa

Authors
  1. Jorge Alpedrinha Ramos
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Luís Paulo Reis
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dulce Pedrosa
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculdade de Ciências, Departamento de Informática, GUESS/LabMAg/Universidade de Lisboa, Campo Grande, 749-016, Lisboa, Portugal

    Luis Antunes

  2. Department of Computer Science and Engineering, INESC-ID, Instituto Superior Técnico, IST, Avenida Rovisco Pais, 1049-001, Lisboa, Portugal

    H. Sofia Pinto

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

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. https://doi.org/10.1007/978-3-642-24769-9_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24769-9_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-24768-2

  • Online ISBN: 978-3-642-24769-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation