Analysis of the selective traveling salesman problem with time-dependent profits

Referencias bibliográficas

• Afsar H, Labadie N (2013) Team orienteering problem with decreasing profits. Electronic Notes in Discrete Mathematics 41:285–293
• Archetti C, Speranza MG, Vigo D (2014) Vehicle routing problems with profits. In: Toth P, Vigo D (eds) Vehicle routing: problems, methods, and applications, monographs on discrete mathematics and applications, vol 18. MOS-SIAM Series on Optimization, Philadelphia, pp 87–116
• Bruck BP, Iori M (2017) Non-elementary formulations for single vehicle routing problems with pickups and deliveries. Operat Res 65(6):1597–614
• Bruglieri M (2020) The parking warden tour problem. Networks 76:539–554
• da Silva AA, Morabito R, Pureza V (2018) Optimization approaches to support the planning and analysis of travel itineraries. Expert Syst Appl 112:321–330
• Erdoğan G, Laporte G (2013) The orienteering problem with variable profits. Networks 61(2):104–116
• Erkut E, Zhang J (1996) The maximum collection problem with time-dependent rewards. Naval Res Logist 43(5):749–763
• Feillet D, Dejax P, Gendreau M (2005) Traveling salesman problems with profits. Transp Sci 39(2):188–205
• Gavalas D, Konstantopoulos C, Mastakas K, Pantziou G (2014) A survey on algorithmic approaches for solving tourist trip design problems. J Heuristics 20(3):291–328
• Golden BL, Levy L, Vohra R (1987) The orienteering problem. Naval Res Logist 34:307–318
• Gribkovskaia I, Halskau Ø, Laporte G, Vlček M (2007) General solutions to the single vehicle routing problem with pickups and deliveries. Eur J Operat Res 180(2):568–584
• Gunawan A, Lau HC, Vansteenwegen P (2016) Orienteering problem: a survey of recent variants, solution approaches and applications. Eur J Operat Res 255:315–332
• Hoff A, Gribkovskaia I, Laporte G, Løkketangen A (2009) Lasso solution strategies for the vehicle routing problem with pickups and deliveries. Eur J Operat Res 192(3):755–766
• Laporte G, Martello S (1990) The selective travelling salesman problem. Discrete Appl Math 26(2–3):193–207
• Marglin SA (1967) Public investment criteria. Studies in the Economic Development of India 4, George Allen & Unwin, London
• Munari P, Savelsbergh MWP (2022) Compact formulations for split delivery routing problems. Transp Sci. https://doi.org/10.1287/trsc.2021.1106
• Salazar-González JJ, Santos-Hernández B (2015) The split-demand one-commodity pickup-and-delivery travelling salesman problem. Transp Res Part B: Method 75:58–73
• Schilde M, Doerner KF, Hartl RF, Kiechle G (2009) Metaheuristics for the bi-objective orienteering problem. Swarm Intell 3(3):179–201
• Souffriau W, Vansteenwegen P, Vertommen J, Vanden Berghe G, Van Oudheusden D (2008) A personalized tourist trip design algorithm for mobile tourist guides. Appl Artif Intell 22(10):964–985
• Vansteenwegen P, Souffriau W, Van Oudheusden D (2011) The orienteering problem: a survey. Eur J Operat Res 209(1):1–10
• Wang X, Golden BL, Wasil EA (2008) Using a genetic algorithm to solve the generalized orienteering problem. In: Golden BL, Raghavan S, Wasil EA (eds) The vehicle routing problem: latest advances and new challenges. Springer, New York, pp 263–274
• Yu Q, Fang K, Zhu N, Ma S (2019) A matheuristic approach to the orienteering problem with service time dependent profits. Eur J Operat Res 273(2):488–503
• Yu Q, Adulyasak Y, Rousseau LM, Zhu N, Ma S (2021) Team orienteering with time-varying profit. INFORMS J Comput. https://doi.org/10.1287/ijoc.2020.1026
• Yu VF, Jewpanya P, Lin S, Redi A (2019) Team orienteering problem with time windows and time-dependent scores. Comput Industr Eng 127:213–224
• Zhang W, Wang K, Wang S, Laporte G (2020) Clustered coverage orienteering problem of unmanned surface vehicles for water sampling. Naval Res Logist 67(5):353–367