Minimum cost path problems with relays
TL;DR: This paper first models the MCPPR as a particular bicriteria path problem involving an aggregated function of the path and relay costs, as well as a weight function, and considers a variant of this problem which takes into account all three functions separately.
About: This article is published in Computers & Operations Research.The article was published on 2011-01-01. It has received 61 citations till now. The article focuses on the topics: Shortest path problem & Longest path problem.
Citations
More filters
TL;DR: In this paper, three mathematical models are formulated to describe the resulting network equilibrium flow distributions on regional or metropolitan road networks, where the authors assume that BEV drivers select routes and decide battery recharging plans to minimize their trip times or costs while making sure to complete their trips without running out of charge.
Abstract: The limited driving ranges, the scarcity of recharging stations and potentially long battery recharging or swapping time inevitably affect route choices of drivers of battery electric vehicles (BEVs). When traveling between their origins and destinations, this paper assumes that BEV drivers select routes and decide battery recharging plans to minimize their trip times or costs while making sure to complete their trips without running out of charge. With different considerations of flow dependency of energy consumption of BEVs and recharging time, three mathematical models are formulated to describe the resulting network equilibrium flow distributions on regional or metropolitan road networks. Solution algorithms are proposed to solve these models efficiently. Numerical examples are presented to demonstrate the models and solution algorithms.
212 citations
TL;DR: This paper articulate this problem and classify current routing protocols for WSNs into two categories according to their orientation toward either homogeneous or heterogeneous W SNs, further classified into static and mobile ones.
Abstract: Due to a battery constraint in wireless sensor networks (WSNs), prolonging their lifetime is important. Energy-efficient routing techniques for WSNs play a great role in doing so. In this paper, we articulate this problem and classify current routing protocols for WSNs into two categories according to their orientation toward either homogeneous or heterogeneous WSNs. They are further classified into static and mobile ones. We give an overview of these protocols in each category by summarizing their characteristics, limitations, and applications. Finally, some open issues in energy-efficient routing protocol design for WSNs are indicated.
148 citations
Cites background from "Minimum cost path problems with rel..."
...It first models the problem based on the minimum cost path problem with relays [39] and formulates it as a multi-objective optimization problem....
[...]
TL;DR: The security threats and vulnerabilities imposed by the distinctive open nature of WSNs are examined and a comprehensive survey of various routing and middleware challenges for wireless networks is presented.
Abstract: Advances in hardware manufacturing technology, wireless communications, micro electro-mechanical devices and information processing technologies enabled the development of WSNs. These consist of numerous, low cost, small sensor nodes powered by energy constrained batteries. WSNs have attracted much interest from both industry and academia due to its wide range of applications such as environment monitoring, battlefield awareness, medical healthcare, military investigation and home appliances management. Thus information in sensor network needs to be protected against various attacks. Attackers may employ various security threats making the WSN systems vulnerable and unstable. This paper examines the security threats and vulnerabilities imposed by the distinctive open nature of WSNs. We first summarize the requirements in WSNs that includes both the survivality and security issues. Next, a comprehensive survey of various routing and middleware challenges for wireless networks is presented. Next, paper explores the potential security threats at different protocol layers. Here various security attacks are identified along with their countermeasures that were investigated by different researchers in recent years. We also provide a detailed survey of data aggregation and the energy-efficient routing protocols for WSNS. And finally, few unsolved technical challenges and the future scope for WSN security has been outlined.
127 citations
TL;DR: This article surveys the main contributions that have appeared in the scientific literature addressing resource constrained shortest path problems to provide a starting point for researchers who want to address the problems at hand.
Abstract: This article surveys the main contributions that have appeared in the scientific literature addressing resource constrained shortest path problems. The aim of this work is twofold: to give a structured survey of the literature on this topic; to provide a starting point for researchers who want to address the problems at hand. The study is focused on the relevant contributions dealing with exact solution approaches. © 2013 Wiley Periodicals, Inc. NETWORKS, Vol. 62(3), 183-200 2013
121 citations
TL;DR: In this article, the authors define the shortest-walk problem to determine the route from a starting point to a destination with minimum detouring; this route may include cycles for detouring to recharge batteries.
Abstract: Electric vehicles (EV) have received much attention in the last few years. Still, they have neither been widely accepted by commuters nor by organizations with service fleets. It is predominately the lack of recharging infrastructure that is inhibiting a wide-scale adoption of EVs. The problem of using EVs is especially apparent in long trips, or inter-city trips. Range anxiety, when the driver is concerned that the vehicle will run out of charge before reaching the destination, is a major hindrance for the market penetration of EVs. To develop a recharging infrastructure it is important to route vehicles from origins to destinations with minimum detouring when battery recharging/exchange facilities are few and far between. This paper defines the EV shortest-walk problem to determine the route from a starting point to a destination with minimum detouring; this route may include cycles for detouring to recharge batteries. Two problem scenarios are studied: one is the problem of traveling from an origin to a destination to minimize the travel distance when any number of battery recharge/exchange stops may be made. The other is to travel from origin to destination when a maximum number of stops is specified. It is shown that both of these problems are polynomially solvable and solution algorithms are provided. This paper also presents another new problem of finding the route that minimizes the maximum anxiety induced by the route.
89 citations
References
More filters
TL;DR: This paper is the text of an invited address before the annual summer meeting of the American Mathematical Society at Laramie, Wyoming, September 2, 1954, of an expository nature on the theory of dynamic programming.
Abstract: Abstract : The paper is the text of an invited address before the annual summer meeting of the American Mathematical Society at Laramie, Wyoming, September 2, 1954. The contents are chiefly of an expository nature on the theory of dynamic programming.
1,474 citations
"Minimum cost path problems with rel..." refers background in this paper
...Another difference is the fact that optimal paths may contain subpaths that are not optimal, which means that labeling algorithms supported by Bellman’s principle of optimality [1] cannot be applied directly to the MCPPR....
[...]
...Uniformly integer cost, relay and weight values generated in [1, 100] and W = 50, 110 were considered....
[...]
...For instance, the paths 〈1, 2〉 and 〈1, 2̂〉 in network (N1,A1) shown in Figure 1a correspond to labels la = [5, 3, 1, 2] and lb = [5, 0, 1, 2], respectively....
[...]
01 Jan 1980
TL;DR: Algorithms are provided for some of the bicriterion path problems in directed graphs, including polynomial algorithms for the MAXMIN-MAXMIN problem and the MINSUM-MAX MIN problem, and a pseudo-polynomial exact algorithm as well as a fullyPolynomial approximation scheme for the MINsUM-MINSUM problem.
Abstract: Bicriterion path problems in directed graphs are systematically studied. A series of ten problems are defined and their computational complexity examined. Algorithms are provided for some of them, including polynomial algorithms for the MAXMIN-MAXMIN problem and the MINSUM-MAXMIN problem, and a pseudo-polynomial exact algorithm as well as a fully polynomial approximation scheme for the MINSUM-MINSUM problem.
556 citations
"Minimum cost path problems with rel..." refers methods in this paper
...As mentioned earlier this approach solves a problem similar to the bicriteria shortest path problem for every feasible weight, which Hansen proved to have a number of non-dominated solutions that may grow exponentially [9], and thus the BMCPPR is NP-hard....
[...]
TL;DR: It is proved that any pair of nondominated path can be connected by nondominated paths, which is the support of an algorithm that can be viewed as a variant of the simplex method used in continuous linear multiobjective programming.
446 citations
"Minimum cost path problems with rel..." refers methods in this paper
...Similar labeling algorithms for bicriteria shortest path problems (thus different objective functions) can be found in [3, 8, 10, 11], among others....
[...]
TL;DR: A very fast algorithm for solving the bicriterion shortest-path problem is contributed with some simple domination conditions, and the number of iterations needed to find all the efficient (Pareto optimal) paths in the network is reduced.
205 citations
"Minimum cost path problems with rel..." refers methods in this paper
...Similar labeling algorithms for bicriteria shortest path problems (thus different objective functions) can be found in [3, 8, 10, 11], among others....
[...]
TL;DR: In this paper, several implementations of a general label correcting algorithm are discussed for bicriterion networks and their implementations are compared on networks of varying size and having varying degrees of correlation between the two criteria.
152 citations
"Minimum cost path problems with rel..." refers background or methods in this paper
...For instance, the paths 〈1, 2〉 and 〈1, 2̂〉 in network (N1,A1) shown in Figure 1a correspond to labels la = [5, 3, 1, 2] and lb = [5, 0, 1, 2], respectively....
[...]
...Similar labeling algorithms for bicriteria shortest path problems (thus different objective functions) can be found in [3, 8, 10, 11], among others....
[...]