Skip to main content
SpringerLink
Log in

The Integrated Operational Transportation Planning Problem with Compulsory Requests

  • Conference paper
Computational Logistics (ICCL 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8760))

Included in the following conference series:

Abstract

Demand fluctuations and high fixed costs force freight forwarders to consider the integrated operational transportation planning problem, which consists in the combined usage of own transportation resources (self-fulfillment) and external carriers (subcontracting) for the fulfillment of requests. For high quality goods or because of reliability and trustiness, customers prohibit subcontracting for some of their requests (compulsory requests). In this paper we present an approach for solving the integrated problem in case of the existence of compulsory requests. The presented approach is based on an adaptive large neighborhood search and on a column generation procedure. By means of this approach we quantify the increase of fulfillment costs which is caused by different kinds of compulsiveness of transportation requests. A first benchmark study shows that our heuristic approach for the integrated problem with compulsion outperforms the only approach found in literature for that problem, and therefore justifies the investigation of our main study with 6960 test instances. In our main study more realistic and extended instances are used, which gives us the possibility to consider the impact of different kinds of compulsory requests.

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 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 44.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Article  MATH  Google Scholar 

  2. Agarwal, Y.K.: Vehicle routing with limited fleet and common carrier option. TIMS/ORSA Joint National Meeting (1985)

    Google Scholar 

  3. Bagchi, P.K.: Carrier selection: The analytic hierarchy process. Logistics and Transportation Review 25(1), 63–73 (1989)

    Google Scholar 

  4. Ball, M.O., Golden, B.L., Assad, A.A., Bodin, L.D.: Planning for truck fleet size in the presence of a common-carrier option. Decision Sciences 14(1), 103–120 (1983)

    Article  Google Scholar 

  5. Berger, S., Bierwirth, C.: Solutions to the request reassignment problem in collaborative carrier networks. Transportation Research Part E: Logistics and Transportation Review 46(5), 627–638 (2010)

    Article  Google Scholar 

  6. Bolduc, M.-C., Laporte, G., Renaud, J., Boctor, F.: A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars. European Journal of Operational Research 202, 122–130 (2010)

    Article  MATH  Google Scholar 

  7. Bolduc, M.-C., Renaud, J., Boctor, F.: A heuristic for the routing and carrier selection problem. European Journal of Operational Research 183, 926–932 (2007)

    Article  MATH  Google Scholar 

  8. Bolduc, M.-C., Renaud, J., Boctor, F., Laporte, G.: A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers. Journal of the Operational Research Society 59(6), 776–787 (2008)

    Article  MATH  Google Scholar 

  9. Chu, C.-W.: A heuristic algorithm for the truckload and less-than-truckload problem. European Journal of Operational Research 165, 657–667 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  10. Clifton, C., Iyer, A., Cho, R., Jiang, W., Kantarcioglu, M., Vaidya, J.: An approach to securely identifying beneficial collaboration in decentralized logistics systems. Manufacturing & Service Operations Management 10(1), 108–125 (2008)

    Article  Google Scholar 

  11. Côté, J.-F., Potvin, J.-V.: A tabu search heuristic for the vehicle routing problem with private fleet and common carrier. European Journal of Operational Research 198, 464–469 (2009)

    Article  MATH  Google Scholar 

  12. Cruijssen, F., Bräysy, O., Dullaert, W., Fleuren, H., Salomon, M.: Joint route planning under varying market conditions. International Journal of Physical Distribution & Logistics Management 37(4), 287–304 (2007)

    Article  Google Scholar 

  13. Desaulniers, G., Desrosiers, J., Erdmann, A., Solomon, M.M., Soumis, F.: VRP with pickup and delivery. In: Toth, P., Vigo, D. (eds.) The Vehicle Routing Problem, pp. 225–242. SIAM, Philadelphia (2002)

    Chapter  Google Scholar 

  14. Diaby, M., Ramesh, R.: The distribution problem with carrier service: A dual based penalty approach. ORSA Journal on Computing 7(1), 24–35 (1995)

    Article  MATH  Google Scholar 

  15. Ergun, Ö., Kuyzu, G., Savelsbergh, M.: Reducing truckload transportation costs through collaboration. Transportation Science 41(2), 206–221 (2007)

    Article  Google Scholar 

  16. Jones, L.V.: Conversational Statistics for Business and Economics, 3rd edn. Kendall Hunt Publishing Company (2012)

    Google Scholar 

  17. Klincewicz, J.G., Luss, H., Pilcher, M.G.: Fleet size planning when outside carrier services are available. Transportation Science 24(3), 169–182 (1990)

    Article  Google Scholar 

  18. Krajewska, M., Kopfer, H., Laporte, G., Ropke, S., Zaccour, G.: Horizontal cooperation among freight carriers: request allocation and profit sharing. Journal of the Operational Research Society 59(11), 1483–1491 (2008)

    Article  MATH  Google Scholar 

  19. Krajewska, M., Kopfer, H.: Metaheuristics for the integrated operational transportation planning problem: an overview. In: Proceedings of MLS+CP (2005)

    Google Scholar 

  20. Krajewska, M., Kopfer, H.: Transportation planning in freight forwarding companies: Tabu search algorithm for the integrated operational transportation planning problem. European Journal of Operational Research 197, 741–751 (2009)

    Article  MATH  Google Scholar 

  21. Kratica, J., Kostic, T., Tosic, D., Dugosija, D., Filipovic, V.: A genetic algorithm for the routing and carrier selection problem. Computer Science and Information Systems 9(1), 49–62 (2012)

    Article  Google Scholar 

  22. Lau, H.C., Liang, Z.: Pickup and delivery with time windows: algorithms and test case generation. In: Proceedings of the 13th ICTAI, pp. 333–340 (2001)

    Google Scholar 

  23. Lehmusvaara, A., Tuominien, M., Korpela, J.: An integrated approach for truck carrier selection. International Journal of Logistics Research and Applications 2(1), 5–20 (1999)

    Article  Google Scholar 

  24. Li, H., Lim, A.: A metaheuristic for the pickup and delivery problem with time windows. In: Proceedings of the 13th ICTAI, pp. 160–167 (2001)

    Google Scholar 

  25. Liberatore, M.J., Miller, T.: A decision support approach for transport carrier and model selection. Journal of Business Logistics 16(2), 85–11 (1995)

    Google Scholar 

  26. Liu, R., Jiang, Z., Liu, X., Chen, F.: Task selection and routing problems in collaborative truckload transportation. Transportation Research Part E: Logistics and Transportation Review 46(6), 1071–1085 (2010)

    Article  Google Scholar 

  27. Min, H.: A personal-computer assisted decision support system for private versus common carrier selection. Transportation Research Part E: Logistics and Transportation Review 34(3), 229–241 (1998)

    Article  Google Scholar 

  28. Mohammaditabar, D., Teimoury, E.: Integrated freight transportation carrier selection and network flow assignment: Methodology and case study. Journal of Applied Sciences 8, 2928–2938 (2008)

    Article  Google Scholar 

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

    Article  Google Scholar 

  30. Potvin, J.-Y., Naud, M.-A.: Tabu search with ejection chains for the vehicle routing problem with private fleet and common carrier. Journal of the Operational Research Society 62(2), 326–336 (2011)

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Google Scholar 

  33. Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research, 35(2), 254–265 (1987)

    Google Scholar 

  34. Song, J., Regan, A.: An auction based collaborative carrier network. Technical Report, Institute of Transportation Studies, University of California, Irvine (2003)

    Google Scholar 

  35. Wang, X., Kopfer, H., Gendreau, M.: Operational transportation planning of freight forwarding companies in horizontal coalitions. European Journal of Operational Research 237, 1133–1141 (2014)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Logistics, University of Bremen, 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

Editor information

Editors and Affiliations

  1. Pontificia Universidad Católica de Valparaíso, Av. Brasil 2241, Valparaíso, Chile

    Rosa G. González-Ramírez

  2. Institute of Information Systems, University of Hamburg, Hamburg, Germany

    Frederik Schulte  & Stefan Voß  & 

  3. Industrial Engineering School, Pontificia Universidad Católica de Valparaíso, Av. Brasil 2241, Valparaíso, Chile

    Jose A. Ceroni Díaz

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Ziebuhr, M., Kopfer, H. (2014). The Integrated Operational Transportation Planning Problem with Compulsory Requests. In: González-Ramírez, R.G., Schulte, F., Voß, S., Ceroni Díaz, J.A. (eds) Computational Logistics. ICCL 2014. Lecture Notes in Computer Science, vol 8760. Springer, Cham. https://doi.org/10.1007/978-3-319-11421-7_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-11421-7_1

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-11420-0

  • Online ISBN: 978-3-319-11421-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation