Skip to main content
SpringerLink
Log in
Book cover

Operations Research Proceedings 2001 pp 3–8Cite as

Routing a Fleet of Vehicles for Dynamic Combined Pick-up and Deliveries Services

  • Conference paper

Part of the book series: Operations Research Proceedings 2001 ((ORP,volume 2001))

Abstract

This work partially reports the results of a study aiming at the design and analysis of the performance of a multi-cab metropolitan transportation system. In our model we investigate a particular multi-vehicle many-to-many dynamic request dial-a-ride problem. We present a heuristic algorithm for this problem and some preliminary results. The algorithm is based on iteratively solving a single-vehicle subproblem at optimality: a pretty efficient dynamic programming routine has been devised for this purpose.

This work has been carried out by researchers from both University of Rome “Tor Vergata” and Italian Energy Research Center ENEA as a line of a reasearch program, regarding urban mobility optimization, funded by ENEA and the Italian Ministry of Environment.

This work is partially supported by the Italian Ministry of the Environment and ENEA Research Centre.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Psaraftis, H. N., (1980) A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-ride Problem. Transp. Sc. 14, 130–154

    Article  Google Scholar 

  2. Psaraftis, H. N., (1995) Dynamic Vehicle Routing: Status and Prospects. Ann. Op. Res. 61, 143–164

    Article  Google Scholar 

  3. Nicosia G., Oriolo G. (2000) Solving the Shortest Common Supersequence problem. Op. Res. Proc. 2000, eds. B. Fleischmann, R. Lasch, U. Derigs, W. Domschke, U. Rieder, Springer-Verlag, 2001

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DISP, Università di Roma “Tor Vergata”, via di Tor Vergata, 110, 00133, Roma, Italy

    Massimiliano Caramia, Giuseppe F. Italiano, Gianpaolo Oriolo & Andrea Pacifici

  2. Centro Ricerche ENEA Casaccia, via Anguillarese, 301, 00060, S. Maria di Galena, Roma, Italy

    Alessandro Perugia

Authors
  1. Massimiliano Caramia
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Giuseppe F. Italiano
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gianpaolo Oriolo
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Andrea Pacifici
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Alessandro Perugia
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Fakultät 3, Institut für Logistik und Informationsmanagement, Lehrstuhl für Wirtschaftsinformatik und Operations Research, Gerhard-Mercator-Universität Duisburg, Lotharstraße 63, 47057, Duisburg, Germany

    Peter Chamoni

  2. Fakultät 3, Institut für Logistik und Informationsmanagement, Lehrstuhl für Produktionswirtschaft und Industriebetriebslehre, Gerhard-Mercator-Universität Duisburg, Lotharstraße 63, 47057, Duisburg, Germany

    Rainer Leisten

  3. Fachbreich Mathematik · Fachgebiet Diskrete Optimierung, Technische Universität Darmstadt, Schlossgartenstraße 7, 64289, Darmstadt, Germany

    Alexander Martin

  4. WestLB · Abteilung Mathematik/Operations Research, Herzogstraße 15, 40217, Düsseldorf, Germany

    Joachim Minnemann

  5. Institut für Betriebswirtschaftslehre · Fachgebiet Fertigungs- und Materialwirtschaft, Technische Universität Darmstadt, Hochschulstraße 1, 64289, Darmstadt, Germany

    Hartmut Stadtler

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Caramia, M., Italiano, G.F., Oriolo, G., Pacifici, A., Perugia, A. (2002). Routing a Fleet of Vehicles for Dynamic Combined Pick-up and Deliveries Services. In: Chamoni, P., Leisten, R., Martin, A., Minnemann, J., Stadtler, H. (eds) Operations Research Proceedings 2001. Operations Research Proceedings 2001, vol 2001. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-50282-8_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-50282-8_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43344-6

  • Online ISBN: 978-3-642-50282-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation