نتایج جستجو برای: pareto front coverage

تعداد نتایج: 163758  

2013
Diederik M. Roijers Shimon Whiteson Frans A. Oliehoek

In this paper we propose multi-objective variable elimination (MOVE), an efficient solution method for multi-objective collaborative graphical games (MO-CoGGs), that exploits loose couplings. MOVE computes the convex coverage set, which can be much smaller than the Pareto front. In an empirical study, we show that MOVE can tackle multi-objective problems much faster than methods that do not exp...

The most important issue in multi-objective optimization problems is to determine the Pareto points along the Pareto frontier. If the optimization problem involves multiple conflicting objectives, the results obtained from the Pareto-optimality will have the trade-off solutions that shaping the Pareto frontier. Each of these solutions lies at the boundary of the Pareto frontier, such that the i...

In this paper, a bi-objective pharmaceutical supply chain network under uncertainty demand and transportation costs is modeled and developed. To control the uncertainty parameters, the robust optimization method is considering. The main objective of this paper determines the number and location of potential facilities such as drug manufacture centers and drug distribution centers by considering...

Maghsoud Amiri, Mostafa Khajeh

Bi-objective optimization of the availability allocation problem in a series–parallel system with repairable components is aimed in this paper. The two objectives of the problem are the availability of the system and the total cost of the system. Regarding the previous studies in series–parallel systems, the main contribution of this study is to expand the redundancy allocation problems to syst...

2016
Khoi Nguyen Le Dario Landa-Silva

We propose a multi-objective evolutionary algorithm (MOEA), named the Hyper-volume Evolutionary Algorithm (HVEA). The algorithm is characterised by three components. First, individual fitness evaluation depends on the current Pareto front, specifically on the ratio of its dominated hyper-volume to the current Pareto front hyper-volume, hence giving an indication of how close the individual is t...

2011
Pruet Boonma Junichi Suzuki

This paper proposes and evaluates an evolutionary multiobjective optimization algorithm (EMOA) that uses a new quality indicator, called the prospect indicator, for parent selection and environmental selection operators. The prospect indicator measures the potential of each individual to reproduce offspring that dominate itself and spread out in the objective space. The prospect indicator allow...

2012
Chun-Hao Chen Tzung-Pei Hong Vincent S. Tseng Lien-Chin Chen L.-C. CHEN

Many approaches have been proposed for mining fuzzy association rules. The membership functions, which critically influence the final mining results, are difficult to define. In general, multiple criteria are considered when defining membership functions. In this paper, a multi-objective genetic-fuzzy mining algorithm is proposed for extracting membership functions and association rules from qu...

2005
Julio E. Alvarez-Benitez Richard M. Everson Jonathan E. Fieldsend

In extending the Particle Swarm Optimisation methodology to multi-objective problems it is unclear how global guides for particles should be selected. Previous work has relied on metric information in objective space, although this is at variance with the notion of dominance which is used to assess the quality of solutions. Here we propose methods based exclusively on dominance for selecting gu...

2008
Dimo Brockhoff Tobias Friedrich Frank Neumann

Goals: understand why hypervolume-based search is that successful understand basic properties of hypervolume indicator Approach: rigorous running time analyses of a hypervolume-based MOEA for (i) approaching the Pareto front (ii) approximating large Pareto fronts (unary) hypervolume indicator (A) = hypervolume/area of dominated part of search space between front A and reference point Pareto-dom...

2013
Bing Qi Fangyang Shen Heping Liu

Evolutionary optimization algorithms have been used to solve multiple objective problems. However, most of these methods have focused on search a sufficient Pareto front, and no efforts are made to explore the diverse Pareto optimal solutions corresponding to a Pareto front. Note that in semi-obnoxious facility location problems, diversifying Pareto optimal solutions is important. The paper the...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید