Abstract
In this paper, we address a rich Traveling Salesman Problem with Profits encountered in several real-life cases. We propose a unified solution approach based on variable neighborhood search. Our approach combines several removal and insertion routing neighborhoods and efficient constraint checking procedures. The loading problem related to the use of a multi-compartment vehicle is addressed carefully. Two loading neighborhoods based on the solution of mathematical programs are proposed to intensify the search. They interact with the routing neighborhoods as it is commonly done in matheuristics. The performance of the proposed matheuristic is assessed on various instances proposed for the Orienteering Problem and the Orienteering Problem with Time Window including up to 288 customers. The computational results show that the proposed matheuristic is very competitive compared with the state-of-the-art methods. To better evaluate its performance, we generate a new testbed including instances with various attributes. Extensive computational experiments on the new testbed confirm the efficiency of the matheuristic. A sensitivity analysis highlights which components of the matheuristic contribute most to the solution quality.
Similar content being viewed by others
References
Archetti C, Feillet D, Hertz A, Speranza MG (2009) The capacitated team orienteering and profitable tour problems. J Oper Res Soc 60(2):831–842
Archetti C, Speranza MG, Vigo D (2013) Vehicle routing problems. Tech. rep, Department of Economics and Management University of Brescia, Italy
Balas E (1989) The prize collecting traveling salesman problem. Networks 19(6):621–636
Balas E (2007) The prize collecting traveling salesman problem and its applications. In: Gutin G, Punnen AP (eds) The traveling salesman problem and its variations. Kluwer Academic Publisher, The Netherlands, pp 663–695
Campos V, Martí R, Sánchez-Oro J, Duarte A (2013) Grasp with path relinking for the orienteering problem. J Oper Res Soc 65(12):1800–1813
Chao IM, Golden BL, Wasil EA (1996) A fast and effective heuristic for the orienteering problem. Eur J Oper Res 88:475–489
Cordeau JF, Gendreau M, Laporte G (1997) A tabu search heuristic for periodic and multidepot problems. Networks 30:105–119
Cordeau JF, Gendreau M, Laporte G, Potvin J, Semet F (2002) A guide to vehicle routing heuristics. J Oper Res Soc 53(5):512–522
Cornillier F, Boctor FF, Laporte G, Renaud J (2009) The petrol station replenishment problem with time windows. Comp Oper Res 36(3):919–935
Dell’Amico M, Maffioli F, Varbrand P (1995) On prize-collecting tours and the asymmetric travelling salesman problem. Int Trans Oper Res 2(3):297–308
Demir E, Bektas T, Laporte G (2012) An adaptive large neighborhood search heuristic for the pollution-routing problem. Eur J Oper Res 223(2):346–359
Derigs U, Gottlieb J, Kalkoff J, Piesche M, Rothlauf F, Vogel U (2011) Vehicle routing with compartments: applications, modeling and heuristics. OR Spectrum 33(4):885–914
Dongarra JJ (2013) Performance of various computers using standard linear equations software. Tech. rep., Electrical Engineering and Computer Science Department- University of Tennessee and Computer Science and Mathematics Division- University of Manchester
El Fallahi A, Prins C, Calvo RW (2008) A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem. Comp Oper Res 35:1725–1741
Feillet D, Dejax P, Gendreau M (2005) Traveling salesman problems with profits. Transportation Sci 39(2):188–205
Fischetti M, Salazar-González JJ, Toth P (2007) The generalized traveling salesman and orienteering problems. In: Gutin G, Punnen AP (eds) The traveling salesman problem and its variations. Kluwer Academic Publisher, The Netherlands, pp 609–662
Garcia A, Vansteenwegen P, Souffriau W, Arbelaitz O, Linaza M (2010) Solving multi constrained team orienteering problems to generate tourist routes. Tech. rep., Centre for Industrial Management / Traffic & Infrastructure
Gehring H, Homberger J (1999) A parallel hybrid evolutionary metaheuristic for the vehicle routing problem with time windows. In: Proceedings of the Evolutionary Algorithms in Engineering and Computer Science, University of Jyvskyl, Jyvskyl, Finland, pp 57–64
Gendreau M, Hertz A, Laporte G, Stan M (1995) A generalized insertion heuristic for the traveling salesman problem with time windows. Oper Res 46(3):330–335
Gendreau M, Laporte G, Semet F (1998a) A branch and cut algorithm for the undirected selective travelling salesman problem. Networks 32(4):263–273
Gendreau M, Laporte G, Semet F (1998b) A tabu search heuristic for the undirected selective travelling salesman problem. Eur J Oper Res 106(2–3):539–545
Golden B, Levy L, Vohra R (1987) The orienteering problem. Naval Res Logistics 34(3):307–318
Golumbic MC (2004) Algorithmic graph theory and perfect graphs. Elsevier, Amsterdam, The Netherlands
Jepsen MK (2011) Branch-and-cut and branch-and-cut-and-price algorithms for solving vehicle routing problems. PhD thesis, Technical University of Denmark. http://orbit.dtu.dk/fedora/objects/orbit:89357/datastreams/file_6317942/content
Labadie N, Melechovsk J, Calvo RW (2011) Hybridized evolutionary local search algorithm for the team orienteering problem with time windows. J Heuristics 17(6):729–753
Labadie N, Mansini R, Melechovsk J, Calvo RW (2012) The team orienteering problem with time windows: An lp-based granular variable neighborhood search. Eur J Oper Res 220(1):15–27
Lahyani R, Coelho LC, Khemakhem M, Laporte G, Semet F (2015a) A multi-compartment vehicle routing problem arising in the collection of olive oil in tunisia. OMEGA 51:1–10
Lahyani R, Khemakhem M, Semet F (2015b) Rich vehicle routing problems: From a taxonomy to a definition. Eur J Oper Res 241(1):1–14
Laporte G, Martello S (1990) The selective travelling salesman problem. Discrete Appl Math 26(2–3):193–207
Lin SW, Yu VF (2012) A simulated annealing heuristic for the team orienteering problem with time windows. Eur J Oper Res 217(1):94–107
Mladenovic N, Hansen P (1997) Variable neighborhood search. Comp Oper Res 24(11):1097–1100
Montemanni R, Gambardella LM (2009) An ant colony system for team orienteering problem with time windows. Foundations Comp Decision Sci 34(4):287–306
Muyldermans L, Pang G (2010) On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm. Eur J Oper Res 206(1):93–103
Perttunen J (1994) On the significance of the initial solution in traveling salesman heuristics. J Oper Res Soc 45(10):1131–1140
Pferschy U, Schauer J (2009) The knapsack problem with conflict graphs. J Graph Algo Appl 13(2):233–249
Pirkwieser DS (2012) Hybrid metaheuristics and matheuristics for problems in bioinformatics and transportation. PhD thesis, Vienna University of Technology
Pisinger D, Ropke S (2007) A general heuristic for vehicle routing problems. Compu Oper Res 34(8):2403–2435
Prescott-Gagnon E, Desaulniers G, Rousseau LM (2009) A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows. Networks 54(4):190–204
Ribeiro G, Laporte G (2012) An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem. Comp Oper Res 39(3):728–735
Righini G, Salani M (2006) Dynamic programming for the orienteering problem with time windows. Tech. rep., Dipartimento di Tecnologie dell’Informazione, Universita degli Studi Milano, Italy
Righini G, Salani M (2009) Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming. Comp Oper Res 36(4):1191–1203
Ropke S, Pisinger D (2006) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Sci 40(4):455–472
Savelsbergh MWP (1992) The vehicle routing problem with time windows: Minimizing route duration. ORSA J Comp 4(2):146–154
Schilde M, Doerner KF, Hartl RF, Kiechle G (2009) Metaheuristics for the bi-objective orienteering problem. Swarm Intel 3(3):179–201
Schilde M, Doerner KF, Hartl RF, Kiechle G (2011) Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports. Comp Oper Res 38(12):1719–1730
Schrimph G, Schneider J, Stamm-Wilbrandt H, Dueck G (2000) Record breaking optimization results using the ruin and recreate principle. J Comp Phys 159(2):139–171
Shaw P (1997) A new local search algorithm providing high quality solutions to vehicle routing problems. Tech. rep., Department of Computer Science, University of Strathclyde, Scotland
Shaw P (1998) Using constraint programming and local search methods to solve vehicle routing problem. In: Proceedings CP-98 (Fourth International Conference on Principles and Practice of Constraint Programming)
Solomon M (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper Res 35(2):254–265
Souffriau W, Vansteenwegen P, Berghe GV, Oudheusden DV (2008) Automated parameterisation of a metaheuristic for the orienteering problem. Adaptive Multilevel Metaheuristics 136:255–269
Souffriau W, Vansteenwegen P, Berghe GV, Oudheusden DV (2013) The multiconstraint team orienteering problem with multiple time windows. Transportation Sci 47(1):53–63
Subramanian A (2012) Heuristic, exact and hybrid approaches for vehicle routing problems. PhD thesis, Universidade Federal Fluminense, Niteroi, Brazil. http://www2.ic.uff.br/PosGraduacao/Teses/532
Tricoire F, Romauch M, Doerner K, Hartl R (2010) Heuristics for the multi-period orienteering problem with multiple time windows. Comp Oper Res 37(2):351–367
Tsiligirides T (1984) Heuristic methods applied to orienteering. J Oper Res Soc 35(9):797–809
Vansteenwegen P, Souffriau W, Berghe GV, Oudheusden DV (2009a) A guided local search metaheuristic for the team orienteering problem. Eur J Oper Res 196(1):118–127
Vansteenwegen P, Souffriau W, Berghe GV, Oudheusden DV (2009b) Iterated local search for the team orienteering problem with time windows. Comp Oper Res 36(12):3281–3290
Vansteenwegen P, Souffriau W, Oudheusden DV (2011) The orienteering problem: a survey. Eur J Oper Res 209(1):1–10
Vidal T, Crainic TG, Gendreau M, Prins C (2014) A unified solution framework for multi-attribute vehicle routing problems. Eur J Oper Res 234(3):658–673
Wen M, Krapper E, Larsen J, Stidsen T (2011) A multi-level variable neighborhood heuristic for a practical vehicle routing and driver scheduling problem. Networks 58(4):311–322
Acknowledgments
This work was partially supported by the International Campus on Safety and Intermodality in Transportation, the Nord-Pas-de-Calais Region, the European Community, the Regional Delegation for Research and Technology, the French Ministry of Higher Education and Research and the National Center for Scientific Research. This support is gratefully acknowledged. The authors thank Fabien Tricoire and Matteo Salani for their answers to our requests regarding the computational experiments. They also thank three anonymous referees whose comments have helped them to improve their paper.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Lahyani, R., Khemakhem, M. & Semet, F. A unified matheuristic for solving multi-constrained traveling salesman problems with profits. EURO J Comput Optim 5, 393–422 (2017). https://doi.org/10.1007/s13675-016-0071-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13675-016-0071-1
Keywords
- Profitable tour problem with compartments
- Matheuristic
- Exact loading neighborhoods
- Approximate routing neighborhoods
- Orienteering problem
- Orienteering problem with time window