Search Results - The modified Dijkstra algorithm

Dynamic emergency route planning for major chemical accidents: Models and application by Xu, Ke, Gai, Wen-mei, Salhi, Saïd

“…•The Dijkstra algorithm is modified to solve the multi-objective optimization problem for the emergency route selection…”
Get full text

Solving the Shortest Total Path Length Spanning Tree Problem Using the Modified Sollin and Modified Dijkstra Algorithms by Wamiliana, Wamiliana, Sari, Reni Permata, Reformasari, Astri, Suparman, Jani, Junaidi, Akmal

“… On orders 10, 20, 30, 60, and 80, the Modified Dijkstra Algorithm performs better than the Modified Sollin, however on orders 40, 50, 70, 90, and 100, the Modified Sollin performs better…”
Get full text

Analysis of loop flow in electrical power systems with embedded HVDC using a modified Dijkstra algorithm by Alvarenga, Gabriel F., Zambroni de Souza, A.C., Taranto, Glauco N., Venkatesh, Bala

“… The main advantage of the modified Dijkstra algorithm is that it not only accelerates the analysis, but also simplifies the task…”
Get full text

A Modified Dijkstra Algorithm for ROS Based Autonomous Mobile Robots by Çelik, Orkan Murat, Köseoğlu, Murat

“… Two different path planning algorithms, which are Dijkstra’s algorithm and a modified version…”
Get full text

AOLSR: hybrid ad hoc routing protocol based on a modified Dijkstra's algorithm by Natarajan, Dhanalakshmi, Rajendran, Alli P

“… An optimized link state routing (OLSR) protocol is a proactive routing protocol. An advanced OLSR (AOLSR) protocol is proposed based on a modified Dijkstra's algorithm which enables routing in multiple paths of dense and sparse ne0074work topologies…”
Get full text

Tsunami Evacuation Route Mapping Based on Modified Dijkstra's Algorithm in Batu Karas Beach, Pangandaran by Agustiana, Elis, Costrada, Aldo Novaznursyah, Aminah, Nina Siti, Djamal, Mitra

“… The Modified Dijkstra's Algorithm weights consider not only travel distance, but also additional factors such as road conditions, traffic, and road width…”
Get full text

OPTIMAL ROUTE GENERATION FOR GARBAGE COLLECTION USING MODIFIED DIJKSTRA ALGORITHM by Kavitha, R, Sumathi, P

“… In this research, we offer an optimum route recommendation system for trash carrier trucks that collect solid waste based on the profile of a given region by using a modified Dijkstra algorithm (MDA…”
Get full text

Multi-Autonomous Mobile Robot traffic Management Based on Layered Costmaps and a modified Dijkstra's Algorithm by Langbak, Simon Mouritsen, Schou, Casper, Hansen, Karl Damkjær

“… This paper therefore explores an approach where multi-AMR traffic management is achieved with layered costmaps and a modified Dijkstra's algorithm…”
Get full text

Finding Optimal Routes in Internal Routing Networks based on a Modified Dijkstra’s Algorithm by Riabenko, Borys, Martynova, Oksana, Boiarinova, Yuliia, Krainosvit, Arkadii

“… In this paper, we propose a modification of the Dijkstra’s algorithm that extends the classical approach to find a set of optimal routes in a single algorithm run…”
Get full text

Modified Dijkstra Shortest Path Algorithm for SD Networks by M. Abdelghany, Haitham, W. Zaki, Fayez, M. Ashour, Mohammed

“… This comparison shows that the modified Dijkstra’s algorithm provides higher performance of the different cumulative delays…”
Get full text

Shortest Path Finding using Modified Dijkstra's algorithm with Adaptive Penalty Function by Garg, Samridh, Devi, Bhanu

“… So, the study proposes modified Dijkstra's algorithm with adaptive penalty function to find the optimal shortest path among starting node and destination node using graphs and greedy methods…”
Get full text

Smart Control of an Electric Vehicle for Ancillary Service in DC Microgrid by Yu, Yue, Nduka, Onyema Sunday, Pal, Bikash C.

“…) peak shaving service has been realised. This coordinated EV integration into the DCMG was formulated as a directed weighted single source shortest path problem that was solved using a modified Dijkstra's algorithm…”
Get full text

Characterization of the objective function landscape using a modified Dijkstra algorithm by Weiser, Stephan, Wulf, Hans, Ihlemann, Jörn

“…A decisive disadvantage of high dimensional optimization problems is the large number of parameters which make the identification process difficult. Many of…”
Get full text

Evacuation route optimization under real-time toxic gas dispersion through CFD simulation and Dijkstra algorithm by Wang, Jiyun, Yu, Xiaoyang, Zong, Ruowen, Lu, Shouxiang

“… Taking the dose as the weights of arcs, the concentrations predicted by CFD are embedded into the modified Dijkstra algorithm to calculate the optimal route with minimal total inhaled dose…”
Get full text

DEVELOPMENT OF LOAD BALANCING MECHANISMS IN SDN DATA PLANE FAT TREE USING MODIFIED DIJKSTRA’S ALGORITHM by Rangkuty, Muhammad Fattahilah, Ijtihadie, Royyana Muslim, Ahmad, Tohari

“… The Least Loaded Path (LLP) of our proposed concept, which is a Dijkstra development, selects the best…”
Get full text

On Scalable Design for User-Centric Multi-Modal Shared E-Mobility Systems using MILP and Modified Dijkstra's Algorithm by Shah, Maqsood Hussain, Li, Ji, Liu, Mingming

“… Additionally, the modified Dijkstra's algorithm offers a more scalable…”
Get full text

Design of a Modified Dijkstra's Algorithm for finding alternate routes for shortest-path problems with huge costs by Gbadamosi, Omoniyi Ajoke, Aremu, Dayo Reuben

“… Such cases are the basic consideration in this study. Solution to such situations requires a modified Dijkstra's algorithm, which is proposed in this study…”
Get full text

UAV-based persistent full area coverage with dynamic priorities by Feng, Licheng, Katupitiya, Jay

“… Then an autonomous path planning strategy is proposed for persistent coverage, where a combinatorial priority function is designed as the goal assignment strategy and a modified Dijkstra algorithm…”
Get full text

Path selection model and algorithm for emergency logistics management by Yuan, Yuan, Wang, Dingwei

“… A modified Dijkstra algorithm is designed to solve the model. Based on the first model, we further consider the chaos, panic and congestions in time of disaster…”
Get full text

Dynamic Routing For Uniform Energy Distribution in Wireless Sensor Network Using a Modified Dijkstra Algorithm by Jain, Mohak, Konar, Gargi

“… This paper introduces a modification to the traditional Dijkstra algorithm by incorporating a cost function that accounts for both node energy levels and path length, balanced by a weighting factor…”
Get full text