On Socially Optimal Traffic Flow in the Presence of Random Users
Traffic assignment is an integral part of urban city planning. Roads and freeways are constructed to cater to the expected demands of the commuters between different origin-destination pairs with the overall objective of minimising the travel cost. As compared to static traffic assignment problems w...
Gespeichert in:
| Hauptverfasser: | , , , , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Chopra, Anant Kalhan, Deepak S Bedi, Amrit S Gupta, Abhishek K Rajawat, Ketan |
| description | Traffic assignment is an integral part of urban city planning. Roads and
freeways are constructed to cater to the expected demands of the commuters
between different origin-destination pairs with the overall objective of
minimising the travel cost. As compared to static traffic assignment problems
where the traffic network is fixed over time, a dynamic traffic network is more
realistic where the network's cost parameters change over time due to the
presence of random congestion. In this paper, we consider a stochastic version
of the traffic assignment problem where the central planner is interested in
finding an optimal social flow in the presence of random users. These users are
random and cannot be controlled by any central directives. We propose a
Frank-Wolfe algorithm based stochastic algorithm to determine the socially
optimal flow for the stochastic setting in an online manner. Further,
simulation results corroborate the efficacy of the proposed algorithm. |
| doi_str_mv | 10.48550/arxiv.1810.07934 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1810_07934</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1810_07934</sourcerecordid><originalsourceid>FETCH-LOGICAL-a674-550fe715896c3e0ae05b0c0e526660812f5a9388e40265a5fdbf9292dc6f4f233</originalsourceid><addsrcrecordid>eNotj81OwzAQhH3hgAoPwIl9gRTHf7FvoIoCUqUgCOdo6-yKSG5SORXQtyeUnkaaw3zzCXFTyqXx1so7zD_917L0cyGroM2luK8HeB9jjykdod4f-h0maDIy9xHWafyGfoDDJ8FrpomGSDAyvOHQjTv4mChPV-KCMU10fc6FaNaPzeq52NRPL6uHTYGuMsUMZ6pK64OLmiSStFsZJVnlnJO-VGwxaO_JSOUsWu62HFRQXXRsWGm9ELf_syeFdp_no_nY_qm0JxX9C0IjQkE</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>On Socially Optimal Traffic Flow in the Presence of Random Users</title><source>arXiv.org</source><creator>Chopra, Anant ; Kalhan, Deepak S ; Bedi, Amrit S ; Gupta, Abhishek K ; Rajawat, Ketan</creator><creatorcontrib>Chopra, Anant ; Kalhan, Deepak S ; Bedi, Amrit S ; Gupta, Abhishek K ; Rajawat, Ketan</creatorcontrib><description>Traffic assignment is an integral part of urban city planning. Roads and
freeways are constructed to cater to the expected demands of the commuters
between different origin-destination pairs with the overall objective of
minimising the travel cost. As compared to static traffic assignment problems
where the traffic network is fixed over time, a dynamic traffic network is more
realistic where the network's cost parameters change over time due to the
presence of random congestion. In this paper, we consider a stochastic version
of the traffic assignment problem where the central planner is interested in
finding an optimal social flow in the presence of random users. These users are
random and cannot be controlled by any central directives. We propose a
Frank-Wolfe algorithm based stochastic algorithm to determine the socially
optimal flow for the stochastic setting in an online manner. Further,
simulation results corroborate the efficacy of the proposed algorithm.</description><identifier>DOI: 10.48550/arxiv.1810.07934</identifier><language>eng</language><subject>Computer Science - Systems and Control</subject><creationdate>2018-10</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,777,882</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1810.07934$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1810.07934$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Chopra, Anant</creatorcontrib><creatorcontrib>Kalhan, Deepak S</creatorcontrib><creatorcontrib>Bedi, Amrit S</creatorcontrib><creatorcontrib>Gupta, Abhishek K</creatorcontrib><creatorcontrib>Rajawat, Ketan</creatorcontrib><title>On Socially Optimal Traffic Flow in the Presence of Random Users</title><description>Traffic assignment is an integral part of urban city planning. Roads and
freeways are constructed to cater to the expected demands of the commuters
between different origin-destination pairs with the overall objective of
minimising the travel cost. As compared to static traffic assignment problems
where the traffic network is fixed over time, a dynamic traffic network is more
realistic where the network's cost parameters change over time due to the
presence of random congestion. In this paper, we consider a stochastic version
of the traffic assignment problem where the central planner is interested in
finding an optimal social flow in the presence of random users. These users are
random and cannot be controlled by any central directives. We propose a
Frank-Wolfe algorithm based stochastic algorithm to determine the socially
optimal flow for the stochastic setting in an online manner. Further,
simulation results corroborate the efficacy of the proposed algorithm.</description><subject>Computer Science - Systems and Control</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj81OwzAQhH3hgAoPwIl9gRTHf7FvoIoCUqUgCOdo6-yKSG5SORXQtyeUnkaaw3zzCXFTyqXx1so7zD_917L0cyGroM2luK8HeB9jjykdod4f-h0maDIy9xHWafyGfoDDJ8FrpomGSDAyvOHQjTv4mChPV-KCMU10fc6FaNaPzeq52NRPL6uHTYGuMsUMZ6pK64OLmiSStFsZJVnlnJO-VGwxaO_JSOUsWu62HFRQXXRsWGm9ELf_syeFdp_no_nY_qm0JxX9C0IjQkE</recordid><startdate>20181018</startdate><enddate>20181018</enddate><creator>Chopra, Anant</creator><creator>Kalhan, Deepak S</creator><creator>Bedi, Amrit S</creator><creator>Gupta, Abhishek K</creator><creator>Rajawat, Ketan</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20181018</creationdate><title>On Socially Optimal Traffic Flow in the Presence of Random Users</title><author>Chopra, Anant ; Kalhan, Deepak S ; Bedi, Amrit S ; Gupta, Abhishek K ; Rajawat, Ketan</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a674-550fe715896c3e0ae05b0c0e526660812f5a9388e40265a5fdbf9292dc6f4f233</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><topic>Computer Science - Systems and Control</topic><toplevel>online_resources</toplevel><creatorcontrib>Chopra, Anant</creatorcontrib><creatorcontrib>Kalhan, Deepak S</creatorcontrib><creatorcontrib>Bedi, Amrit S</creatorcontrib><creatorcontrib>Gupta, Abhishek K</creatorcontrib><creatorcontrib>Rajawat, Ketan</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Chopra, Anant</au><au>Kalhan, Deepak S</au><au>Bedi, Amrit S</au><au>Gupta, Abhishek K</au><au>Rajawat, Ketan</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On Socially Optimal Traffic Flow in the Presence of Random Users</atitle><date>2018-10-18</date><risdate>2018</risdate><abstract>Traffic assignment is an integral part of urban city planning. Roads and
freeways are constructed to cater to the expected demands of the commuters
between different origin-destination pairs with the overall objective of
minimising the travel cost. As compared to static traffic assignment problems
where the traffic network is fixed over time, a dynamic traffic network is more
realistic where the network's cost parameters change over time due to the
presence of random congestion. In this paper, we consider a stochastic version
of the traffic assignment problem where the central planner is interested in
finding an optimal social flow in the presence of random users. These users are
random and cannot be controlled by any central directives. We propose a
Frank-Wolfe algorithm based stochastic algorithm to determine the socially
optimal flow for the stochastic setting in an online manner. Further,
simulation results corroborate the efficacy of the proposed algorithm.</abstract><doi>10.48550/arxiv.1810.07934</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.1810.07934 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_1810_07934 |
| source | arXiv.org |
| subjects | Computer Science - Systems and Control |
| title | On Socially Optimal Traffic Flow in the Presence of Random Users |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-18T00%3A34%3A43IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=On%20Socially%20Optimal%20Traffic%20Flow%20in%20the%20Presence%20of%20Random%20Users&rft.au=Chopra,%20Anant&rft.date=2018-10-18&rft_id=info:doi/10.48550/arxiv.1810.07934&rft_dat=%3Carxiv_GOX%3E1810_07934%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |