Consider the single-source cheapest paths problem in a digraph with negative edge costs allowed. A hybrid of Bellman-Ford and Dijkstra algorithms is suggested, improving the running time bound upon Bellman-Ford for graphs with a sparse distribution of negative cost edges. The algorithm iterates Dijkstra several times without reinitializing values d(v) at vertices. At most k+2 executions of Dijk...

A common algorithm to solve the shortest path problem (SPP) is the Dijkstra algorithm. In this paper, a generalized Dijkstra algorithm is proposed to handle SPP in an uncertain environment. Two key issues need to be addressed in SPP with fuzzy parameters. One is how to determine the addition of two edges. The other is how to compare the distance between two different paths with vailable online ...

The Dijkstra algorithm is a common method used when solving shortest path problems. It graph-based that compares node distances, selects the subsequent node, and generates an ideal path. However, it seen struggles with memory utilization, particularly working substantial amounts of data or graphs. purpose this research work to improve tackle current problem. enhancement accomplished by providin...

Global path planning for mobile robot using genetic algorithm and A* algorithm is investigated in this paper. The proposed algorithm includes three steps: the MAKLINK graph theory is adopted to establish the free space model of mobile robots firstly, then Dijkstra algorithm is utilized for finding a feasible collision-free path, finally the global optimal path of mobile robots is obtained based...

This paper describ esa new search algorithm, Dual Dijkstra Search. F roma given initial and nal conguration, Dual Dijkstra Search nds various paths which have di er enttop olo giessimultaneously. This alo grithm allows you to enumerate not only the optimal one but variety of meaningful candidates among local minimum paths. It is based on the algorithm of Dijkstra[10], which is populary used to ...

Are you feeling up today, or down in the dumps? Spatial metaphors that connote affective valence are common in English, where up in space=happy/positive and down in space=sad/negative. Past research suggests that these metaphors have some measure of psychological reality: people are faster to respond to words with an emotional connotation in metaphorcongruent regions of space (Meier & Robinson,...

In this paper we propose the idea of using Bionomic Algorithm (BA) for the shortest path finding problem. SPF is a very important issue associated with many other tasks like network routing and graph/map analysis etc. Different techniques have been used for solving the SPF problem, some of them being Dijkstra Algorithm, Floyd Algorithm, Genetic Algorithm, Tabu Search etc. The choice of algorith...