{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,17]],"date-time":"2026-10-17T12:10:52Z","timestamp":1792239052231,"version":"4.4.0"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"4-6","license":[{"start":{"date-parts":[[2023,9,22]],"date-time":"2023-09-22T00:00:00Z","timestamp":1695340800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,9,22]],"date-time":"2023-09-22T00:00:00Z","timestamp":1695340800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100005711","name":"Universit\u00e4t Hamburg","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100005711","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2023,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In the family traveling salesman problem (FTSP), there is a set of cities which are divided into a number of clusters called families. The salesman has to find a shortest possible tour visiting a specific number of cities from each of the families without any restriction of visiting one family before starting the visit of another one. In this work, the general concept of the Partial OPtimization Metaheuristic Under Special Intensification Conditions is linked with the exact optimization by a classical solver using a mathematical programming formulation for the FTSP to develop a matheuristic. Moreover, a genetic and a simulated annealing algorithm are used as metaheuristics embedded in the approach. The method is examined on a set of benchmark instances and its performance is favorably compared with a state-of-the-art approach from literature. Moreover, a careful analysis of the specific components of the approach is undertaken to provide insights into the impact of their interplay.\n<\/jats:p>","DOI":"10.1007\/s10732-023-09516-9","type":"journal-article","created":{"date-parts":[[2023,9,22]],"date-time":"2023-09-22T11:02:06Z","timestamp":1695380526000},"page":"435-460","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["A matheuristic approach for the family traveling salesman problem"],"prefix":"10.1007","volume":"29","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0383-0379","authenticated-orcid":false,"given":"Abtin","family":"Nourmohammadzadeh","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8307-5144","authenticated-orcid":false,"given":"Malek","family":"Sarhani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1296-4221","authenticated-orcid":false,"given":"Stefan","family":"Vo\u00df","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,9,22]]},"reference":[{"key":"9516_CR1","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1109\/tsmca.2012.2217322","volume":"43","author":"F Almeida","year":"2013","unstructured":"Almeida, F., Gimenez, D., Lopez-Espin, J.J., Perez-Perez, M.: Parameterized schemes of metaheuristics: basic ideas and applications with genetic algorithms, scatter search, and GRASP. IEEE Trans. Syst. Man Cybern. Syst. 43, 570\u2013586 (2013). https:\/\/doi.org\/10.1109\/tsmca.2012.2217322","journal-title":"IEEE Trans. Syst. Man Cybern. Syst."},{"key":"9516_CR2","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1016\/j.ejor.2007.10.002","volume":"192","author":"AC Alvim","year":"2009","unstructured":"Alvim, A.C., Taillard, \u00c9.D.: POPMUSIC for the point feature label placement problem. Eur. J. Oper. Res. 192, 396\u2013413 (2009). https:\/\/doi.org\/10.1016\/j.ejor.2007.10.002","journal-title":"Eur. J. Oper. Res."},{"key":"9516_CR3","doi-asserted-by":"publisher","unstructured":"Bergmann, B., Hommel, G.: Improvements of general multiple test procedures for redundant systems of hypotheses. In: Bauer, P., Hommel, G., Sonnemann, E. (eds.) Multiple Hypothesenpr\u00fcfung\/Multiple Hypotheses Testing, pp. 100\u2013115. Springer, Berlin (1988). https:\/\/doi.org\/10.1007\/978-3-642-52307-6_8","DOI":"10.1007\/978-3-642-52307-6_8"},{"key":"9516_CR4","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1016\/j.ejor.2017.11.063","volume":"267","author":"R Bernardino","year":"2018","unstructured":"Bernardino, R., Paias, A.: Solving the family traveling salesman problem. Eur. J. Oper. Res. 267, 453\u2013466 (2018). https:\/\/doi.org\/10.1016\/j.ejor.2017.11.063","journal-title":"Eur. J. Oper. Res."},{"key":"9516_CR5","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1111\/itor.12771","volume":"28","author":"R Bernardino","year":"2021","unstructured":"Bernardino, R., Paias, A.: Heuristic approaches for the family traveling salesman problem. Int. Trans. Oper. Res. 28, 262\u2013295 (2021). https:\/\/doi.org\/10.1111\/itor.12771","journal-title":"Int. Trans. Oper. Res."},{"key":"9516_CR6","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1002\/net.22036","volume":"79","author":"R Bernardino","year":"2022","unstructured":"Bernardino, R., Paias, A.: The family traveling salesman problem with incompatibility constraints. Networks 79, 47\u201382 (2022). https:\/\/doi.org\/10.1002\/net.22036","journal-title":"Networks"},{"key":"9516_CR7","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1002\/net.22125","volume":"80","author":"R Bernardino","year":"2022","unstructured":"Bernardino, R., Gouveia, L., Paias, A., Santos, D.: The multi-depot family traveling salesman problem and clustered variants: mathematical formulations and branch- &-cut based methods. Networks 80, 502\u2013571 (2022). https:\/\/doi.org\/10.1002\/net.22125","journal-title":"Networks"},{"key":"9516_CR8","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1162\/evco.1996.4.4.361","volume":"4","author":"T Blickle","year":"1996","unstructured":"Blickle, T., Thiele, L.: A comparison of selection schemes used in evolutionary algorithms. Evol. Comput. 4, 361\u2013394 (1996). https:\/\/doi.org\/10.1162\/evco.1996.4.4.361","journal-title":"Evol. Comput."},{"key":"9516_CR9","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1002\/net.21574","volume":"64","author":"A Bosco","year":"2014","unstructured":"Bosco, A., Lagan\u00e0, D., Musmanno, R., Vocaturo, F.: A matheuristic algorithm for the mixed capacitated general routing problem. Networks 64, 262\u2013281 (2014). https:\/\/doi.org\/10.1002\/net.21574","journal-title":"Networks"},{"key":"9516_CR10","doi-asserted-by":"publisher","DOI":"10.1002\/0470072768","volume-title":"Response Surfaces, Mixtures, and Ridge Analyses","author":"GEP Box","year":"2007","unstructured":"Box, G.E.P., Draper, N.R.: Response Surfaces, Mixtures, and Ridge Analyses, 2nd edn. Wiley, Hoboken (2007)","edition":"2"},{"key":"9516_CR11","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1002\/net.20421","volume":"57","author":"V Cacchiani","year":"2010","unstructured":"Cacchiani, V., Muritiba, A.E.F., Negreiros, M., Toth, P.: A multistart heuristic for the equality generalized traveling salesman problem. Networks 57, 231\u2013239 (2010). https:\/\/doi.org\/10.1002\/net.20421","journal-title":"Networks"},{"key":"9516_CR12","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s10732-014-9265-y","volume":"22","author":"M Caserta","year":"2014","unstructured":"Caserta, M., Vo\u00df, S.: A corridor method based hybrid algorithm for redundancy allocation. J. Heuristics 22, 405\u2013429 (2014). https:\/\/doi.org\/10.1007\/s10732-014-9265-y","journal-title":"J. Heuristics"},{"key":"9516_CR13","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1016\/s0305-0548(02)00050-3","volume":"30","author":"I-C Choi","year":"2003","unstructured":"Choi, I.-C., Kim, S.-I., Kim, H.-S.: A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem. Comput. Oper. Res. 30, 773\u2013786 (2003). https:\/\/doi.org\/10.1016\/s0305-0548(02)00050-3","journal-title":"Comput. Oper. Res."},{"key":"9516_CR14","volume-title":"Practical Nonparametric Statistics","author":"W Conover","year":"1999","unstructured":"Conover, W.: Practical Nonparametric Statistics. Wiley, New York (1999)"},{"key":"9516_CR15","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/s11047-020-09837-9","volume":"21","author":"J de Armas","year":"2022","unstructured":"de Armas, J., Lalla-Ruiz, E., Tilahun, S.L., Vo\u00df, S.: Similarity in metaheuristics: a gentle step towards a comparison methodology. Nat. Comput. 21, 265\u2013287 (2022). https:\/\/doi.org\/10.1007\/s11047-020-09837-9","journal-title":"Nat. Comput."},{"key":"9516_CR16","doi-asserted-by":"publisher","first-page":"1785","DOI":"10.1007\/s00170-019-03809-9","volume":"104","author":"LG de Oliveira","year":"2019","unstructured":"de Oliveira, L.G., de Paiva, A.P., Balestrassi, P.P., Ferreira, J.R., da Costa, S.C., da Silva Campos, P.H.: Response surface methodology for advanced manufacturing technology optimization: theoretical fundamentals, practical guidelines, and survey literature review. Int. J. Adv. Manuf. Technol. 104, 1785\u20131837 (2019). https:\/\/doi.org\/10.1007\/s00170-019-03809-9","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"9516_CR17","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","volume":"1","author":"J Derrac","year":"2011","unstructured":"Derrac, J., Garc\u00eda, S., Molina, D., Herrera, F.: A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol. Comput. 1, 3\u201318 (2011). https:\/\/doi.org\/10.1016\/j.swevo.2011.02.002","journal-title":"Swarm Evol. Comput."},{"key":"9516_CR18","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1016\/j.ejor.2017.11.046","volume":"267","author":"T Doi","year":"2018","unstructured":"Doi, T., Nishi, T., Vo\u00df, S.: Two-level decomposition-based matheuristic for airline crew rostering problems with fair working time. Eur. J. Oper. Res. 267, 428\u2013438 (2018). https:\/\/doi.org\/10.1016\/j.ejor.2017.11.046","journal-title":"Eur. J. Oper. Res."},{"key":"9516_CR19","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.dam.2022.06.033","volume":"335","author":"L Galli","year":"2023","unstructured":"Galli, L., Martello, S., Rey, C., Toth, P.: Lagrangian matheuristics for the quadratic multiple knapsack problem. Discret. Appl. Math. 335, 36\u201351 (2023). https:\/\/doi.org\/10.1016\/j.dam.2022.06.033","journal-title":"Discret. Appl. Math."},{"key":"9516_CR20","unstructured":"Gurobi Optimization, LLC (2021). Gurobi Optimizer Reference Manual. https:\/\/www.gurobi.com\/?s=optimizer+reference+manual"},{"key":"9516_CR21","doi-asserted-by":"publisher","DOI":"10.1002\/0471671746","volume-title":"Practical Genetic Algorithms","author":"RL Haupt","year":"2003","unstructured":"Haupt, R.L., Haupt, S.E.: Practical Genetic Algorithms. Wiley, New York (2003). https:\/\/doi.org\/10.1002\/0471671746"},{"key":"9516_CR22","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1002\/net.21674","volume":"67","author":"A Hill","year":"2016","unstructured":"Hill, A., Vo\u00df, S.: An equi-model matheuristic for the multi-depot ring star problem. Networks 67, 222\u2013237 (2016). https:\/\/doi.org\/10.1002\/net.21674","journal-title":"Networks"},{"key":"9516_CR23","unstructured":"Hutter, F., Hamadi, Y.: Parameter Adjustment Based on Performance Prediction: Towards an Instance-Aware Problem Solver. Technical Report Microsoft Corporation, MSR-TR-2005-125 (2005)"},{"key":"9516_CR24","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.artint.2013.10.003","volume":"206","author":"F Hutter","year":"2014","unstructured":"Hutter, F., Xu, L., Hoos, H.H., Leyton-Brown, K.: Algorithm runtime prediction: methods and evaluation. Artif. Intell. 206, 79\u2013111 (2014). https:\/\/doi.org\/10.1016\/j.artint.2013.10.003","journal-title":"Artif. Intell."},{"key":"9516_CR25","doi-asserted-by":"publisher","unstructured":"Jovanovic, R., Tuba, M., Vo\u00df, S.: Fixed set search applied to the traveling salesman problem. In: Blesa-Aguilera, M.J., Blum, C., Gambini-Santos, H., Pinacho-Davidson, P., del Campo, J.G. (eds.) Hybrid Metaheuristics, pp. 63\u201377. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-05983-5_5","DOI":"10.1007\/978-3-030-05983-5_5"},{"key":"9516_CR26","doi-asserted-by":"publisher","unstructured":"Karp, R.\u00a0M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, pp. 85\u2013103. Springer US (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"9516_CR27","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 671\u2013680 (1983). https:\/\/doi.org\/10.1126\/science.220.4598.671","journal-title":"Science"},{"key":"9516_CR28","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s10472-014-9444-4","volume":"76","author":"E Lalla-Ruiz","year":"2014","unstructured":"Lalla-Ruiz, E., Vo\u00df, S.: POPMUSIC as a matheuristic for the berth allocation problem. Ann. Math. Artif. Intell. 76, 173\u2013189 (2014). https:\/\/doi.org\/10.1007\/s10472-014-9444-4","journal-title":"Ann. Math. Artif. Intell."},{"key":"9516_CR29","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1007\/s11590-018-1376-1","volume":"14","author":"E Lalla-Ruiz","year":"2019","unstructured":"Lalla-Ruiz, E., Vo\u00df, S.: A POPMUSIC approach for the multi-depot cumulative capacitated vehicle routing problem. Optim. Lett. 14, 671\u2013691 (2019). https:\/\/doi.org\/10.1007\/s11590-018-1376-1","journal-title":"Optim. Lett."},{"key":"9516_CR30","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1007\/s10479-015-2055-6","volume":"253","author":"E Lalla-Ruiz","year":"2015","unstructured":"Lalla-Ruiz, E., Vo\u00df, S., Exp\u00f3sito-Izquierdo, C., Meli\u00e1n-Batista, B., Moreno-Vega, J.M.: A POPMUSIC-based approach for the berth allocation problem under time-dependent limitations. Ann. Oper. Res. 253, 871\u2013897 (2015). https:\/\/doi.org\/10.1007\/s10479-015-2055-6","journal-title":"Ann. Oper. Res."},{"key":"9516_CR31","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.dam.2016.03.019","volume":"234","author":"V Leggieri","year":"2018","unstructured":"Leggieri, V., Haouari, M.: A matheuristic for the asymmetric capacitated vehicle routing problem. Discrete Appl. Math. 234, 139\u2013150 (2018). https:\/\/doi.org\/10.1016\/j.dam.2016.03.019","journal-title":"Discrete Appl. Math."},{"key":"9516_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-1306-7","volume-title":"Matheuristics\u2014Hybridizing Metaheuristics and Mathematical Programming","year":"2010","unstructured":"Maniezzo, V., St\u00fctzle, T., Vo\u00df, S. (eds.): Matheuristics\u2014Hybridizing Metaheuristics and Mathematical Programming. Springer, New York (2010). https:\/\/doi.org\/10.1007\/978-1-4419-1306-7"},{"key":"9516_CR33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-70277-9","volume-title":"Matheuristics","author":"V Maniezzo","year":"2021","unstructured":"Maniezzo, V., Boschetti, M.A., St\u00fctzle, T.: Matheuristics. Springer, Berlin (2021). https:\/\/doi.org\/10.1007\/978-3-030-70277-9"},{"key":"9516_CR34","doi-asserted-by":"publisher","unstructured":"Matai, R., Singh, S., Lal, M.: Traveling salesman problem: an overview of applications, formulations, and solution approaches. In: Davendra D. (eds) Traveling Salesman Problem, Theory and Applications, pp. 1\u201324. InTech (2010). https:\/\/doi.org\/10.5772\/12909","DOI":"10.5772\/12909"},{"key":"9516_CR35","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1145\/321043.321046","volume":"7","author":"CE Miller","year":"1960","unstructured":"Miller, C.E., Tucker, A.W., Zemlin, R.A.: Integer programming formulation of traveling salesman problems. J. ACM 7, 326\u2013329 (1960). https:\/\/doi.org\/10.1145\/321043.321046","journal-title":"J. ACM"},{"key":"9516_CR36","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1111\/itor.12026","volume":"21","author":"L Mor\u00e1n-Mirabal","year":"2014","unstructured":"Mor\u00e1n-Mirabal, L., Gonz\u00e1lez-Velarde, J., Resende, M.: Randomized heuristics for the family traveling salesperson problem. Int. Trans. Oper. Res. 21, 41\u201357 (2014). https:\/\/doi.org\/10.1111\/itor.12026","journal-title":"Int. Trans. Oper. Res."},{"key":"9516_CR37","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/bf02125405","volume":"63","author":"A Nagar","year":"1996","unstructured":"Nagar, A., Heragu, S.S., Haddock, J.: A combined branch-and-bound and genetic algorithm based approach for a flowshop scheduling problem. Ann. Oper. Res. 63, 397\u2013414 (1996). https:\/\/doi.org\/10.1007\/bf02125405","journal-title":"Ann. Oper. Res."},{"key":"9516_CR38","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s10479-017-2715-9","volume":"286","author":"T Nishi","year":"2017","unstructured":"Nishi, T., Okura, T., Lalla-Ruiz, E., Vo\u00df, S.: A dynamic programming-based matheuristic for the dynamic berth allocation problem. Ann. Oper. Res. 286, 391\u2013410 (2017). https:\/\/doi.org\/10.1007\/s10479-017-2715-9","journal-title":"Ann. Oper. Res."},{"key":"9516_CR39","doi-asserted-by":"publisher","first-page":"934","DOI":"10.1057\/palgrave.jors.2602633","volume":"60","author":"A Ostertag","year":"2009","unstructured":"Ostertag, A., Doerner, K.F., Hartl, R.F., Taillard, \u00c9.D., Waelti, P.: POPMUSIC for a real-world large-scale vehicle routing problem with time windows. J. Oper. Res. Soc. 60, 934\u2013943 (2009). https:\/\/doi.org\/10.1057\/palgrave.jors.2602633","journal-title":"J. Oper. Res. Soc."},{"key":"9516_CR40","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s10107-020-01523-z","volume":"183","author":"A Pessoa","year":"2020","unstructured":"Pessoa, A., Sadykov, R., Uchoa, E., Vanderbeck, F.: A generic exact solver for vehicle routing and related problems. Math. Program. 183, 483\u2013523 (2020). https:\/\/doi.org\/10.1007\/s10107-020-01523-z","journal-title":"Math. Program."},{"key":"9516_CR41","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.ejor.2008.10.033","volume":"199","author":"C Poojari","year":"2009","unstructured":"Poojari, C., Beasley, J.: Improving benders decomposition using a genetic algorithm. Eur. J. Oper. Res. 199, 89\u201397 (2009). https:\/\/doi.org\/10.1016\/j.ejor.2008.10.033","journal-title":"Eur. J. Oper. Res."},{"key":"9516_CR42","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105475","volume":"136","author":"E Queiroga","year":"2021","unstructured":"Queiroga, E., Sadykov, R., Uchoa, E.: A POPMUSIC matheuristic for the capacitated vehicle routing problem. Comput. Oper. Res. 136, 105475 (2021). https:\/\/doi.org\/10.1016\/j.cor.2021.105475","journal-title":"Comput. Oper. Res."},{"key":"9516_CR43","unstructured":"Reyes\u00a0Vega, K.\u00a0A.: Solving the family traveling salesman problem with capacitated agents. Master thesis, Instituto Tecnol\u00f3gico y de Estudios Superiores de Monterrey, Mexico (2014). https:\/\/hdl.handle.net\/11285\/640275"},{"key":"9516_CR44","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1287\/trsc.2019.0930","volume":"54","author":"Z Su","year":"2020","unstructured":"Su, Z., L\u00fc, Z., Wang, Z., Qi, Y., Benlic, U.: A matheuristic algorithm for the inventory routing problem. Transp. Sci. 54, 330\u2013354 (2020). https:\/\/doi.org\/10.1287\/trsc.2019.0930","journal-title":"Transp. Sci."},{"key":"9516_CR45","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/j.ejor.2021.05.042","volume":"297","author":"J Swan","year":"2022","unstructured":"Swan, J., Adriaensen, S., Brownlee, A.E., Hammond, K., Johnson, C.G., Kheiri, A., Krawiec, F., Merelo, J., Minku, L.L., \u00d6zcan, E., Pappa, G.L., Garc\u00eda-S\u00e1nchez, P., S\u00f6rensen, K., Vo\u00df, S., Wagner, M., White, D.R.: Metaheuristics \u201cin the large\u2019\u2019. Eur. J. Oper. Res. 297, 393\u2013406 (2022). https:\/\/doi.org\/10.1016\/j.ejor.2021.05.042","journal-title":"Eur. J. Oper. Res."},{"key":"9516_CR46","doi-asserted-by":"publisher","unstructured":"Taillard, \u00c9.\u00a0D., Voss, S.: POPMUSIC\u2014partial optimization metaheuristic under special intensification conditions. In: Ribeiro, C., Hansen, P. (eds.), Essays and Surveys in Metaheuristics, pp. 613\u2013629. Springer, Boston (2002). https:\/\/doi.org\/10.1007\/978-1-4615-1507-4_27","DOI":"10.1007\/978-1-4615-1507-4_27"},{"key":"9516_CR47","doi-asserted-by":"publisher","unstructured":"Taillard, \u00c9.D.: Design of Heuristic Algorithms for Hard Optimization. Springer International Publishing (2023). https:\/\/doi.org\/10.1007\/978-3-031-13714-3","DOI":"10.1007\/978-3-031-13714-3"},{"key":"9516_CR48","unstructured":"Taillard, E.\u00a0D.: TSP neighbourhood reduction with POPMUSIC. In: Metaheuristic International Conference (MIC\u201917) Proceedings, pp. 237\u2013240 (2017)"},{"key":"9516_CR49","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1016\/j.ejor.2021.05.034","volume":"297","author":"\u00c9D Taillard","year":"2022","unstructured":"Taillard, \u00c9.D.: A linearithmic heuristic for the travelling salesman problem. Eur. J. Oper. Res. 297, 442\u2013450 (2022). https:\/\/doi.org\/10.1016\/j.ejor.2021.05.034","journal-title":"Eur. J. Oper. Res."},{"key":"9516_CR50","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1016\/j.ejor.2018.06.039","volume":"272","author":"\u00c9D Taillard","year":"2019","unstructured":"Taillard, \u00c9.D., Helsgaun, K.: POPMUSIC for the travelling salesman problem. Eur. J. Oper. Res. 272, 420\u2013429 (2019). https:\/\/doi.org\/10.1016\/j.ejor.2018.06.039","journal-title":"Eur. J. Oper. Res."},{"key":"9516_CR51","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105262","volume":"131","author":"ST Vadseth","year":"2021","unstructured":"Vadseth, S.T., Andersson, H., St\u00e5lhane, M.: An iterative matheuristic for the inventory routing problem. Comput. Oper. Res. 131, 105262 (2021). https:\/\/doi.org\/10.1016\/j.cor.2021.105262","journal-title":"Comput. Oper. Res."},{"key":"9516_CR52","doi-asserted-by":"publisher","first-page":"9797","DOI":"10.1109\/tcyb.2021.3070143","volume":"52","author":"X Xu","year":"2022","unstructured":"Xu, X., Li, J., Zhou, M., Yu, X.: Precedence-constrained colored traveling salesman problem: an augmented variable neighborhood search approach. IEEE Trans. Cybern. 52, 9797\u20139808 (2022). https:\/\/doi.org\/10.1109\/tcyb.2021.3070143","journal-title":"IEEE Trans. Cybern."},{"key":"9516_CR53","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2022.131406","volume":"351","author":"J Yu","year":"2022","unstructured":"Yu, J., Vo\u00df, S., Song, X.: Multi-objective optimization of daily use of shore side electricity integrated with quayside operation. J. Clean. Prod. 351, 131406 (2022). https:\/\/doi.org\/10.1016\/j.jclepro.2022.131406","journal-title":"J. Clean. Prod."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-023-09516-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10732-023-09516-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-023-09516-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,27]],"date-time":"2023-10-27T13:18:37Z","timestamp":1698412717000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10732-023-09516-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,22]]},"references-count":53,"journal-issue":{"issue":"4-6","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["9516"],"URL":"https:\/\/doi.org\/10.1007\/s10732-023-09516-9","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,22]]},"assertion":[{"value":"12 April 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 August 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 August 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 September 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"None.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This research did not contain any studies involving animal or human participants, nor did it take place on any private or protected areas. No specific permissions were required for corresponding locations.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Human and animal rights"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to Participate"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to publish"}}]}}