Skip to main content
SpringerLink
Log in

The Pickup and Delivery Problem with Cross-Docking Opportunity

  • Conference paper
Computational Logistics (ICCL 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6971))

Included in the following conference series:

Abstract

In this paper, we consider the pickup and delivery problem with cross-docking opportunity (PDPCD). The problem arises from an industry application, and includes pickup requests, delivery requests, and pickup-and-delivery requests. Each pickup-and-delivery request can be served either as direct delivery by one truck, or by being picked up and transported to the cross-dock by one vehicle, and subsequently delivered at its final destination by another vehicle. Handling times at customers sites and terminal are given. A typical daily instance includes 500–1,000 requests. We solve the problem using a Large Neighborhood Search (LNS) 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. Ahuja, R., Ergun, Ö., Ergun, J., Punnen, A.: A survey of very large-scale neighborhood search techniques. Discrete Applied Mathematics 123, 75–102 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  2. Baldacci, R., Bartolini, E., Mingozzi, A.: An exact algorithm for the pickup and delivery problem with time windows. Operations Research 59, 414–426 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  3. Berbeglia, G., Cordeau, J.F., Gribkovskaia, I., Laporte, G.: Static pickup and delivery problems: a classification scheme and survey. Top 15(1), 1–31 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  4. Boysen, N., Fliedner, M.: Cross dock scheduling: Classification, literature review and research agenda. Omega 38, 413–422 (2010)

    Article  Google Scholar 

  5. Cordeau, J.F., Laporte, G., Ropke, S.: Recent models and algorithms for one-to-one pickup and delivery problems. In: Golden, B., Raghavan, R., Wasil, E. (eds.) The Vehicle Routing Problem: Latest Advances and New Challenges, pp. 327–357. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  6. Cordeau, J., Laporte, G.: The dial-a-ride problem: Variants, modelling issues and algorithms. 4OR 1, 89–101 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  7. Cortes, C., Matamala, M., Contardo, C.: The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method. European Journal of Operational Research 200(3), 711–724 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  8. Häll, C., Anderson, H., Lundgren, J., Värbrand, P.: The integrated dial-a-ride problem. Public Transport 1(1), 39–54 (2009)

    Article  Google Scholar 

  9. Lee, Y., Jung, H., Lee, K.: Vehicle routing scheduling for cross-docking in the supply chain. Computers & Industrial Engineering 51, 247–256 (2006)

    Article  Google Scholar 

  10. Mitrović-Minić, S., Laporte, G.: The pickup and delivery problem with time windows and transshipment. INFOR 44(3), 217–227 (2006)

    MathSciNet  Google Scholar 

  11. Nagata, Y., Kobayashi, S.: Guided ejection search for the pickup and delivery problem with time windows. In: Cowling, P., Merz, P. (eds.) EvoCOP 2010. LNCS, vol. 6022, pp. 202–213. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  12. Nagata, Y., Kobayashi, S.: A memetic algorithm for the pickup and delivery problem with time windows using selective route exchange crossover. In: Schaefer, R., Cotta, C., Kołodziej, J., Rudolph, G. (eds.) PPSN XI. LNCS, vol. 6238, pp. 536–545. Springer, Heidelberg (2010)

    Google Scholar 

  13. Parragh, S., Doerner, K., Hartl, R.: A survey on pickup and delivery problems. part II: Transportation between pickup and delivery locations. Journal für Betriebswirtschaft 58(2), 81–117 (2008)

    Article  Google Scholar 

  14. Pisinger, D., Ropke, S.: A general heuristic for vehicle routing problems. Computers & Operations Research 34(8), 2403–2435 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  15. Potvin, J.Y., Rousseau, J.M.: A parallel route building algorithm for the vehicle routing and scheduling problem with time windows. European Journal of Operational Research 66, 331–340 (1993)

    Article  MATH  Google Scholar 

  16. Ropke, S.: Parallel large neighborhood search - a software framework. In: MIC 2009, VIII Metaheuristics International Conference CDROM (2009)

    Google Scholar 

  17. Ropke, S., Cordeau, J.F.: Branch-and-cut-and-price for the pickup and delivery problem with time windows. Transportation Science 43(3), 267–286 (2009)

    Article  Google Scholar 

  18. Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Science 40(4), 455–472 (2006)

    Article  Google Scholar 

  19. Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417–431. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  20. Toth, P., Vigo, D.: The granular tabu search and its application to the vehicle-routing problem. INFORMS Journal on Computing 15(4), 333–346 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  21. Wen, M., Larsen, J., Clausen, J., Cordeau, J.F., Laporte, G.: Vehicle routing with cross-docking. Journal of the Operational Research Society 60, 1708–1718 (2009)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Transport, Technical University of Denmark, Bygningstorvet 115, 2800 Kgs., Lyngby, Denmark

    Hanne L. Petersen & Stefan Ropke

Authors
  1. Hanne L. Petersen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stefan Ropke
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Maritime Logistics, University of Technology, Schwarzenbergstraße 95 (D), 21073, Hamburg, Germany

    Jürgen W. Böse  & Carlos Jahn  & 

  2. School of Naval Architecture, Ocean and Civil Engineering, Shanghai Jiao Tong University, Dongchuan Road 800, 200240, Shanghai, China

    Hao Hu  & Xiaoning Shi  & 

  3. Institute of Information Systems, University of Hamburg, Von-Melle-Park 5, 20146, Hamburg, Germany

    Robert Stahlbock  & Stefan Voß  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Petersen, H.L., Ropke, S. (2011). The Pickup and Delivery Problem with Cross-Docking Opportunity. In: Böse, J.W., Hu, H., Jahn, C., Shi, X., Stahlbock, R., Voß, S. (eds) Computational Logistics. ICCL 2011. Lecture Notes in Computer Science, vol 6971. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24264-9_8

Download citation

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

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation