Latest revision as of 23:38, 28 January 2021

Abstract

Traffic congestion has been proven a difficult problem to tackle, particularly in big cities where the number of cars are steadily increasing while the infrastructure remains stagnant. Several approaches have been proposed to alleviate the effects of traffic congestion, however, so far congestion is still a big problem in most cities. In this work we investigate a new route reservation approach to address the problem which is motivated by air traffic control. This paper formulates the route reservation problem under different assumptions and examines the complexity of the resulting formulations. Two waiting strategies are investigated, (i) vehicles are allowed to wait at the source before they start their journey, and (ii) they are allowed to wait at every road junction. Strategy (i) though more practical to implement, results to an NP-complete problem while strategy (ii) results to a problem that can be solved in polynomial time but it is not easily implemented since the infrastructure does not have adequate space for vehicles to wait until congestion downstream is cleared. Finally, a heuristic algorithm (based on time-expanded networks) is derived as a solution to both proposed waiting strategies. © 20xx IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works C. Menelaou, P. Kolios, S. Timotheou and C. Panayiotou, "On the Complexity of Congestion Free Routing in Transportation Networks," 2015 IEEE 18th International Conference on Intelligent Transportation Systems, Las Palmas, 2015, pp. 2819-2824. doi: 10.1109/ITSC.2015.453

Document type: Conference object

Full document

Original document

The different versions of the original document can be found in:

• http://gnosis.library.ucy.ac.cy/handle/7/44205 under the license https://creativecommons.org/licenses/by

• https://zenodo.org/record/1252132

• https://zenodo.org/record/1252132/files/TDSPv2.pdf under the license http://creativecommons.org/licenses/by/4.0/legalcode

• http://xplorestaging.ieee.org/ielx7/7307301/7312804/07313545.pdf?arnumber=7313545,

http://dx.doi.org/10.1109/itsc.2015.453 under the license cc-by

• https://dblp.uni-trier.de/db/conf/itsc/itsc2015.html#MenelaouKTP15a,

http://dx.doi.org/10.1109/ITSC.2015.453,

http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=7313545,

https://trid.trb.org/view/1406185,

https://academic.microsoft.com/#/detail/1956351449