Skip to main content
SpringerLink
Log in

Pre-selection Strategies for Dynamic Collaborative Transportation Planning Problems

  • Conference paper
  • First Online:
Book cover Operations Research Proceedings 2014

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

Abstract

To improve the competitiveness , small and mid-sized carriers may ally in coalitions for request exchange. One main barrier is the “carrier-fear” of losing autonomy. A decentralized pre-selection that allows carriers to preserve own transportation requests for the private fleet may limit the information shared within the coalition and increase the autonomy. Several heuristic pre-selection strategies are presented. A computational study analyzes which of those are most qualified.

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. Archetti, C., Speranza, M.G., Vigo, D.: Vehicle routing problems with profits. Technical Report, Department of Economics and Management, University of Brescia, Italy (2012)

    Google Scholar 

  2. Berger, S., Bierwirth, C.: Solutions to the request reassignment problem in collaborative carrier networks. Transp. Res. Part E 46, 627–638 (2010)

    Article  Google Scholar 

  3. Butt, S.E., Cavalier, T.M.: A heuristic for the multiple tour maximum collection problem. Comput. Oper. Res. 21, 101–111 (1994)

    Article  Google Scholar 

  4. Clarke, G., Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12, 368–581 (1964)

    Article  Google Scholar 

  5. Gehring, H., Homberger, J.: A parallel hybrid evolutionary metaheuristic for the vehicle routing problem with time windows. Proc. EUROGEN 99, 57–64 (1999)

    Google Scholar 

  6. Krajewska, M.A., Kopfer, H.: Collaborating freight forwarding enterprise. OR Spectr. 28, 301–317 (2006)

    Article  Google Scholar 

  7. Laporte, G., Martello, S.: The selective travelling salesman problem. Discrete Appl. Math. 26, 193–207 (1990)

    Article  Google Scholar 

  8. Gillett, B.E., Miller, L.R.: A heuristic for the vehicle-dispatch problem. Oper. Res. 22, 340–349 (1974)

    Article  Google Scholar 

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

    Google Scholar 

  10. Pisinger, D., Ropke, S.: A general heuristic for vehicle routing problems. Comput. Oper. Res. 34, 2403–2435 (2007)

    Article  Google Scholar 

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

    Article  Google Scholar 

Download references

Acknowledgments

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. Operations Research, RWTH Aachen University, Aachen, Germany

    Marco Lübbecke

  2. Lehrstuhl II für Mathematik, RWTH Aachen University, Aachen, Germany

    Arie Koster

  3. RWTH Aachen University, Aachen, Nordrhein-Westfalen, Germany

    Peter Letmathe

  4. E.ON Energy Research Center, RWTH Aachen University, Aachen, Nordrhein-Westfalen, Germany

    Reinhard Madlener

  5. Management Science, RWTH Aachen University, Aachen, Nordrhein-Westfalen, Germany

    Britta Peis

  6. Chair of Operations Management, RWTH Aachen University, Aachen, Germany

    Grit Walther

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Schopka, K., Kopfer, H. (2016). Pre-selection Strategies for Dynamic Collaborative Transportation Planning Problems. In: Lübbecke, M., Koster, A., Letmathe, P., Madlener, R., Peis, B., Walther, G. (eds) Operations Research Proceedings 2014. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-28697-6_73

Download citation

Publish with us

Policies and ethics

Search

Navigation