Pruning-based pareto front generation for mixed-discrete bi-objective optimization

Cited 1 time in webofscience Cited 0 time in scopus
  • Hit : 272
  • Download : 0
This note proposes an effective pruning-based Pareto front generation method in mixed-discrete bi-objective optimization. The mixed-discrete problem is decomposed into multiple continuous subproblems; two-phase pruning steps identify and prune out non-contributory subproblems to the Pareto front construction. The efficacy of the proposed method is demonstrated on three benchmark examples.
Publisher
SPRINGER
Issue Date
2015-01
Language
English
Article Type
Article
Keywords

WEIGHTED-SUM METHOD; MULTIOBJECTIVE OPTIMIZATION; ALGORITHM

Citation

STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION, v.51, no.1, pp.193 - 198

ISSN
1615-147X
DOI
10.1007/s00158-014-1111-1
URI
http://hdl.handle.net/10203/196072
Appears in Collection
AE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 1 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0