Skip to main content
SpringerLink
Log in

A Combined Approach to Solve the Pickup and Delivery Selection Problem

  • Conference paper
Operations Research Proceedings 2002

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

Abstract

In this article we propose a model which decides upon the execution of transportation requests in order to maximize their contribution to the overall profit. Positive contributions of requests are obtained by composing appropriate routes for the vehicles involved. The composition of routes is hindered by limited capacity of vehicles and time windows associated to requests. A hybrid approach consisting of a parallel path construction heuristic which seeds a Genetic Algorithm is presented. We assess its capability for a set of suitable benchmark instances for pickup and delivery problems with time windows

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Bäck, T., Fogel, D.B., Michalewicz, Z. (2000) Evolutionary Computation 1 Basic Algorithms and Operators, Institute of Physics Publishing

    Book  Google Scholar 

  2. Bierwirth, C., Mattfeld, D.C., Kopfer, H. (1996) On Permutation Representations for Scheduling Problems, Proc. of PPSN IV, Springer, 310–318

    Google Scholar 

  3. Butt, S.E., Ryan, D.M. (1999) An optimal Solution procedure for the multiple tour maximum collect ion problem using column generation, Computer & Operations Research 26, 427–441

    Article  Google Scholar 

  4. Dumas, Y., Desrosiers, J., Soumis, F. (1991) The pickup and delivery problem with time windows, European Journal of Operational Research 54, 7–22

    Article  Google Scholar 

  5. Feillet, D. (2001) Traveling Salesman problems with profits: an overview, Proceedings of OPR3, Paris

    Google Scholar 

  6. Laporte, G., Martello, S. (1990) The Selective Travelling Salesman Problem, Discrete Applied Mathematics 26, 193–207

    Article  Google Scholar 

  7. Nanry, W.P., Barnes, J.W. (2000) Solving the pickup and delivery problem with time windows using reactive tabu search, Transportation Research Part B 34,107–121

    Article  Google Scholar 

  8. Savelsbergh, M.W.P., Sol, M. (1995) The General Pickup and Delivery Problem, Transportation Science 29, 17–29

    Article  Google Scholar 

  9. Verweij, B. Aardal, K. (2000) The Merchant Subtour Problem, technical report UU-CS-2000–25, Universiteit Utrecht

    Google Scholar 

  10. Williams H.P. (1999) Model Building in Mathematical Programming, 4th Edition, Wiley, Chichester

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Economics, Chair of Logistics,, University of Bremen, D-28334, Bremen, Germany

    Jörn Schönberger, Herbert Kopfer & Dirk C. Mattfeld

Authors
  1. Jörn Schönberger
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Herbert Kopfer
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dirk C. Mattfeld
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Statistik und Operations Research, Universität Graz, Universitätsstraße 15/E3, 8010, Graz, Austria

    Ulrike Leopold-Wildburger

  2. Institut für Mathematik, Universität Klagenfurt, 9020, Klagenfurt, Austria

    Franz Rendl

  3. Fakultät für Wirtschaftswissenschaften BWL VIII: Management Science, Otto-von-Guericke-Universität Magdeburg, 39016, Postfach 4120, Magdeburg, Germany

    Gerhard Wäscher

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schönberger, J., Kopfer, H., Mattfeld, D.C. (2003). A Combined Approach to Solve the Pickup and Delivery Selection Problem. In: Leopold-Wildburger, U., Rendl, F., Wäscher, G. (eds) Operations Research Proceedings 2002. Operations Research Proceedings 2002, vol 2002. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-55537-4_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-55537-4_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00387-8

  • Online ISBN: 978-3-642-55537-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation