Dynamic Collaborative Transportation Planning: A Rolling Horizon Planning Approach | SpringerLink
Skip to main content
Springer Nature Link
Log in

Dynamic Collaborative Transportation Planning: A Rolling Horizon Planning Approach

  • Conference paper
Computational Logistics (ICCL 2013)

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

Included in the following conference series:

Abstract

Small and mid-sized freight carriers are suggested to cooperate with fellow companies and to perform collaborative transportation planning (CTP) enabling an exchange of customer requests for higher operational efficiencies. In order to realize the synergy embedded in CTP, appropriate request exchange mechanisms have to be developed. Compared to their static counterparts, little research has been conducted on dynamic CTP problems (DCTPP). In this paper, the DCTPP of a coalition of freight carriers offering full truckload transport services is presented. A rolling horizon planning approach is proposed to solve this problem. Computational studies are carried out to identify the potential of cost-savings through CTP and to analyze the influence of the degree of dynamism of instances on the planning results.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 5262
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 6578
Price includes VAT (Japan)
  • 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.

Similar content being viewed by others

References

  1. Abrache, J., Crainic, T.G., Gendreau, M., Rekik, M.: Combinatorial auctions. Annals of Operations Research 153, 131–164 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  2. Berbeglia, G., Cordeau, J.-F., Laporte, G.: Dynamic pickup and delivery problems. European Journal of Operational Research 202, 8–15 (2010)

    Article  MATH  Google Scholar 

  3. Berger, S., Bierwirth, C.: Solutions to the request reassignment in collaborative carrier networks. Transportation Research E 46, 627–638 (2010)

    Article  Google Scholar 

  4. Chen, Z.-L., Xu, H.: Dynamic Column Generation for Dynamic Vehicle Routing with Time Windows. Transportation Science 40, 74–88 (2006)

    Article  Google Scholar 

  5. Clifton, C., Iyer, A., Cho, R., Jiang, W., Kantarciglu, M., Vaidya, J.: An Approach to Securely Identifying Beneficial Collaboration in Decentralized Logistics Systems. Manufacturing and Service Operations Management 10, 108–125 (2008)

    Article  Google Scholar 

  6. Cordeau, J.-F., Desaulniers, G., Desrosiers, J., Solomon, M., Soumis, F.: VRP with time windows. In: Toth, P., Vigo, D. (eds.) The Vehicle Routing Problem, pp. 157–194. SIAM, Philadelphia (2002)

    Chapter  Google Scholar 

  7. Cruijssen, F., Bräysy, O., Dullaert, W., Fleuren, H., Solomon, M.: Joint route planning under varying market conditions. International Journal of Physical Distribution and Logistics Management, 287–304 (2007)

    Google Scholar 

  8. Cruijssen, F., Cools, M., Dullaert, W.: Horizontal cooperation in logistics: Opportunities and impediments. Transportation Research E 43, 129–142 (2007)

    Article  Google Scholar 

  9. Cruijssen, F., Dullaert, W., Fleuren, H.: Horizontal cooperation in transport and logistics: A literature review. Transportation Journal 46, 22–39 (2007)

    Google Scholar 

  10. Cruijssen, F., Salomon, M.: Empirical Study: order sharing between transportation companies may result in cost reductions between 5 to 15 percent. Technical report, CentER Discussion Paper (2004)

    Google Scholar 

  11. Dantzig, G.B., Wolfe, P.: Decomposition principle for linear programs. Operations Research 8, 101–111 (1960)

    Article  MATH  Google Scholar 

  12. Gendreau, M., Guertin, F., Potvin, J.-Y., Séguin, R.: Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries. Transportation Research C 14, 157–174 (2006)

    Article  Google Scholar 

  13. Gendreau, M., Guertin, F., Potvin, J.-Y., Taillard, E.: Parallel tabu search for real-time vehicle routing and dispatching. Transportation Science 33, 381–390 (1999)

    Article  MATH  Google Scholar 

  14. Glover, F.: Ejection chains, reference structures and alternating path methods for traveling salesman problems. Discrete Applied Mathematics 65, 223–253 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  15. Krajewska, M.A., Kopfer, H.: Collaborating freight forwarding enterprises. OR Spectrum 28, 301–317 (2006)

    Article  MATH  Google Scholar 

  16. Krajewska, M.A., Kopfer, H., Laporte, G., Ropke, S., Zaccour, G.: Horizontal cooperation of freight carriers: request allocation and profit sharing. Journal of the Operational Research Society 59, 1483–1491 (2008)

    Article  MATH  Google Scholar 

  17. Mitrović-Minić, S., Laporte, G.: Waiting strategies for the dynamic pickup and delivery problem with time windows. Transportation Research B 38, 635–655 (2004)

    Article  Google Scholar 

  18. Montemanni, R., Gambardella, L.M., Rizzoli, A.E., Donati, A.V.: Ant colony system for a dynamic vehicle routing problem. Journal of Combinatorial Optimization 10, 327–343 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  19. Özener, O., Ergun, O., Savelsbergh, M.: Lane-exchange mechanisms for truckload carrier collaboration. Transportation Science 45, 1–17 (2011)

    Article  Google Scholar 

  20. Pillac, V., Gendreau, M., Guéret, C., Medaglia, A.L.: A review of dynamic vehicle routing problems. European Journal of Operational Research 225, 1–11 (2013)

    Article  MathSciNet  Google Scholar 

  21. Psaraftis, H.N.: A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem. Transportation Science 14, 130–154 (1980)

    Article  Google Scholar 

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

    Article  Google Scholar 

  23. Savelsbergh, M., Sol, M.: DRIVE: Dynamic Routing of Independent Vehicles. Operations Research 46, 474–490 (1998)

    Article  MATH  Google Scholar 

  24. Schönberger, J.: Operational Freight Carrier Planning, pp. 135–148. Springer, Berlin (2005)

    Google Scholar 

  25. Schwind, M., Gujo, O., Vykoukal, J.: A combinatorial intra-enterprise exchange for logistics services. Information Systems and e-Business Management 7, 447–471 (2009)

    Article  Google Scholar 

  26. Song, J., Regan, A.: An auction based collaborative carrier network. Technical report. Institute of Transportation Studies, University of California, Irvine (2003)

    Google Scholar 

  27. Stadtler, H.: A framework for collaborative planning and state-of-the-art. OR Spectrum 31, 5–30 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  28. Taillard, E., Badeau, P., Gendreau, M., Guertin, F., Potvin, J.-Y.: A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Science 31, 170–186 (1997)

    Article  MATH  Google Scholar 

  29. Tjokroamidjojo, D., Kutanoglu, E., Taylor, G.D.: Quantifying the value of advance load information in truckload trucking. Transportation Research E 42, 340–357 (2006)

    Article  Google Scholar 

  30. Vickery, W.: Counterspeculation, Auctions, and Competitive Sealed Tenders. Journal of Finance 16, 8–37 (1961)

    Article  Google Scholar 

  31. Wang, X., Kopfer, H.: Collaborative transportation planning of less-than-truckload freight: A route-based request exchange mechanism. To appear in: OR Spectrum (2013), doi:10.1007/s00291-013-0331-x

    Google Scholar 

  32. Yang, J., Jaillet, P., Mahmassani, H.S.: On-line algorithms for truck fleet assignment and scheduling under real-time information. Transportation Research Record 1667, 107–113 (1998)

    Article  Google Scholar 

  33. Yang, J., Jaillet, P., Mahmassani, H.S.: Real-time multivehicle truckload pickup and delivery problems. Transportation Science 38, 135–148 (2004)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Chair of Logistics, University of Bremen, Wilhelm-Herbst-Str. 5, 28359, Bremen, Germany

    Xin Wang & Herbert Kopfer

Authors
  1. Xin Wang
    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

Editor information

Editors and Affiliations

  1. DTU TRANSPORT, Dept. of Transport , Technical University of Denmark, Bygningstorvet 116B, 2800 Kgs, Lyngby, Denmark

    Dario Pacino

  2. Institute of Information Systems (IWI), University of Hamburg, Von-Melle-Park 5, 20146, Hamburg, Germany

    Stefan Voß

  3. IT University of Copenhagen, Rued Langgaards Vej 7, 2300, Copenhagen S, Denmark

    Rune Møller Jensen

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, X., Kopfer, H. (2013). Dynamic Collaborative Transportation Planning: A Rolling Horizon Planning Approach. In: Pacino, D., Voß, S., Jensen, R.M. (eds) Computational Logistics. ICCL 2013. Lecture Notes in Computer Science, vol 8197. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41019-2_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-41019-2_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-41018-5

  • Online ISBN: 978-3-642-41019-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics