{"id":"https://openalex.org/W2033097611","doi":"https://doi.org/10.1002/net.3230040304","title":"Shortest path with time constraints on movement and parking","display_name":"Shortest path with time constraints on movement and parking","publication_year":1974,"publication_date":"1974-01-01","ids":{"openalex":"https://openalex.org/W2033097611","doi":"https://doi.org/10.1002/net.3230040304","mag":"2033097611"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230040304","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230040304","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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/A5058160308","display_name":"Jonathan Halpern","orcid":null},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"J. Halpern","raw_affiliation_strings":["TECHNION Israel Institute of Technology Haifa, Israel","Technion \u00ad Israel Institute of Technology, Haifa, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TECHNION Israel Institute of Technology Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]},{"raw_affiliation_string":"Technion \u00ad Israel Institute of Technology, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056237811","display_name":"I. Priess","orcid":null},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"I. Priess","raw_affiliation_strings":["TECHNION Israel Institute of Technology Haifa, Israel","Technion \u00ad Israel Institute of Technology, Haifa, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TECHNION Israel Institute of Technology Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]},{"raw_affiliation_string":"Technion \u00ad Israel Institute of Technology, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5058160308"],"corresponding_institution_ids":["https://openalex.org/I174306211"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":2.5031,"has_fulltext":false,"cited_by_count":39,"citation_normalized_percentile":{"value":0.8690671,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"4","issue":"3","first_page":"241","last_page":"253"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9994000196456909,"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"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9994000196456909,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10698","display_name":"Transportation Planning and Optimization","score":0.9922000169754028,"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.7177294492721558},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6200128793716431},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6084411144256592},{"id":"https://openalex.org/keywords/arc","display_name":"Arc (geometry)","score":0.5846852660179138},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.49216407537460327},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32706183195114136},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.23332706093788147},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.09266534447669983},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.06833600997924805},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.05840882658958435}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7177294492721558},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6200128793716431},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6084411144256592},{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.5846852660179138},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49216407537460327},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32706183195114136},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.23332706093788147},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.09266534447669983},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.06833600997924805},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.05840882658958435}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230040304","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230040304","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5099999904632568,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1964119857","https://openalex.org/W1986652726","https://openalex.org/W2020147819","https://openalex.org/W2144050074","https://openalex.org/W2151842399","https://openalex.org/W2169528473","https://openalex.org/W4244424643"],"related_works":["https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W4225152035","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W1587224694","https://openalex.org/W2911598644","https://openalex.org/W2142036596"],"abstract_inverted_index":{"Abstract":[0],"The":[1],"shortest":[2,74],"path":[3,75],"problem":[4,39,126],"is":[5,99],"well":[6],"known":[7],"and":[8,43,54,56,66],"a":[9,137],"number":[10],"of":[11,37,59,86,94,115,125,133,139],"methods":[12],"have":[13,40],"been":[14,41],"proposed":[15],"for":[16,48,81,103,128],"its":[17,20],"solution.":[18],"In":[19,61],"simplest":[21],"form":[22],"no":[23],"restrictions":[24],"or":[25,117,136],"special":[26],"costs":[27],"are":[28,79],"placed":[29],"on":[30,145],"movement":[31],"in":[32,91,120,130],"the":[33,38,68,73,92,95,113,121,131],"network.":[34],"Some":[35],"variations":[36],"presented":[42],"solved,":[44],"such":[45],"as":[46],"requirements":[47],"visiting":[49],"specified":[50,84],"nodes,":[51],"turn":[52],"penalties":[53],"prohibitions":[55],"time\u2010dependent":[57],"length":[58],"arcs.":[60],"this":[62],"paper":[63],"we":[64,71,110],"present":[65],"solve":[67],"case":[69],"where":[70],"seek":[72],"when":[76,97],"some":[77],"arcs":[78],"closed":[80],"travelling":[82],"during":[83],"periods":[85,119],"time.":[87],"We":[88],"allow":[89],"parking":[90],"vertices":[93],"network,":[96],"it":[98],"necessary":[100],"to":[101,106],"wait":[102],"an":[104],"arc":[105],"be":[107],"opened,":[108],"but":[109],"also":[111],"assume":[112],"possibility":[114],"\u201cno\u2010parking\u201d":[116],"\u201coccupied\u201d":[118],"nodes.":[122],"This":[123],"type":[124],"emerges,":[127],"example,":[129],"management":[132],"railway":[134],"system,":[135],"network":[138],"narrow":[140],"roads":[141],"with":[142],"convoys":[143],"moving":[144],"it.":[146]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-05-09T13:55:54.758798","created_date":"2025-10-10T00:00:00"}