matlab计算帕累托前沿

收录时间:2014-05-07
资源分类:Matlab 工具:MATLAB 7.5 (R2007b)

在多个目标空间中确认帕累托前沿是很重要的,同时也是最浪费时间的多目标优化。该程序提供了两个算法实现从多目标点中查找帕累托前沿。

基本的算法现是通过mex函数。第二个算法利用了matlab矢量化的优点,将给定目标拆分为小组,然后通过第一种算法进行检查。然后,再将所有的帕累托前沿进行组合,计算出最终的帕累托前沿。

 

Pareto Front

Identifying the Pareto Front from a set of points in a multi-objective space is the most important and also the most time-consuming task in multi-objective optimization. Usually, this is done through so called nondominated sorting. In this package, two efficient algorithms are provided to find the Pareto Front from a large set of multi-objective points.

 

The basic algorithm is implemented as an mex function. The algorithm considers the logical relationship between dominated and nondominated points to avoid unnecessary comparisons as much as possible so that the overall operations reduced from n x n x m for an n x m problem to r x n x m, where r is the size of the final Pareto Front.

 

The second algorithm takes the advantage of vectorization of MATLAB to splits the given objective set into several smaller groups to be examined by the first algorithm. Then, the Pareto Fronts of each group are combined as one set to be

re-checked by the first algorithm again to determine the overall Pareto

Front. Numerical tests show that, the overal computation time can be reduced about half of using the first algorithm alone.

文件下载列表
paretofront.zip (4.92KB)  
附件内容(只显示5中的3个)
paretofront.c  paretofront.m  paretoGroup.m  
标签: 帕累托前沿 
更多

目前尚无评论

用户反馈   关于我们
Copyright (©) ZHIHUISHI.COM 2013 All Rights Reserved.
京ICP备14040384号