Advertisement

A Heuristic Approach to the Driver and Vehicle Routing Problem

  • Bencomo Domínguez-Martín
  • Inmaculada Rodríguez-Martín
  • Juan-José Salazar-GonzálezEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11184)

Abstract

This paper presents a heuristic approach for a routing problem with two depots and involving vehicles and drivers. Vehicles must leave from one depot and arrive to the other, while drivers should leave and return to the same depot and their routes can not exceed a given duration. With these conditions, drivers must change vehicles in order to go back to their base depots. These changes can only take place at some particular nodes known as exchange locations. The heuristic approach in this paper is a two-phase method for the problem with one exchange location. In the first phase it solves a mathematical model to obtain drivers’ routes. In the second phase it builds vehicles’ routes over the given drivers’ routes. Computational results show that the proposed approach can find high quality solutions for instances with up to 50 nodes.

Keywords

Vehicle routing Multi depot Heuristics 

References

  1. 1.
    Cordeau, J.-F., Stojković, G., Soumis, F., Desrosiers, J.: Benders decomposition for simultaneous aircraft routing and crew scheduling. Transp. Sci. 35, 375–388 (2001)CrossRefGoogle Scholar
  2. 2.
    Domínguez-Martín, B., Rodríguez-Martín, I., Salazar-González, J.-J.: An exact algorithm for a Vehicle-and-Driver Scheduling Problem. Comput. Oper. Res. 81, 247–256 (2017)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Domínguez-Martín, B., Rodríguez-Martín, I., Salazar-González, J.-J.: The driver and vehicle routing problem. Comput. Oper. Res. 92, 56–64 (2018)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Drexl, M.: Synchronization in vehicle routing - a survey of VRPs with multiple synchronization constraints. Transp. Sci. 46, 297–316 (2012)CrossRefGoogle Scholar
  5. 5.
    Freling, R., Huisman, D., Wagelmans, A.P.M.: Models and algorithms for integration of Vehicle and Crew Scheduling. J. Sched. 6, 63–85 (2003)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Huisman, D., Freling, R., Wagelmans, A.P.M.: Multiple-depot integrated Vehicle and Crew Scheduling. Transp. Sci. 39, 491–502 (2005)CrossRefGoogle Scholar
  7. 7.
    Lam, E., Van Hentenryck, P., Kilby, P.: Joint vehicle and crew routing and scheduling. In: Pesant, G. (ed.) CP 2015. LNCS, vol. 9255, pp. 654–670. Springer, Cham (2015).  https://doi.org/10.1007/978-3-319-23219-5_45CrossRefGoogle Scholar
  8. 8.
    Mesquita, M., Paias, A.: Set partitioning/covering-based approaches for the integrated vehicle and crew scheduling problem. Comput. Oper. Res. 35, 1562–1575 (2008)CrossRefGoogle Scholar
  9. 9.
    Papadakos, N.: Integrated airline scheduling. Comput. Oper. Res. 36, 176–195 (2009)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Salazar-González, J.J.: Approaches to solve the fleet-assignment, aircraft-routing, crew-pairing and crew-rostering problems of a regional carrier. Omega 43, 71–82 (2014)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  1. 1.DMEIO, Facultad de CienciasUniversidad de La LagunaTenerifeSpain

Personalised recommendations