Summary

PAPER I
Study on Distributed and Parallel Search Strategy of Shortest
Path in Urban Road Network
In this paper the authors gives the idea that it is very difficult and complicated to
find the shortest path in urban road network. In the algorithm presented in the
paper, the whole search road network is first cut into local sub-search road
networks, and connections among each local sub-search road network are
established through virtual auxiliary nodes; then searches of the shortest paths in
local sub-search road networks are conducted in a parallel manner In order to
improve operating efficiency of the shortest path search in urban road network,
the paper presents the distributed and parallel search strategy of shortest path in
urban road network based on local and parallel search. The node number of the
local-search-sub network is far smaller than that in the whole urban road network
and the local search is operated in the parallel computation environment.
Therefore, the operating efficiency of the shortest path search in urban road
network is greatly improved. Classical algorithms of the shortest path mainly
include: Dijstra algorithm, Floyd algorithm, Bidirectional search algorithm, etc.
and their time complexities are O(n2 ) , O(n3 ) , O(bd / 2 ) [1] respectively. These
algorithms are taken as general shortest path search algorithms, and the required
time in the search process would rise sharply with the increase of the problem
search scale in solving practical problems. In many applied cases, improvement
of operating efficiency of the optimum path search is usually achieved by
adopting two measures, i.e. by simplifying road network according to its
characteristics and by taking advantage of auxiliary information of the road
network to guide shortest path search.

PAPER II
An Improved Genetic Algorithm for Dynamic Shortest Path
Problems
In this paper the authors gives the idea about improving the conventional methods
of dynamic shortest path problems. In this paper, an improved Genetic Algorithm
(GA) with four local search operators for Dynamic Shortest Path (DSP) problems
is proposed. The local search operators are inspired by Dijkstras Algorithm and
carried out when the topology changes to generate local shortest path trees, which
are used to promote the performance of the individuals in the population. In
dynamic topologies, the deterministic algorithms are not efficient due to the
necessity of restart [3]. Therefore, for DSP problems, new solving methods are
needed. Fortunately, Genetic Algorithms (GAs) perform well for solving
Dynamic Optimization Problems (DOPs).The experimental results show that the
proposed algorithm could get solutions which adapt to new environments rapidly
and produce high-quality solutions after environmental changes. In the future, the
author will investigate the DSP problems in the large-scale topologies, and take
some missing factors (such as the situation where some nodes move) into
consideration.

PAPER III
A Gene-Constrained Genetic Algorithm for Solving Shortest Path
Problem
In this paper the authors gives the idea IO solve! Shortest Path problem Genetic
Algorithm [GA), gene is constrained to ensure that each chromosome report a
feasible path without loop during the whole process of search. Contrasting with
other Genetic Algorithm for SP problem, this algorithm can improve the
searching capacity with a more accurate solution and more rapid speed of
convergence. The G-C GA is mare general and flexible no matter in a directed
graph or in an undirected graph and it will provide the foundation for more
complicated shortest path problems. They are to look for the shortest path with
some conditions or some restrictions. The traditional algorithms mentioned can
solve the simple SP problem effectively, but they are not always fit for die
complicated SP problems. Considering the further research on the complicated
SP problems, Genetic Algorithm is adopted, for GA can deal with a variety of
optimization problems, either exactly or approximately. The proposed algorithm
in this can improve the searching capacity with a more accurate solution and
ignore rapid speed of convergence. Especially, it is more efficient to solve the

problem of loop in undirected graph. Since the Gene-Constrained Genetic

Algorithm can solve simple SP problem essentially, it will provide the foundation
for solving the more complicated shortest path problems.

PAPER IV
EFFICIENT HIERARCHICAL HYBRIDS PARALLE
GENETIC ALGORITHM FOR SHORTEST PATH ROUTING
This paper basically describes and solves the constrained in hybrid smallest path
problems. This paper presents an algorithm based on hierarchical hybrids parallel
genetic algorithm for the shortest path routing. The algorithm is the hybrid of
coarse-grained genetic algorithm and fine. The proposed algorithm is analyzed
for the travelling sales person problem for more than one source cities. The
performance comparison shows that the proposed algorithm takes less time as
chooses the shortest path communication overhead present in the existing
algorithm. The algorithm uses the worst replace best migration strategy to replace
the genes. The simulation result shows that the algorithm outperforms the serial
genetic algorithm due to parallelism and outperforms coarse-grained genetic
algorithm in terms of communication. GAs includes techniques enhanced by
natural evolution to compute and change species to their environment. Generally
speaking, a GA modifies a number of solutions to the problem at present,
similarly as nature alters species. A GA develops a population of arbitrarily
generated individuals by using iterations and performing genetic operations such
as crossover, mutation and some other methods. In future the proposed algorithm
can be analysed for other single objective as well as for multi objective problems.

PAPER V
A Study on the Shortest Path Problem Based on Improved
Genetic Algorithm
This paper is basically about a shortest path problem in network optimization,
and proposes a model with constraints. The search algorithm based on intelligent
computation for solving shortest path problem has developed rapidly in recent
years. This paper attempts to establish a model with constraints for shortest path
problem and design an improved genetic algorithm (GA) for solving the shortest
path problem. The improved GA has strong optimization and brief structure. The
results indicate that the improved GA with a good performance in convergence
speed can solve the optimal solution set under certain constraints, which is proved

the effectiveness and feasibility of the improved GA. Experimental results show
that the improved GA can obtain good solutions within a short time, and
algorithm stability, convergence speed and search efficiency are relatively high,
which fully demonstrate the advantages of the algorithm for solving the shortest
path problem. Therefore, the algorithm is feasible and effective.