Abstract
This paper presents a survey on the multi-trip vehicle routing problem (MTVRP) and on related routing problems where vehicles are allowed to perform multiple trips and corresponds to the article by Cattaruzza et al. (4OR 14(3):223–259, 2016). The first part of the paper focuses on the MTVRP. It gives an unified view on mathematical formulations and surveys exact and heuristic approaches. The paper continues with variants of the MTVRP and other families of routing problems where multiple trips are sometimes allowed. For the latter, it specially insists on the motivations for having multiple trips and the algorithmic consequences. The expected contribution of the survey is to give a comprehensive overview on a structural property of routing problems that has seen a strongly growing interest in the last few years and that has been investigated in very different areas of the routing literature.
Similar content being viewed by others
References
Adulyasak, Y., Cordeau, J.-F., & Jans, R. (2014). The production routing problem: A review of formulations and solution algorithms. Computers & Operations Research, 155, 141–152.
Aghezzaf, E.-H., Raa, B., & Van Landeghem, H. (2006). Modeling inventory routing problems in supply chains of high consumption products. European Journal of Operational Research, 169(3), 1048–1063.
Alonso, F., Alvarez, M. J., & Beasley, J. E. (2008). A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions. Journal of Operational Research Society, 59(7), 963–976.
Anaya-Arenas, A. M., Chabot, T., Renaud, J., & Ruiz. A. (2014). Biomedical sample transportation: A case study based on quebec’s healthcare supply chain. Technical report, Faculté des sciences de l’administration, Universit Laval Québec (Québec), Canada
Avella, P., Boccia, M., & Sforza, A. (2004). Solving a fuel delivery problem by heuristic and exact approaches. European Journal of Operational Research, 152(1), 170–179.
Ayadi, R., Elldrissi, A. E., Benadada, Y., & El Hilali Alaoui, A. (2014). Evolutionary algorithm for a green vehicle routing problem with multiple trips. In International conference on logistics and operations management, pp. 148–154.
Azi, N. (2010). Méthodes Exactes et Heuristiques pour le Problème de Tournées avec Fenêtres de Temps et Réutilisation de Véhicules. Ph.D. thesis, Université de Montréal.
Azi, N., Gendreau, M., & Potvin, J.-Y. (2007). An exact algorithm for a single-vehicle routing problem with time windows and multiple routes. European Journal of Operational Research, 178(3), 755–766.
Azi, N., Gendreau, M., & Potvin, J.-Y. (2010). An exact algorithm for a vehicle routing problem with time windows and multiple routes. European Journal of Operational Research, 202(3), 756–763.
Azi, N., Gendreau, M., & Potvin, J.-Y. (2012). A dynamic vehicle routing problem with multiple delivery routes. Annals of Operations Research, 199(1), 103–112.
Azi, N., Gendreau, M., & Potvin, J.-Y. (2014). An adaptive large neighborhood search for a vehicle routing problem with multiple routes. Computers & Operations Research, 41, 167–173.
Battarra, M., Monaci, M., & Vigo, D. (2009). An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem. Computers & Operations Research, 36(11), 3041–3050.
Bendall, H. B., & Stent, A. F. (2001). A scheduling model for a high speed containership service: A hub and spoke short-sea application. International Journal of Maritime Economics, 3, 262–277.
Bertazzi, L., Savelsbergh, M., & Speranza, M. G. (2008). In the vehicle routing problem: Last advances and new challenges, operations research computer science interfaces, chapter inventory routing (pp. 49–72). Berlin: Springer.
Boschetti, M., & Maniezzo, V. (2015). A set covering based matheuristic for a real-world city logistics problem. International Transaction in Operational Research, 22, 169–195.
Brandão, J., & Mercer, A. (1997). A tabu search algorithm for the multi-trip vehicle routing problem. European Journal of Operational Research, 100(1), 180–191.
Brandão, J., & Mercer, A. (1998). The multi-trip vehicle routing problem. Journal of the Operational Research Society, 49, 799–805.
Buhrkal, K., Larsen, A., & Ropke, S. (2012). The waste collection vehicle routing problem with time windows in a city logistics context. Procedia-Social and Behavioral Sciences, 39, 241–254.
Caceres-Cruz, J., Grasas, A., Ramalhinho, H., & Juan, A. A. (2014). A savings-based randomized heuristic for the heterogeneous fixed fleet vehicle routing problem with multi-trips. Journal of Applied Operational Research, 6(2), 69–81.
Cattaruzza, D., Absi, N., & Feillet, D. (2016). The multi-trip vehicle routing problem with time windows and release dates. Transportation Science, 50(2), 676–693.
Cattaruzza, D., Absi, N., & Feillet, D. (2016). Vehicle routing problems with multiple trips. 4OR, 14(3), 223–259.
Cattaruzza, D., Absi, N., Feillet, D., & Vidal, T. (2014). A memetic algorithm for the multi trip vehicle routing problem. European Journal of Operational Research, 236(6), 833–848.
Cattaruzza, D., Absi, N., Feillet, D., & Vigo, D. (2014). An iterated local search for the multi-commodity multi-trip vehicle routing problem with time windows. Computer & Operations Research, 51, 257–267.
Ceselli, A., Righini, G., & Salani, M. (2009). A column generation algorithm for a rich vehicle-routing problem. Transportation Science, 43(1), 56–69.
Chang, T.-C., & Lee, C.-Y. (2004). Machine scheduling with job delivery coordination. European Journal of Operational Research, 158(2), 470–487.
Chbichib, A., Mellouli, R., & Chabchoub, H. (2012). Profitable vehicle routing problem with multiple trips: Modeling and variable neighborhood descent algorithm. American Journal of Operational Research, 2(6), 104–119.
Chen, Z.-L. (2010). Integrated production and outbound distribution scheduling: Review and extensions. Operations Research, 58(1), 130–148.
Christiansen, M., Fagerholt, K., Nygreen, B., & Ronen, D. (2007). Handbooks in operations research & management science, chapter maritime transportation (pp. 189–284). New York: North Holland.
Christiansen, M., Fagerholt, K., & Ronen, D. (2004). Ship routing and scheduling: Status and perspectives. Transportation Science, 38(1), 1–18.
Christofides, N., Mingozzi, A., & Toth, P. (1979). The vehicle routing problem (pp. 315–338). Chichester: Wiley.
Cinar, D., Gakis, K., & Pardalos, P. M. (2014). Reduction of CO\(_2\) emissions in cumulative multi-trip vehicle routing problems with limited duration. Environmental Modeling & Assessment,. https://doi.org/10.1007/s10666-014-9434-2.
Clarke, G., & Wright, J. W. (1964). Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 12(4), 568–581.
Coelho, L. C., Cordeau, J.-F., & Laporte, G. (2014). Thirty years of inventory routing. Transportation Science, 48(1), 1–19.
Cornillier, F., Boctor, F. F., Laporte, G., & Renaud, J. (2008). A heuristic for the multi-period petrol station replenishment problem. European Journal of Operational Research, 191, 295–305.
Cornillier, F., Boctor, F. F., Laporte, G., & Renaud, J. (2009). An exact algorithm for the petrol station replenishment problem. Journal of Operational Research Society, 59, 607–615.
Cornillier, F., Laporte, G., Boctor, F. F., & Renaud, J. (2009). The petrol station replenishment problem with time windows. Computers & Operations Research, 36(3), 919–935.
Cornillier, G., Boctor, F. F., & Renaud, J. (2012). Heuristic for the multi-depot petrol station replenishment problem with time windows. European Journal of Operational Research, 220(2), 361–369.
Crainic, T. G., Gajapl, Y., & Gendreau, M. (2012). Multi-zone multi-trip vehicle routing problem with time windows. Technical report 2012–36, Centre interuniversitaire de recherche sur les réseaux d’enterprise, la logistique et le transport, Université de Montréal, Montréal, QC, Canada.
Crevier, B., Cordeau, J.-F., & Laporte, G. (2007). The multi-depot vehicle routing problem with inter-depot routes. European Journal of Operational Research, 176(2), 756–773.
Dantzig, G. B., & Ramser, J. H. (1959). The truck dispatching problem. Management Science, 6, 80–91.
Fagerholt, K. (1999). Optimal fleet design in a ship routing problem. International Transaction in Operational Research, 9(5), 453–464.
Fagerholt, K., & Lindstad, H. (2000). Optimal policies for maintaining a supply service in the norwegian sea. Omega, 28(3), 269–275.
Fisher, M. L. (1994). Optimal solution for vehicle routing problem using minimum \(k\)-trees. Operations Research, 42(4), 626–642.
Fleischmann, B. (1990). The vehicle routing problem with multiple use of vehicles. Technical report, Fachbereich Wirtschaftswissenschaften, Universität Hamburg
Gehring, H., & Homberger, J. (1999). A parallel hybrid evolutionary metaheuristic for the vehicle routing problem with time windows. In EUROGEN99.
Geismar, H. N., Laporte, G., Lei, L., & Sriskandarajah, C. (2008). The integrated production and transportation scheduling problem for a product with a short lifespan. INFORMS Journal of Computing, 20(1), 21–33.
Gianessi, P. (2014). Solving strategic and tactical optimization problems in city logistics. Ph.D. thesis, Université Paris 13.
Grangier, P., Gendreau, M., Lehuédé, F., & Rousseau. L.-M. (2014). An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization. Technical report 2014–33, Centre interuniversitaire de recherche sur les réseaux d’enterprise, la logistique et le transport, Université de Montréal, Montréal, QC, Canada.
Gribkovskaia, I., Gullberg, B. O., Hovden, K. J., & Wallace, S. W. (2006). Optimization model for a livestock collection problem. International Journal of Physical Distribution & Logistics Management, 36(2), 136–152.
Gutin, G., & Punnen, A. P. (2002). The traveling salesman problem and its variations. Combinatorial optimization (Vol. 12). Dordrecht: Kluwer Academic Publisher.
Hajri-Gabouj, S., & Darmoul, S. (2003). A hybrid evolutionary approach for a vehicle routing problem with double time windows for the depot and multiple use of vehicles. Studies in Informatics and Control, 12(4), 253–268.
Halvorsen-Weare, E. E., Fagerholt, K., Nonås, L. M., & Asbjørnslett, B. E. (2012). Optimal fleet composition and periodic routing of offshore supply vessels. European Journal of Operational Research, 223(2), 508–517.
Hernandez, F., Feillet, D., Giroudeau, R., & Naud, O. (2013). An exact algorithm to solve the multi-trip vehicle routing problem with time windows. Technical report.
Hernandez, F., Feillet, D., Giroudeau, R., & Naud, O. (2014). A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration. 4OR, 12, 235–259.
Koc, C., & Karaoglan, I. (2011). A branch and cut algorithm for the vehicle routing problem with multiple use of vehicles. In Proceedings of the 41st international conference on computers & industrial engineering (pp. 554–559). Los Angeles, USA.
Lee, J., Kim, B.-I., Johnson, A. L., & Lee, K. (2014). The nuclear medicine production and delivery problem. European Journal of Operational Research, 236(2), 461–472.
Lei, L., Liu, S., Ruszczynski, A., & Park, S. (2006). On the integrated production, inventory, and distribution routing problem. IIIE Transactions, 38(11), 955–970.
Lenstra, J. K., & Rinnooy Kan, H. G. (1981). Complexity of vehicle routing and scheduling problems. Networks, 11(2), 221–227.
Lin, C. K. Y., & Kwok, R. C. W. (2006). Multi-objective metaheuristic for a location routing problem with multiple use of vehicles on real data and simulated data. European Journal of Operational Research, 175(3), 1833–1849.
Macedo, R., Alves, C., Valério de Carvalho, J. M., Clautiaux, F., & Hanafi, S. (2011). Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model. European Journal of Operational Research, 214(3), 536–545.
Miller, C. E., Tucker, A. W., & Zemlin, R. A. (1960). Integer programming formulation of traveling salesman problems. Journal of the ACM, 7(4), 326–329.
Mingozzi, A., Roberti, R., & Toth, P. (2013). An exact algorithm for the multi-trip vehicle routing problem. INFORMS Journal on Computing, 25(2), 193–207.
Mu, Q., & Eglese, R. W. (2013). Disrupted capacitated vehicle routing problem with order release delay. Annals of Operations Research, 207(1), 201–216.
Nguyen, P. K., Crainic, T. G., & Toulouse, M. (2013). A tabu search for time-dependent multi-zone multi-trip vehicle routing problem with time windows. European Journal of Operational Research, 231(1), 43–56.
Nguyen, P. K., Crainic, T. G., & Toulouse, M.(2014). Multi-zone multi-trip pickup and delivery problem with time windows and synchronization. Technical report 2014–18, Centre interuniversitaire de recherche sur les réseaux d’enterprise, la logistique et le transport, Université de Montréal, Montréal, QC, Canada.
Olivera, A., & Viera, O. (2007). Adaptive memory programming for the vehicle routing problem with multiple trips. Computers & Operations Research, 34(1), 28–47.
Ong, J. O., & Suprayogi, S. (2011). Vehicle routing problem with backhaul, multiple trips and time windows. Journal Teknik Industri, 13(1), 1–10.
Oppen, J., & Lø kketangen, A. (2008). A tabu search approach for the livestock collection problem. Computers & Operations Research, 35(10), 3213–3229.
Oppen, J., Løkketangen, A., & Desrosiers, J. (2010). Solving a rich vehicle routing and inventory problem using column generation. Computers & Operations Research, 37(7), 1308–1317.
Petch, R. J., & Salhi, S. (2004). A multi-phase constructive heuristic for the vehicle routing problem with multi trips. Discrete Applied Mathematics, 133(1–3), 69–92.
Povlovitsch, S., & Bergsten Mendes, A. (2013). Column generation for a multitrip vehicle routing problem with time windows, driver work hours, and heterogeneous fleet. Mathematical Problems in Engineering 2013(824961): 13 pp.
Prins, C. (2002). Efficient heuristic for the heterogeneous fleet multitrip vrp with application to a large-scale real case. Journal of Mathematical Modelling and Algorithms, 1, 135–150.
Prins, C. (2004). A simple and effective evolutionary algorithm for the vehicle routing problem. Computers & Operations Research, 31(12), 1985–2002.
Raa, B., & Aghezzaf, E.-H. (2008). Designing distribution patterns for long-term inventory routing with constant demand rates. International Journal of Production Economics, 112(1), 255–263.
Raa, B., & Aghezzaf, E.-H. (2009). A practical solution approach for the cyclic inventory routing problem. European Journal of Operational Research, 192(2), 429–441.
Rivera J. C., Afsar H. M., Prins C. (2014). Multistart evolutionary local search for a disaster relief problem. In P. Legrand, M. M. Corsini, J. K. Hao, N. Monmarché, E. Lutton, M. Schoenauer (Eds.), Artificial Evolution. EA 2013. Lecture Notes in Computer Science (Vol. 8752). Cham: Springer.
Rochat, Y., & Taillard, É. (1995). Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics, 1(1), 147–167.
Ronen, D. (1992). Allocation of trips to trucks operating from a single terminal. Computers & Operations Research, 19(5), 445–451.
Salhi, S. (1987). The integration of routing into location-allocation and vehicle fleet composition problems. Ph.D. thesis, University of Lancaster.
Salhi, S., & Petch, R. J. (2007). A GA based heuristic for the vehicle routing problem with multiple trips. Journal of Mathematical Modeling and Algorithms, 6(4), 591–613.
Şen, A., & Bülbül, K. (2008). A survey on multi trip vehicle routing problem. In VI International Logistics & Supply Chain Congress, Instanbul.
Shyshou, A., Fagerholt, K., Gribkovskaia, I., & Laporte, G. (2012). A large neighbourhood search heuristic for a periodic supply vessel planning problem arising on offshore oil and gas operations. INFOR, 50(4), 195–204.
Solomon, M. M. (1987). Algorithms for the vehicle routing and scheduling problem with time windows constraints. Operations Research, 35, 254–265.
Suprayogi, S., Yamato, H., & Iskendar, B. P. (2001). Ship routing design for the oily liquid waste collection. Journal of the Society of Naval Architects of Japan, 190, 325–335.
Taillard, É. D. (1993). Parallel iterative search methods for vehicle routing problems. Networks, 23(8), 661–673.
Taillard, É. D., Laporte, G., & Gendreau, M. (1996). Vehicle routeing with multiple use of vehicles. Journal of Operational Research Society, 47(8), 1065–1070.
Taniguchi, E., & Shimamoto, H. (2004). Intelligent transportation sustem based dynamic vehicle routing and scheduling with variable travel times. Transportation Research Part C, 12(3–4), 235–250.
Taniguchi, E., & Van Der Heijden, R. E. C. M. (2000). An evaluation methodology for the city logistics. Transport Reviews, 20(1), 65–90.
Toth, P., & Vigo, D. (2002). The vehicle routing problem. Monographs on discrete mathematics and applications. SIAM: Philadelphia.
Tsirimpas, P., Tatarakis, A., Minis, I., & Kyriakidis, E. G. (2008). Single vehicle routing with a predefined customer sequence and multiple depot returns. European Journal of Operational Research, 187(2), 483–495.
Tung, D. V., & Pinnoi, A. (2000). Vehicle routing-scheduling for waste collection in hanoi. European Journal of Operational Research, 125(3), 449–468.
Ullrich, A. C. (2013). Integrated machine scheduling and vehicle routing with time windows. European Journal of Operational Research, 227(1), 152–165.
Van Buer, M. G., Woodruff, D. L., & Olson, R. T. (1999). Solving the medium newspaper production/distribution problem. European Journal of Operational Research, 115(2), 237–253.
Wang, Z., Liang, W., & Hu, X. (2014). A metaheuristic based on a pool of routes for the vehicle routing problem with multiple trips and time windows. Journal of the Operational Research Society, 65, 37–48.
Yellow, P. C. (1970). A computational modification to the savings method of vehicle scheduling. Operational Research Quarterly, 21(2), 281–283.
Author information
Authors and Affiliations
Corresponding author
Additional information
This is an updated version of the paper that appeared in 4OR, 14(3), 223–259 (2016).
Appendices
APPENDICES
A Benchmark instances for the MTVRP
Table 3 presents the state-of-the-art results on benchmark instances proposed by Taillard et al. (1996) for the MTVRP. The first column indicates the instance name, the number of customers N and the value \(z^*\) that served as a basis for the construction of the instance. Columns \(\left| \mathcal {V}\right| \), \(T_H^1\) and \(T_H^2\) give the number of vehicles and the length of the time horizon. Columns Opt report optimal values when available [all obtained by Mingozzi et al. (2013)]. Columns Best Known report best known values [all obtained by the heuristic method proposed in Cattaruzza et al. (2014)], when the corresponding optimal values are not known but feasible solutions have been found. Column Best Unfeas reports the value (including penalty) of the best unfeasible solution, when no feasible solutions are known. This column is omitted for instances corresponding to time horizon \(T_H^2\) since a feasible solution has been found for all instances. All these values and more detailed algorithm comparisons can be found in Cattaruzza et al. (2014). State-of-the-art algorithms are Olivera and Viera (2007), Cattaruzza et al. (2014).
B Benchmark instances for the MTVRP with time-windows and service-dependent loading times
Table 4 presents the state-of-the-art results on benchmark instances proposed by Hernandez et al. (2013), and adapted from Solomon’s, for the MTVRP with time-windows and service-dependent loading times. In these instances Q is set to 100 and M is set to 2 (instances with 25 customers) or 4 (instances with 50 customers). Other data are kept as in original instances. Distances are Euclidean and truncated to one decimal place. Column Opt reports optimal values when they are known. Column Best Known reports best known solution values for other instances.
Optimal values are obtained by Hernandez et al. (2013). All the best known values are obtained by the heuristic method proposed in Cattaruzza et al. (2016). Two of these best know values are upper bounds determined by Hernandez et al. (2013) (but no optimality certificate is provided).
C Benchmark instances for the MTVRP with time-windows, service-dependent loading times, limited trip duration and profits
Tables 5 and 6 report state-of-the-art results on benchmark instances proposed by Azi (2010), based on Solomon’s, for the MTVRP with time-windows, service-dependent loading times, limited trip duration and profits (MTVRPTW-LDP). Table 5 reports optimal solution values when all customers are visited. Table 6 gives optimal solutions for which some customers are left non-visited. The problem was investigated by Azi et al. (2010), Macedo et al. (2011) and Hernandez et al. (2014), with the exception that the latter does not allow non-visited vertices.
Each instance is solved with two values for N, respectively equal to 25 and 40, and two values for \(T_{max}\). For instances of groups RC and R, \(T_{max}\) is either set to 75 (indicated as Short \(T_{max}\) in Table 5) or 100 (Large \(T_{max}\)). For group C it is set to 220 (Short \(T_{max}\)) or 250 (Large \(T_{max}\)). Service times in C2 instances are equal to 90 for each customer, while in the other cases they are equal to 10. The number of vehicles is set to 2. \(\beta \) = 0.2.
Additionally, two different conventions have been adopted for computing the distance matrix. In Azi et al. (2010), instances are used with distances rounded at the second decimal place. Macedo et al. (2011) performed their experiments on the same instances but without truncating distances. Hernandez et al. (2014) evaluate their approach on both types of distances. Columns Opt(T) and Opt(NT) of Tables 5 report the optimal value when the distances are truncated (T) or not truncated (NT), respectively. In Table 6 the objective function is hierarchical and the optimal solution is described by the number of non-visited customers (Column Nb) and the traveled distance (column Dist). Whether distances are truncated or not, we follow the literature by reporting travel distances truncated at the second decimal place.
In both tables a “–” indicates that no optimal solution has been found. In Tables 5 NoSol is written instead if it is proved that no solution visiting all customers exist. No heuristic algorithms having been applied to these instances, we do not report upper bounds.
Detailed comparisons of the three approaches when all customers are visited can be found in Hernandez et al. (2014). They permit to conclude that Macedo et al. (2011) and Hernandez et al. (2014) obtain comparable results and significantly improve upon Azi et al. (2010), not forgetting that Hernandez et al. (2014) is more specialized (not allowing non-visited vertices).
Rights and permissions
About this article
Cite this article
Cattaruzza, D., Absi, N. & Feillet, D. Vehicle routing problems with multiple trips. Ann Oper Res 271, 127–159 (2018). https://doi.org/10.1007/s10479-018-2988-7
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-018-2988-7