نتایج جستجو برای: bi objective optimization

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

High amounts of waste paper are disposed of every year in Iran posing the health hazard and environmental damages instead of being recovered. Collection, recovery and proper disposal of waste paper without damaging the environment need to design an efficient closed-loop supply chain network. The main objective of this paper is introducing a bi-objective, multi-echelon, multi-product and single-...

2008
CHENG-CHIEN KUO

An interactive pareto optimal with advantage (IPOA) approach for bi-objective programming is proposed and applied on capacitor placement and sizing problem. Two main contradictory concerned which including cost and quality properties are considered as bi-objective programming formulation. The IPOA approach can provide a valuable trade-off pareto-optimal solution by following the intention of de...

2015
Rituparna Datta Kalyanmoy Deb

Single objective evolutionary constrained optimization has been widely searched and researched by plethora of researchers in last two decades. On the other hand, multi-objective constraint handling using evolutionary algorithms has not been actively proposed. However, real-world multi-objective optimization problems consist of one or many non-linear and non-convex constraints. In the present wo...

2017
Benjamin Martin Alexandre Goldsztejn Laurent Granvilliers Christophe Jermann

The global optimization of constrained Non-Linear Bi-Objective Optimization problems (NLBOO) aims at covering their Pareto-optimal front which is in general a manifold in R. Continuation methods can help in this context as they can follow a continuous component of this front once an initial point on it is provided. They constitute somehow a generalization of the classical scalarizing framework ...

1999
Jinhuan Zhang Margaret M. Wiecek

ABSTRACT: The problem of robust design is treated as a bi-objective optimization problem in which the performance mean and variation are optimized and minimized, respectively. A method for deriving a utility function as a local approximation of the efficient frontier is presented and investigated at different locations of candidate solutions, with different ranges of interest, and for efficient...

دررودی, مریم, صادقیان, رامین,

In this paper, a general process is developed to find all non-dominated solutions of the multi objective combinatorial optimization (MOCO) problem. This process is based on the elastic constraints method and applies the identification of objective's bounds for it. Objectives bounds are determined by solving single objective integer programming problems. First the elastic constraints method is...

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

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