Convergent Network Approximation for the Continuous Euclidean Length Constrained Minimum Cost Path Problem
نویسندگان
چکیده
منابع مشابه
Convergent Network Approximation for the Continuous Euclidean Length Constrained Minimum Cost Path Problem
In many path planning situations we would like to find a path of constrained Euclidean length in R2 that minimises a line integral. We call this the Continuous Length-Constrained Minimum Cost Path Problem (C-LCMCPP). Generally, this will be a non-convex optimization problem, for which continuous approaches only ensure locally optimal solutions. However, network discretisations yield weight cons...
متن کاملA Fuzzy Random Minimum Cost Network Flow Programming Problem
In this paper, a fuzzy random minimum cost flow problem is presented. In this problem, cost parameters and decision variables are fuzzy random variables and fuzzy numbers respectively. The object of the problem is to find optimal flows of a capacitated network. Then, two algorithms are developed to solve the problem based on Er-expected value of fuzzy random variables and chance-constrained pro...
متن کاملMinimum cost-reliability ratio path problem
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...
متن کاملConvergent Lagrangian heuristics for nonlinear minimum cost network flows
We consider the separable nonlinear and strictly convex single-commodity network flow problem (SSCNFP). We develop a computational scheme for generating a primal feasible solution from any Lagrangian dual vector; this is referred to as “early primal recovery”. It is motivated by the desire to obtain a primal feasible vector before convergence of a Lagrangian scheme; such a vector is not availab...
متن کامل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, whic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Optimization
سال: 2009
ISSN: 1052-6234,1095-7189
DOI: 10.1137/070695356