Abstract
Small- and medium-sized forwarders are confronted with thin margins and high demand fluctuations in competitive transportation markets. In these markets forwarders try to improve their planning situation by using external resources besides their own resources. These external resources might belong to closely related subcontractors, common carriers or cooperating forwarders in horizontal coalitions. In recent publications, it is assumed that some transportation requests are prohibited to be fulfilled by certain external resources due to contractual obligations. These requests are known as compulsory requests. In this paper, a transportation planning problem including external resources is extended by the mentioned compulsory requests. It is proposed to consider different types of compulsory requests depending on the applicable external resources for fulfilling these requests. As a solution approach a column generation-based heuristic is applied, which uses a strict composition procedure and a strict generation procedure for handling compulsory requests. In a detailed computational study, the increase of transportation costs is analyzed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Chu C-W (2005) A heuristic algorithm for the truckload and less-than truckload problem. Eur J Oper Res 165(3):657–667
Krajewska M, Kopfer H (2009) Transportation planning in freight forwarding companies: Tabu search algorithm for the integrated operational transportation planning problem. Eur J Oper Res 197(2):741–751
Li H, Lim A (2001) A metaheuristic for solving the pickup and delivery problem with time windows. In: IEEE Computer Society (ed) Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence (ICTAI). IEEE Computer Society, Los Alamitos, California: 160–167
Lübbecke M, Desrosiers J (2004) Selected topics in column generation. Oper Res 53(6):1007–1023
Özener OÖ, Ergun Ö, Savelsbergh M (2011) Lane-exchange mechanisms for truckload carrier collaboration. Transp Sci 45(1):1–17
Ropke S, Pisinger D (2006) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp Sci 40(4):455–472
Schönberger J (2005) Operational freight carrier planning. Springer, Berlin, Heidelberg
Wang X, Kopfer H (2014) Collaborative transportation planning of less-than truckload freight. OR Spectrum 36(2):357–380
Wang X, Kopfer H, Gendreau M (2014) Operational transportation planning of freight forwarding companies in horizontal coalitions. Eur J Oper Res 237(3):1133–1141
Ziebuhr M, Kopfer H (2014) The integrated operational transportation planning problem with compulsory requests. In: Gonzlez-Ramrez RG et al (eds) Computational logistics. Lecture notes in computer science, vol 8760. Springer, Berlin, Heidelberg, pp 1–15
Ziebuhr M, Kopfer H (2016): Collaborative transportation planning with forwarding limitations. In: Accepted for publication in Operation research proceedings 2015. Springer
Acknowledgments
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
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing Switzerland
About this paper
Cite this paper
Ziebuhr, M., Kopfer, H. (2017). Transportation Planning with Forwarding Limitations. In: Freitag, M., Kotzab, H., Pannek, J. (eds) Dynamics in Logistics. Lecture Notes in Logistics. Springer, Cham. https://doi.org/10.1007/978-3-319-45117-6_22
Download citation
DOI: https://doi.org/10.1007/978-3-319-45117-6_22
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-45116-9
Online ISBN: 978-3-319-45117-6
eBook Packages: EngineeringEngineering (R0)