Extending a Coupling Metric for Characterization of Traffic Networks: an Application to the Route Choice Problem
Resumo
Esse artigo discute o uso de uma métrica de acoplamento para caracterizar redes de tráfego para uma solução baseada em agentes do Traffic Assignment Problem. Métrica essa, baseada em o quão frequente rotas compartilham arestas entre si e o quão interconectadas elas são. Já que as escolhas de agentes de aprendizagem podem interferir entre si, nós estendemos trabalho anterior enviesando o aprendizado com essa métrica e caracterizando outras instâncias maiores de redes de tráfego.Referências
Bazzan, A. L. C. and Chira, C. (2015). Hybrid evolutionary and reinforcement learning approach to accelerate traffic assignment (extended abstract). In Bordini, R., Elkind, E., Weiss, G., and Yolum, P., editors, Proceedings of the 14th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2015), pages 1723–1724. IFAAMAS.
Ortúzar, J. and Willumsen, L. G. (2001). Modelling Transport. John Wiley & Sons, 3rd edition.
Stefanello, F., da Silva, B. C., and Bazzan, A. L. C. (2016). Using topological statistics to bias and accelerate route choice: preliminary findings in synthetic and real-world road networks. In Proceedings of Ninth International Workshop on Agents in Traffic and Transportation, pages 1–8, New York, USA.
Tumer, K. and Agogino, A. (2006). Agent reward shaping for alleviating traffic congestion. In Workshop on Agents in Traffic and Transportation, Hakodate, Japan.
Yen, J. Y. (1971). Finding the k shortest loopless paths in a network. Management Science, 17(11):712–716.
Ortúzar, J. and Willumsen, L. G. (2001). Modelling Transport. John Wiley & Sons, 3rd edition.
Stefanello, F., da Silva, B. C., and Bazzan, A. L. C. (2016). Using topological statistics to bias and accelerate route choice: preliminary findings in synthetic and real-world road networks. In Proceedings of Ninth International Workshop on Agents in Traffic and Transportation, pages 1–8, New York, USA.
Tumer, K. and Agogino, A. (2006). Agent reward shaping for alleviating traffic congestion. In Workshop on Agents in Traffic and Transportation, Hakodate, Japan.
Yen, J. Y. (1971). Finding the k shortest loopless paths in a network. Management Science, 17(11):712–716.
Publicado
04/05/2017
Como Citar
OLIVEIRA, Thiago B. F.; SILVA, Bruno C. da; STEFANELLO, F.; ZACHOW, Arthur; BAZZAN, Ana L. C..
Extending a Coupling Metric for Characterization of Traffic Networks: an Application to the Route Choice Problem. In: WORKSHOP-ESCOLA DE SISTEMAS DE AGENTES, SEUS AMBIENTES E APLICAÇÕES (WESAAC), 11. , 2017, São Paulo/SP.
Anais [...].
Porto Alegre: Sociedade Brasileira de Computação,
2017
.
p. 47-55.
ISSN 2326-5434.
DOI: https://doi.org/10.5753/wesaac.2017.33227.
