{"id":"https://openalex.org/W2806379636","doi":"https://doi.org/10.1007/s10589-018-0014-2","title":"A two-level metaheuristic for the all colors shortest path problem","display_name":"A two-level metaheuristic for the all colors shortest path problem","publication_year":2018,"publication_date":"2018-06-08","ids":{"openalex":"https://openalex.org/W2806379636","doi":"https://doi.org/10.1007/s10589-018-0014-2","mag":"2806379636"},"language":"en","primary_location":{"id":"doi:10.1007/s10589-018-0014-2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10589-018-0014-2","pdf_url":null,"source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"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":"Computational Optimization and Applications","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/A5032185912","display_name":"Francesco Carrabs","orcid":"https://orcid.org/0000-0003-2187-8624"},"institutions":[{"id":"https://openalex.org/I131729948","display_name":"University of Salerno","ror":"https://ror.org/0192m2k53","country_code":"IT","type":"education","lineage":["https://openalex.org/I131729948"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"F. Carrabs","raw_affiliation_strings":["Department of Mathematics, University of Salerno, Fisciano, Italy"],"raw_orcid":"https://orcid.org/0000-0003-2187-8624","affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Salerno, Fisciano, Italy","institution_ids":["https://openalex.org/I131729948"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034899414","display_name":"Raffaele Cerulli","orcid":"https://orcid.org/0000-0002-3277-6802"},"institutions":[{"id":"https://openalex.org/I131729948","display_name":"University of Salerno","ror":"https://ror.org/0192m2k53","country_code":"IT","type":"education","lineage":["https://openalex.org/I131729948"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"R. Cerulli","raw_affiliation_strings":["Department of Mathematics, University of Salerno, Fisciano, Italy"],"raw_orcid":"https://orcid.org/0000-0002-3277-6802","affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Salerno, Fisciano, Italy","institution_ids":["https://openalex.org/I131729948"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067237809","display_name":"Rosa Pentangelo","orcid":"https://orcid.org/0000-0002-1056-4390"},"institutions":[{"id":"https://openalex.org/I131729948","display_name":"University of Salerno","ror":"https://ror.org/0192m2k53","country_code":"IT","type":"education","lineage":["https://openalex.org/I131729948"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"R. Pentangelo","raw_affiliation_strings":["Department of Mathematics, University of Salerno, Fisciano, Italy"],"raw_orcid":"https://orcid.org/0000-0002-1056-4390","affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Salerno, Fisciano, Italy","institution_ids":["https://openalex.org/I131729948"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010736650","display_name":"Andrea Raiconi","orcid":"https://orcid.org/0000-0002-7188-8794"},"institutions":[{"id":"https://openalex.org/I131729948","display_name":"University of Salerno","ror":"https://ror.org/0192m2k53","country_code":"IT","type":"education","lineage":["https://openalex.org/I131729948"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"A. Raiconi","raw_affiliation_strings":["Department of Mathematics, University of Salerno, Fisciano, Italy"],"raw_orcid":"https://orcid.org/0000-0002-7188-8794","affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Salerno, Fisciano, Italy","institution_ids":["https://openalex.org/I131729948"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5010736650"],"corresponding_institution_ids":["https://openalex.org/I131729948"],"apc_list":{"value":2990,"currency":"USD","value_usd":2990},"apc_paid":null,"fwci":0.6434,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.75951765,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"71","issue":"2","first_page":"525","last_page":"551"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9994000196456909,"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.9994000196456909,"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.9534000158309937,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.9514999985694885,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/shortest-path-problem","display_name":"Shortest path problem","score":0.7758657932281494},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7292017936706543},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.7191598415374756},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5831048488616943},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5502840280532837},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.47103527188301086},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.42980748414993286},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.4088747799396515},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.36818403005599976},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.24874639511108398},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.22044730186462402}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7758657932281494},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7292017936706543},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.7191598415374756},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5831048488616943},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5502840280532837},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.47103527188301086},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.42980748414993286},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4088747799396515},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36818403005599976},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.24874639511108398},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.22044730186462402},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10589-018-0014-2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10589-018-0014-2","pdf_url":null,"source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"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":"Computational Optimization and Applications","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:coopap:v:71:y:2018:i:2:d:10.1007_s10589-018-0014-2","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10589-018-0014-2","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1972335984","https://openalex.org/W2008656089","https://openalex.org/W2017602820","https://openalex.org/W2018269848","https://openalex.org/W2032789430","https://openalex.org/W2077405310","https://openalex.org/W2081231516","https://openalex.org/W2083974195","https://openalex.org/W2086987885","https://openalex.org/W2088814889","https://openalex.org/W2110105948","https://openalex.org/W2145457833","https://openalex.org/W2150367356","https://openalex.org/W2159637648","https://openalex.org/W2163148176","https://openalex.org/W2165842651","https://openalex.org/W2167459401","https://openalex.org/W2172255557","https://openalex.org/W2240749562","https://openalex.org/W2766388960","https://openalex.org/W2769655085","https://openalex.org/W2794514739","https://openalex.org/W3145128584","https://openalex.org/W4246219036"],"related_works":["https://openalex.org/W2375775343","https://openalex.org/W2018146256","https://openalex.org/W2198982833","https://openalex.org/W2365712669","https://openalex.org/W3205592527","https://openalex.org/W2612665926","https://openalex.org/W4294360851","https://openalex.org/W4200172719","https://openalex.org/W3165912151","https://openalex.org/W2388654557"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":3}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}