Results 101 to 110 of about 5,083,450 (268)
Computing New Optimized Routes for GPS Navigators Using Evolutionary Algorithms [PDF]
GPS navigators are now present in most vehicles and smartphones. The usual goal of these navigators is to take the user in less time or distance to a destination.
Alba-Torres, Enrique, Stolfi, Daniel H.
core +1 more source
Application Teaching Case of Dijkstra Algorithm
Dijkstra algorithm has been widely applied in many fields, such as optimization, image processing and grid processing. In the tradition teaching process, we find that students could not understand the use of Dijkstra algorithm, think this algorithm is complex and have no interest.
Xiao-Chao SUN +3 more
openaire +2 more sources
An Improved Dijkstra Shortest Path Algorithm [PDF]
An improved Dijkstra shortest path algorithm is presented in this paper. The improved algorithm introduces a constraint function with weighted value to solve the defects of the data structure storage, such as lots of redundancy of space and time. The number of search nodes is reduced by ignoring reversed nodes and the weighted value is flexibly changed
Min Shi, Qingming Yi, Yizhen Huang
openaire +1 more source
Abstract This paper introduces a novel heuristic method, the smart selective navigator (SSN), for addressing arc routing problems (ARPs) with a focus on integrating hard turn restrictions in urban winter operations. Addressing a significant gap in existing ARP methodologies, SSN seamlessly incorporates common side constraints, such as vehicle ...
Farhad Baghyari, Jaho Seo
wiley +1 more source
Dijkstra algorithm for shortest path problem under interval-valued Pythagorean fuzzy environment
Pythagorean fuzzy set as an extension of fuzzy set has been presented to handle the uncertainty in real-world decision-making problems. In this work, we formulate a shortest path (SP) problem in an interval-valued Pythagorean fuzzy environment. Here, the
Mohammad Enayattabar +2 more
semanticscholar +1 more source
Multi‐objective maritime vessel routing with safety considerations
Abstract The routing of maritime vessels is a challenging optimization problem that involves finding an adequate balance between conflicting and multiple objectives. This paper proposes a methodology based on inverse optimization to find appropriate objective weights that account for conflicting objectives. To formulate the inverse optimization problem,
Nazanin Sharif +4 more
wiley +1 more source
Поиск кратчайшего пути с ограниченным числом снимаемых "пробок" в вершинах графа [PDF]
В статье предлагаются методы нахождения кратчайшего пути на графе в условиях частичной проходимости вершин. Предложенное решение представляет собой модификацию жадного алгоритма и алгоритма Дейкстра.In clause the methods of a presence (finding) of the ...
Кащеев, Леонид Борисович +2 more
core
Bidirectional Dijkstra’s Algorithm is Instance-Optimal
Fixed a bug in the bidirectional search pseudocode where e_mid was updated even if $\mu$ wasn't. Fixed a typo in the proof of Theorem 3: changed all $v_1u_2$ to $u_2v_1$.
Haeupler, Bernhard +4 more
openaire +2 more sources
Anti-Congestion Route Planning Scheme Based on Dijkstra Algorithm for Automatic Valet Parking System
Based on the Dijkstra algorithm, with the parking parameters in the static state, the shortest route to each parking space of the parking lot without dynamic influence factors can be calculated.
Yu, Jiang, Hua
semanticscholar +1 more source
Integrated routing of heavy electrical and diesel trucks in forest transports
Abstract Fossil‐free forestry transports are important to reach climate goals. In Sweden, road transports account for around 50% of the industry's CO2 emissions and almost 20% of the road freight volumes. Previous studies have shown that electrification is a cost‐effective way for carbon abatement, while at the same time the requirements for ...
Mikael Rönnqvist +4 more
wiley +1 more source

