Výsledky vyhledávání - "Shortest-path algorithms"

BikewaySim Expected to Improve Bicycle Infrastructure Planning Process

Autoři: Passmore, Reid Guensler, Randall Watkins, Kari E

Témata: Bicycle lanes, bicycling, bikeways, public transit, shortest path algorithms, simulation, travel time

Popis souboru: application/pdf

Přístupová URL adresa: https://escholarship.org/uc/item/87k1w46r
https://escholarship.org/content/qt87k1w46r/qt87k1w46r.pdf

Design of Simulation Program for Analysis of Shortest Path Algorithms in Grid-Based Path Planning

Autoři: İbrahim Şanlialp İbrahim Yandı

Zdroj: Gazi Üniversitesi Fen Bilimleri Dergisi, Vol 13, Iss 1, Pp 187-199 (2025)
Volume: 13, Issue: 1187-199
Gazi Üniversitesi Fen Bilimleri Dergisi Part C: Tasarım ve Teknoloji
Gazi University Journal of Science Part C: Design and Technology

Témata: Information Modelling, Management and Ontologies, Science (General), Science, Optimal path planning, simulation program, shortest path algorithms, unity 3D, unity 3d, Engineering (General). Civil engineering (General), Q1-390, Optimum yol planlama, simülasyon programı, en kısa yol algoritmaları, Bilgi Modelleme, Yönetim ve Ontolojiler, optimal path planning, TA1-2040

Popis souboru: application/pdf

Přístupová URL adresa: https://doaj.org/article/f60bbfd7154d4db0b4e0afb1259dfd16
https://dergipark.org.tr/tr/pub/gujsc/issue/90949/1570730

Simulating Bike-Transit Trips Using BikewaySim and TransitSim

Autoři: Passmore, Reid Watkins, Kari E Guensler, Randall

Témata: Bicycle lanes, Bicycling, Bikeways, Public transit, Shortest path algorithms, Simulation, Travel time

Popis souboru: application/pdf

Přístupová URL adresa: https://escholarship.org/uc/item/7pt4d1tk
https://escholarship.org/content/qt7pt4d1tk/qt7pt4d1tk.pdf

A Performance Comparison of Shortest Path Algorithms in Directed Graphs

Autoři: Fatima Sapundzhi Kristiyan Danev Antonina Ivanova a další

Zdroj: The 14th International Scientific Conference TechSys 2025—Engineering, Technologies and Systems. :31

Témata: shortest path algorithms, Dijkstra, Bellman–Ford, Floyd–Warshall, Dantzig, graph theory, algorithm comparison, performance analysis

Popis souboru: application/pdf

A game for learning how to model in graph theory

Autoři: Cordero, A. Jordan, C. Murillo Arcila, Marina a další

Přispěvatelé: Cordero, A. Jordan, C. Murillo Arcila, Marina a další

Zdroj: Mathematics, 10, 1969 2022

Témata: modeling, weighted graphs, shortest path algorithms, Dijkstra, Bellman–Ford

Popis souboru: application/pdf

Relation: http://hdl.handle.net/10498/35684

Dostupnost: http://hdl.handle.net/10498/35684
https://doi.org/10.3390/MATH10121969

The STEM methodology and graph theory. Some practical examples

Autoři: Jordan, C. Murillo Arcila, Marina Torregrosa, Juan R. a další

Přispěvatelé: Jordan, C. Murillo Arcila, Marina Torregrosa, Juan R. a další

Zdroj: Mathematics, 9(23):3110, 2021

Témata: weighted graphs, shortest path algorithms, Dijkstra, Bellman–Ford, modeling, STEM

Popis souboru: application/pdf

Relation: http://hdl.handle.net/10498/35663

Dostupnost: http://hdl.handle.net/10498/35663
https://doi.org/10.3390/MATH9233110

BikewaySim and Complete Paths Networks are Expected to Improve Modeling of Bicycle Activity and Route Choice

Autoři: Passmore, Reid Watkins, Kari E. Guensler, Randall

Témata: Bikeways, Routes and routing, Shortest path algorithms, Travel time

Popis souboru: application/pdf

Přístupová URL adresa: https://escholarship.org/uc/item/8np1r2zx
https://escholarship.org/content/qt8np1r2zx/qt8np1r2zx.pdf

BikewaySim Technology Transfer: City of Atlanta, Georgia

Autoři: Passmore, Reid Watkins, Kari E. Guensler, Randall

Témata: Bikeways, Routes and routing, Shortest path algorithms, Travel time

Popis souboru: application/pdf

Přístupová URL adresa: https://escholarship.org/uc/item/23n9389j
https://escholarship.org/content/qt23n9389j/qt23n9389j.pdf

Egzaktni i heuristički algoritmi za problem najkraćeg puta

Autoři: Livaić, Tihomir Nakić, Anamari

Přispěvatelé: Livaić, Tihomir Nakić, Anamari

