{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T00:56:30Z","timestamp":1760576190558,"version":"build-2065373602"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2024,6,13]],"date-time":"2024-06-13T00:00:00Z","timestamp":1718236800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,6,13]],"date-time":"2024-06-13T00:00:00Z","timestamp":1718236800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","doi-asserted-by":"publisher","award":["Finance Code 001"],"award-info":[{"award-number":["Finance Code 001"]}],"id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2013\/07375- 0, 2019\/22067-6, 2022\/05803-3"],"award-info":[{"award-number":["2013\/07375- 0, 2019\/22067-6, 2022\/05803-3"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["403735\/2021-1, 309385\/2021-0"],"award-info":[{"award-number":["403735\/2021-1, 309385\/2021-0"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2025,10]]},"DOI":"10.1007\/s13042-024-02228-x","type":"journal-article","created":{"date-parts":[[2024,6,19]],"date-time":"2024-06-19T03:02:58Z","timestamp":1718766178000},"page":"7175-7199","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The bi-objective prize collecting traveling backpacker problem for planning flight itineraries"],"prefix":"10.1007","volume":"16","author":[{"given":"Calvin Rodrigues","family":"da Costa","sequence":"first","affiliation":[]},{"given":"Mari\u00e1 Cristina Vasconcelos","family":"Nascimento","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,6,13]]},"reference":[{"key":"2228_CR1","unstructured":"U.N.W.T.O.: The world tourism organization: Tourism highlights 2018. (2023). https:\/\/www.e-unwto.org\/doi\/pdf\/10.18111\/9789284419876"},{"key":"2228_CR2","unstructured":"Bank TW (2023) https:\/\/data.worldbank.org\/indicator\/IS.AIR.PSGR"},{"key":"2228_CR3","unstructured":"TravelPerk: (2023). https:\/\/www.travelperk.com\/corporate-travel-glossary\/low-cost-carrier\/"},{"issue":"1","key":"2228_CR4","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1057\/s41274-017-0205-8","volume":"69","author":"KY Nakamura","year":"2018","unstructured":"Nakamura KY, Coelho LC, Renaud J, Nascimento MCV (2018) The traveling backpacker problem: a computational comparison of two formulations. J. Oper. Res. Soc. 69(1):108\u2013114","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"2228_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2010.03.045","volume":"209","author":"P Vansteenwegen","year":"2011","unstructured":"Vansteenwegen P, Souffriau W, Van Oudheusden D (2011) The orienteering problem: a survey. Euro. J. Oper. Res. 209(1):1\u201310","journal-title":"Euro. J. Oper. Res."},{"issue":"6","key":"2228_CR6","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1002\/net.3230190602","volume":"19","author":"E Balas","year":"1989","unstructured":"Balas E (1989) The prize collecting traveling salesman problem. Networks 19(6):621\u2013636","journal-title":"Networks"},{"issue":"2","key":"2228_CR7","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. Evol. Comput. IEEE Trans. 6(2):182\u2013197","journal-title":"Evol. Comput. IEEE Trans."},{"key":"2228_CR8","unstructured":"Kiwi (2023) https:\/\/www.kiwi.com\/en\/cheap-flights\/"},{"key":"2228_CR9","doi-asserted-by":"crossref","unstructured":"Zitzler E, Laumanns M, Bleuler S (2004) A tutorial on evolutionary multiobjective optimization. In: Metaheuristics for Multiobjective Optimisation, pp. 3\u201337. Springer, Berlin Heidelberg","DOI":"10.1007\/978-3-642-17144-4_1"},{"key":"2228_CR10","unstructured":"Fonseca CM, Fleming PJ (1993) Genetic algorithms for multiobjective optimization: Formulationdiscussion and generalization. In: Proceedings of the 5th International Conference on Genetic Algorithms, pp. 416\u2013423. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA"},{"issue":"3","key":"2228_CR11","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1162\/evco.1994.2.3.221","volume":"2","author":"N Srinivas","year":"1994","unstructured":"Srinivas N, Deb K (1994) Multiobjective optimization using nondominated sorting in genetic algorithms. Evol. Comput. 2(3):221\u2013248","journal-title":"Evol. Comput."},{"key":"2228_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-642-37140-0_25","volume-title":"Evolutionary Multi-Criterion Optimization","author":"H Jain","year":"2013","unstructured":"Jain H, Deb K (2013) An improved adaptive approach for elitist nondominated sorting genetic algorithm for many-objective optimization. In: Purshouse R, Fleming P, Fonseca C, Greco S, Shaw J (eds) Evolutionary Multi-Criterion Optimization, vol 7811. Lecture Notes in Computer Science. Springer, Berlin Heilderberg, pp 307\u2013321"},{"key":"2228_CR13","volume-title":"An evolutionary algorithm for multiobjective optimization: The strength Pareto approach","author":"E Zitzler","year":"1998","unstructured":"Zitzler E, Thiele L (1998) An evolutionary algorithm for multiobjective optimization: The strength Pareto approach. Technical report, TIK report"},{"issue":"2","key":"2228_CR14","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s10852-008-9080-2","volume":"7","author":"N Jozefowiez","year":"2008","unstructured":"Jozefowiez N, Glover F, Laguna M (2008) Multi-objective meta-heuristics for the traveling salesman problem with profits. J. Math. Modelling Algorithms 7(2):177\u2013195","journal-title":"J. Math. Modelling Algorithms"},{"issue":"3","key":"2228_CR15","first-page":"296","volume":"1","author":"Y Haimes","year":"1971","unstructured":"Haimes Y (1971) On a bicriterion formulation of the problems of integrated system identification and system optimization. IEEE Trans. Syst. Man Cybernet.A 1(3):296\u2013297","journal-title":"IEEE Trans. Syst. Man Cybernet.A"},{"issue":"2\u20133","key":"2228_CR16","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1016\/S0377-2217(97)00289-0","volume":"106","author":"M Gendreau","year":"1998","unstructured":"Gendreau M, Laporte G, Semet F (1998) A tabu search heuristic for the undirected selective travelling salesman problem. Euro. J. Oper. Res. 106(2\u20133):539\u2013545","journal-title":"Euro. J. Oper. Res."},{"key":"2228_CR17","unstructured":"Zitzler E (1999) Evolutionary algorithms for multiobjective optimization: Methods and applications. PhD thesis, Swiss Federal Institute of Technology Zurich"},{"key":"2228_CR18","doi-asserted-by":"crossref","unstructured":"Bederina H, Hifi M (2017) A hybrid multi-objective evolutionary algorithm for the team orienteering problem. In: 2017 4th International Conference on Control, Decision and Information Technologies (CoDIT), pp. 0898\u20130903. IEEE","DOI":"10.1109\/CoDIT.2017.8102710"},{"issue":"3","key":"2228_CR19","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1016\/0377-2217(94)00289-4","volume":"88","author":"I-M Chao","year":"1996","unstructured":"Chao I-M, Golden BL, Wasil EA (1996) The team orienteering problem. Euro. J. Oper Res. 88(3):464\u2013474","journal-title":"Euro. J. Oper Res."},{"key":"2228_CR20","doi-asserted-by":"publisher","first-page":"13953","DOI":"10.1007\/s00521-020-04798-7","volume":"32","author":"J Dutta","year":"2020","unstructured":"Dutta J, Barma PS, Mukherjee A, Kar S, De T (2020) A multi-objective open set orienteering problem. Neural Comput. Appl. 32:13953\u201313969","journal-title":"Neural Comput. Appl."},{"issue":"1","key":"2228_CR21","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1016\/j.ejor.2017.11.009","volume":"267","author":"C Archetti","year":"2018","unstructured":"Archetti C, Carrabs F, Cerulli R (2018) The set orienteering problem. Euro. J. Oper. Res. 267(1):264\u2013272","journal-title":"Euro. J. Oper. Res."},{"issue":"11","key":"2228_CR22","doi-asserted-by":"publisher","first-page":"3942","DOI":"10.1007\/s10489-020-01713-4","volume":"50","author":"I Khan","year":"2020","unstructured":"Khan I, Maiti MK, Basuli K (2020) Multi-objective traveling salesman problem: an abc approach. Appl. Intell. 50(11):3942\u20133960","journal-title":"Appl. Intell."},{"key":"2228_CR23","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10898-007-9149-x","volume":"39","author":"D Karaboga","year":"2007","unstructured":"Karaboga D, Basturk B (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J. Global Opt. 39:459\u2013471","journal-title":"J. Global Opt."},{"key":"2228_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.114779","volume":"176","author":"G Srivastava","year":"2021","unstructured":"Srivastava G, Singh A, Mallipeddi R (2021) NSGA-II with objective-specific variation operators for multiobjective vehicle routing problem with time windows. Expert Syst. Appl. 176:114779","journal-title":"Expert Syst. Appl."},{"key":"2228_CR25","unstructured":"Bean JC (1993) Genetics and random keys for sequencing amd optimization. Technical report"},{"issue":"2","key":"2228_CR26","first-page":"115","volume":"9","author":"K Deb","year":"1995","unstructured":"Deb K, Agrawal RB et al (1995) Simulated binary crossover for continuous search space. Complex Systems 9(2):115\u2013148","journal-title":"Complex Systems"},{"key":"2228_CR27","unstructured":"Goldberg DE, Lingle R, et\u00a0al. (1985) Alleles, loci, and the traveling salesman problem. In: Proceedings of an International Conference on Genetic Algorithms and Their Applications, vol. 154, pp. 154\u2013159. Lawrence Erlbaum Hillsdale, NJ"},{"key":"2228_CR28","volume-title":"Genetic algorithms and simulated annealing","author":"L Davis","year":"1987","unstructured":"Davis L (1987) Genetic algorithms and simulated annealing. Morgan Kaufman Publishers Inc, Los Altos, CA"},{"key":"2228_CR29","doi-asserted-by":"crossref","unstructured":"Costa CR, Nascimento MCV (2024) The priority-based traveling backpacker problem: Formulations and heuristics. Expert Systems with Applications, 121818","DOI":"10.1016\/j.eswa.2023.121818"},{"key":"2228_CR30","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BF02289263","volume":"18","author":"RL Thorndike","year":"1953","unstructured":"Thorndike RL (1953) Who belongs in the family? Psychometrika 18:267\u2013276","journal-title":"Psychometrika"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-024-02228-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13042-024-02228-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-024-02228-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T16:57:27Z","timestamp":1760547447000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13042-024-02228-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,13]]},"references-count":30,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2025,10]]}},"alternative-id":["2228"],"URL":"https:\/\/doi.org\/10.1007\/s13042-024-02228-x","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"type":"print","value":"1868-8071"},{"type":"electronic","value":"1868-808X"}],"subject":[],"published":{"date-parts":[[2024,6,13]]},"assertion":[{"value":"21 February 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 May 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 June 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}