{"id":"https://openalex.org/W7128917603","doi":"https://doi.org/10.1007/s10732-026-09584-7","title":"A Hybrid Genetic Search for Selective Routing with Overlapping Clusters: A Case Study in Order Picking","display_name":"A Hybrid Genetic Search for Selective Routing with Overlapping Clusters: A Case Study in Order Picking","publication_year":2026,"publication_date":"2026-02-14","ids":{"openalex":"https://openalex.org/W7128917603","doi":"https://doi.org/10.1007/s10732-026-09584-7"},"language":"en","primary_location":{"id":"doi:10.1007/s10732-026-09584-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10732-026-09584-7","pdf_url":null,"source":{"id":"https://openalex.org/S111418578","display_name":"Journal of Heuristics","issn_l":"1381-1231","issn":["1381-1231","1572-9397"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Heuristics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5068245696","display_name":"Vittorio Latorre","orcid":"https://orcid.org/0000-0002-4644-848X"},"institutions":[{"id":"https://openalex.org/I129627893","display_name":"University of Molise","ror":"https://ror.org/04z08z627","country_code":"IT","type":"education","lineage":["https://openalex.org/I129627893"]},{"id":"https://openalex.org/I4210132817","display_name":"Mercatorum University","ror":"https://ror.org/03znjxt55","country_code":"IT","type":"education","lineage":["https://openalex.org/I4210132817"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Vittorio Latorre","raw_affiliation_strings":["Department of Bioscience and Territory, University of Molise, c.da Fonte Lappone, snc, Pesche (IS), 86170, Molise, Italy","Department of Engineering and Science, Universitas Mercatorum, Piazza Mattei 10, Rome, 00186, Lazio, Italy"],"raw_orcid":"https://orcid.org/0000-0002-4644-848X","affiliations":[{"raw_affiliation_string":"Department of Bioscience and Territory, University of Molise, c.da Fonte Lappone, snc, Pesche (IS), 86170, Molise, Italy","institution_ids":["https://openalex.org/I129627893"]},{"raw_affiliation_string":"Department of Engineering and Science, Universitas Mercatorum, Piazza Mattei 10, Rome, 00186, Lazio, Italy","institution_ids":["https://openalex.org/I4210132817"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5125999484","display_name":"Donato Salvatore","orcid":null},"institutions":[{"id":"https://openalex.org/I4210117916","display_name":"Agenzia Regionale Prevenzione e Ambiente della Regione Emilia-Romagna","ror":"https://ror.org/02edavb98","country_code":"IT","type":"government","lineage":["https://openalex.org/I4210117916","https://openalex.org/I4405255721"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Donato Salvatore","raw_affiliation_strings":["IT Department, INFOLOG SPA, Via Pier Paolo Pasolini, 23, Modena (MO), 41123, Emilia Romagna, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IT Department, INFOLOG SPA, Via Pier Paolo Pasolini, 23, Modena (MO), 41123, Emilia Romagna, Italy","institution_ids":["https://openalex.org/I4210117916"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5068245696"],"corresponding_institution_ids":["https://openalex.org/I129627893","https://openalex.org/I4210132817"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.30155704,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"32","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9904999732971191,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9904999732971191,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.001500000013038516,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.0008999999845400453,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6884999871253967},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6633999943733215},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6043999791145325},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.579800009727478},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5232999920845032},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4952999949455261},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.4823000133037567},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.4677000045776367},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.4462999999523163}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6884999871253967},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6633999943733215},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.645799994468689},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6043999791145325},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5821999907493591},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.579800009727478},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5232999920845032},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4952999949455261},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4823000133037567},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.4677000045776367},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.4462999999523163},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4383000135421753},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4284999966621399},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.3522000014781952},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.33489999175071716},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.32260000705718994},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32199999690055847},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.32120001316070557},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3179999887943268},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.2953999936580658},{"id":"https://openalex.org/C110332635","wikidata":"https://www.wikidata.org/wiki/Q629498","display_name":"Genetic programming","level":2,"score":0.2930999994277954},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.29019999504089355},{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.27649998664855957},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.2732999920845032},{"id":"https://openalex.org/C203208320","wikidata":"https://www.wikidata.org/wiki/Q5150830","display_name":"Combinatorial search","level":4,"score":0.26739999651908875},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.2621999979019165},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.2612999975681305},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.2606000006198883}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10732-026-09584-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10732-026-09584-7","pdf_url":null,"source":{"id":"https://openalex.org/S111418578","display_name":"Journal of Heuristics","issn_l":"1381-1231","issn":["1381-1231","1572-9397"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Heuristics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G707361917","display_name":null,"funder_award_id":"D.M. 10/08/2021 n.1062","funder_id":"https://openalex.org/F4320321873","funder_display_name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca"}],"funders":[{"id":"https://openalex.org/F4320321873","display_name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca","ror":"https://ror.org/0166hxq48"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1601649239","https://openalex.org/W1971759877","https://openalex.org/W2019741214","https://openalex.org/W2028630422","https://openalex.org/W2093698911","https://openalex.org/W2093795574","https://openalex.org/W2106996973","https://openalex.org/W2119601963","https://openalex.org/W2121666077","https://openalex.org/W2128970394","https://openalex.org/W2168381469","https://openalex.org/W2262246802","https://openalex.org/W2586188487","https://openalex.org/W2616101379","https://openalex.org/W3026014732","https://openalex.org/W3121330861","https://openalex.org/W3133818392","https://openalex.org/W3214868035","https://openalex.org/W4313331239","https://openalex.org/W4376631521","https://openalex.org/W4391315348","https://openalex.org/W4391812043","https://openalex.org/W4400345375","https://openalex.org/W4407424474","https://openalex.org/W4412041078"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2026-02-15T00:00:00"}