Selective clustered traveling salesman problem

References

• Angelelli, E., Archetti, C., & Vindigni, M. (2014). The clustered orienteering problem. European Journal of Operational Research, 238(2), 404–414. https://doi.org/10.1016/j.ejor.2014.04.006
   Web of Science ®Google Scholar
• Anily, S., Bramel, J., & Hertz, A. (1999). A 53-approximation algorithm for the clustered traveling salesman tour and path problems. Operations Research Letters, 24(1-2), 29–35. https://doi.org/10.1016/S0167-6377(98)00046-7
   Web of Science ®Google Scholar
• Archetti, C., Carrabs, F., & Cerulli, R. (2018). The set orienteering problem. European Journal of Operational Research, 267(1), 264–272. https://doi.org/10.1016/j.ejor.2017.11.009
   Web of Science ®Google Scholar
• Arkin, E. M., Hassin, R., & Klein, L. (1997). Restricted delivery problems on a network. Networks: An International Journal, 29(4), 205–216. https://doi.org/10.1002/(SICI)1097-0037(199707)29:4<205::AID-NET3>3.0.CO;2-J
   Web of Science ®Google Scholar
• Balas, E. (1989). The prize collecting traveling salesman problem. Networks, 19(6), 621–636. https://doi.org/10.1002/net.3230190602
   Web of Science ®Google Scholar
• Bao, X., & Liu, Z. (2012). An improved approximation algorithm for the clustered traveling salesman problem. Information Processing Letters, 112(23), 908–910. https://doi.org/10.1016/j.ipl.2012.08.020
   Web of Science ®Google Scholar
• Chisman, J. A. (1975). The clustered traveling salesman problem. Computers & Operations Research, 2(2), 115–119. https://doi.org/10.1016/0305-0548(75)90015-5
   Google Scholar
• Dell’Amico, M., Maffioli, F., & Värbrand, P. (1995). On prize-collecting tours and the asymmetric travelling salesman problem. International Transactions in Operational Research, 2(3), 297–308. https://doi.org/10.1111/j.1475-3995.1995.tb00023.x
   Google Scholar
• Derya, T., Dinler, E., & Keçeci, B. (2020). Selective generalized travelling salesman problem. Mathematical and Computer Modelling of Dynamical Systems, 26(1), 80–118. https://doi.org/10.1080/13873954.2019.1705496
   Web of Science ®Google Scholar
• Ding, C., Cheng, Y., & He, M. (2007). Two-level genetic algorithm for clustered traveling salesman problem with application in large-scale TSPs. Tsinghua Science & Technology, 12(4), 459–465. https://doi.org/10.1016/S1007-0214(07)70068-8
   Google Scholar
• Fischetti, M., Salazar González, J. J., & Toth, P. (1997). A branch-and-cut algorithm for the symmetric generalized traveling salesman problem. Operations Research, 45(3), 378–394. https://doi.org/10.1287/opre.45.3.378
   Web of Science ®Google Scholar
• Gavish, B., & Graves, S. C. (1978). The travelling salesman problem and related problems. Working paper. MIT.
   Google Scholar
• Gendreau, M., Laporte, G., & Hertz, A. (1997). An approximation algorithm for the traveling salesman problem with backhauls. Operations Research, 45(4), 639–641. https://doi.org/10.1287/opre.45.4.639
   Web of Science ®Google Scholar
• Gendreau, M., Laporte, G., & Potvin, J. Y. (1994). Heuristics for the clustered traveling salesman problem (No. CRT-94-54).
   Google Scholar
• Gendreau, M., Laporte, G., & Semet, F. (1998). A tabu search heuristic for the undirected selective travelling salesman problem. European Journal of Operational Research, 106(2-3), 539–545. https://doi.org/10.1016/S0377-2217(97)00289-0
   Web of Science ®Google Scholar
• Ghaziri, H., & Osman, I. H. (2003). A neural network algorithm for the traveling salesman problem with backhauls. Computers & Industrial Engineering, 44(2), 267–281. https://doi.org/10.1016/S0360-8352(02)00179-1
   Web of Science ®Google Scholar
• Golden, B. L., Levy, L., & Vohra, R. (1987). The orienteering problem. Naval Research Logistics (NRL), 34(3), 307–318. https://doi.org/10.1002/1520-6750(198706)34:3<307::AID-NAV3220340302>3.0.CO;2-D
   Web of Science ®Google Scholar
• Gunawan, A., Lau, H. C., & Vansteenwegen, P. (2016). Orienteering problem: A survey of recent variants, solution approaches and applications. European Journal of Operational Research, 255(2), 315–332. https://doi.org/10.1016/j.ejor.2016.04.059
   Web of Science ®Google Scholar
• Guttmann-Beck, N., Hassin, R., Khuller, S., & Raghavachari, B. (2000). Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem. Algorithmica, 28(4), 422–437. https://doi.org/10.1007/s004530010045
   Web of Science ®Google Scholar
• Jiang, J., Yao, X., Yang, E., Mehnen, J., & Yu, H. (2020). An improved adaptive genetic algorithm for mobile robot path planning analogous to the ordered clustered TSP. In 2020 IEEE Congress on Evolutionary Computation (CEC) (pp. 1–8). IEEE.
   Google Scholar
