Nowadays most data networks use shortest path protocols such as OSPF or IS-IS to route traffic. Given administrative routing lengths for the links of a network, all data packets are sent along shortest paths with respect to these lengths from their source to their destination. One of the most fundamental problems in planning shortest path networks is to decide whether a given set of routing pat...

The shortest path problem in the time dependent network is an important extension of the classical shortest path problem and has been widely applied in real life. It is known as nonlinear and NP-hard. Therefore, the algorithms of the classical shortest path are incapable to solve this problem. In this paper, the models of the shortest path problem in the time dependent network are formulated an...

In wireless sensor networks where sensors are geographically deployed in 3D spaces, a mobile robot is required to travel to each sensor in order to download the data. The effective communication ranges of sensors are represented by spheres with varying diameters. The task of finding the shortest travelling path in this scenario can be regarded as an instance of a class of problems called Travel...

Nowadays most data networks use shortest path protocols such as OSPF or IS-IS to route traffic. Given administrative routing lengths for the links of a network, all data packets are sent along shortest paths with respect to these lengths from their source to their destination. One of the most fundamental problems in planning shortest path networks is to decide whether a given set of routing pat...

In this paper we consider the Origin-Destination (O-D) shortest path problem. We define the O-D shortest path problem as follows: We are given the set of nodes and edges in a network. Associated with each edge is a weight. In addition, we are given two subsets of the node set. One set is called the set of origin nodes and the other is called the set of destination nodes. The objective of the O-...

A shortest path problem is a practical issue in networks for real-world situations. This paper addresses the fuzzy shortest path (FSP) problem to obtain the best fuzzy path among fuzzy paths sets. For this purpose, a new efficient algorithm is introduced based on a new definition of ideal fuzzy sets (IFSs) in order to determine the fuzzy shortest path. Moreover, this algorithm is developed for ...

This paper investigates minimum time and minimum cost path problems in street networks regulated by periodic traffic lights. We show that the minimum time path problem is polynomially solvable. On the other hand, minimum cost path problems are generally NP-hard. Special, realistic, cases which are polynomially solvable are discussed. Dynamic shortest path problems often arise in transportation ...