Skip to main content
SpringerLink
Log in
Book cover

Operations Research Proceedings 2015 pp 141–147Cite as

Collaborative Transportation Planning with Forwarding Limitations

  • Conference paper
  • First Online:

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

Abstract

In collaborative transportation planning, independent forwarders align their transportation plans by exchanging requests within a horizontal coalition. The goal of the coalition members is to increase their profitability and flexibility in competitive markets with high demand fluctuations. In recent publications, it is assumed that each request can be fulfilled by any coalition member. However, in practice some requests are prohibited to be forwarded due to contractual agreements. These requests are known as compulsory requests. The contribution of this paper is to identify the increase of costs caused by compulsory requests of a collaborative pickup and delivery transportation planning problem. To analyze the impact of compulsory requests, an existing column generation-based heuristic with two solution strategies for handling compulsory requests is applied and investigated.

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

References

  1. Agarwal, R., Ergun, Ö.: Network design and allocation mechanisms for carrier alliances in liner shipping. Oper. Res. 58(6), 1726–1742 (2010)

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  4. Schönberger, J.: Operational Freight Carrier Planning. Springer, Berlin (2005)

    Google Scholar 

  5. 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 

  6. Wang, X., Kopfer, H.: Collaborative transportation planning of less-than-truckload freight. OR Spectr. 36(2), 357–380 (2014)

    Article  Google Scholar 

  7. Ziebuhr, M., Kopfer, H.: The integrated operational transportation planning problem with compulsory requests. Proceedings of ICCL 2014. Lecture Notes in Computer Science (LNCS), vol. 8760, pp. 1–15. Springer, Berlin (2014)

    Google Scholar 

Download references

Acknowledgements

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

Author information

Authors and Affiliations

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

    Mario Ziebuhr & Herbert Kopfer

Authors
  1. Mario Ziebuhr
    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 Mario Ziebuhr .

Editor information

Editors and Affiliations

  1. Department of Business Administration, University of Vienna, Vienna, Austria

    Karl Franz Dörner

  2. Decision Sciences and Statistics (IDS) Department, ESSEC Business School of Paris, Cergy Pontoise Cedex, France

    Ivana Ljubic

  3. Department of Statistics and Operations Research, University of Vienna, Vienna, Austria

    Georg Pflug

  4. Operations Research and Control Systems, TU Wien, Vienna, Austria

    Gernot Tragler

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing Switzerland

About this paper

Cite this paper

Ziebuhr, M., Kopfer, H. (2017). Collaborative Transportation Planning with Forwarding Limitations. In: Dörner, K., Ljubic, I., Pflug, G., Tragler, G. (eds) Operations Research Proceedings 2015. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-42902-1_19

Download citation

Publish with us

Policies and ethics

Search

Navigation