Application of traffic weighted multi-maps based on disjoint routing areas for static traffic assignment

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, promo...

ver descrição completa

Detalhes bibliográficos
Autores: Paricio García, Álvaro|||0000-0002-9162-4147, López Carmona, Miguel Ángel|||0000-0001-9228-1863
Tipo de documento: artigo
Data de publicação:2023
País:España
Recursos:Universidad de Alcalá (UAH)
Repositório:e_Buah Biblioteca Digital Universidad de Alcalá
Idioma:inglês
OAI Identifier:oai:ebuah.uah.es:10017/60361
Acesso em linha:http://hdl.handle.net/10017/60361
https://dx.doi.org/10.3390/app131810071
Access Level:Acceso aberto
Palavra-chave:Traffic assignment
Traffic control
Vehicle routing
Intelligent transportation systems
Traffic big data
Decision making
Evolutionary algorithms
Multi-map routing
TWM
Path flows
Informática
Computer science
id ES_6760a5bb0eb4c12811db5266ceef4e62
oai_identifier_str oai:ebuah.uah.es:10017/60361
network_acronym_str ES
network_name_str España
repository_id_str
spelling Application of traffic weighted multi-maps based on disjoint routing areas for static traffic assignmentParicio García, Álvaro|||0000-0002-9162-4147López Carmona, Miguel Ángel|||0000-0001-9228-1863Traffic assignmentTraffic controlVehicle routingIntelligent transportation systemsTraffic big dataDecision makingEvolutionary algorithmsMulti-map routingTWMPath flowsInformáticaComputer scienceUrban 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.Universidad de AlcaláMDPI20232023-09-06journal articlehttp://purl.org/coar/resource_type/c_6501NAhttp://purl.org/coar/version/c_be7fb7dd8ff6fe43info:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10017/60361https://dx.doi.org/10.3390/app131810071reponame:e_Buah Biblioteca Digital Universidad de Alcaláinstname:Universidad de Alcalá (UAH)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2Attribution-NonCommercial-NoDerivatives 4.0 Internationalhttp://creativecommons.org/licenses/by-nc-nd/4.0/info:eu-repo/semantics/openAccessoai:ebuah.uah.es:10017/603612026-06-18T11:13:07Z
dc.title.none.fl_str_mv Application of traffic weighted multi-maps based on disjoint routing areas for static traffic assignment
title Application of traffic weighted multi-maps based on disjoint routing areas for static traffic assignment
spellingShingle Application of traffic weighted multi-maps based on disjoint routing areas for static traffic assignment
Paricio García, Álvaro|||0000-0002-9162-4147
Traffic assignment
Traffic control
Vehicle routing
Intelligent transportation systems
Traffic big data
Decision making
Evolutionary algorithms
Multi-map routing
TWM
Path flows
Informática
Computer science
title_short Application of traffic weighted multi-maps based on disjoint routing areas for static traffic assignment
title_full Application of traffic weighted multi-maps based on disjoint routing areas for static traffic assignment
title_fullStr Application of traffic weighted multi-maps based on disjoint routing areas for static traffic assignment
title_full_unstemmed Application of traffic weighted multi-maps based on disjoint routing areas for static traffic assignment
title_sort Application of traffic weighted multi-maps based on disjoint routing areas for static traffic assignment
dc.creator.none.fl_str_mv Paricio García, Álvaro|||0000-0002-9162-4147
López Carmona, Miguel Ángel|||0000-0001-9228-1863
author Paricio García, Álvaro|||0000-0002-9162-4147
author_facet Paricio García, Álvaro|||0000-0002-9162-4147
López Carmona, Miguel Ángel|||0000-0001-9228-1863
author_role author
author2 López Carmona, Miguel Ángel|||0000-0001-9228-1863
author2_role author
dc.subject.none.fl_str_mv Traffic assignment
Traffic control
Vehicle routing
Intelligent transportation systems
Traffic big data
Decision making
Evolutionary algorithms
Multi-map routing
TWM
Path flows
Informática
Computer science
topic Traffic assignment
Traffic control
Vehicle routing
Intelligent transportation systems
Traffic big data
Decision making
Evolutionary algorithms
Multi-map routing
TWM
Path flows
Informática
Computer science
description 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.
publishDate 2023
dc.date.none.fl_str_mv 2023
2023-09-06
dc.type.none.fl_str_mv journal article
http://purl.org/coar/resource_type/c_6501
NA
http://purl.org/coar/version/c_be7fb7dd8ff6fe43
dc.type.openaire.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv http://hdl.handle.net/10017/60361
https://dx.doi.org/10.3390/app131810071
url http://hdl.handle.net/10017/60361
https://dx.doi.org/10.3390/app131810071
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
Attribution-NonCommercial-NoDerivatives 4.0 International
http://creativecommons.org/licenses/by-nc-nd/4.0/
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
Attribution-NonCommercial-NoDerivatives 4.0 International
http://creativecommons.org/licenses/by-nc-nd/4.0/
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv MDPI
publisher.none.fl_str_mv MDPI
dc.source.none.fl_str_mv reponame:e_Buah Biblioteca Digital Universidad de Alcalá
instname:Universidad de Alcalá (UAH)
instname_str Universidad de Alcalá (UAH)
reponame_str e_Buah Biblioteca Digital Universidad de Alcalá
collection e_Buah Biblioteca Digital Universidad de Alcalá
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869409885706256384
score 15,300719

Registros relacionados