Results 191 to 200 of about 5,425,704 (264)
Some of the next articles are maybe not open access.
, 2020
In China, rapid development of online food delivery brings massive orders, which relies heavily on deliverymen riding e-bikes. In practice, actual delivery routes of most orders are not the same as the system recommended routes, and the road network ...
Shanyun Liu +5 more
semanticscholar +1 more source
In China, rapid development of online food delivery brings massive orders, which relies heavily on deliverymen riding e-bikes. In practice, actual delivery routes of most orders are not the same as the system recommended routes, and the road network ...
Shanyun Liu +5 more
semanticscholar +1 more source
A Three-Dimensional Dijkstra's algorithm for multi-objective ship voyage optimization
Ocean Engineering, 2019In this paper, a Three-Dimensional Dijkstra’s optimization algorithm is proposed to allow a ship to plan her waypoints and sailing speeds along each waypoint. It is expected to generate global optimum solutions for ship routes.
Helong Wang, Wengang Mao, L. Eriksson
semanticscholar +1 more source
A biobjective Dijkstra algorithm
European Journal of Operational Research, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Antonio Sedeño-Noda, Marcos Colebrook
openaire +2 more sources
2020 International Conference in Mathematics, Computer Engineering and Computer Science (ICMCECS), 2020
The classical Dijkstra’s algorithm has been widely used in shortest path problems. It is indeed one of the most referenced shortest path algorithms. However, it is observed that in certain circumstances finding shortest paths between given nodes may be ...
O. A. Gbadamosi, D. R. Aremu
semanticscholar +1 more source
The classical Dijkstra’s algorithm has been widely used in shortest path problems. It is indeed one of the most referenced shortest path algorithms. However, it is observed that in certain circumstances finding shortest paths between given nodes may be ...
O. A. Gbadamosi, D. R. Aremu
semanticscholar +1 more source
Dijkstra's algorithm and Google maps
Proceedings of the 2014 ACM Southeast Regional Conference, 2014Dijkstra's Algorithm is known as the shortest path source. In this paper, we discuss this Algorithm and the applications that the algorithm has on the modern day. In this study, we provide a pseudo-code of the algorithm. It is the backbone of every navigation system. Google Maps is a typical application of this Algorithm.
Daniel R. Lanning +2 more
openaire +1 more source
2014 9th IEEE Conference on Industrial Electronics and Applications, 2014
The path planning is a very important part of AGV control. Firstly, The OpenCV is called to fitting the contour of obstacles with polygon and to optimize the result. Then a model of AGV work space is built by the method of network topology. So the problem of AGV path planning can be transformed into the problem of searching for the shortest path of the
Duanling Li, Kun Niu
openaire +1 more source
The path planning is a very important part of AGV control. Firstly, The OpenCV is called to fitting the contour of obstacles with polygon and to optimize the result. Then a model of AGV work space is built by the method of network topology. So the problem of AGV path planning can be transformed into the problem of searching for the shortest path of the
Duanling Li, Kun Niu
openaire +1 more source
EvacuSafe: A real-time model for building evacuation based on Dijkstra's algorithm
, 2020Building evacuation strategies directly affect the success of an emergency response plan in reaction to a disastrous event in a building. Evacuation alternatives result from applying time delays or altering path planning in the evacuation strategy.
Farid Mirahadi, B. McCabe
semanticscholar +1 more source
Route Optimization by using Dijkstra's Algorithm for the Waste Management System
International Conferences on Information Science and System, 2020Unplanned waste collection causes environmental pollution, cost increment and large consumption of fuel. Optimized route planning is one of the most important factors in the smart waste management system (WMS).
M. Hossain +6 more
semanticscholar +1 more source
The improved Dijkstra's shortest path algorithm
2011 Seventh International Conference on Natural Computation, 2011The shortest path problem exists in variety of areas. A well known shortest path algorithm is Dijkstra's, also called “label algorithm”. Experiment results have shown that the “label algorithm” has the following issues: ①. Its exiting mechanism is effective to undigraph but ineffective to digraph, or even gets into an infinite loop; ②.
Shu-Xi Wang, Xing-qiu Zhao
openaire +1 more source
Dijkstra’s algorithm-based ray tracing method for total focusing method imaging of CFRP laminates
Composite structures, 2019Accurate determination of ultrasonic travel time from a start point to an end point with known positions is fundamental to the application of total focusing method (TFM) to ultrasonic array imaging.
Li Lin, Huan-qing Cao, Zhongbing Luo
semanticscholar +1 more source