https://www.scipedia.com/wd/index.php?action=history&feed=atom&title=Mohring_et_al_2015a 2026-04-26T01:23:36Z Revision history for this page on the wiki MediaWiki 1.27.0-wmf.10 https://www.scipedia.com/wd/index.php?title=Mohring_et_al_2015a&diff=216569&oldid=prev 2021-02-16T11:04:28Z

<p>Scipediacontent moved page <a href="/public/Draft_Content_990901827" class="mw-redirect" title="Draft Content 990901827">Draft Content 990901827</a> to <a href="/public/Mohring_et_al_2015a" title="Mohring et al 2015a">Mohring et al 2015a</a></p> <table class="diff diff-contentalign-left" data-mw="interface"> <tr style='vertical-align: top;' lang='en'> <td colspan='1' style="background-color: white; color:black; text-align: center;">← Older revision</td> <td colspan='1' style="background-color: white; color:black; text-align: center;">Revision as of 11:04, 16 February 2021</td> </tr><tr><td colspan='2' style='text-align: center;' lang='en'><div class="mw-diff-empty">(No difference)</div> </td></tr></table>

Scipediacontent https://www.scipedia.com/wd/index.php?title=Mohring_et_al_2015a&diff=216568&oldid=prev 2021-02-16T11:04:25Z

<p>Created page with &quot; == Abstract == Reducing traffic congestion via toll pricing has been a central topic in the operations research and transportation literature and, recently, it has been impl...&quot;</p> <p><b>New page</b></p><div><br /> == Abstract ==<br /> <br /> Reducing traffic congestion via toll pricing has been a central topic in the operations research and transportation literature and, recently, it has been implemented in several cities all over the world. Since, in practice, it is not feasible to impose tolls on every edge of a given traffic network, we study the resulting mathematical problem of computing tolls on a predefined subset of edges of the network so as to minimize the total travel time of the induced equilibrium flow. We first present an analytical study for the special case of parallel edge networks highlighting the intrinsic complexity and nonconvexity of the resulting optimization problem. We then present algorithms for general networks for which we systematically test the solution quality for large-scale network instances. Finally, we discuss the related optimization problem of computing tolls subject to a cardinality constraint on the number of edges that have tolls. © 2015 Wiley Periodicals, Inc. NETWORKS, Vol. 653, 262-285 2015<br /> <br /> <br /> == Original document ==<br /> <br /> The different versions of the original document can be found in:<br /> <br /> * [http://dx.doi.org/10.1002/net.21604 http://dx.doi.org/10.1002/net.21604]<br /> <br /> * [http://page.math.tu-berlin.de/%7Emoehring/adm3/adm3-2015/ComputingNetworkTolls.pdf http://page.math.tu-berlin.de/%7Emoehring/adm3/adm3-2015/ComputingNetworkTolls.pdf]<br /> <br /> * [https://cris.maastrichtuniversity.nl/en/publications/1c29311b-0943-4c8b-b728-641448608824 https://cris.maastrichtuniversity.nl/en/publications/1c29311b-0943-4c8b-b728-641448608824]<br /> <br /> * [http://page.math.tu-berlin.de/~moehring/adm3/adm3-2015/ComputingNetworkTolls.pdf http://page.math.tu-berlin.de/~moehring/adm3/adm3-2015/ComputingNetworkTolls.pdf],<br /> : [https://onlinelibrary.wiley.com/doi/abs/10.1002/net.21604 https://onlinelibrary.wiley.com/doi/abs/10.1002/net.21604],<br /> : [https://www.narcis.nl/publication/RecordID/oai%3Acris.maastrichtuniversity.nl%3Apublications%2F1c29311b-0943-4c8b-b728-641448608824 https://www.narcis.nl/publication/RecordID/oai%3Acris.maastrichtuniversity.nl%3Apublications%2F1c29311b-0943-4c8b-b728-641448608824],<br /> : [http://page.math.tu-berlin.de/~moehring/adm3/adm3-2013/ComputingNetworkTolls.pdf http://page.math.tu-berlin.de/~moehring/adm3/adm3-2013/ComputingNetworkTolls.pdf],<br /> : [https://dblp.uni-trier.de/db/journals/networks/networks65.html#HarksKKM15 https://dblp.uni-trier.de/db/journals/networks/networks65.html#HarksKKM15],<br /> : [http://researchers-sbe.unimaas.nl/tobiasharks/wp-content/uploads/sites/29/2014/02/HHKM-2013.pdf http://researchers-sbe.unimaas.nl/tobiasharks/wp-content/uploads/sites/29/2014/02/HHKM-2013.pdf],<br /> : [https://dl.acm.org/citation.cfm?id=2885338.2885343 https://dl.acm.org/citation.cfm?id=2885338.2885343],<br /> : [https://cris.maastrichtuniversity.nl/en/publications/computing-network-tolls-with-support-constraints https://cris.maastrichtuniversity.nl/en/publications/computing-network-tolls-with-support-constraints],<br /> : [https://core.ac.uk/display/90648879 https://core.ac.uk/display/90648879],<br /> : [https://academic.microsoft.com/#/detail/2126014631 https://academic.microsoft.com/#/detail/2126014631]<br /> <br /> * [https://api.wiley.com/onlinelibrary/tdm/v1/articles/10.1002%2Fnet.21604 https://api.wiley.com/onlinelibrary/tdm/v1/articles/10.1002%2Fnet.21604],<br /> : [http://onlinelibrary.wiley.com/wol1/doi/10.1002/net.21604/fullpdf http://onlinelibrary.wiley.com/wol1/doi/10.1002/net.21604/fullpdf],<br /> : [http://dx.doi.org/10.1002/net.21604 http://dx.doi.org/10.1002/net.21604] under the license http://doi.wiley.com/10.1002/tdm_license_1.1<br /> <br /> * [https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/53051 https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/53051],<br /> : [https://doi.org/10.1002/net.21604 https://doi.org/10.1002/net.21604]</div>

Scipediacontent