2010
DOI: 10.1016/j.ejor.2010.06.003
|View full text |Cite
|
Sign up to set email alerts
|

Note on “A new bidirectional algorithm for shortest paths”

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 12 publications
(13 citation statements)
references
References 2 publications
0
9
0
Order By: Relevance
“…In order to optimize the spatial computation, and more particularly the spatial query, GAMA uses a dynamic Quadtree structure that is updated according to the movement of the agents. Regarding the computation of shortest paths on graphs, GAMA proposes different algorithms such as Dijkstra, Floyd Warshall, or NBA* [53]. At last, several algorithms are also available to compute shortest paths and distances on a grid (with the possibility to consider obstacles) such as Dijkstra, A*, or JPS [39].…”
Section: Spatial Component Of Modelsmentioning
confidence: 99%
“…In order to optimize the spatial computation, and more particularly the spatial query, GAMA uses a dynamic Quadtree structure that is updated according to the movement of the agents. Regarding the computation of shortest paths on graphs, GAMA proposes different algorithms such as Dijkstra, Floyd Warshall, or NBA* [53]. At last, several algorithms are also available to compute shortest paths and distances on a grid (with the possibility to consider obstacles) such as Dijkstra, A*, or JPS [39].…”
Section: Spatial Component Of Modelsmentioning
confidence: 99%
“…the time of departure is calculated based on expected travel time and time of appointment considering walking and motorized movement with constant speed. The path and modes to use are computed using behavioral rules and shortest path algorithm: agent will choose the most efficient mode in term of time, while computing shortest path using NBA* algorithm [19]. On the tactical level, each agent is able to update its path when changes in the environment does not let them move to their current destination, including the ability to change the mode of transportation.…”
Section: Mobile Entities: People and Vehicle Agentsmentioning
confidence: 99%
“…Searching path process will be divided into two part, (1) from start node to goal node, and (2) from goal node to start node. They will stopped if they meet in the halfway [9] [10].…”
Section: Cs-2-1 Designing and Implementation Of Autonomous Hexarotor mentioning
confidence: 99%