A Parallelized Algorithm for a Real-Time Traffic Recommendations Architecture Based in Multi-agents
暂无分享,去创建一个
Pedro Oscar Pérez Murueta | Cesar Cárdenas Pérez | Jorge Adolfo Ramirez Uresti | Pedro Oscar Perez Murueta | Cesar Raul Cardenas Perez | J. R. Ramírez Uresti
[1] Subhash Suri,et al. Finding the k Shortest Simple Paths: A New Algorithm and Its Implementation. , 2003 .
[2] Anna Nagurney,et al. On a Paradox of Traffic Planning , 2005, Transp. Sci..
[3] E. Lawler. A PROCEDURE FOR COMPUTING THE K BEST SOLUTIONS TO DISCRETE OPTIMIZATION PROBLEMS AND ITS APPLICATION TO THE SHORTEST PATH PROBLEM , 1972 .
[4] M. C. Sinclair,et al. A Comparative Study of k-Shortest Path Algorithms , 1996 .
[5] Toshihide Ibaraki,et al. An efficient algorithm for K shortest simple paths , 1982, Networks.
[6] J. Y. Yen,et al. Finding the K Shortest Loopless Paths in a Network , 2007 .
[7] Richard Pavley,et al. A Method for the Solution of the Nth Best Path Problem , 1959, JACM.
[8] César Cárdenas,et al. Intelligent System for Real-Time Traffic Recommendations , 2014, Res. Comput. Sci..
[9] David Eppstein,et al. Finding the k Shortest Paths , 1999, SIAM J. Comput..
[10] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .
[11] Licia Capra,et al. Urban Computing: Concepts, Methodologies, and Applications , 2014, TIST.
[12] João Leite,et al. A Survey of Programming Languages and Platforms for Multi-Agent Systems , 2006, Informatica.
[13] T. Walsh,et al. Finding Multi-criteria Optimal Paths in Multi-modal Public Transportation Networks using the Transit Algorithm , 2012 .
[14] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.