{"id":"https://openalex.org/W4297973708","doi":"https://doi.org/10.3390/a15100364","title":"A Constructive Heuristics and an Iterated Neighborhood Search Procedure to Solve the Cost-Balanced Path Problem","display_name":"A Constructive Heuristics and an Iterated Neighborhood Search Procedure to Solve the Cost-Balanced Path Problem","publication_year":2022,"publication_date":"2022-09-29","ids":{"openalex":"https://openalex.org/W4297973708","doi":"https://doi.org/10.3390/a15100364"},"language":"en","primary_location":{"id":"doi:10.3390/a15100364","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a15100364","pdf_url":"https://www.mdpi.com/1999-4893/15/10/364/pdf?version=1666584763","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/15/10/364/pdf?version=1666584763","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5086509443","display_name":"Daniela Ambrosino","orcid":"https://orcid.org/0000-0001-6532-2287"},"institutions":[{"id":"https://openalex.org/I83816512","display_name":"University of Genoa","ror":"https://ror.org/0107c5v14","country_code":"IT","type":"education","lineage":["https://openalex.org/I83816512"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Daniela Ambrosino","raw_affiliation_strings":["Department of Economics and Business Studies, University of Genoa, 16126 Genoa, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Economics and Business Studies, University of Genoa, 16126 Genoa, Italy","institution_ids":["https://openalex.org/I83816512"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072433066","display_name":"Carmine Cerrone","orcid":"https://orcid.org/0000-0002-6243-4512"},"institutions":[{"id":"https://openalex.org/I83816512","display_name":"University of Genoa","ror":"https://ror.org/0107c5v14","country_code":"IT","type":"education","lineage":["https://openalex.org/I83816512"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Carmine Cerrone","raw_affiliation_strings":["Department of Economics and Business Studies, University of Genoa, 16126 Genoa, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Economics and Business Studies, University of Genoa, 16126 Genoa, Italy","institution_ids":["https://openalex.org/I83816512"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004450046","display_name":"Anna Sciomachen","orcid":"https://orcid.org/0000-0001-7934-6992"},"institutions":[{"id":"https://openalex.org/I83816512","display_name":"University of Genoa","ror":"https://ror.org/0107c5v14","country_code":"IT","type":"education","lineage":["https://openalex.org/I83816512"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Anna Sciomachen","raw_affiliation_strings":["Department of Economics and Business Studies, University of Genoa, 16126 Genoa, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Economics and Business Studies, University of Genoa, 16126 Genoa, Italy","institution_ids":["https://openalex.org/I83816512"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5086509443"],"corresponding_institution_ids":["https://openalex.org/I83816512"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.2668,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.62216499,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"15","issue":"10","first_page":"364","last_page":"364"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9952999949455261,"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.9952999949455261,"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/T11606","display_name":"Infrastructure Maintenance and Monitoring","score":0.9879000186920166,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural 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.9861000180244446,"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/heuristics","display_name":"Heuristics","score":0.6891166567802429},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6341789960861206},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.587151288986206},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5576486587524414},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5477123856544495},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5428100228309631},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.5226892232894897},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5162048935890198},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4625394344329834},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4338997006416321},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42204025387763977},{"id":"https://openalex.org/keywords/iterated-local-search","display_name":"Iterated local search","score":0.41136810183525085},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40989190340042114},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.31768959760665894},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.11515045166015625}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6891166567802429},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6341789960861206},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.587151288986206},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5576486587524414},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5477123856544495},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5428100228309631},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.5226892232894897},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5162048935890198},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4625394344329834},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4338997006416321},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42204025387763977},{"id":"https://openalex.org/C124145224","wikidata":"https://www.wikidata.org/wiki/Q6094397","display_name":"Iterated local search","level":3,"score":0.41136810183525085},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40989190340042114},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.31768959760665894},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.11515045166015625},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.3390/a15100364","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a15100364","pdf_url":"https://www.mdpi.com/1999-4893/15/10/364/pdf?version=1666584763","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:25555e89f4ed483f9e14333149635589","is_oa":true,"landing_page_url":"https://doaj.org/article/25555e89f4ed483f9e14333149635589","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 15, Iss 10, p 364 (2022)","raw_type":"article"},{"id":"pmh:oai:iris.unige.it:11567/1098863","is_oa":true,"landing_page_url":"https://hdl.handle.net/11567/1098863","pdf_url":null,"source":{"id":"https://openalex.org/S4377196291","display_name":"CINECA IRIS Institutial Research Information System (University of Genoa)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I83816512","host_organization_name":"University of Genoa","host_organization_lineage":["https://openalex.org/I83816512"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:mdpi.com:/1999-4893/15/10/364/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a15100364","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms; Volume 15; Issue 10; Pages: 364","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a15100364","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a15100364","pdf_url":"https://www.mdpi.com/1999-4893/15/10/364/pdf?version=1666584763","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.699999988079071,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4297973708.pdf","grobid_xml":"https://content.openalex.org/works/W4297973708.grobid-xml"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W650979811","https://openalex.org/W958548075","https://openalex.org/W1974223154","https://openalex.org/W1983354559","https://openalex.org/W2008284829","https://openalex.org/W2022246164","https://openalex.org/W2053379987","https://openalex.org/W2066586043","https://openalex.org/W2078701526","https://openalex.org/W2083919985","https://openalex.org/W2084224084","https://openalex.org/W2089515406","https://openalex.org/W2092716525","https://openalex.org/W2102207689","https://openalex.org/W2169528473","https://openalex.org/W2172588432","https://openalex.org/W2461425465","https://openalex.org/W2466376001","https://openalex.org/W2570013196","https://openalex.org/W2595243011","https://openalex.org/W3093633678","https://openalex.org/W3131202049","https://openalex.org/W3132345617","https://openalex.org/W3185272754","https://openalex.org/W4214855410","https://openalex.org/W4224231691","https://openalex.org/W4237928211","https://openalex.org/W6625081808","https://openalex.org/W6809946840"],"related_works":["https://openalex.org/W2083844986","https://openalex.org/W2005660029","https://openalex.org/W2887485518","https://openalex.org/W1666350026","https://openalex.org/W1996453501","https://openalex.org/W4394238759","https://openalex.org/W2346455737","https://openalex.org/W4385205110","https://openalex.org/W3204855000","https://openalex.org/W2949474276"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,40,91,148,161],"new":[4],"heuristic":[5],"algorithm":[6,89,120,129],"tailored":[7],"to":[8,68,74,103,143],"solve":[9],"large":[10,137],"instances":[11,138],"of":[12,16,58,61,106,136,147,156,164],"an":[13,95,107],"NP-hard":[14],"variant":[15],"the":[17,22,29,36,51,55,59,62,75,104,118,127,134,145,154,157],"shortest":[18],"path":[19,24,38,151],"problem,":[20,25],"denoted":[21],"cost-balanced":[23],"recently":[26],"proposed":[27,88,119,128],"in":[28,34,39,133,167],"literature.":[30],"The":[31,87,112],"problem":[32],"consists":[33],"finding":[35,160],"origin\u2013destination":[37],"direct":[41],"graph,":[42],"having":[43],"both":[44],"negative":[45],"and":[46,94,98,152],"positive":[47],"weights":[48,60],"associated":[49],"with":[50],"arcs,":[52],"such":[53],"that":[54,117],"total":[56],"sum":[57],"selected":[63],"arcs":[64],"is":[65,100,121,130,141],"as":[66,70],"close":[67],"zero":[69],"possible.":[71],"At":[72],"least":[73],"authors\u2019":[76],"knowledge,":[77],"there":[78],"are":[79],"no":[80],"solution":[81,158],"algorithms":[82],"for":[83],"facing":[84],"this":[85],"problem.":[86],"integrates":[90],"constructive":[92],"procedure":[93],"improvement":[96],"procedure,":[97],"it":[99,140],"validated":[101],"thanks":[102],"implementation":[105],"iterated":[108],"neighborhood":[109],"search":[110],"procedure.":[111],"reported":[113],"numerical":[114],"experimentation":[115],"shows":[116],"computationally":[122],"very":[123],"efficient.":[124],"In":[125],"particular,":[126],"most":[131],"suitable":[132],"case":[135],"where":[139],"possible":[142],"prove":[144],"existence":[146],"perfectly":[149],"balanced":[150],"thus":[153],"optimality":[155],"by":[159],"good":[162],"percentage":[163],"optimal":[165],"solutions":[166],"negligible":[168],"computational":[169],"time.":[170]},"counts_by_year":[{"year":2023,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}