{"title":"Application of Traffic Weighted Multi-Maps Based on Disjoint Routing Areas for Static Traffic Assignment","authors":"Alvaro Paricio-Garcia, Miguel A. López-Carmona","doi":"10.3390/app131810071","DOIUrl":null,"url":null,"abstract":"Urban traffic congestion is a pressing issue, demanding effective and cost-efficient solutions. This paper develops the Traffic Weighted Multi-Maps (TWM) method to solve the Traffic Assignment Problem in Intelligent Transportation Systems (ITS). TWM offers drivers diverse views of the network, promoting path diversity and adaptability. Providing an optimal TWM configuration to the traffic demand in terms of structure and allocation policy is a challenging issue as it usually depends on the size of the network and its complexity. The paper explores TWM generation and assignment by applying routing areas based on semi-disjointed k-shortest paths and allocating them using a per-sub flow optimized assignment policy. This approach allows obtaining a pseudo-optimal solution for static traffic assignment with similar results in terms of total travel time compared to the direct solution of calculating optimal map weights and the theoretical system optimum. It offers a cost-effective solution valid for wide urban areas, as the TWM calculation depends on the variety of the traffic flows and the number of semi-disjoint routing areas considered instead of the network complexity and size. Urban network experiments with synthetic traffic demands are studied under different TWM adoption rates, comparing results with existing traffic assignment policies and estimation methods. It highlights its potential for enhancing urban traffic management. Overall, TWM presents a promising approach to addressing urban traffic congestion efficiently.","PeriodicalId":48760,"journal":{"name":"Applied Sciences-Basel","volume":" ","pages":""},"PeriodicalIF":2.5000,"publicationDate":"2023-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Sciences-Basel","FirstCategoryId":"103","ListUrlMain":"https://doi.org/10.3390/app131810071","RegionNum":4,"RegionCategory":"综合性期刊","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 1
Abstract
Urban traffic congestion is a pressing issue, demanding effective and cost-efficient solutions. This paper develops the Traffic Weighted Multi-Maps (TWM) method to solve the Traffic Assignment Problem in Intelligent Transportation Systems (ITS). TWM offers drivers diverse views of the network, promoting path diversity and adaptability. Providing an optimal TWM configuration to the traffic demand in terms of structure and allocation policy is a challenging issue as it usually depends on the size of the network and its complexity. The paper explores TWM generation and assignment by applying routing areas based on semi-disjointed k-shortest paths and allocating them using a per-sub flow optimized assignment policy. This approach allows obtaining a pseudo-optimal solution for static traffic assignment with similar results in terms of total travel time compared to the direct solution of calculating optimal map weights and the theoretical system optimum. It offers a cost-effective solution valid for wide urban areas, as the TWM calculation depends on the variety of the traffic flows and the number of semi-disjoint routing areas considered instead of the network complexity and size. Urban network experiments with synthetic traffic demands are studied under different TWM adoption rates, comparing results with existing traffic assignment policies and estimation methods. It highlights its potential for enhancing urban traffic management. Overall, TWM presents a promising approach to addressing urban traffic congestion efficiently.
期刊介绍:
Applied Sciences (ISSN 2076-3417) provides an advanced forum on all aspects of applied natural sciences. It publishes reviews, research papers and communications. Our aim is to encourage scientists to publish their experimental and theoretical results in as much detail as possible. There is no restriction on the length of the papers. The full experimental details must be provided so that the results can be reproduced. Electronic files and software regarding the full details of the calculation or experimental procedure, if unable to be published in a normal way, can be deposited as supplementary electronic material.