Approximation Solutions for Time-Varying Shortest Path Problem
نویسندگان
چکیده مقاله:
Abstract. Time-varying network optimization problems have tradition-ally been solved by specialized algorithms. These algorithms have NP-complement time complexity. This paper considers the time-varying short-est path problem, in which can be optimally solved in O(T(m + n)) time,where T is a given integer. For this problem with arbitrary waiting times,we propose an approximation algorithm, which can solve the problem withO(T(m+n)/ k ) time complexity such that evaluates only a subset of the valuesfor t = {0, 1, . . . , T}.
منابع مشابه
Time-varying shortest path problems with constraints
The shortest path problem is considered with yet another extension. The transit times b(x,y,u) and the arc costs c(x,y,u) on arc (x,y) vary as a function of the departure time u at the beginning vertex of the arc. The problem considered is to find the shortest path between a pair of nodes such that the total traverse time is lesser than some specified value T. Waiting times at nodes are conside...
متن کاملApproximation Schemes for the Restricted Shortest Path Problem
The Restricted Shortest Path (RSP) problem, also known as the Delay-Constrained Least-Cost (DCLC) problem, is an NP-hard bicriteria optimization problem on graphs with n vertices and m edges. In a graph where each edge is assigned a cost and a delay, the goal is to find a min-cost path which does not exceed a delay bound. In this paper, we present improved approximation schemes for RSP on sever...
متن کاملAn Approximation Algorithm for a Shortest Dubins Path Problem
The problem of finding the shortest path for a vehicle visiting a given sequence of target points subject to the motion constraints of the vehicle is an important problem that arises in several monitoring and surveillance applications involving unmanned aerial vehicles. There is currently no algorithm that can find an optimal solution to this problem. Therefore, heuristics that can find approxi...
متن کاملImproved Approximation Schemes for the Restricted Shortest Path Problem ∗
The Restricted Shortest Path (RSP) problem, also known as the Delay-Constrained Least-Cost (DCLC) problem, is an NP-hard bicriteria optimization problem on graphs with n vertices and m edges. In a graph where each edge is assigned a cost and a delay, the goal is to find a min-cost path which does not exceed a delay bound. In this paper, we present improved approximation schemes for RSP on sever...
متن کاملShortest Path Problem with Gamma Probability Distribution Arc Length
We propose a dynamic program to find the shortest path in a network having gamma probability distributions as arc lengths. Two operators of sum and comparison need to be adapted for the proposed dynamic program. Convolution approach is used to sum two gamma probability distributions being employed in the dynamic program.
متن کاملA Landmark Algorithm for the Time-Dependent Shortest Path Problem
The shortest path problem is one of the most classical problem in combinatorial optimization problem which, given an edge-weighted graph and two vertices, asks to find a path between the two vertices of the minimum length. In this thesis, we consider a generalization of the shortest path problem in which the edge length is time-variable, which we call the time-dependent shortest path problem. T...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 2 شماره 2
صفحات 139- 147
تاریخ انتشار 2017-09-01
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023