首页 | 官方网站   微博 | 高级检索  
     


Proposal of a cannibalism bug‐based search strategy using genetic algorithms (C‐BUGS) and its application to multiobjective optimization problems
Authors:Keiichiro Yasuda  Osamu Yamazaki  Takao Watanabe
Abstract:For decision support under a multiobjective environment, it is effective to offer a Pareto optimal solution set with uniform distribution to the decision‐maker. In this paper, a new optimization method for obtaining a Pareto optimal solution set with such uniform distribution is proposed. In order to overcome the difficulty of realizing this goal, the concept of cannibalism is introduced in BUGS (a bug‐based search strategy using genetic algorithms). Introducing the concept of cannibalism achieves the uniform distribution of Pareto optimal solutions. A numerical experiment using typical continuous and discrete multiobjective optimization problems clarifies the usefulness of the proposed method. © 2002 Scripta Technica, Electr Eng Jpn, 139(1): 51–64, 2002; DOI 10.1002/eej.1146
Keywords:Multiobjective optimization  genetic algorithm  bug‐based search algorithm  knapsack problem  
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号