메뉴 건너뛰기




Volumn , Issue , 2015, Pages 43-50

An evolutionary approach to traffic assignment

Author keywords

[No Author keywords available]

Indexed keywords

GENETIC ALGORITHMS; ITERATIVE METHODS; TRAVEL TIME;

EID: 84922495754     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CIVTS.2014.7009476     Document Type: Conference Paper
Times cited : (18)

References (20)
  • 1
    • 0038183237 scopus 로고    scopus 로고
    • How bad is selfish routing?
    • T. Roughgarden and E. Tardos, "How bad is selfish routing?" J. ACM, vol. 49, no. 2, pp. 236-259, 2002.
    • (2002) J. ACM , vol.49 , Issue.2 , pp. 236-259
    • Roughgarden, T.1    Tardos, E.2
  • 2
    • 34250513249 scopus 로고
    • Über ein paradoxon aus der verkehrsplanung
    • D. Braess, "Über ein Paradoxon aus der Verkehrsplanung," Unternehmensforschung, vol. 12, p. 258, 1968.
    • (1968) Unternehmensforschung , vol.12 , pp. 258
    • Braess, D.1
  • 6
    • 4444318795 scopus 로고    scopus 로고
    • Ph.D. dissertation, University of Cologne, Cologne, Germany. [Online]. Available:
    • C. Gawron, "Simulation-based traffic assignment," Ph.D. dissertation, University of Cologne, Cologne, Germany, 1998. [Online]. Available: www.zaik.uni-koeln.de/AFS/publications/theses.html
    • (1998) Simulation-based Traffic Assignment
    • Gawron, C.1
  • 8
    • 0013316758 scopus 로고    scopus 로고
    • Dynamic network traffic assignment and simulation methodology for advanced system management applications
    • H. S. Mahmassani, "Dynamic network traffic assignment and simulation methodology for advanced system management applications," Networks and Spatial Economics, vol. 1, no. 3-4, pp. 267-292, 2001.
    • (2001) Networks and Spatial Economics , vol.1 , Issue.3-4 , pp. 267-292
    • Mahmassani, H.S.1
  • 9
    • 0034333576 scopus 로고    scopus 로고
    • A predictive dynamic traffic assignment model in congested capacity-constrained road networks
    • C. Tong and S. Wong, "A predictive dynamic traffic assignment model in congested capacity-constrained road networks," Transportation Research Part B: Methodological, vol. 34, no. 8, pp. 625-644, 2000.
    • (2000) Transportation Research Part B: Methodological , vol.34 , Issue.8 , pp. 625-644
    • Tong, C.1    Wong, S.2
  • 10
    • 0034325030 scopus 로고    scopus 로고
    • Fuzzy route choice model for traffic assignment
    • V. Henn, "Fuzzy route choice model for traffic assignment," Fuzzy Sets and Systems, vol. 116, no. 1, pp. 77-101, 2000.
    • (2000) Fuzzy Sets and Systems , vol.116 , Issue.1 , pp. 77-101
    • Henn, V.1
  • 11
    • 84868546030 scopus 로고    scopus 로고
    • Application of genetic algorithms for joint optimization of signal setting parameters and dynamic traffic assignment for the real network data
    • H. Varia, P. Gundaliya, and S. Dhingra, "Application of genetic algorithms for joint optimization of signal setting parameters and dynamic traffic assignment for the real network data," Research in Transportation Economics, vol. 38, no. 1, pp. 35-44, 2013.
    • (2013) Research in Transportation Economics , vol.38 , Issue.1 , pp. 35-44
    • Varia, H.1    Gundaliya, P.2    Dhingra, S.3
  • 14
    • 84922553704 scopus 로고    scopus 로고
    • Learning-based traffic assignment: How heterogeneity in route choices pays off
    • F. Klügl, J. Vokrinek, and G. Vizzari, Eds, 2014 held at the 13th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS
    • A. L. C. Bazzan, "Learning-based traffic assignment: how heterogeneity in route choices pays off," in Proceedings of the 8th International Workshop on Agents in Traffic and Transportation (ATT-2014), F. Klügl, J. Vokrinek, and G. Vizzari, Eds., 2014, held at the 13th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2014).
    • (2014) Proceedings of the 8th International Workshop on Agents in Traffic and Transportation (ATT-2014)
    • Bazzan, A.L.C.1
  • 16
    • 4544287387 scopus 로고    scopus 로고
    • Route decision behaviour in a commuting scenario
    • [Online]. Available
    • F. Klügl and A. L. C. Bazzan, "Route decision behaviour in a commuting scenario," Journal of Artificial Societies and Social Simulation, vol. 7, no. 1, 2004. [Online]. Available: jasss.soc.surrey.ac.uk/7/1/1.html
    • (2004) Journal of Artificial Societies and Social Simulation , vol.7 , Issue.1
    • Klügl, F.1    Bazzan, A.L.C.2
  • 18
    • 57049167684 scopus 로고    scopus 로고
    • Re-routing agents in an abstract traffic scenario
    • G. Zaverucha and A. L. da Costa, Eds., no. 5249. Berlin: Springer-Verlag, [Online]. Available
    • A. L. C. Bazzan and F. Klügl, "Re-routing agents in an abstract traffic scenario," in Advances in artificial intelligence, ser. Lecture Notes in Artificial Intelligence, G. Zaverucha and A. L. da Costa, Eds., no. 5249. Berlin: Springer-Verlag, 2008, pp. 63-72. [Online]. Available: www.inf.ufrgs.br/maslab/pergamus/pubs/BazzanKluegl.pdf.zip
    • (2008) Advances in Artificial Intelligence, Ser. Lecture Notes in Artificial Intelligence , pp. 63-72
    • Bazzan, A.L.C.1    Klügl, F.2
  • 20
    • 0000663732 scopus 로고
    • Finding the k shortest loopless paths in a network
    • [Online]. Available
    • J. Y. Yen, "Finding the k shortest loopless paths in a network," Management Science, vol. 17, no. 11, pp. 712-716, 1971. [Online]. Available: http://pubsonline.informs.org/doi/abs/10.1287/mnsc.17.11.712
    • (1971) Management Science , vol.17 , Issue.11 , pp. 712-716
    • Yen, J.Y.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.