• Jongens, K., & Volgenant, T. (1985). The symmetric clustered traveling salesman problem. European Journal of Operational Research, 19(1), 68–75. https://doi.org/10.1016/0377-2217(85)90309-1
   Web of Science ®Google Scholar
• Juan, A. A., Lourenço, H. R., Mateo, M., Luo, R., & Castella, Q. (2014). Using iterated local search for solving the flow-shop problem: Parallelization, parametrization, and randomization issues. International Transactions in Operational Research, 21(1), 103–126. https://doi.org/10.1111/itor.12028
   Web of Science ®Google Scholar
• Laporte, G., & Palekar, U. (2002). Some applications of the clustered travelling salesman problem. Journal of the operational Research Society, 53(9), 972–976. https://doi.org/10.1057/palgrave.jors.2601420
   Web of Science ®Google Scholar
• Laporte, G., Potvin, J. Y., & Quilleret, F. (1997). A tabu search heuristic using genetic diversification for the clustered traveling salesman problem. Journal of Heuristics, 2(3), 187–200. https://doi.org/10.1007/BF00127356
   Google Scholar
• Lokin, F. C. J. (1979). Procedures for travelling salesman problems with additional constraints. European Journal of Operational Research, 3(2), 135–141. https://doi.org/10.1016/0377-2217(79)90099-7
   Web of Science ®Google Scholar
• López-Ibánez, M., Mascia, F., Marmion, MÉ, & Stützle, T. (2014). A template for designing single-solution hybrid metaheuristics. In Proceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation (pp. 1423–1426).
   Google Scholar
• Mestria, M. (2016). A hybrid heuristic algorithm for the clustered traveling salesman problem. Pesquisa Operacional, 36(1), 113–132. https://doi.org/10.1590/0101-7438.2016.036.01.0113
   Google Scholar
• Mestria, M. (2018). New hybrid heuristic algorithm for the clustered traveling salesman problem. Computers & Industrial Engineering, 116, 1–12. https://doi.org/10.1016/j.cie.2017.12.018
   Web of Science ®Google Scholar
• Mestria, M., Ochi, L. S., & de Lima Martins, S. (2013). GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem. Computers & Operations Research, 40(12), 3218–3229. https://doi.org/10.1016/j.cor.2012.10.001
   Web of Science ®Google Scholar
• Mladenović, N., & Hansen, P. (1997). Variable neighborhood search. Computers & operations research, 24(11), 1097–1100. https://doi.org/10.1016/S0305-0548(97)00031-2
   Web of Science ®Google Scholar
• Phuong, H. N., Nhat, H. T. N., Hà, M. H., Langevin, A., & Trépanier, M. (2018). Solving the clustered traveling salesman problem with d-relaxed priority rule. arXiv preprint arXiv:1810.03981.
   Google Scholar
• Potvin, J. Y., & Guertin, F. (1996). The clustered traveling salesman problem: A genetic approach. In I. H Osman & J. P Kelly (Eds.), Meta-heuristics (pp. 619–631). Springer.
   Google Scholar
• Ropke, S., & Pisinger, D. (2006). An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation science, 40(4), 455–472. https://doi.org/10.1287/trsc.1050.0135
   Web of Science ®Google Scholar
• Sánchez-García, M., Zouaghi, F., Lera-López, F., & Faulin, J. (2021). An extended behavior model for explaining the willingness to pay to reduce the air pollution in road transportation. Journal of Cleaner Production, 314, 128134. https://doi.org/10.1016/j.jclepro.2021.128134
   Web of Science ®Google Scholar
• Sawik, B., Faulin, J., & Pérez-Bernabeu, E. (2017). Multi-objective traveling salesman and transportation problems with environmental aspects. In Applications of management science (Vol. 18, pp. 21–55). Emerald Publishing Limited. https://doi.org/10.1108/S0276-897620170000018002
   Google Scholar
• Shaw, P. (1998). Using constraint programming and local search methods to solve vehicle routing problems. In Principles and Practice of Constraint Programming—CP98: 4th International Conference, CP98 Pisa, Italy, October 26–30, 1998 Proceedings 4 (pp. 417–431). Springer Berlin Heidelberg.
   Google Scholar
• Weintraub, A., Aboud, J., Fernandez, C., Laporte, G., & Ramirez, E. (1999). An emergency vehicle dispatching system for an electric utility in Chile. Journal of the Operational Research Society, 50(7), 690–696. https://doi.org/10.1057/palgrave.jors.2600746
   Web of Science ®Google Scholar
• Zhang, T., Ke, L., Li, J., Li, J., Huang, J., & Li, Z. (2018). Metaheuristics for the tabu clustered traveling salesman problem. Computers & Operations Research, 89, 1–12. https://doi.org/10.1016/j.cor.2017.07.008
   Web of Science ®Google Scholar
• Zhang, W., Wang, K., Wang, S., & Laporte, G. (2020). Clustered coverage orienteering problem of unmanned surface vehicles for water sampling. Naval Research Logistics (NRL), 67(5), 353–367. https://doi.org/10.1002/nav.21906
   Web of Science ®Google Scholar