首页> 外文期刊>International Journal of Forestry Research >Using Different Approaches to Approximate a Pareto Front for a Multiobjective Evolutionary Algorithm: Optimal Thinning Regimes forEucalyptus fastigata
【24h】

Using Different Approaches to Approximate a Pareto Front for a Multiobjective Evolutionary Algorithm: Optimal Thinning Regimes forEucalyptus fastigata

机译:多目标进化算法使用不同的方法逼近帕累托峰:桉树的最佳疏伐制度

获取原文
       

摘要

A stand-level, multiobjective evolutionary algorithm (MOEA) for determining a set of efficient thinning regimes satisfying two objectives, that is, value production for sawlog harvesting and volume production for a pulpwood market, was successfully demonstrated for aEucalyptus fastigatatrial in Kaingaroa Forest, New Zealand. The MOEA approximated the set of efficient thinning regimes (with a discontinuous Pareto front) by employing a ranking scheme developed by Fonseca and Fleming (1993), which was a Pareto-based ranking (a.k.a Multiobjective Genetic Algorithm—MOGA). In this paper we solve the same problem using an improved version of a fitness sharing Pareto ranking algorithm (a.k.a Nondominated Sorting Genetic Algorithm—NSGA II) originally developed by Srinivas and Deb (1994) and examine the results. Our findings indicate that NSGA II approximates the entire Pareto front whereas MOGA only determines a subdomain of the Pareto points.
机译:一种用于确定满足两个目标(即锯材收获的价值生产和纸浆市场的批量生产)的有效稀疏方案的标准的多目标进化算法(MOEA),已成功地演示了新加里加罗亚森林中的桉木西兰。 MOEA通过采用Fonseca和Fleming(1993)开发的排名方案(基于多目标遗传算法,即多目标遗传算法,MOGA),对有效的稀疏机制集(具有不连续的Pareto前沿)进行了近似。在本文中,我们使用最初由Srinivas和Deb(1994)开发的适应度共享Pareto排序算法(也称为非支配排序遗传算法—NSGA II)的改进版本解决了相同的问题,并检验了结果。我们的发现表明,NSGA II近似整个帕累托前沿,而MOGA仅确定帕累托点的子域。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号