Approximating Pareto frontier using a hybrid line search approach
نویسندگان
چکیده
منابع مشابه
Approximating Pareto frontier using a hybrid line search approach
The aggregation of objectives in multiple criteria programming is one of the simplest and widely used approach. But it is well known that this technique sometimes fail in different aspects for determining the Pareto frontier. This paper proposes a new approach for multicriteria optimization which aggregates the objective functions and uses a line search method in order to locate an approximate ...
متن کاملAnalyzing Inefficiency Using a Frontier Search Approach
Efficiency measurement naturally requires the definition of a frontier as a benchmark indicating efficiency. Usually a measure reflecting the distance of a data point to the frontier indicates the level of efficiency. One of the crucial characteristics to distinguish efficiency measurement tools is the way in which they construct the frontier. The class of deterministic and non parametric tools...
متن کاملThe RADO Approach to Quality-Driven Service Composition—Approximating the Pareto- Frontier in Polynomial Time
In Quality-Driven Service Composition, tasks from an abstract workflow are assigned to concrete services such that workflow QoS are optimized. The following three properties are desirable for a corresponding algorithm. First, the run time is ideally bounded by a polynomial in the number of workflow tasks and service candidates. Second, the algorithm provides formal guarantees on how close the r...
متن کاملApproximating Pareto curves using semidefinite relaxations
We consider the problem of constructing an approximation of the Pareto curve associated with the multiobjective optimization problem minx∈S{(f1(x), f2(x))}, where f1 and f2 are two conflicting polynomial criteria and S ⊂ Rn is a compact basic semialgebraic set. We provide a systematic numerical scheme to approximate the Pareto curve. We start by reducing the initial problem into a scalarized po...
متن کاملParametric search and problem decomposition for approximating Pareto-optimal 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...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Sciences
سال: 2010
ISSN: 0020-0255
DOI: 10.1016/j.ins.2009.12.018