Skip to main content
SpringerLink
Log in

Using state-space shortest-path heuristics to solve the long-haul point-to-point vehicle routing and driver scheduling problem subject to hours-of-service regulatory constraints

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

This paper addresses the vehicle routing and driver scheduling problem of finding a low cost route and stoppage schedule for long-haul point-to-point full-load trips with intermediate stops due to refueling needs and driver hours-of-service regulatory restrictions. This is an important problem for long-haul truck drivers because in practice regulatory driving limits often do not coincide with availability of stoppage alternatives for quick rest, for meal, for overnight, or for weekly downtime required stops. The paper presents a methodology and algorithm to pick routes that optimize stoppages within the HOS constraints, an important factor of both highway safety and driver productivity. A solution for this variant of the vehicle routing and truck driver scheduling problem (VRTDS-HOS) that is fast enough to potentially be used in real time is proposed by modeling possible stoppage configurations as nodes in an iteratively built multi-dimensional state-space graph and by using heuristics to decrease processing time when searching for the lowest-cost path in that graph. Individual nodes in the graph are characterized by spatial, temporal, and stoppage attributes, and are expanded sequentially to search for low-cost paths between the origin and the destination. Within this multi-dimensional state-space graph, the paper proposes two heuristics applied to a shortest-path algorithmic solution based on the \(A^*\) algorithm to increase processing speed enough to potentially permit real-time usage. An illustrative application to Brazilian regulations is provided. Results were successful and are reported together with sensitivity analyses comparing alternative routes and different heuristics processing speeds.

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

Similar content being viewed by others

