EDP Sciences logo
Web of Conferences logo
Search
Menu
All issues Volume 365 (2023) E3S Web of Conf., 365 (2023) 05013 References
Open Access
Issue
E3S Web of Conf.
Volume 365, 2023
IV International Scientific Conference “Construction Mechanics, Hydraulics and Water Resources Engineering” (CONMECHYDRO - 2022)
Article Number 05013
Number of page(s) 14
Section Engineering Materials Science, Intelligent Transport Systems and Transport Logistics
DOI https://doi.org/10.1051/e3sconf/202336505013
Published online 30 January 2023
  1. Shvetsov V I 2003 Matematicheskoye modelirovaniye transportnix potokov / V.I. Shvetsov Avtomatika i telemexanika V 11 pp 3–46 [Google Scholar]
  2. Ortuzar J D and Willumsen L G 2011 Modeling Transport. 4th Edition. (USA: John Wiley & Sons Ltd) p 581 [Google Scholar]
  3. Yeremin S V, Teselkin A A, Xabarova K V and Xabarov V I 2013 Intellektualnaya sistema dlya strategicheskogo upravleniya passajirskim kompleksom Krasnoyarska i aglomeratsii Byulleten transportnoy informatsii V 2(212) pp 9–13 [Google Scholar]
  4. Yakimov M R 2013 Transportnoye planirovaniye: sozdaniye transportnix modeley gorodov: monografiy (M.: Logos) p 188 [Google Scholar]
  5. Teselkin A A 2016 Statisticheskiye podxodi k otsenke transportnix korrespondensiy po dannim nablyudeniy «Nauka. Texnologii. Innovatsii».Sbornik nauchnix trudov: (v 9 ch. – Novosibirsk: Izd-vo NGTU) V 2 pp 244–246 [Google Scholar]
  6. Brumitt B 2007 (http://igniteseattle.com/index.php?s=brumitt) [Google Scholar]
  7. Brumitt B 2007 (http://googleblog.blogspot.com/2007/11/road-to-better-path-finding.html) [Google Scholar]
  8. Brumitt B 2007 The road to better path finding)http://googleblog.blogspot.eom/2007/11/road-to-better-path-finding.hlml) [Google Scholar]
  9. Dean J and Ghemawat S 2004 Mapreduce: Simplified data processing on large clusters, Proceedings of the Sixth Symposium on Operating System Design and Implementation (OSDI) (San Francisco, CA) [Google Scholar]
  10. Abraham I, Delling D, Goldberg A V and Werneck R F 2013 Alternative routes in road networks Journal of Experimental Algorithmics (JEA) V 18 [Google Scholar]
  11. Goldberg A V and Harrelson C 2005 Computing the shortest path A * search meets graph theory, SODA ’05: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms (Philadelphia, PA, USA), Society for Industrial and Applied Mathematics pp 156–165. [Google Scholar]
  12. Goldberg A V and Werneck R F 2007 Better landmarks within reach WEA (Camil Demetrescu, ed.), Lecture Notes in Computer Science (Springer) V 4525 pp 38–51 [Google Scholar]
  13. Gutman R J 2004 Peach-based routing A new approach to shortest path algorithms optimized for road networks, ALENEX/ANALC pp 100–111 [Google Scholar]
  14. Sanders P and Schultes D 2005 Highway hierarchies hasten exact shortest path queries ESA (Gerth Stlting Brodal and Stefano Leonardi, eds.) Lecture Notes in Computer Science (Springer) V 3669 pp 568–579 [Google Scholar]
  15. Sanders P and Schultes D 2007 Engineering fast route planning algorithms WEA (Camil Demetrescu, ed.), Lecture Notes in Computer Science (Springer) V 4525 pp 23–36 [Google Scholar]
  16. Bast H, Funke S, Sanders P and Schultes D 2007 Fast routing in road networks with transit nodes (Science 316) V 5824 p 566 [Google Scholar]
  17. Madduri K, Bader D A, Berry J W and Crobak J R 2007 An experimental study of a parallel shortest path algorithm for solving large-scale graph instances Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX), New Orleans, Louisiana [Google Scholar]
  18. Schulz F, Wagner D and Weihe K 2000 Dijkstas’s algorithm on-line: an empirical case study from public railroad transport J. Exp. Algorithmics V 5 p 12 [CrossRef] [Google Scholar]
  19. Holzer M, Schulz F and Wagner D 2006 Engineering multi-level overlay graphs for shortest-path queries, Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments (ALENEX) SIAM pp. 156–170 [Google Scholar]
  20. Lebedeva O A 2018 Optimizasiya marshrutnoy seti gorodskogo obshestvennogo transporta Vestnik AnGTU V 12 pp 185–188 [Google Scholar]
  21. Ximmelblau D 1975 Prikladnoye nelineynoye programmirovaniye (M: Mir) p 530 [Google Scholar]
  22. Yager R R and Zadeh L A 1994 Fuzzy sets, neural networks and Soft Computing VAN Nostrand Reinhold (New York) p 440 [Google Scholar]
  23. Egamberdiev N, Mukhamedieva D and Khasanov U 2020 Presentation of preferences in multi-criterional tasks of decision-making Journal of Physics Conference Seriesoktabr 1441(1) [Google Scholar]
  24. Muhamediyeva D T 2020 Particle swarm method for solving the global optimization problem using the equilibrium coefficient Journal of Physics: Conference Series, 1441(1), 012153 [Google Scholar]
  25. Muhamediyeva D T 2020 Fuzzy cultural algorithm for solving optimization problems Journal of Physics: Conference Series, 1441(1), 012152 [CrossRef] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.