![](bgb.png)
Battarra, M., Cordeau, J.-F., and Iori, M. (2014). Pickup-
and-delivery problems for goods transportation. In
Toth, P. and Vigo, D., editors, The Vehicle Routing
Problem, Monographs on Discrete Mathematics and
Applications, pages 161–191. SIAM, Philadelphia.
Battarra, M., Monaci, M., and Vigo, D. (2009). An adap-
tive guidance approach for the heuristic solution of a
minimum multiple trip vehicle routing problem. Com-
puters & Operations Research, 36(11):3041 – 3050.
Benkebir, N., Pouliquen, M. L., Tr
´
evien, J.-F., Bounceur,
A., Euler, R., Pardiac, E., and Sevaux, M. (2019). On a
multi-trip vehicle routing problem with time windows
integrating european and french driver regulations.
Journal on Vehicle Routing Algorithms, 2(1):55–74.
Brandao, J. and Mercer, A. (1997). A tabu search algo-
rithm for the multi-trip vehicle routing and scheduling
problem. European journal of operational research,
100(1):180–191.
Brandao, J. and Mercer, A. (1998). The multi-trip vehicle
routing problem. Journal of the Operational research
society, 49(8):799–805.
Campbell, A. M. and Savelsbergh, M. (2004). Efficient in-
sertion heuristics for vehicle routing and scheduling
problems. Transportation science, 38(3):369–378.
Cattaruzza, D., Absi, N., and Feillet, D. (2016). Vehicle
routing problems with multiple trips. 4OR, 14(3):223–
259.
Cattaruzza, D., Absi, N., Feillet, D., and Vidal, T. (2014a).
A memetic algorithm for the multi trip vehicle routing
problem. European Journal of Operational Research,
236(3):833–848.
Cattaruzza, D., Absi, N., Feillet, D., and Vigo, D. (2014b).
An iterated local search for the multi-commodity
multi-trip vehicle routing problem with time windows.
Computers & Operations Research, 51:257 – 267.
Dantzig, G. B. and Ramser, J. H. (1959). The truck dis-
patching problem. Management science, 6(1):80–91.
Doerner, K. and Salazar-Gonz
´
alez, J. (2014). Pickup-and-
delivery problems for people transportation. In Toth,
P. and Vigo, D., editors, The Vehicle Routing Prob-
lem, Monographs on Discrete Mathematics and Ap-
plications, pages 161–191. SIAM, Philadelphia.
Drexl, M., Rieck, J., Sigl, T., and Press, B. (2013). Si-
multaneous vehicle and crew routing and scheduling
for partial- and full-load long-distance road transport.
Business Research, 6(2):242–264.
Duhamel, C., Lacomme, P., and Prodhon, C. (2011). Effi-
cient frameworks for greedy split and new depth first
search split procedures for routing problems. Comput-
ers & Operations Research, 38(4):723–739.
Fleischmann, B. (1990). The vehicle routing problem with
multiple use of vehicles. Fachbereich Wirtschaftswis-
senschaften, Universit
¨
at Hamburg.
Goel, A. (2009). Vehicle scheduling and routing with
drivers’ working hours. Transportation Science,
43(1):17–26.
Golden, B., Raghavan, S., and Wasil, E., editors (2008). The
Vehicle Routing Problem: Latest Advances and New
Challenges. Operations Research/Computer Science
Interfaces Series. Springer.
He, P. and Li, J. (2019). The two-echelon multi-trip vehicle
routing problem with dynamic satellites for crop har-
vesting and transportation. Applied Soft Computing,
77:387–398.
Hernandez, F., Feillet, D., Giroudeau, R., and Naud, O.
(2016). Branch-and-price algorithms for the solution
of the multi-trip vehicle routing problem with time
windows. European Journal of Operational Research,
249(2):551–559.
Kok, A. L., Meyer, C. M., Kopfer, H., and Schutten, J.
M. J. (2010). A dynamic programming heuristic for
the vehicle routing problem with time windows and
european community social legislation. Transporta-
tion Science, 44(4):442–454.
Kramer, R., Cordeau, J.-F., and Iori, M. (2019). Rich vehi-
cle routing with auxiliary depots and anticipated deliv-
eries: An application to pharmaceutical distribution.
Transportation Research Part E: Logistics and Trans-
portation Review, 129:162–174.
Lahyani, R., Khemakhem, M., and Semet, F. (2015). Rich
vehicle routing problems: From a taxonomy to a def-
inition. European Journal of Operational Research,
241(1):1–14.
Macedo, R., Alves, C., de Carvalho, J. V., Clautiaux, F., and
Hanafi, S. (2011). Solving the vehicle routing problem
with time windows and multiple routes exactly using a
pseudo-polynomial model. European Journal of Op-
erational Research, 214(3):536 – 545.
Masmoudi, M. A., Hosny, M., Braekers, K., and Dammak,
A. (2016). Three effective metaheuristics to solve the
multi-depot multi-trip heterogeneous dial-a-ride prob-
lem. Transportation Research Part E: Logistics and
Transportation Review, 96:60 – 80.
Mingozzi, A., Roberti, R., and Toth, P. (2013). An exact
algorithm for the multitrip vehicle routing problem.
INFORMS Journal on Computing, 25(2):193–207.
Solomon, M. M. (1984). Vehicle routing and scheduling
with time window constraints: Models and algorithms
(heuristics).
Taillard,
´
E. D., Laporte, G., and Gendreau, M. (1996). Vehi-
cle routeing with multiple use of vehicles. Journal of
the Operational research society, 47(8):1065–1070.
Tang, J., Yu, Y., and Li, J. (2015). An exact algorithm
for the multi-trip vehicle routing and scheduling prob-
lem of pickup and delivery of customers to the airport.
Transportation Research Part E: Logistics and Trans-
portation Review, 73:114–132.
Toth, P. and Vigo, D., editors (2014). Vehicle Rout-
ing: Problems, methods, and applications. SIAM,
Philadelphia, 2nd edition.
Z
¨
apfel, G. and B
¨
ogl, M. (2008). Multi-period vehicle
routing and crew scheduling with outsourcing op-
tions. International Journal of Production Economics,
113(2):980–996.
A Decision Support System for a Multi-trip Vehicle Routing Problem with Trucks and Drivers Scheduling
349