This paper presents a melhod for feasible decomposition applicable to large-scale, non-linear, multiobjective problems. The method, comprising a multi-level problem formulation and an interactive algorithm, has distinct advantages for dealing with real-world multi-objective optimization which is car
β¦ LIBER β¦
Multi-level optimization for multi-objective problems
β Scribed by Norihiro Takama; Daniel P. Loucks
- Publisher
- Elsevier Science
- Year
- 1981
- Tongue
- English
- Weight
- 721 KB
- Volume
- 5
- Category
- Article
- ISSN
- 0307-904X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Multi-level, multi-objective optimizatio
β
Norihiro Takama; Tomio Umeda
π
Article
π
1981
π
Elsevier Science
π
English
β 721 KB
Multi-objective ordinal optimization for
β
Suyan Teng; Loo Hay Lee; Ek Peng Chew
π
Article
π
2007
π
Elsevier Science
π
English
β 255 KB
A methodology for solvng multi-objective
β
Radi Teleb; Farhad Azadivar
π
Article
π
1994
π
Elsevier Science
π
English
β 744 KB
Approximating the nondominated frontiers
β
Murat KΓΆksalan; Banu Lokman
π
Article
π
2009
π
John Wiley and Sons
π
English
β 167 KB
Solving multi-objective dynamic optimiza
β
Cheng-Liang Chen; Chia-Yuan Chang; Daim-Yuang Sun
π
Article
π
2003
π
John Wiley and Sons
π
English
β 170 KB
A multi-start threshold accepting algori
β
Souhail Dhouib; AΓ―da Kharrat; Habib Chabchoub
π
Article
π
2010
π
John Wiley and Sons
π
English
β 591 KB
## Abstract A multiβstart threshold accepting algorithm with an adaptive memory (MSβTA) is proposed to solve multiple objective continuous optimization problems. The aim of this paper is to find efficiently multiple Paretoβoptimal solutions. Comparisons are carried out with multiple objective taboo