Témata: A-star algorithm, exact algorithms, algoritmi za pronalazak najkraćeg puta, TEHNIČKE ZNANOSTI. Računarstvo, egzaktni algoritmi, potpunost, konzistentnost, Dijkstrin algoritam, TECHNICAL SCIENCES. Computing, Dijkstra's algorithm, algoritmi pretraživanja, optimističnost, A* algoritam, admissibility, heuristika, algorithm, consistency, heuristički algoritmi, optimalni algoritmi, best-first algorithm, optimalnost, A-star algoritam, optimal algorithms, A* algorithm, optimality, completeness, heuristic algorithms, search algorithms, heuristic, algoritmi, algoritam najbolji-prvi, shortest path algorithms

Popis souboru: application/pdf

Přístupová URL adresa: https://urn.nsk.hr/urn:nbn:hr:168:310570
https://repozitorij.fer.unizg.hr/islandora/object/fer:13955/datastream/PDF
https://repozitorij.fer.unizg.hr/islandora/object/fer:13955

Flight Radius Algorithms

Autoři: Kamal Idrissi, Assia Malapert, Arnaud Jolin, Rémi a další

Přispěvatelé: Kamal Idrissi, Assia Malapert, Arnaud Jolin, Rémi a další

Zdroj: Proceedings of the 8th International Conference on Operations Research and Enterprise Systems. :370-377

Témata: Shortest Path Algorithms, Graph Database, 0211 other engineering and technologies, Time-independent Model, 02 engineering and technology, [INFO] Computer Science [cs], 0101 mathematics, 01 natural sciences, [INFO.INFO-RO] Computer Science [cs]/Operations Research [math.OC], Flight Radius Problem

Popis souboru: application/pdf

Přístupová URL adresa: https://hal.science/hal-02069634v1
https://hal.archives-ouvertes.fr/hal-02069634
https://dblp.uni-trier.de/db/conf/icores/icores2019.html#IdrissiMJ19
https://hal.archives-ouvertes.fr/hal-02069634/document

Changeability analysis for existing systems

Autoři: Dylan M. Dwyer Mahmoud Efatmaneshnik Dwyer, Dylan a další

Přispěvatelé: Dylan M. Dwyer Mahmoud Efatmaneshnik Dwyer, Dylan a další

Zdroj: Australian Journal of Multi-Disciplinary Engineering. 16:43-53

Témata: tradespace networks, 0209 industrial biotechnology, existing systems, multi-attribute tradespace exploration, 0211 other engineering and technologies, 02 engineering and technology, changeability, shortest path algorithms, epochera analysis

Přístupová URL adresa: https://www.tandfonline.com/doi/full/10.1080/14488388.2020.1781345
https://hdl.handle.net/11541.2/144137

PARALLELIZATION OF SHORTEST PATH CLASS ALGORITHMS: A COMPARATIVE ANALYSIS

Autoři: Flávio Henrique Batista de Souza Marcos Henrique Gonçalves Abreu Paulo Ricardo Fonseca Trindade a další

Zdroj: Pesquisa Operacional, Volume: 43, Article number: e272130, Published: 10 NOV 2023

Témata: graphs algorithms, algorithm parallelization, shortest path algorithms

Popis souboru: text/html

Přístupová URL adresa: http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382023000100226&lng=en&tlng=en

Algorithm for the Accelerated Calculation of Conceptual Distances in Large Knowledge Graphs

Autoři: Rolando Quintero Esteban Mendiola Giovanni Guzmán a další

Zdroj: Mathematics, Vol 11, Iss 23, p 4806 (2023)

Témata: conceptual distance, shortest path algorithms, accelerated calculation, computational complexity, Mathematics, QA1-939

Relation: https://www.mdpi.com/2227-7390/11/23/4806; https://doaj.org/toc/2227-7390; https://doaj.org/article/2859137192a748079567b1ad196913fd

Dostupnost: https://doi.org/10.3390/math11234806
https://doaj.org/article/2859137192a748079567b1ad196913fd

Solving the Flight Radius Problem

Autoři: Kamal Idrissi, Assia Malapert, Arnaud Jolin, Rémi a další

Přispěvatelé: Kamal Idrissi, Assia Malapert, Arnaud Jolin, Rémi a další

Zdroj: Proceedings of the 7th International Conference on Operations Research and Enterprise Systems. :304-311

Témata: Shortest Path Algorithms, 0502 economics and business, 05 social sciences, 0211 other engineering and technologies, Route Network Development, 02 engineering and technology, Airline Schedule Design, [INFO.INFO-RO] Computer Science [cs]/Operations Research [math.OC], Flight Radius Problem

Popis souboru: application/pdf

Přístupová URL adresa: https://hal.archives-ouvertes.fr/hal-01701827/document
https://hal.archives-ouvertes.fr/hal-01701827
https://dblp.uni-trier.de/db/conf/icores/icores2018.html#IdrissiMJ18

Egzaktni i heuristički algoritmi za problem najkraćeg puta ; Exact and heuristic algorithms for the shortest path problem

Autoři: Livaić, Tihomir Nakić, Anamari

Přispěvatelé: Livaić, Tihomir Nakić, Anamari

