{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T09:58:26Z","timestamp":1781344706590,"version":"3.54.1"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032292919","type":"print"},{"value":"9783032292926","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T00:00:00Z","timestamp":1781395200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T00:00:00Z","timestamp":1781395200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2027]]},"DOI":"10.1007\/978-3-032-29292-6_23","type":"book-chapter","created":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T09:48:35Z","timestamp":1781344115000},"page":"277-288","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Hybrid Nearest Neighbor Approach with Crossover Operators for Traveling Salesman Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7392-9767","authenticated-orcid":false,"given":"Dragan","family":"Simi\u0107","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zorana","family":"Bankovi\u0107","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5969-6821","authenticated-orcid":false,"given":"Marko","family":"Veli\u010dkovi\u0107","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0692-2124","authenticated-orcid":false,"given":"Svetislav D.","family":"Simi\u0107","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1857-8209","authenticated-orcid":false,"given":"Svetlana","family":"Simi\u0107","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,14]]},"reference":[{"key":"23_CR1","unstructured":"Amarilli, A., Lombardo, A., Monet, M.: The S-Hamiltonian cycle problem. arXiv:2602.16532 (2026)"},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"17119","DOI":"10.1038\/s41598-024-66393-3","volume":"14","author":"S Lv","year":"2024","unstructured":"Lv, S., Wang, J., Deng, D., Yan, P.: A hybrid recommendation algorithm based on user nearest neighbor model. Sci. Rep. 14, 17119 (2024)","journal-title":"Sci. Rep."},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"110907","DOI":"10.1016\/j.knosys.2023.110907","volume":"278","author":"D Gupta","year":"2023","unstructured":"Gupta, D., Loane, R., Gayen, S., Demner-Fushman, D.: Medical image retrieval via nearest neighbor search on pre-trained image features. Knowl.-Based Syst. 278, 110907 (2023)","journal-title":"Knowl.-Based Syst."},{"issue":"1","key":"23_CR4","doi-asserted-by":"publisher","first-page":"012078","DOI":"10.1088\/1755-1315\/1324\/1\/012078","volume":"1324","author":"F Razita","year":"2024","unstructured":"Razita, F., Basaria, F.T.: Optimizing routes for sustainability: a comparative analysis of parcel distribution methods in South Jakarta. IOP Conf. Ser.: Earth Environ. Sci. 1324(1), 012078 (2024)","journal-title":"IOP Conf. Ser.: Earth Environ. Sci."},{"key":"23_CR5","unstructured":"Backurs, A., Dong, Y., Indyk, P., Razenshteyn, I., Wagner, T.: Scalable nearest neighbor search for optimal transport. In: ICML 2020: Proceedings of the 37th International Conference on Machine Learning, Article No.: 47, pp. 497\u2013506 (2020)"},{"issue":"3","key":"23_CR6","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1093\/jigpal\/jzv011","volume":"23","author":"D Simi\u0107","year":"2015","unstructured":"Simi\u0107, D., Kova\u010devi\u0107, I., Svir\u010devi\u0107, V., Simi\u0107, S.: Hybrid firefly model in routing heterogeneous fleet of vehicles in logistics distribution. Log. J. IGPL 23(3), 521\u2013532 (2015)","journal-title":"Log. J. IGPL"},{"issue":"4","key":"23_CR7","first-page":"37","volume":"69","author":"V Ilin","year":"2023","unstructured":"Ilin, V., Veli\u010dkovi\u0107, M., Garunovi\u0107, N., Simi\u0107, D.: Last-mile delivery with electric vehicles, unmanned aerial vehicles, and e-scooters and e-bikes. J. Road Traffic Eng. 69(4), 37\u201342 (2023)","journal-title":"J. Road Traffic Eng."},{"issue":"3","key":"23_CR8","doi-asserted-by":"publisher","first-page":"115","DOI":"10.2308\/TAR-2021-0478","volume":"99","author":"PD Easton","year":"2024","unstructured":"Easton, P.D., Kapons, M.M., Monahan, S.J., Schutt, H.H., Weisbrod, E.H.: Forecasting earnings using k-nearest neighbors. Account. Rev. 99(3), 115\u2013140 (2024)","journal-title":"Account. Rev."},{"key":"23_CR9","unstructured":"https:\/\/stevedower.id.au\/research\/oliver-30"},{"issue":"1","key":"23_CR10","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1080\/01969722.2018.1558014","volume":"50","author":"D Simi\u0107","year":"2019","unstructured":"Simi\u0107, D., Svir\u010devi\u0107, V., Ilin, V., Simi\u0107, S.D., Simi\u0107, S.: Particle swarm optimization and pure adaptive search in finish goods\u2019 inventory management. Cybern. Syst. 50(1), 58\u201377 (2019)","journal-title":"Cybern. Syst."},{"issue":"4","key":"23_CR11","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1093\/jigpal\/jzz057","volume":"28","author":"E Jove","year":"2020","unstructured":"Jove, E., Casteleiro-Roca, J.L., Quinti\u00e1n, H., Simi\u0107, D., M\u00e9ndez-P\u00e9rez, J.A., Calvo-Rolle, J.L.: Anomaly detection based on one-class intelligent techniques over a control level plant. Log. J. IGPL 28(4), 502\u2013518 (2020)","journal-title":"Log. J. IGPL"},{"issue":"9","key":"23_CR12","doi-asserted-by":"publisher","first-page":"e12990","DOI":"10.1111\/exsy.12990","volume":"39","author":"F Zayas-Gato","year":"2022","unstructured":"Zayas-Gato, F., et al.: A hybrid one-class approach for detecting anomalies in industrial systems. Expert. Syst. 39(9), e12990 (2022)","journal-title":"Expert. Syst."},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Clark, P.J., Evans. F.C.: Distance to nearest neighbor as a measure of spatial relationships in populations, Ecology 35(4), 445\u2013453 (1954)","DOI":"10.2307\/1931034"},{"issue":"4","key":"23_CR14","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1287\/ijoc.4.4.387","volume":"4","author":"JJ Bentley","year":"1992","unstructured":"Bentley, J.J.: Fast algorithms for geometric traveling salesman problems. ORSA J. Comput. 4(4), 387\u2013412 (1992)","journal-title":"ORSA J. Comput."},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Ilin, V., Simi\u0107, D., Simi\u0107, S.D., Simi\u0107, S.: Hybrid genetic algorithms and tour construction and improvement algorithms used for optimizing the traveling salesman problem. In: Advances in Intelligent Systems and Computing, vol. 1268, pp. 530\u2013539 (2020)","DOI":"10.1007\/978-3-030-57802-2_51"},{"issue":"1","key":"23_CR16","first-page":"26","volume":"2","author":"A Philip","year":"2011","unstructured":"Philip, A., Taofiki, A.A., Kehinde, O.: A genetic algorithm for solving travelling salesman problem. Int. J. Adv. Comput. Sci. Appl. 2(1), 26\u201329 (2011)","journal-title":"Int. J. Adv. Comput. Sci. Appl."},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Tsai, C.W., Tseng, S.P., Chiang, M.C., Yang, C.S., Hong, T.P.: A high-performance genetic algorithm: using traveling salesman problem as a case. Sci. World J. 2014, Article ID: 178621 (2014)","DOI":"10.1155\/2014\/178621"},{"issue":"1","key":"23_CR18","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.ejor.2024.05.010","volume":"318","author":"G Gabriel Soares","year":"2024","unstructured":"Gabriel Soares, G., Bulh\u00f5es, T., Bruck, B.: An efficient hybrid genetic algorithm for the traveling salesman problem with release dates. Eur. J. Oper. Res. 318(1), 31\u201342 (2024)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"23_CR19","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1093\/jigpal\/jzac028","volume":"31","author":"V Ilin","year":"2023","unstructured":"Ilin, V., Simi\u0107, D., Simi\u0107, S.D., Simi\u0107, S., Sauli\u0107, N., Calvo-Rolle, J.L.: A hybrid genetic algorithm, list-based simulated annealing algorithm, and different heuristic algorithms for the travelling salesman problem. Logic J. IGPL 31(4), 602\u2013617 (2023)","journal-title":"Logic J. IGPL"},{"key":"23_CR20","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BF02022093","volume":"21","author":"M Malek","year":"1989","unstructured":"Malek, M., Guruswamy, M., Pandya, M.: Serial and parallel simulated annealing and tabu search algorithms for traveling salesman problem. Ann. Oper. Res. 21, 59\u201384 (1989)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"23_CR21","first-page":"163","volume":"2012","author":"S Basu","year":"2012","unstructured":"Basu, S.: Tabu search implementation on traveling salesman problem and its variations: a literature survey. Am. J. Oper. Res. 2012(2), 163\u2013173 (2012)","journal-title":"Am. J. Oper. Res."},{"key":"23_CR22","doi-asserted-by":"publisher","first-page":"105107","DOI":"10.1016\/j.cor.2020.105107","volume":"126","author":"X Chou","year":"2021","unstructured":"Chou, X., Gambardella, L.M., Montemanni, R.: A tabu search algorithm for the probabilistic orienteering problem. Comput. Oper. Res. 126, 105107 (2021)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"23_CR23","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0303-2647(97)01708-5","volume":"43","author":"M Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.M.: Ant colonies for the traveling salesman problem. BioSystems 43(2), 73\u201381 (1997)","journal-title":"BioSystems"},{"key":"23_CR24","doi-asserted-by":"crossref","unstructured":"Yang, J., Shi, X., Marchese, M., Liang, Y.: An ant colony optimization method for generalized TSP problem. Progr. Natural Sci. 18(11) pp. 1417\u20131422 (2008)","DOI":"10.1016\/j.pnsc.2008.03.028"},{"key":"23_CR25","doi-asserted-by":"publisher","first-page":"104678","DOI":"10.1016\/j.robot.2024.104678","volume":"177","author":"Y Zhang","year":"2024","unstructured":"Zhang, Y., Shen, Y., Wang, Q., Song, C., Dai, N., He, B.: A novel hybrid swarm intelligence algorithm for solving TSP and desired-path-based online obstacle avoidance strategy for AUV. Robot. Auton. Syst. 177, 104678 (2024)","journal-title":"Robot. Auton. Syst."},{"issue":"2","key":"23_CR26","doi-asserted-by":"publisher","first-page":"10","DOI":"10.48161\/qaj.v3n2a141","volume":"3","author":"AA Shaban","year":"2023","unstructured":"Shaban, A.A., Dela Fuente, J.A., Salih, M.S., Ali, R.I.: Review of swarm intelligence for solving symmetric traveling salesman problem. Qubahan Acad. J. 3(2), 10\u201327 (2023)","journal-title":"Qubahan Acad. J."},{"key":"23_CR27","volume-title":"Traveling Salesman Problem and its Variations","year":"2002","unstructured":"Gutin, G., Punnen, A.P. (eds.): Traveling Salesman Problem and its Variations. Kluwer Academic Publishers, Boston\/Dordrecht\/London (2002)"},{"issue":"3","key":"23_CR28","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.omega.2004.10.004","volume":"34","author":"T Bektas","year":"2006","unstructured":"Bektas, T.: The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega 34(3), 209\u2013219 (2006)","journal-title":"Omega"},{"issue":"1","key":"23_CR29","doi-asserted-by":"publisher","first-page":"692","DOI":"10.2991\/ijcis.11.1.53","volume":"11","author":"KM Lo","year":"2018","unstructured":"Lo, K.M., Yi, W.Y., Wong, P.K., Leung, K.S., Leung, Y., Mak, S.T.: A genetic algorithm with new local operators for multiple traveling salesman problems. Int. J. Comput. Intell. Syst. 11(1), 692\u2013705 (2018)","journal-title":"Int. J. Comput. Intell. Syst."},{"issue":"1","key":"23_CR30","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1023\/A:1008779125567","volume":"17","author":"N Ascheuer","year":"2000","unstructured":"Ascheuer, N., J\u00fcnger, M., Reinelt, G.A.: A branch and cut algorithm for the asymmetric traveling salesman problem with precedence constraints. Comput. Optim. Appl. 17(1), 61\u201384 (2000)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"23_CR31","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S0377-2217(02)00794-4","volume":"153","author":"G Righini","year":"2004","unstructured":"Righini, G., Trubian, M.: A note on the approximation of the asymmetric traveling salesman problem. Eur. J. Oper. Res. 153(1), 255\u2013265 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"23_CR32","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1016\/j.ejor.2023.07.022","volume":"314","author":"PC Pop","year":"2024","unstructured":"Pop, P.C., Cosma, O., Sabo, C., Sitar, C.P.: A comprehensive survey on the generalized traveling salesman problem. Eur. J. Oper. Res. 314, 819\u2013835 (2024)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"23_CR33","doi-asserted-by":"publisher","first-page":"122","DOI":"10.4236\/ica.2013.42017","volume":"4","author":"X Wang","year":"2013","unstructured":"Wang, X., Mu, A., Zhu, S.: ISPO: a new way to solve traveling salesman problem. Intell. Control. Autom. 4(2), 122\u2013125 (2013)","journal-title":"Intell. Control. Autom."},{"issue":"3","key":"23_CR34","doi-asserted-by":"publisher","first-page":"59","DOI":"10.3390\/a9030059","volume":"9","author":"IC Obagbuwa","year":"2016","unstructured":"Obagbuwa, I.C., Abidoye, A.P.: Binary cockroach swarm optimization for combinatorial optimization problem. Algorithms 9(3), 59 (2016)","journal-title":"Algorithms"}],"container-title":["Lecture Notes in Computer Science","Hybrid Artificial Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-29292-6_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T09:48:40Z","timestamp":1781344120000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-29292-6_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,14]]},"ISBN":["9783032292919","9783032292926"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-29292-6_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,14]]},"assertion":[{"value":"14 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"HAIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Hybrid Artificial Intelligence Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Marbella","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"hais2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/haisconference.eu","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}