References

  • Alcaraz, J.J., Caballero-Arnaldos, L., Vales-Alonso, J.: Rich vehicle routing problem with last-mile outsourcing decisions. Transp. Res. Part E Logist. Transp. Rev. 129, 263–286 (2019)

    Google Scholar 

  • Archetti, C., Savelsbergh, M.: The trip scheduling problem. Transp. Sci. 43(4), 417–431 (2009)

    Google Scholar 

  • Ardakani, M.K., Tavana, M.: A decremental approach with the \(a^*\) algorithm for speeding-up the optimization process in dynamic shortest path problems. Measurement 60, 299–307 (2015)

    Google Scholar 

  • Avella, P., Boccia, M., Sforza, A.: A penalty function heuristic for the resource constrained shortest path problem. Eur. J. Oper. Res. 142(2), 221–230 (2002)

    MATH  Google Scholar 

  • Baum, M., Dibbelt, J., Gemsa, A., Wagner, D., Zündorf, T.: Shortest feasible paths with charging stops for battery electric vehicles. Transp. Sci. 53(6), 1627–1655 (2019)

    Google Scholar 

  • BRASIL, L., Lei n\(^\circ \) 13.103. Dispõe sobre o exercício da profissão de motorista. Disponível emhttp://www.planalto.gov.br/ccivil_03/_Ato2015-2018/2015/LeiL, 13103, (2015)

  • Bruni, M.E., Guerriero, F.: An enhanced exact procedure for the absolute robust shortest path problem. Int. Trans. Oper. Res. 17(2), 207–220 (2010)

    MathSciNet  MATH  Google Scholar 

  • Campbell, A.M., Savelsbergh, M.: Efficient insertion heuristics for vehicle routing and scheduling problems. Transp. Sci. 38(3), 369–378 (2004)

    Google Scholar 

  • Ceselli, A., Righini, G., Salani, M.: A column generation algorithm for a rich vehicle-routing problem. Transp. Sci. 43(1), 56–69 (2009)

    Google Scholar 

  • Coelho, L.C., Cordeau, J.-F., Laporte, G.: Thirty years of inventory routing. Transp. Sci. 48(1), 1–19 (2014)

    Google Scholar 

  • Cordeau, J.-F., Gendreau, M., Laporte, G., Potvin, J.-Y., Semet, F.: A guide to vehicle routing heuristics. J. Oper. Res. Soci. 53(5), 512–522 (2002)

    MATH  Google Scholar 

  • Dabia, S., Demir, E., Woensel, T.V.: An exact approach for a variant of the pollution-routing problem. Transp. Sci. 51(2), 607–628 (2017)

    Google Scholar 

  • de Figueiredo, J.N., Gonzaga, C.C.: Aplicaçao de métodos de busca em grafos com nós parcialmente ordenadosa locaçao de torres de transmissao. Pesquisa Operacional 23(1), 209–220 (2003)

    Google Scholar 

  • Dell’Amico, M., Iori, M., Pretolani, D.: Shortest paths in piecewise continuous time-dependent networks. Oper. Res. Lett. 36(6), 688–691 (2008)

    MathSciNet  MATH  Google Scholar 

  • Dijkstra, E.W.: A note on two problems in connexion with graphs: Numerische Mathematik. pages 269–271, (1959)

  • Drexl, M., Prescott-Gagnon, E.: Labelling algorithms for the elementary shortest path problem with resource constraints considering eu drivers’ rules. Logist. Res. 2(2), 79–96 (2010)

    Google Scholar 

  • Franceschetti, A., Honhon, D., Laporte, G., Van Woensel, T.: A shortest-path algorithm for the departure time and speed optimization problem. Transp. Sci. 52(4), 756–768 (2018)

    Google Scholar 

  • Fu, L., Sun, D., Rilett, L.R.: Heuristic shortest path algorithms for transportation applications: state of the art. Comput. Oper. Res. 33(11), 3324–3343 (2006)

    MATH  Google Scholar 

  • Goel, A.: Vehicle scheduling and routing with drivers’ working hours. Transp. Sci. 43(1), 17–26 (2009)

    Google Scholar 

  • Goel, A.: The canadian minimum duration truck driver scheduling problem. Comput. Oper. Res. 39(10), 2359–2367 (2012)

    MathSciNet  MATH  Google Scholar 

  • Goel, A.: A mixed integer programming formulation and effective cuts for minimising schedule durations of australian truck drivers. J. Sched. 15(6), 733–741 (2012)

    Google Scholar 

  • Goel, A.: Legal aspects in road transport optimization in europe. Transp. Res. Part E Logist. Transp. Rev. 114, 144–162 (2018)

    Google Scholar 

  • Goel, A., Irnich, S.: An exact method for vehicle routing and truck driver scheduling problems. Transp. Sci. 51(2), 737–754 (2017)

    Google Scholar 

  • Goel, A., Kok, L.: Efficient scheduling of team truck drivers in the european union. Flex. Serv. Manuf. J. 24(1), 81–96 (2012)

    Google Scholar 

  • Goel, A., Vidal, T.: Hours of service regulations in road freight transport: an optimization-based international assessment. Transp. Sci. 48(3), 391–412 (2014)

    Google Scholar 

  • Goel, A., Archetti, C., Savelsbergh, M.: Truck driver scheduling in australia. Comput. Operat. Res. 39(5), 1122–1132 (2012)

    MATH  Google Scholar 

  • Goel, A., Vidal, T., Kok, A.L.: To team up or not-single versus team driving in european road freight transport. Tech. Rep., PUC-Rio, Rio de Janeiro, Brasil, Technical report (2019)

  • Goldberg, A.V., Harrelson, C.: Computing the shortest path: a search meets graph theory. SODA 5, 156–165 (2005)

    MathSciNet  MATH  Google Scholar 

  • Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4(2), 100–107 (1968)

    Google Scholar 

  • Horváth, M., Kis, T.: Solving resource constrained shortest path problems with lp-based methods. Comput. Oper. Res. 73, 150–164 (2016)

    MathSciNet  MATH  Google Scholar 

  • Klunder, G., Post, H.: The shortest path problem on large-scale real-road networks. Netw Int J 48(4), 182–194 (2006)

    MathSciNet  MATH  Google Scholar 

  • Koç, Ç., Jabali, O., Laporte, G.: Long-haul vehicle routing and scheduling with idling options. J. Oper. Res. Soc. (2017). https://doi.org/10.1057/s41274-017-0202-y

    Article  Google Scholar 

  • Kok, A.L., Meyer, C.M., Kopfer, H., Schutten, J.M.J.: A dynamic programming heuristic for the vehicle routing problem with time windows and european community social legislation. Transp. Sci. 44(4), 442–454 (2010)

    Google Scholar 

  • Laporte, G.: Fifty years of vehicle routing. Transp. Sci. 43(4), 408–416 (2009)

    Google Scholar 

  • Mandow, L., De La Cruz, J.L.P.: Multiobjective a* search with consistent heuristics. J. ACM (JACM) 57(5), 1–25 (2008)

    MathSciNet  Google Scholar 

  • Mayerle, S.F., Chiroli, D.M.D.G., de Figueiredo, J.N., Rodrigues, H.F.: The long-haul full-load vehicle routing and truck driver scheduling problem with intermediate stops: an economic impact evaluation of brazilian policy. Transp. Res. Part A. Policy Pract. 140, 36–51 (2020)

    Google Scholar 

  • Montemanni, R., Gambardella, L.M.: An exact algorithm for the robust shortest path problem with interval data. Comput. Oper. Res. 31(10), 1667–1680 (2004)

    MathSciNet  MATH  Google Scholar 

  • Murthy, I., Her, S.-S.: Solving min-max shortest-path problems on a network. Naval Res. Logist. (NRL) 39(5), 669–683 (1992)

    MathSciNet  MATH  Google Scholar 

  • Nannicini, G., Baptiste, P., Barbier, G., Krob, D., Liberti, L.: Fast paths in large-scale dynamic road networks. Comput. Optim. Appl. 45(1), 143–158 (2010)

    MathSciNet  MATH  Google Scholar 

  • Nannicini, G., Delling, D., Schultes, D., Liberti, L.: Bidirectional a* search on time-dependent road networks. Networks 59(2), 240–251 (2012)

    MathSciNet  MATH  Google Scholar 

  • Nascimento, D.B., de Figueiredo, J.N., Mayerle, S., Nascimento, P., Casali, R.: A state-space solution search method for apparel industry spreading and cutting. Int. J. Prod. Econ. 128(1), 379–392 (2010)

    Google Scholar 

  • Nilsson, N.J.: Problem-solving methods in. Artificial Intelligence, (1971)

  • Pijls, W.: Heuristic estimates in shortest path algorithms. Stat. Neerl. 61(1), 61–74 (2007)

    MathSciNet  MATH  Google Scholar 

  • Pohl, I.: Bi-directional search, machine intelligence 6. (1971)

  • Prescott-Gagnon, E., Desaulniers, G., Drexl, M., Rousseau, L.-M.: European driver rules in vehicle routing with time windows. Transp. Sci. 44(4), 455–473 (2010)

    Google Scholar 

  • Rancourt, M.-E., Cordeau, J.-F., Laporte, G.: Long-haul vehicle routing and scheduling with working hour rules. Transp. Sci. 47(1), 81–107 (2013)

    Google Scholar 

  • Savelsbergh, M., Sol, M.: Drive: dynamic routing of independent vehicles. Oper. Res. 46(4), 474–490 (1998)

    MATH  Google Scholar 

  • Schiffer, M., Schneider, M., Walther, G., Laporte, G.: Vehicle routing and location routing with intermediate stops: a review. Transp. Sci. 53(2), 319–343 (2019)

    Google Scholar 

  • Vidal, T., Crainic, T.G., Gendreau, M., Prins, C.: Heuristics for multi-attribute vehicle routing problems: a survey and synthesis. Eur. J. Oper. Res. 231(1), 1–21 (2013)

    MathSciNet  MATH  Google Scholar 

  • Vidal, T., Laporte, G., Matl, P.: A concise guide to existing and emerging vehicle routing problem variants. Eur. J. Oper. Res. 286(2), 401–416 (2019)

    MathSciNet  MATH  Google Scholar 

  • Vital, F., Ioannou, P.: Scheduling and shortest path for trucks with working hours and parking availability constraints. Transp. Res. Part B Methodol. 148, 1–37 (2021)

    Google Scholar 

  • Wang, Y., Li, X., Ruiz, R.: An exact algorithm for the shortest path problem with position-based learning effects. IEEE Trans. Syst. Man Cybern. Syst. 47(11), 3037–3049 (2016)

    Google Scholar 

  • Xu, H., Chen, Z.-L., Rajagopal, S., Arunapuram, S.: Solving a practical pickup and delivery problem. Transp. Sci. 37(3), 347–364 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Textile Engineering, Federal Technology University of Paraná, Apucarana, Brazil

    Daiane Maria De Genaro Chiroli

  2. Department of Industrial Engineering and Systems, Federal University of Santa Catarina, Florianópolis, Brazil

    Sérgio Fernando Mayerle

  3. Department of Management, Haub School of Business, Saint Joseph’s University, 5600 City Ave, Philadelphia, USA

    João Neiva de Figueiredo

Authors
  1. Daiane Maria De Genaro Chiroli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sérgio Fernando Mayerle
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. João Neiva de Figueiredo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to João Neiva de Figueiredo.

Additional information

Publisher's Note

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

Appendix

Appendix

Algorithm pseudo-code for the computer system as programmed

figure a
figure b
figure c
figure d
figure e
figure f
figure g
figure h

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

De Genaro Chiroli, D.M., Mayerle, S.F. & de Figueiredo, J.N. Using state-space shortest-path heuristics to solve the long-haul point-to-point vehicle routing and driver scheduling problem subject to hours-of-service regulatory constraints. J Heuristics 28, 23–59 (2022). https://doi.org/10.1007/s10732-021-09489-7

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10732-021-09489-7

Keywords

Search

Navigation