{"id":"https://openalex.org/W3093633678","doi":"https://doi.org/10.3390/a13110269","title":"Algorithms for Finding Shortest Paths in Networks with Vertex Transfer Penalties","display_name":"Algorithms for Finding Shortest Paths in Networks with Vertex Transfer Penalties","publication_year":2020,"publication_date":"2020-10-22","ids":{"openalex":"https://openalex.org/W3093633678","doi":"https://doi.org/10.3390/a13110269","mag":"3093633678"},"language":"en","primary_location":{"id":"doi:10.3390/a13110269","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a13110269","pdf_url":"https://www.mdpi.com/1999-4893/13/11/269/pdf","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/13/11/269/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5087572284","display_name":"Rhyd Lewis","orcid":"https://orcid.org/0000-0003-1046-811X"},"institutions":[{"id":"https://openalex.org/I79510175","display_name":"Cardiff University","ror":"https://ror.org/03kk7td41","country_code":"GB","type":"education","lineage":["https://openalex.org/I79510175"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Rhyd Lewis","raw_affiliation_strings":["School of Mathematics, Cardiff University, Cardiff CF10 3AT, Wales, UK"],"affiliations":[{"raw_affiliation_string":"School of Mathematics, Cardiff University, Cardiff CF10 3AT, Wales, UK","institution_ids":["https://openalex.org/I79510175"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5087572284"],"corresponding_institution_ids":["https://openalex.org/I79510175"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":6.9847,"has_fulltext":true,"cited_by_count":36,"citation_normalized_percentile":{"value":0.96477142,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"13","issue":"11","first_page":"269","last_page":"269"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9986000061035156,"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"}},"topics":[{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9986000061035156,"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"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9911999702453613,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.7665722370147705},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6245938539505005},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5374370813369751},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.536628782749176},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4193948209285736},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41169676184654236},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3932186961174011},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3774302005767822},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.34999823570251465},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2886067032814026}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7665722370147705},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6245938539505005},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5374370813369751},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.536628782749176},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4193948209285736},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41169676184654236},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3932186961174011},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3774302005767822},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34999823570251465},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2886067032814026}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.3390/a13110269","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a13110269","pdf_url":"https://www.mdpi.com/1999-4893/13/11/269/pdf","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:https://orca.cardiff.ac.uk:135874","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306401195","display_name":"ORCA Online Research @Cardiff (Cardiff University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79510175","host_organization_name":"Cardiff University","host_organization_lineage":["https://openalex.org/I79510175"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Article"},{"id":"pmh:oai:doaj.org/article:df81c68bfbfd49eca0b8d5c52def8761","is_oa":true,"landing_page_url":"https://doaj.org/article/df81c68bfbfd49eca0b8d5c52def8761","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-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 13, Iss 11, p 269 (2020)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/13/11/269/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a13110269","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 13; Issue 11; Pages: 269","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a13110269","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a13110269","pdf_url":"https://www.mdpi.com/1999-4893/13/11/269/pdf","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":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3093633678.pdf","grobid_xml":"https://content.openalex.org/works/W3093633678.grobid-xml"},"referenced_works_count":28,"referenced_works":["https://openalex.org/W1482690689","https://openalex.org/W1495837337","https://openalex.org/W1524993602","https://openalex.org/W1969357318","https://openalex.org/W1969483458","https://openalex.org/W1981031568","https://openalex.org/W1986652726","https://openalex.org/W1990292945","https://openalex.org/W2011282943","https://openalex.org/W2017694061","https://openalex.org/W2020147819","https://openalex.org/W2022980325","https://openalex.org/W2089338760","https://openalex.org/W2102233757","https://openalex.org/W2136366792","https://openalex.org/W2144050074","https://openalex.org/W2144375401","https://openalex.org/W2160365857","https://openalex.org/W2167036627","https://openalex.org/W2169528473","https://openalex.org/W2181005956","https://openalex.org/W2199523148","https://openalex.org/W2804087515","https://openalex.org/W2896302100","https://openalex.org/W2964848975","https://openalex.org/W3007095780","https://openalex.org/W4231176537","https://openalex.org/W6680400737"],"related_works":["https://openalex.org/W3209137076","https://openalex.org/W2374560440","https://openalex.org/W1490490684","https://openalex.org/W4221129498","https://openalex.org/W2887026015","https://openalex.org/W2361442013","https://openalex.org/W2373384475","https://openalex.org/W4310124294","https://openalex.org/W143403600","https://openalex.org/W2761711678"],"abstract_inverted_index":{"In":[0,124],"this":[1,26],"paper":[2],"we":[3,73],"review":[4],"many":[5],"of":[6,25,62,77,98],"the":[7,12,35,83,93,126],"well-known":[8],"algorithms":[9],"for":[10,115],"solving":[11],"shortest":[13],"path":[14],"problem":[15,27],"in":[16,28,56],"edge-weighted":[17],"graphs.":[18,123],"We":[19],"then":[20,89],"focus":[21],"on":[22,82,107],"a":[23],"variant":[24,112,128],"which":[29],"additional":[30],"penalties":[31,38,65],"are":[32,88],"incurred":[33],"at":[34,48],"vertices.":[36],"These":[37],"can":[39],"be":[40],"used":[41],"to":[42,54,91,103],"model":[43],"things":[44],"like":[45],"waiting":[46],"times":[47],"road":[49],"junctions":[50],"and":[51,96],"delays":[52],"due":[53],"transfers":[55],"public":[57],"transport.":[58],"The":[59],"usual":[60],"way":[61],"handling":[63],"such":[64],"is":[66,113],"through":[67],"graph":[68],"expansion.":[69],"As":[70],"an":[71],"alternative,":[72],"propose":[74],"two":[75],"variants":[76],"Dijkstra\u2019s":[78,105],"algorithm":[79,106],"that":[80],"operate":[81],"original,":[84],"unexpanded":[85],"graph.":[86],"Analyses":[87],"presented":[90],"gauge":[92],"relative":[94],"advantages":[95],"disadvantages":[97],"these":[99],"methods.":[100],"Asymptotically,":[101],"compared":[102],"using":[104],"expanded":[108],"graphs,":[109],"our":[110],"first":[111],"faster":[114],"very":[116],"sparse":[117],"graphs":[118],"but":[119],"slower":[120],"with":[121],"dense":[122],"contrast,":[125],"second":[127],"features":[129],"identical":[130],"worst-case":[131],"run":[132],"times.":[133]},"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":1}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}