Skip to main content
SpringerLink
Log in

Request-Allocation in Dynamic Collaborative Transportation Planning Problems

  • Conference paper
  • First Online:
Operations Research Proceedings 2016

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

  • 2005 Accesses

Abstract

Several publications on collaborative transportation planning problems (CTPPs) focus on schemes that ensure a fair assignment of collaborative profits. However, it is seldom taken into account that an even allocation of transportation resources (e.g. transportation requests) is also responsible for the viability and stability of horizontal carrier coalitions; particularly if dynamic CTPPs are considered. In this paper, the winner determination problem (WDP) of an auction-based request exchange is restricted by lower and upper bounds that respect an equality between transferred and received requests for carriers. In a computational study, the restricted WDP is applied to the dynamic collaborative traveling salesman problem.

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 EPUB and 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

Notes

  1. 1.

    http://www.logistik.uni-bremen.de/english/instances/.

References

  1. Feillet, D., Dejax, P., Gendreau, M.: Traveling salesman problems with profits. Transp. Sci. 39(2), 188–205 (2005)

    Article  Google Scholar 

  2. Pillac, V., Gendreau, M., Guret, C., Medaglia, A.L.: A review of dynamic vehicle routing problems. Eur. J. Oper. Res. 225(1), 1–11 (2013)

    Article  Google Scholar 

  3. Rosenkrantz, D.J., Stearns, R.E., Lewis, P.M.: An analysis of several heuristics for the traveling salesman problem. SIAM J. Comput. 6(3), 563–581 (1977)

    Article  Google Scholar 

  4. Schwind, M., Gujo, O., Vykoukal, J.: A combinatorial intra-enterprise exchange for logistics services. Inf. Syst. E-Bus. Manag. 7(4), 447–471 (2009)

    Article  Google Scholar 

  5. Shapley, L.: A value for n-person games. In: Kuhn, H., Tucker, A. (eds.) Contributions to the Theory of Games II 28, pp. 307–317. Princeton University Press, Princenton, NJ (1957)

    Google Scholar 

  6. Wang, X., Kopfer, H.: Rolling horizon planning for a dynamic collaborative routing problem with full-truckload pickup and delivery requests. Flex. Serv. Manuf. J. 27(4), 1–25 (2015)

    Article  Google Scholar 

Download references

Acknowledgements

The research was supported by the German Research Foundation (DFG) as part of the project “Kooperierende Rundreiseplanung bei rollierender Planung”.

Author information

Authors and Affiliations

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

    Kristian Schopka & Herbert Kopfer

Authors
  1. Kristian Schopka
    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

Corresponding author

Correspondence to Kristian Schopka .

Editor information

Editors and Affiliations

  1. Institute of Computer Science, Helmut Schmidt University, Institute of Computer Science, Hamburg, Germany

    Andreas Fink

  2. Applied Mathematics, Helmut Schmidt University, Applied Mathematics, Hamburg, Germany

    Armin Fügenschuh

  3. Institute of Logistics and Organization, Helmut Schmidt University, Institute of Logistics and Organization, Hamburg, Germany

    Martin Josef Geiger

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Cite this paper

Schopka, K., Kopfer, H. (2018). Request-Allocation in Dynamic Collaborative Transportation Planning Problems. In: Fink, A., Fügenschuh, A., Geiger, M. (eds) Operations Research Proceedings 2016. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-55702-1_44

Download citation

Publish with us

Policies and ethics

Search

Navigation