نتایج جستجو برای: multiobjective problem

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

2008
Christian Glaßer Christian Reitwießner Heinz Schmitz

We introduce multiobjective disk cover problems and study their approximability. We construct a polynomial-time approximation scheme (PTAS) for the multiobjective problem where k types of points (customers) in the plane have to be covered by disks (base stations) such that the number of disks is minimized and for each type of points, the number of covered points is maximized. Our approximation ...

2009
António Dourado Agostinho Rosa Kurosh Madani Dragana Laketic Thaise Yano Eliane Martins Ali D. Mehrabi Saeed Mehrabi Liping Zheng Guangyao Li Jing Liang Ahmed Kattan Mohammed Al-Mulla Francisco Sepulveda Ali Hajbabaie Nelson Rangel-Valdez Jose Torres-Jimenez Josue Bracho-Rios Caroline Prodhon Demetrio Macías Farouk Yalaoui Oxana Lapteva Diego Ordóñez Carlos Dafonte J. M. Herrero

In this article a procedure to tune robust Generalized Predictive Controllers (GPC) is presented. To tune the controller parameters a multiobjective optimization problem is formulated so the designer can consider conflicting objectives simultaneously without establishing any prior preference. Moreover model uncertainty, represented by a list of possible models, is considered. The multiobjective...

1997
C M Fonseca P J Fleming

This section reviews current approaches to multiobjective optimization with evolutionary algorithms. After introducing the subject, multiobjective fitness evaluation is formulated as a two-step process: a decision-making problem which reflects the preferences of an expert in the relevant problem domain followed by conventional fitness assignment and selection. The presentation and discussion of...

Journal: :Simulation 2003
Lisa A. Schaefer Craig W. Kirkwood

This article reviews the characteristics of the model selection problem for simulation software or analyses and presents a multiobjective decision analysis approach for model selection that addresses these characteristics. The approach is illustrated with an application to selecting a modeling approach for simulating transport agents. The authors discovered that using multiobjective decision an...

2007
Efrén Mezura-Montes Carlos A. Coello Coello

In this chapter, we present a survey of constraint-handling techniques based on evolutionary multiobjective optimization concepts. We present some basic definitions required to make this chapter self-contained, and then we introduce the way in which a global (single-objective) nonlinear optimization problem is transformed into an unconstrained multiobjective optimization problem. A taxonomy of ...

2007
Vadim Azhmyakov John R. Cannon

In the present work, we consider a class of nonlinear optimal control problems, which can be called “optimal control problems in mechanics.” We deal with control systems whose dynamics can be described by a system of Euler-Lagrange or Hamilton equations. Using the variational structure of the solution of the corresponding boundary-value problems, we reduce the initial optimal control problem to...

2012
C. Chitra P. Subbaraj

The shortest path routing problem is a multiobjective nonlinear optimization problem with constraints. This problem has been addressed by considering Quality of service parameters, delay and cost objectives separately or as a weighted sum of both objectives. Multiobjective evolutionary algorithms can find multiple pareto-optimal solutions in one single run and this ability makes them attractive...

Journal: :JNW 2013
Xiaoyan Gao

The purpose of this paper is to consider a class of non-smooth multiobjective semi-infinite programming problem. Based on the concepts of local cone approximation, K − directional derivative and K − subdifferential, a new generalization of convexity, namely generalized uniform ( , , , ) K F d α ρ − − convexity, is defined for this problem. For such semi-infinite programming problem, several suf...

2005
Scott Ferguson Ashwin Gurnani

In this paper, we investigate the issue of convergence in multiobjective optimization problems when using a MultiObjective Genetic Algorithm (MOGA) to determine the set of Pareto optimal solutions. Additionally, given a Pareto set for a multi-objective problem, the mapping between the performance and design space is studied to determine design variable configurations for a given set of performa...

2011
Charles Delort Olivier Spanjaard Paul Weng

This paper is devoted to a knapsack problem with a cardinality constraint when dropping the assumption of additive representability [10]. More precisely, we assume that we only have a classification of the items into ordered classes. We aim at generating the set of preferred subsets of items, according to a pairwise dominance relation between subsets that naturally extends the ordering relation...

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

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