{"id":"https://openalex.org/W2987767782","doi":"https://doi.org/10.1145/3357000.3366137","title":"Shortest-Path Diversification through Network Penalization","display_name":"Shortest-Path Diversification through Network Penalization","publication_year":2019,"publication_date":"2019-11-01","ids":{"openalex":"https://openalex.org/W2987767782","doi":"https://doi.org/10.1145/3357000.3366137","mag":"2987767782"},"language":"en","primary_location":{"id":"doi:10.1145/3357000.3366137","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3357000.3366137","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3357000.3366137","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 12th ACM SIGSPATIAL International Workshop on Computational Transportation Science","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3357000.3366137","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101534823","display_name":"Dan Cheng","orcid":"https://orcid.org/0000-0002-5973-8523"},"institutions":[{"id":"https://openalex.org/I162714631","display_name":"George Mason University","ror":"https://ror.org/02jqj7156","country_code":"US","type":"education","lineage":["https://openalex.org/I162714631"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Dan Cheng","raw_affiliation_strings":["George Mason University"],"affiliations":[{"raw_affiliation_string":"George Mason University","institution_ids":["https://openalex.org/I162714631"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049941658","display_name":"Olga Gkountouna","orcid":null},"institutions":[{"id":"https://openalex.org/I162714631","display_name":"George Mason University","ror":"https://ror.org/02jqj7156","country_code":"US","type":"education","lineage":["https://openalex.org/I162714631"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Olga Gkountouna","raw_affiliation_strings":["George Mason University"],"affiliations":[{"raw_affiliation_string":"George Mason University","institution_ids":["https://openalex.org/I162714631"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017299501","display_name":"Andreas Z\u00fcfle","orcid":"https://orcid.org/0000-0001-7001-4123"},"institutions":[{"id":"https://openalex.org/I162714631","display_name":"George Mason University","ror":"https://ror.org/02jqj7156","country_code":"US","type":"education","lineage":["https://openalex.org/I162714631"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andreas Z\u00fcfle","raw_affiliation_strings":["George Mason University"],"affiliations":[{"raw_affiliation_string":"George Mason University","institution_ids":["https://openalex.org/I162714631"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001448076","display_name":"Dieter Pfoser","orcid":"https://orcid.org/0000-0001-9197-0069"},"institutions":[{"id":"https://openalex.org/I162714631","display_name":"George Mason University","ror":"https://ror.org/02jqj7156","country_code":"US","type":"education","lineage":["https://openalex.org/I162714631"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dieter Pfoser","raw_affiliation_strings":["George Mason University"],"affiliations":[{"raw_affiliation_string":"George Mason University","institution_ids":["https://openalex.org/I162714631"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054903605","display_name":"Carola Wenk","orcid":"https://orcid.org/0000-0001-9275-5336"},"institutions":[{"id":"https://openalex.org/I114832834","display_name":"Tulane University","ror":"https://ror.org/04vmvtb21","country_code":"US","type":"education","lineage":["https://openalex.org/I114832834"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Carola Wenk","raw_affiliation_strings":["Tulane University"],"affiliations":[{"raw_affiliation_string":"Tulane University","institution_ids":["https://openalex.org/I114832834"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5101534823"],"corresponding_institution_ids":["https://openalex.org/I162714631"],"apc_list":null,"apc_paid":null,"fwci":1.161,"has_fulltext":true,"cited_by_count":19,"citation_normalized_percentile":{"value":0.79722597,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"10"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9990000128746033,"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.9990000128746033,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.994700014591217,"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/T11344","display_name":"Traffic Prediction and Management Techniques","score":0.9945999979972839,"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/betweenness-centrality","display_name":"Betweenness centrality","score":0.8743326663970947},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.8596361875534058},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6674688458442688},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.6177934408187866},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5895739793777466},{"id":"https://openalex.org/keywords/average-path-length","display_name":"Average path length","score":0.5117852091789246},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.48816925287246704},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4588485658168793},{"id":"https://openalex.org/keywords/diversification","display_name":"Diversification (marketing strategy)","score":0.4421333074569702},{"id":"https://openalex.org/keywords/load-balancing","display_name":"Load balancing (electrical power)","score":0.4301041066646576},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.410258024930954},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.23637473583221436},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2168877124786377},{"id":"https://openalex.org/keywords/centrality","display_name":"Centrality","score":0.20382186770439148},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17887169122695923},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.15652650594711304},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.151056170463562},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07534340023994446}],"concepts":[{"id":"https://openalex.org/C117045392","wikidata":"https://www.wikidata.org/wiki/Q4899215","display_name":"Betweenness centrality","level":3,"score":0.8743326663970947},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8596361875534058},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6674688458442688},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.6177934408187866},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5895739793777466},{"id":"https://openalex.org/C91886571","wikidata":"https://www.wikidata.org/wiki/Q432520","display_name":"Average path length","level":4,"score":0.5117852091789246},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.48816925287246704},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4588485658168793},{"id":"https://openalex.org/C180916674","wikidata":"https://www.wikidata.org/wiki/Q3711935","display_name":"Diversification (marketing strategy)","level":2,"score":0.4421333074569702},{"id":"https://openalex.org/C138959212","wikidata":"https://www.wikidata.org/wiki/Q1806783","display_name":"Load balancing (electrical power)","level":3,"score":0.4301041066646576},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.410258024930954},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.23637473583221436},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2168877124786377},{"id":"https://openalex.org/C53811970","wikidata":"https://www.wikidata.org/wiki/Q5062194","display_name":"Centrality","level":2,"score":0.20382186770439148},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17887169122695923},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.15652650594711304},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.151056170463562},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07534340023994446},{"id":"https://openalex.org/C162853370","wikidata":"https://www.wikidata.org/wiki/Q39809","display_name":"Marketing","level":1,"score":0.0},{"id":"https://openalex.org/C144133560","wikidata":"https://www.wikidata.org/wiki/Q4830453","display_name":"Business","level":0,"score":0.0},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3357000.3366137","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3357000.3366137","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3357000.3366137","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 12th ACM SIGSPATIAL International Workshop on Computational Transportation Science","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3357000.3366137","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3357000.3366137","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3357000.3366137","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 12th ACM SIGSPATIAL International Workshop on Computational Transportation Science","raw_type":"proceedings-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.5199999809265137}],"awards":[{"id":"https://openalex.org/G5364773387","display_name":null,"funder_award_id":"CCF-1637541, CCF-1637576","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2987767782.pdf","grobid_xml":"https://content.openalex.org/works/W2987767782.grobid-xml"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W49244725","https://openalex.org/W197429550","https://openalex.org/W1524993602","https://openalex.org/W1557047551","https://openalex.org/W1766637835","https://openalex.org/W1920501755","https://openalex.org/W1989750313","https://openalex.org/W2011282943","https://openalex.org/W2035209810","https://openalex.org/W2077279388","https://openalex.org/W2078948975","https://openalex.org/W2111472333","https://openalex.org/W2122516422","https://openalex.org/W2131058166","https://openalex.org/W2142311862","https://openalex.org/W2145761514","https://openalex.org/W2154434560","https://openalex.org/W2155061423","https://openalex.org/W2169528473","https://openalex.org/W2173413334","https://openalex.org/W2242685411","https://openalex.org/W2296055404","https://openalex.org/W2604146997","https://openalex.org/W2607294481","https://openalex.org/W2770729327","https://openalex.org/W2914284136","https://openalex.org/W3013082658","https://openalex.org/W4210463984","https://openalex.org/W4210896998","https://openalex.org/W4241079583","https://openalex.org/W6637930290","https://openalex.org/W6647738298","https://openalex.org/W6677555952"],"related_works":["https://openalex.org/W2388051136","https://openalex.org/W2357391150","https://openalex.org/W2156431668","https://openalex.org/W2144050074","https://openalex.org/W2161960576","https://openalex.org/W2370345607","https://openalex.org/W2996337372","https://openalex.org/W2300956438","https://openalex.org/W1992129517","https://openalex.org/W2134900907"],"abstract_inverted_index":{"Traditional":[0],"navigation":[1],"systems":[2],"compute":[3],"the":[4,26,30,68,72,76,90,98,119,122],"quantitatively":[5],"shortest":[6,27],"or":[7],"fastest":[8],"route":[9],"between":[10],"two":[11],"locations":[12],"in":[13],"a":[14,19,37,82,101,113],"spatial":[15,102],"network.":[16],"In":[17,52],"practice,":[18],"problem":[20],"resulting":[21],"from":[22],"all":[23],"drivers":[24],"using":[25,71],"path":[28,108],"is":[29],"congregation":[31],"of":[32,67,75,100,121],"individuals":[33],"on":[34],"routes":[35,64],"having":[36],"high":[38],"in-betweenness.":[39],"To":[40],"this":[41,53],"end,":[42],"several":[43],"works":[44],"have":[45],"proposed":[46],"methods":[47],"for":[48,58],"proposing":[49,65],"alternative":[50],"routes.":[51],"work,":[54],"we":[55],"test":[56],"solutions":[57],"traffic":[59],"load-balancing":[60],"by":[61],"computing":[62],"diversified":[63],"variants":[66],"penalty":[69],"method":[70],"road":[73],"network":[74,123],"Washington":[77],"DC":[78],"metropolitan":[79],"area":[80],"as":[81],"case":[83],"study.":[84],"Our":[85],"experimental":[86],"evaluation":[87],"shows":[88],"that":[89,116],"tested":[91],"Penalty-based":[92],"approaches":[93],"allow":[94],"to":[95,105,112],"significantly":[96],"balance":[97],"load":[99],"network,":[103],"compared":[104,111],"existing":[106],"k-shortest":[107],"algorithms,":[109],"and":[110],"naive":[114],"baseline":[115],"randomly":[117],"changes":[118],"weights":[120],"at":[124],"each":[125],"shortest-path":[126],"computation.":[127]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}