The shortest path problem is a classical combinatorial optimization problem with countless
real-life applications. Numerous algorithms have been proposed to solve the SPP since the …

Route planning in multimodal transportation networks is gaining more and more importance.
Travelers ask for efficient routing methods allowing them to reach their destinations through …

Routing is gaining prime importance in our increasingly mobile and highly Information
Technology enabled world. The shortest path problem is widely applied in transportation …

Within the last few decades, there has been exponential growth in the research,
development, and utilization of Geospatial Information Systems (GIS). While GISs have been …

AERARS is a response and routing software for accident emergency requirement. A method
has been proposed in this project for using a genetic algorithm to find the shortest route …

In this paper we propose an optimal routing method for cars in car navigation system. The
proposed method finds the paths with a combination of Divide and Conquer method and Ant …

(国防科技大学信息系统与管理学院, 湖南长沙410073) E2m a il: lvx in-nudt@ yahoo. com. cn
摘要: 提出一个解决非负权网络最短路问题的节点合并算法. 该算法以将距离起始节点最近的 …

The major objective of this work is to reduce the overall cost as well as to reduce the
distance and time involved in transportation networks so that the effective shortest possible …

Particle swarm optimization (PSO) algorithms are now being practiced for more than a
decade and have been extended to solve various types of optimization problems. However …

A mobile agent is a mobile object, whose movement requires a wise determination of the
best path, as this path is applied to migrate a mobile agent from a source node to a …