Due to dynamic network conditions, routing is the most critical part in WMNs and needs to be optimised. The routing strategies developed for WMNs must be efficient to make it an operationally self configurable network. Thus we need to resort to near shortest path evaluation. This lays down the requirement of some soft computing approaches such that a near shortest path is available in an afford...

Nowadays, in computer networks, the routing is based on the shortest path problem. This will help in minimizing the overall costs of setting up computer networks. New technologies such as map-related systems are also applying the shortest path problem. This paper’s main objective is to evaluate the Dijkstra’s Algorithm, Floyd-Warshall Algorithm, Bellman-Ford Algorithm, and Genetic Algorithm (GA...

This paper describes a distributed algorithm for solving the shortest path problem with a swarm of JASMINE micro-robots. Each robot is only connected via infra-red communication with its neighbours. Based on local information exchange and some simple rules the swarm manages to find the shortest path (shortest path in the number of robots on the path) in a labyrinth with dead-ends and cycles. Th...

We consider the 2-Way Multi Modal Shortest Path Problem (2WMMSPP). Its goal is to find two multi modal paths with total minimal cost, an outgoing path and a return path. The main difficulty lies in the fact that if a private car or bicycle is used during the outgoing path, it has to be picked up during the return path. The shortest return path is typically not equal to the shortest outgoing pat...

Given a communication network or a road network one of the most natural algorithmic question is how to determine the shortest path from one point to another. In this paper we deal with one of the most fundamental problems of Graph Theory, the All Pairs Shortest Path (APSP) problem. We study three algorithms namely The FloydWarshall algorithm, APSP via Matrix Multiplication and the Johnson’s alg...

We give algorithmic results for combinatorial problems with cost arrays possessing certain algebraic Monge properties. We extend Monge-array results for two shortest path problems to a general algebraic setting, with values in an ordered commutative semigroup, if the semigroup operator is strictly compatible with the order relation. We show how our algorithms can be modified to solve bottleneck...

There are some ramp entry or exit direction limitations on networks. This kind of limitation is represented by successive passage prohibition (SPP). It indicates that the vehicles cannot successively pass two links with SPP attributes. However, the shortest-path tree sometimes cannot be expressed with a simple tree when a network having this limitation is represented with single nodes. In such ...

A theorem of Hardy, Littlewood, and Polya, first time is used to find the variational form of the well known shortest path problem, and as a consequence of that theorem, one can find the shortest path problem via quadratic programming. In this paper, we use measure theory to solve this problem. The shortest path problem can be written as an optimal control problem. Then the resulting distribute...

Shortest path computation is one of the most fundamental operations for managing and analyzing large social networks. Though existing techniques are quite effective for finding the shortest path on large but sparse road networks, social graphs have quite different characteristics: they are generally non-spatial, non-weighted, scale-free, and they exhibit small-world properties in addition to th...

In this paper, we study the routing problem for the undirected binary de Bruijn interconnection network. Researchers have never proposed a shortest path routing algorithm on the undirected binary de Bruijn network. We first propose a shortest path routing algorithm, whose time complexity in the binary de Bruijn network of 2 nodes is O(m2). Then, based on our shortest path routing algorithm, we ...