{"id":1611,"date":"2013-01-06T15:11:40","date_gmt":"2013-01-06T06:11:40","guid":{"rendered":"http:\/\/www.is.doshisha.ac.jp\/~tomo\/ftw\/?p=1611"},"modified":"2013-01-06T15:11:40","modified_gmt":"2013-01-06T06:11:40","slug":"multiobjective-evolutionary-algorithms-a-survey-of-the-state-of-the-art-swarm-and-evolutionary-computation","status":"publish","type":"post","link":"https:\/\/is.doshisha.ac.jp\/~tomo\/ftw\/?p=1611","title":{"rendered":"Multiobjective evolutionary algorithms : A survey of the state of the art. Swarm and Evolutionary Computation"},"content":{"rendered":"

Zhou, A., Qu, B., Li, H., Zhao, S., & Nagaratnam, P. (2011). Multiobjective evolutionary algorithms : A survey of the state of the art. Swarm and Evolutionary Computation<\/a>, 1(1), 32\u201349. doi:10.1016\/j.swevo.2011.03.00
\n\u591a\u76ee\u7684\u6700\u9069\u5316\u306esurvey\u8ad6\u6587\u3002
\n\u975e\u5e38\u306b\u5e83\u304f\u8abf\u67fb\u3057\u3066\u3044\u308b\u3002\u5fc5\u8aad\u3002
\n
\nMultiobjective evolutionary algorithms: A survey of the state of the art
\n1. Introduction
\n2. Advances in MOEA design
\n 2.1 Algorithm framworks
\n 2.1.1. An MOEA based on decomposion: MOEA\/D
\n 2.1.2 MOEAs based on preference
\n 2.1.3 Indicator based MOEAs
\n 2.1.4 Hybrid MOEAs
\n 2.1.5 Memtic MOEAs
\n 2.1.6 MOEAs based on coevolution
\n 2.2 Selection and population updating
\n 2.2.1 Complete orders over individuals
\n 2.2.2 Complete orders over populations
\n 2.3 Reproduction
\n 2.3.1 DE-Based Approaches
\n 2.3.2 Immune-based appraches
\n 2.3.3 PSO-based approaces
\n 2.3.4 Prbabilistic model-based appraches
\n 2.3.5 SA-based approaches
\n 2.3.6 Other approaces
\n 2.4 Other issues
\n 2.4.1 Theoretical studies of MOEAs
\n 2.4.2 Adaptation
\n3. MOEAs for complicated problems
\n 3.1 Constraint handling in MOEAs
\n 3.2 MOEAs as constrint handling methods
\n 3.3 MOEAs and multimodal problems
\n 3.4 MOEAs for many-objective problems
\n 3.5 Compuationally expensive multiobjective optimization
\n 3.6 Dynamic multiobjective optimizaiton
\n 3.7 Noisy multiobjective optimization
\n 3.8 MOEAs for combinatorial and discrete problems
\n4. Benchmark problems and performance measures
\n 4.1 Benchmark problems
\n 4.2 Performance measures
\n5. Applications
\n6. Conclusions and future directions<\/p>\n","protected":false},"excerpt":{"rendered":"

Zhou, A., Qu, B., Li, H., Zhao, S., &#03 … \u7d9a\u304d\u3092\u8aad\u3080 →<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[11],"tags":[],"class_list":["post-1611","post","type-post","status-publish","format-standard","hentry","category-11"],"_links":{"self":[{"href":"https:\/\/is.doshisha.ac.jp\/~tomo\/ftw\/index.php?rest_route=\/wp\/v2\/posts\/1611","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/is.doshisha.ac.jp\/~tomo\/ftw\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/is.doshisha.ac.jp\/~tomo\/ftw\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/is.doshisha.ac.jp\/~tomo\/ftw\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/is.doshisha.ac.jp\/~tomo\/ftw\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=1611"}],"version-history":[{"count":0,"href":"https:\/\/is.doshisha.ac.jp\/~tomo\/ftw\/index.php?rest_route=\/wp\/v2\/posts\/1611\/revisions"}],"wp:attachment":[{"href":"https:\/\/is.doshisha.ac.jp\/~tomo\/ftw\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=1611"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/is.doshisha.ac.jp\/~tomo\/ftw\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=1611"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/is.doshisha.ac.jp\/~tomo\/ftw\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=1611"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}