we consider biobjective shortest path problems in networks with fuzzy arc lengths. considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. the rst and second approaches are extensions of the labeling method to solve the sing...

We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. The rst and second approaches are extensions of the labeling method to solve the sing...

This article presents an efficient parametric optimization method for the biobjective optimal routing problem. The core process is a bounded greedy singleobjective shortest path approximation algorithm. This method avoids the computationally intensive dominance check with labeling methods and overcomes the deficiency with existing parametric methods that can only find extreme nondominated paths...

The multiobjective shortest path problem arises in many transportation and logistics applications, either as a stand-alone network routing problem or a subroutine of a more complex multiobjective network optimization problem. It has been addressed by different solution strategies, including labeling methods, ranking methods, constraint methods, and parametric methods. Increasing attention has b...

In this paper we introduce a biobjective ant colony algorithm for constructing low cost overlay routing networks. The ant colony algorithm is distributed and adaptive in finding shortest paths from source to destination nodes while also constructing a low cost overlay routing network. Additionally, we define a cost model for overlay network construction that includes network traffic demands. Th...

While using drones (UAVs) for remote surveillance missions, it is mandatory to do path planning of the vehicle since these are pilot-less vehicles. Path planning, whether offline (more popular) or online, entails setting up the path as a sequence of locations in the 3D Euclidean space, whose coordinates happen to be latitude, longitude and altitude. For the specific application of remote survei...

We consider the biobjective shortest path (BSP) problem as the natural extension of the single objective shortest path problem. BSP problems arise in various applications where networks usually consist of large numbers of nodes and arcs. Since obtaining the set of efficient solutions to a BSP problem is more difficult (i.e. NP-hard and intractable) than solving the corresponding single objectiv...

The problem of finding a minimal cost-reliability ratio path is considered. The optimal solution to this problem is shown to map into an extreme supported non-dominated objective point in the objective space of the biobjective shortest path problem. Different forms of reliability are presented. We assume that this reliability does not change over time. We employ a parametric network simplex alg...

The main aim of this paper is to find an optimal path to prolong the network lifetime and to find energy efficient routes for MANET. Routing involves path discovery based on Received Signal Strength (RSS) and residual energy and selection based on an optimized biobjective model. Biobjective here represents energy and hop. In path discovery process, initially, transmit power required is varied t...

we give an algorithm, called t*, for finding the k shortest simplepaths connecting a certain pair of nodes, s and t, in a acyclic digraph.first the nodes of the graph are labeled according to the topologicalordering. then for node i an ordered list of simple s − i paths iscreated. the length of the list is at most k and it is created by usingtournament trees. we prove the correctness of t* and ...