Témata: algoritmi, algoritmi pretraživanja, algoritmi za pronalazak najkraćeg puta, optimalnost, optimalni algoritmi, potpunost, optimističnost, konzistentnost, heuristika, heuristički algoritmi, egzaktni algoritmi, Dijkstrin algoritam, algoritam najbolji-prvi, A* algoritam, A-star algoritam, algorithm, search algorithms, shortest path algorithms, optimality, optimal algorithms, completeness, admissibility, consistency, heuristic, heuristic algorithms, exact algorithms, Dijkstra’s algorithm, best-first algorithm, A* algorithm, A-star algorithm

Popis souboru: application/pdf

Relation: https://zir.nsk.hr/islandora/object/fer:13955; https://urn.nsk.hr/urn:nbn:hr:168:310570; https://repozitorij.unizg.hr/islandora/object/fer:13955; https://repozitorij.unizg.hr/islandora/object/fer:13955/datastream/PDF

Dostupnost: https://zir.nsk.hr/islandora/object/fer:13955
https://urn.nsk.hr/urn:nbn:hr:168:310570
https://repozitorij.unizg.hr/islandora/object/fer:13955
https://repozitorij.unizg.hr/islandora/object/fer:13955/datastream/PDF

Shortest Path Visualizer using AI

Autoři: Neil Mehta Hitesh Swami Tejas Poojary a další

Témata: Shortest Path Visualizer, Shortest Path Algorithms, e–Learning

Relation: https://zenodo.org/communities/compub/; https://zenodo.org/records/6548686; oai:zenodo.org:6548686; https://doi.org/10.5281/zenodo.6548686

Dostupnost: https://doi.org/10.5281/zenodo.6548686
https://zenodo.org/records/6548686

COMPARATIVE ANALYSIS AND IMPLEMENTATION OF DIJKSTRA'S SHORTEST PATH ALGORITHM FOR EMERGENCY RESPONSE AND LOGISTIC PLANNING

Autoři: AH Eneh UC Arinze

Zdroj: Nigerian Journal of Technology; Vol 36, No 3 (2017); 876-888

Témata: TransRoute, shortest path algorithms, double bucket data structure, GIS, Computer Science, 11. Sustainability, 7. Clean energy

Popis souboru: application/pdf

Přístupová URL adresa: https://www.ajol.info/index.php/njt/article/download/159316/148878
https://www.ajol.info/index.php/njt/article/view/159316
https://nijotech.com/index.php/nijotech/article/download/1404/1149
https://www.ajol.info/index.php/njt/article/view/159316
https://nijotech.com/index.php/nijotech/article/view/1404
https://www.ajol.info/index.php/njt/article/download/159316/148878
http://nijotech.com/index.php/nijotech/article/view/1404/1149

SRide: An Online System for Multi-Hop Ridesharing

Autoři: Inayatullah Shah Mohammed El Affendi Basit Qureshi

Zdroj: Sustainability, Vol 12, Iss 9633, p 9633 (2020)

Témata: ridesharing, ride-matching algorithms, multi-hop ridesharing, dynamic shortest-path algorithms, Environmental effects of industries and plants, TD194-195, Renewable energy sources, TJ807-830, Environmental sciences, GE1-350

Relation: https://www.mdpi.com/2071-1050/12/22/9633; https://doaj.org/toc/2071-1050; https://doaj.org/article/18ad7e467e09485abbf55a60cb7c55db

Dostupnost: https://doi.org/10.3390/su12229633
https://doaj.org/article/18ad7e467e09485abbf55a60cb7c55db

GIS Spatial Optimization for Corridor Alignment Using Simulated Annealing

Autoři: Marco Antonio Cruz-Chávez Pedro Moreno-Bernal Rafael Rivera-López a další

Zdroj: Applied Sciences, Vol 10, Iss 6190, p 6190 (2020)

Témata: corridor planning, simulated annealing, shortest path algorithms, spatial optimization, variable neighborhood search, topographical constraint, Technology, Engineering (General). Civil engineering (General), TA1-2040, Biology (General), QH301-705.5, Physics, QC1-999, Chemistry, QD1-999

Relation: https://www.mdpi.com/2076-3417/10/18/6190; https://doaj.org/toc/2076-3417; https://doaj.org/article/1cc1019f595043d0a4b5d15bae240e32

Dostupnost: https://doi.org/10.3390/app10186190
https://doaj.org/article/1cc1019f595043d0a4b5d15bae240e32

Performance of shortest path algorithm based on parallel vertex traversal

Autoři: Aleksandra Smiljanic Dusan Kostic Mihailo Vesovic

Zdroj: Serbian Journal of Electrical Engineering, Vol 13, Iss 1, Pp 31-43 (2016)

Témata: parallelization, Dijkstra, 0202 electrical engineering, electronic engineering, information engineering, Electrical engineering. Electronics. Nuclear engineering, 02 engineering and technology, Bellman-Ford, single source shortest path, shortest path algorithms, TK1-9971

Přístupová URL adresa: https://doaj.org/article/91ada6114a6e418e98d2305d8efe15ab
http://www.doiserbia.nb.rs/Article.aspx?ID=1451-48691601031V
http://www.doiserbia.nb.rs/ft.aspx?id=1451-48691601031V