{"id":"https://openalex.org/W2017597147","doi":"https://doi.org/10.1016/s0377-2217(02)00262-x","title":"A penalty function heuristic for the resource constrained shortest path problem","display_name":"A penalty function heuristic for the resource constrained shortest path problem","publication_year":2002,"publication_date":"2002-10-01","ids":{"openalex":"https://openalex.org/W2017597147","doi":"https://doi.org/10.1016/s0377-2217(02)00262-x","mag":"2017597147"},"language":"en","primary_location":{"id":"doi:10.1016/s0377-2217(02)00262-x","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0377-2217(02)00262-x","pdf_url":null,"source":{"id":"https://openalex.org/S103321696","display_name":"European Journal of Operational Research","issn_l":"0377-2217","issn":["0377-2217","1872-6860"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"European Journal of Operational Research","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/A5053627768","display_name":"Pasquale Avella","orcid":"https://orcid.org/0000-0002-0462-3550"},"institutions":[{"id":"https://openalex.org/I16337185","display_name":"University of Sannio","ror":"https://ror.org/04vc81p87","country_code":"IT","type":"education","lineage":["https://openalex.org/I16337185"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Pasquale Avella","raw_affiliation_strings":["Facolt\u00e0 di Ingegneria, Universit\u00e0 del Sannio, Corso Garibaldi 107, 82100 Benevento, Italy"],"affiliations":[{"raw_affiliation_string":"Facolt\u00e0 di Ingegneria, Universit\u00e0 del Sannio, Corso Garibaldi 107, 82100 Benevento, Italy","institution_ids":["https://openalex.org/I16337185"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069880315","display_name":"Maurizio Boccia","orcid":"https://orcid.org/0000-0003-4947-9852"},"institutions":[{"id":"https://openalex.org/I71267560","display_name":"University of Naples Federico II","ror":"https://ror.org/05290cv24","country_code":"IT","type":"education","lineage":["https://openalex.org/I71267560"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Maurizio Boccia","raw_affiliation_strings":["Dipartimento di Informatica e Sistemistica, Universit\u00e0 degli Studi di Napoli \u201cFederico II\u201d, Via Claudio 21, 80125 Napoli, Italy","Dipartimento di Informatica e Sistemistica, Universit\u00e0 degli Studi di Napoli Federico II via Claudio 21 - 80125 Napoli, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica e Sistemistica, Universit\u00e0 degli Studi di Napoli \u201cFederico II\u201d, Via Claudio 21, 80125 Napoli, Italy","institution_ids":["https://openalex.org/I71267560"]},{"raw_affiliation_string":"Dipartimento di Informatica e Sistemistica, Universit\u00e0 degli Studi di Napoli Federico II via Claudio 21 - 80125 Napoli, Italy","institution_ids":["https://openalex.org/I71267560"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102999982","display_name":"Antonio Sforza","orcid":"https://orcid.org/0000-0003-3117-6810"},"institutions":[{"id":"https://openalex.org/I71267560","display_name":"University of Naples Federico II","ror":"https://ror.org/05290cv24","country_code":"IT","type":"education","lineage":["https://openalex.org/I71267560"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Antonio Sforza","raw_affiliation_strings":["Dipartimento di Informatica e Sistemistica, Universit\u00e0 degli Studi di Napoli \u201cFederico II\u201d, Via Claudio 21, 80125 Napoli, Italy","Dipartimento di Informatica e Sistemistica, Universit\u00e0 degli Studi di Napoli Federico II via Claudio 21 - 80125 Napoli, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica e Sistemistica, Universit\u00e0 degli Studi di Napoli \u201cFederico II\u201d, Via Claudio 21, 80125 Napoli, Italy","institution_ids":["https://openalex.org/I71267560"]},{"raw_affiliation_string":"Dipartimento di Informatica e Sistemistica, Universit\u00e0 degli Studi di Napoli Federico II via Claudio 21 - 80125 Napoli, Italy","institution_ids":["https://openalex.org/I71267560"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5102999982"],"corresponding_institution_ids":["https://openalex.org/I71267560"],"apc_list":{"value":3290,"currency":"USD","value_usd":3290},"apc_paid":null,"fwci":1.0319,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.75715616,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"142","issue":"2","first_page":"221","last_page":"230"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9926000237464905,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.9718999862670898,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7445124983787537},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7391895651817322},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6726198196411133},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.5551945567131042},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5437963008880615},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5217626690864563},{"id":"https://openalex.org/keywords/penalty-method","display_name":"Penalty method","score":0.513966977596283},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.47798770666122437},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.47417914867401123},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43039190769195557},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4245079755783081},{"id":"https://openalex.org/keywords/consistent-heuristic","display_name":"Consistent heuristic","score":0.42151740193367004},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.24940171837806702},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.20387771725654602},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.12998217344284058},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.12427359819412231}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7445124983787537},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7391895651817322},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6726198196411133},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.5551945567131042},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5437963008880615},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5217626690864563},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.513966977596283},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.47798770666122437},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.47417914867401123},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43039190769195557},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4245079755783081},{"id":"https://openalex.org/C200246849","wikidata":"https://www.wikidata.org/wiki/Q5163226","display_name":"Consistent heuristic","level":5,"score":0.42151740193367004},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.24940171837806702},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.20387771725654602},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.12998217344284058},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.12427359819412231},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/s0377-2217(02)00262-x","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0377-2217(02)00262-x","pdf_url":null,"source":{"id":"https://openalex.org/S103321696","display_name":"European Journal of Operational Research","issn_l":"0377-2217","issn":["0377-2217","1872-6860"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"European Journal of Operational Research","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:eee:ejores:v:142:y:2002:i:2:p:221-230","is_oa":false,"landing_page_url":"http://www.sciencedirect.com/science/article/pii/S0377-2217(02)00262-X","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":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.44999998807907104}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W330591652","https://openalex.org/W1531368347","https://openalex.org/W1579927935","https://openalex.org/W1931114878","https://openalex.org/W1964443412","https://openalex.org/W1993161326","https://openalex.org/W2011282943","https://openalex.org/W2056802293","https://openalex.org/W2058479406","https://openalex.org/W2098074159","https://openalex.org/W2117319425","https://openalex.org/W2127456145","https://openalex.org/W2130679277","https://openalex.org/W2146519844","https://openalex.org/W2169528473","https://openalex.org/W6661439664"],"related_works":["https://openalex.org/W2156431668","https://openalex.org/W2019018557","https://openalex.org/W2388410942","https://openalex.org/W2375775343","https://openalex.org/W2022506245","https://openalex.org/W2040572217","https://openalex.org/W2198982833","https://openalex.org/W2009987517","https://openalex.org/W2124726667","https://openalex.org/W2983794855"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}