Skip to main content
Log in

Synchronized routing of active and passive means of transport

  • Regular Article
  • Published:
OR Spectrum Aims and scope Submit manuscript

Abstract

This paper addresses a routing problem where the fulfillment of transport requests requires two types of transport resources, namely, passive and active means of transport. The passive means are used for holding the cargo that is to be shipped from pickup to delivery locations. The active means take up the passive means and carry them from one location to another. Compared to classical vehicle routing problems, the additional challenge in this combined routing problem is that the operations of both transport resources have to be synchronized. In this paper, we provide a modeling approach for the joint routing of passive and active means of transport. We solve the problem by large neighborhood search meta-heuristics that utilize various problem-specific components, for example local search techniques for the routes of active and passive means. A computational study on a large set of benchmark instances is used for assessing the performance of the meta-heuristics.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  • Bürckert HJ, Fischer K, Vierke G (2000) Holonic transport scheduling with teletruck. Appl Artif Intel 14(7):697–725

    Article  Google Scholar 

  • Bredström D, Rönnqvist M (2008) Combined vehicle routing and scheduling with temporal precedence and synchronization constraints. Eur J Oper Res 191(1):19–31

    Google Scholar 

  • Cheung RK, Shi N, Powell WB, Simao HP (2008) An attribute-decision model for cross-border drayage problem. Transp Res Part E 44(2):217–234

    Google Scholar 

  • Cortés C, Matamala M, Contardo C (2010) The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method. Eur J Oper Res 200(3):711–724

    Google Scholar 

  • Derigs U, Kurowsky R, Vogel U (2011) Solving a real-world vehicle routing problem with multiple use of tractors and trailers and EU-regulations for drivers arising in air cargo road feeder services. Eur J Oper Res 213(1):309–319

    Google Scholar 

  • Desaulniers G (2010) Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows. Oper Res 58(1):179–192

    Google Scholar 

  • Drexl M (2007) On some generalized routing problems. PhD thesis, RWTH Aachen University

  • Drexl M (2012) Synchronization in vehicle routing—a survey of VRPs with multiple synchronization constraints. Transp Sci 46(3):297–316

    Google Scholar 

  • Drexl M, Rieck J, Sigl T, Berning B (2011) Simultaneous vehicle and crew routing and scheduling for partial and full load long-distance road transport. Technical report no 1112, Gutenberg School of Management and Economics, Johannes Gutenberg University Mainz, Germany

  • Hempsch C, Irnich S (2008) Vehicle routing problems with inter-tour resource constraints. In: Golden B, Raghavan S, Wasil E (eds) The vehicle routing problem: latest advances and new challenges. Springer, New York, pp 421–444

    Google Scholar 

  • Hollis B, Forbes M, Douglas B (2006) Vehicle routing and crew scheduling for metropolitan mail distribution at Australia post. Eur J Oper Res 173(1):133–150

    Google Scholar 

  • Kergosien Y, Lenté C, Piton D, Billaut JC (2011) A tabu search heuristic for the dynamic transportation of patients between care units. Eur J Oper Res 214(2):442–452

    Google Scholar 

  • Kim BI, Koo J, Park J (2010) The combined manpower-vehicle routing problem for multi-staged services. Expert Syst Appl 37(12):8424–8431

    Google Scholar 

  • Laurent B, Hao J (2007) Simultaneous vehicle and driver scheduling: a case study in a limousine rental company. Comput Ind Eng 53(3):542–558

    Google Scholar 

  • Lin CKY (2011) A vehicle routing problem with pickup and delivery time windows, and coordination of transportable resources. Comput Oper Res 38(11):1596–1609

    Google Scholar 

  • Perboli G, Tadei R, Vigo D (2011) The two-echelon capacitated vehicle routing problem: models and math-based heuristics. Transp Sci 45(3):364–380

    Google Scholar 

  • Prescott-Gagnon E, Desaulniers G, Rousseau L (2009) A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows. Networks 54(4):190–204

    Google Scholar 

  • 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

    Google Scholar 

  • Shaw P (1997) A new local search algorithm providing high quality solutions to vehicle routing problems. APES Group, Department of Computer Science, University of Strathclyde, Scotland, Technical report

  • Zhang R, Yun WY, Kopfer H (2010) Heuristic-based truck scheduling for inland container transportation. OR Spectr 32(3):787–808

    Google Scholar 

Download references

Acknowledgments

This research is funded by the Deutsche Forschungsgemeinschaft (DFG) under project reference B02110263.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Frank Meisel.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Meisel, F., Kopfer, H. Synchronized routing of active and passive means of transport. OR Spectrum 36, 297–322 (2014). https://doi.org/10.1007/s00291-012-0310-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00291-012-0310-7

Keywords

Navigation