Skip to main content
SpringerLink
Log in

The rendezvous vehicle routing problem

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

We consider a novel scheme for same-day delivery with a strong potential to reduce transportation costs. A delivery company has two distinct fleets for last-mile delivery: trucks with known (i.e., fixed) delivery routes leaving early in the day carrying one or more-day delivery packages, and shuttles leaving later in the day carrying same-day delivery packages. By allowing shuttles to intercept trucks and hand off packages for truck delivery it may be possible to leverage the unfinished portion of truck routes to shorten the delivery routes of the shuttles. We refer to this as the Rendezvous Vehicle Routing Problem. We present a mathematical formulation of the problem, as well as a column generation algorithm that can quickly find optimal solutions for instances with up to 200 nodes. We also develop and demonstrate the effectiveness of a specialized heuristic for use in larger instances with up to 1000 nodes. Our computational study validates the efficacy of truck-shuttle synchronization in this scheme, demonstrating an average savings of 20% across the test instances.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

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

Similar content being viewed by others

References

  1. Afifi, S., Dang, D.-C., Moukrim, A.: Heuristic solutions for the vehicle routing problem with time windows and synchronized visits. Opt. Lett. 10, 511–525 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  2. Ahuja, R., Magnanti, T., Orlin, J.: Network Flows - Theory, Algorithms and Applications. Prentice Hall, New Jersey (1993)

    MATH  Google Scholar 

  3. Anderluh, A., Larsen, R., Hemmelmayr, V.C., Nolz, P.C.: Impact of travel time uncertainties on the solution cost of a two-echelon vehicle routing problem with synchronization. Flex. Serv. Manuf. J. 32(4), 806–828 (2020)

    Article  Google Scholar 

  4. Barnhart, C., Johnson, E., Nemhauser, G., Savelsbergh, M., Vance, P.H.: Branch-and-price: column generation for solving huge integer programs. Oper. Res. 46(3), 316–329 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  5. Boysen, N., Fedtke, S., Schwerdfeger, S.: Last-mile delivery concepts: a survey from an operational research perspective. OR Spectr. 43(1), 1–58 (2020)

    Article  MathSciNet  Google Scholar 

  6. Brandstätter, C.: A metaheuristic algorithm and structured analysis for the line-haul feeder vehicle routing problem with time windows. CEJOR 29, 247–289 (2021)

    Article  MathSciNet  MATH  Google Scholar 

  7. Brandstätter, C., Reimann, M.: The line-haul feeder vehicle routing problem: mathematical model formulation and heuristic approaches. Eur. J. Oper. Res. 270(1), 157–170 (2018)

    Article  MathSciNet  MATH  Google Scholar 

  8. Census, U.: Quarterly Retail e-commerce Sales 3rd Quarter 2020 (2020). https://www.census.gov/retail/mrts/www/data/pdf/ec_current.pdf?

  9. Dayarian, I., Savelsbergh, M., Clarke, J.-P.: Same-day delivery with drone resupply. Transp. Sci. 54(1), 229–249 (2020)

    Article  Google Scholar 

  10. Dellaert, N., Woensel, T.V., Crainic, T.G., Saridarq, F.D.: A multi-commodity two-echelon capacitated vehicle routing problem with time windows: Model formulations and solution approach. Comput. Oper. Res. 127, 105154 (2021)

    Article  MathSciNet  MATH  Google Scholar 

  11. Desrochers, M., Desrosiers, J., Solomon, M.: A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. 40(2), 342–354 (1992). https://doi.org/10.1287/opre.40.2.342

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  Google Scholar 

  13. Feillet, D., Dejax, P., Gendreau, M., Gueguen, C.: An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems. Networks 44(3), 216–229 (2004). https://doi.org/10.1002/net.20033

    Article  MathSciNet  MATH  Google Scholar 

  14. Gehring, H., Homberger, J.: A parallel hybrid evolutionary metaheuristic for the vehicle routing problem with time windows. In: Proceedings of EUROGEN99-Short Course on Evolutionary Algorithms in Engineering and Computer Science, pp. 57–64 (1999)

  15. Grangier, P., Gendreau, M., Lehuédé, F., Rousseau, L.-M.: An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization. Eur. J. Oper. Res. 254(1), 80–91 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  16. Grangier, P., Gendreau, M., Lehuédé, F., Rousseau, L.-M.: A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking. Comput. Oper. Res. 84, 116–126 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  17. Groër, C., Golden, B., Wasil, E.: The consistent vehicle routing problem. Manuf. Serv. Oper. Manag. 11(4), 630–643 (2009)

    Article  MATH  Google Scholar 

  18. Helsgaun, K.: An effective implementation of the Lin-Kernighan traveling salesman heuristic. Eur. J. Oper. Res. 126(1), 106–130 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  19. Jacobs, K., Warner, S., Rietra, M., Mazza, L., Buvat, J., Khadikar, A., Cherian, S., Khemka, Y.: The last-mile delivery challenge. Tech. rep. (2019). https://www.capgemini.com/wp-content/uploads/2019/01/Report-Digital-%E2%80%93-Last-Mile-Delivery-Challenge1.pdf

  20. Li, H., Wang, H., Chen, J., Bai, M.: Two-echelon vehicle routing problem with satellite bi-synchronization. Eur. J. Oper. Res. 288(3), 775–793 (2021)

    Article  MathSciNet  MATH  Google Scholar 

  21. Marques, G., Sadykov, R., Dupas, R., Deschamps, J.-C.: A branch-cut-and-price approach for the single-trip and multi-trip two-echelon vehicle routing problem with time windows. Transp. Sci. 56(6), 1598–1617 (2022)

    Article  Google Scholar 

  22. Masone, A., Poikonen, S., Golden, B.: The multivisit drone routing problem with edge launches: an iterative approach with discrete and continuous improvements. Networks 80(2), 193–215 (2022)

    Article  MathSciNet  Google Scholar 

  23. Masson, R., Lehuédé, F., Péton, O.: Efficient feasibility testing for request insertion in the pickup and delivery problem with transfers. Oper. Res. Lett. 41(3), 211–215 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  24. Masson, R., Lehuédé, F., Péton, O.: The dial-a-ride problem with transfers. Comput. Oper. Res. 41(1), 12–23 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  25. Medina, J., Hewitt, M., Lehuédé, F., Péton, O.: Integrating long-haul and local transportation planning: the service network design and routing problem. EURO J. Transp. Logist. 8(2), 119–145 (2019)

    Article  Google Scholar 

  26. Mirhedayatian, S.M., Crainic, T.G., Guajardo, M., Wallace, S.W.: A two-echelon location-routing problem with synchronisation. J. Oper. Res. Soc. 72(1), 145–160 (2021)

    Article  Google Scholar 

  27. Nolz, P.C., Absi, N., Cattaruzza, D., Feillet, D.: Two-echelon distribution with a single capacitated city hub. EURO J. Transp. Logist. 9(3), 100015 (2020)

    Article  Google Scholar 

  28. Parragh, S.N., Cordeau, J.-F.: Branch-and-price and adaptive large neighborhood search for the truck and trailer routing problem with time windows. Comput. Oper. Res. 83, 28–44 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  29. Peng, Z., Chami, Z.A., Manier, H., Manier, M.-A.: A hybrid particle swarm optimization for the selective pickup and delivery problem with transfers. Eng. Appl. Artif. Intell. 85, 99–111 (2019)

    Article  MATH  Google Scholar 

  30. Qu, Y., Bard, J.: A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment. Comput. Oper. Res. 39(10), 2439–2456 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  31. Rais, A., Alvelos, F., Carvalho, M.: New mixed integer-programming model for the pickup-and-delivery problem with transshipment. Eur. J. Oper. Res. 235(3), 530–539 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  32. Salazar-Aguilar, M.A., Langevin, A., Laporte, G.: Synchronized arc routing for snow plowing operations. Comput. Oper. Res. 39(7), 1432–1440 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  33. Salazar-Aguilar, M.A., Langevin, A., Laporte, G.: The synchronized arc and node routing problem: Application to road marking. Comput. Oper. Res. 40(7), 1708–1715 (2013)

    Article  MATH  Google Scholar 

  34. Soares, R.: New Models and Methods for the Vehicle Routing Problem with Multiple Synchronisation Constraints. Ph.D. dissertation, Universidade do Porto, Portugal (2022)

  35. Soares, R., Marques, A., Amorim, P., Parragh, S.: Synchronisation in Vehicle Routing: A Literature-based Classification Schema and Modelling Framework. Technical report, Universidade do Porto, Portugal (2021)

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

    Article  MathSciNet  MATH  Google Scholar 

  37. Yin, P.-Y., Chuang, Y.-L.: Adaptive memory artificial bee colony algorithm for green vehicle routing with cross-docking. Appl. Math. Model. 40, 9302–9315 (2016)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Robert H. Smith School of Business, University of Maryland, College Park, USA

    Bruce Golden & S. Raghavan

  2. College of Computer, Mathematical, and Natural Sciences, University of Maryland, College Park, USA

    Eric Oden

  3. Institute for Systems Research, University of Maryland, College Park, USA

    S. Raghavan

Authors
  1. Bruce Golden
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Eric Oden
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. S. Raghavan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Eric Oden.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Golden, B., Oden, E. & Raghavan, S. The rendezvous vehicle routing problem. Optim Lett 17, 1711–1738 (2023). https://doi.org/10.1007/s11590-023-02037-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-023-02037-1

Keywords

Search

Navigation