{"id":"https://openalex.org/W2213493905","doi":"https://doi.org/10.1145/2812428.2812450","title":"Dynamic routing using maximal road capacity","display_name":"Dynamic routing using maximal road capacity","publication_year":2015,"publication_date":"2015-06-25","ids":{"openalex":"https://openalex.org/W2213493905","doi":"https://doi.org/10.1145/2812428.2812450","mag":"2213493905"},"language":"en","primary_location":{"id":"doi:10.1145/2812428.2812450","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2812428.2812450","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 16th International Conference on Computer Systems and Technologies","raw_type":"proceedings-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/A5039878081","display_name":"L\u00e9on Rothkrantz","orcid":"https://orcid.org/0000-0001-9821-088X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"L\u00e9on Rothkrantz","raw_affiliation_strings":[""],"affiliations":[{"raw_affiliation_string":"","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5039878081"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3168,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.87327673,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"10","issue":null,"first_page":"30","last_page":"37"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9997000098228455,"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.9997000098228455,"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.9994999766349792,"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/T11344","display_name":"Traffic Prediction and Management Techniques","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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.7483752965927124},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6950176954269409},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.652042806148529},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.609525740146637},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5398608446121216},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5230587124824524},{"id":"https://openalex.org/keywords/private-network-to-network-interface","display_name":"Private Network-to-Network Interface","score":0.5026233196258545},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.44406795501708984},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.43087825179100037},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.4232307970523834},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.35024383664131165},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3090660870075226},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.1595386266708374},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.07288578152656555}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7483752965927124},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6950176954269409},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.652042806148529},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.609525740146637},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5398608446121216},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5230587124824524},{"id":"https://openalex.org/C204348804","wikidata":"https://www.wikidata.org/wiki/Q3888133","display_name":"Private Network-to-Network Interface","level":5,"score":0.5026233196258545},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.44406795501708984},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.43087825179100037},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.4232307970523834},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.35024383664131165},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3090660870075226},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.1595386266708374},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.07288578152656555},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2812428.2812450","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2812428.2812450","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 16th International Conference on Computer Systems and Technologies","raw_type":"proceedings-article"},{"id":"pmh:oai:tudelft.nl:uuid:61d1ed60-aa46-4e70-9c9b-3bb54b3bfe22","is_oa":false,"landing_page_url":"http://resolver.tudelft.nl/uuid:61d1ed60-aa46-4e70-9c9b-3bb54b3bfe22","pdf_url":null,"source":{"id":"https://openalex.org/S4306400906","display_name":"Research Repository (Delft University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98358874","host_organization_name":"Delft University of Technology","host_organization_lineage":["https://openalex.org/I98358874"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"conference paper"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.75,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W2004269930","https://openalex.org/W2041656915","https://openalex.org/W2076976887","https://openalex.org/W2082878954","https://openalex.org/W2088769880","https://openalex.org/W2122772180","https://openalex.org/W2137073837","https://openalex.org/W2160719284","https://openalex.org/W2169528473","https://openalex.org/W2256044306","https://openalex.org/W2913425267","https://openalex.org/W3142600612","https://openalex.org/W4297974599"],"related_works":["https://openalex.org/W2154023691","https://openalex.org/W2064711473","https://openalex.org/W1972487624","https://openalex.org/W1515277195","https://openalex.org/W2186932829","https://openalex.org/W2121598558","https://openalex.org/W2237860883","https://openalex.org/W1698965822","https://openalex.org/W1971025399","https://openalex.org/W1579931977"],"abstract_inverted_index":{"Current":[0],"routing":[1,22,24],"devices":[2],"route":[3,78],"an":[4,38],"individual":[5,77],"car":[6,29,67],"driver":[7],"from":[8],"start":[9],"to":[10],"destination":[11],"in":[12,31,87,95],"the":[13,25,32,43,59,63,75],"shortest":[14,33,44,76],"time.":[15,34,89],"In":[16],"this":[17],"paper":[18],"we":[19],"propose":[20],"a":[21,84,102],"algorithm,":[23],"whole":[26],"population":[27],"of":[28,42,47,51,105],"drivers":[30,68],"The":[35,90],"algorithm":[36,46,91],"is":[37],"adapted":[39],"dynamic":[40],"version":[41],"path":[45],"Dijkstra,":[48],"taking":[49],"care":[50],"current":[52],"and":[53,98],"future":[54],"changing":[55],"traffic":[56],"loads":[57],"on":[58],"highways.":[60],"To":[61],"use":[62],"maximal":[64],"road":[65],"capacity":[66],"will":[69],"be":[70],"routed":[71],"not":[72],"only":[73],"via":[74,81],"but":[79],"also":[80],"routes":[82],"with":[83],"small":[85],"variation":[86],"traveling":[88],"has":[92],"been":[93],"tested":[94],"real":[96],"life":[97],"simulation":[99],"studies":[100],"using":[101],"historic":[103],"dataset":[104],"tracked":[106],"cars.":[107]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}