Skip to main content

Transportation Planning with Different Forwarding Limitations

  • Conference paper
  • First Online:
Operations Research Proceedings 2016

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

  • 1982 Accesses

Abstract

In recent publications, it is assumed that there are transportation requests which have to be fulfilled by certain resources (e.g., own vehicle fleet or external carriers) due to contractual obligations. These requests are known as compulsory requests. The contribution of this publication is to identify the increase in transportation costs caused by a combination of compulsory requests with different contractual obligations. To evaluate the impact of compulsory requests, an existing column generation-based heuristic with two solution strategies for handling compulsory requests is applied and the generated results are analyzed.

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

Access this chapter

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

References

  1. Li, Y., Chen, H., Prins, C.: Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests. Eur. J. Oper. Res. 252(1), 27–38 (2016)

    Article  Google Scholar 

  2. Ramaekers, K., Caris, A., Maes, T., Janssens, G.: Pickup and delivery selection problem formulation and extension to problem variants. Inf. Technol. Manag. Sci. 18, 84–90 (2016)

    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. Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2), 254–265 (1987)

    Article  Google Scholar 

  6. Wang, X., Kopfer, H., Gendreau, M.: Operational transportation planning of freight forwarding companies in horizontal coalitions. Eur. J. Oper. Res. 237(3), 1133–1141 (2014)

    Article  Google Scholar 

  7. Ziebuhr, M., Kopfer, H.: Solving an integrated operational transportation planning problem with forwarding limitations. Transp. Res. Part E: Logistics Transp. Rev. 87, 149–166 (2016)

    Google Scholar 

  8. Ziebuhr, M., Kopfer, H.: Transportation planning with forwarding limitations. In: Freitag, M., Kotzab, H., Pannek, J. (eds.) Dynamics in Logistics—Proceedings of the 5th International Conference LDIC, pp. 225–234. Springer (2016)

    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

Authors

Corresponding author

Correspondence to Mario Ziebuhr .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Cite this paper

Ziebuhr, M., Kopfer, H. (2018). Transportation Planning with Different Forwarding Limitations. 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_49

Download citation

Publish with us

Policies and ethics