用多目标演化优化算法解决约束选址问题  

Solving constraints location problem with multi-objective optimizationevolutionary algorithm

作　　者：付朋辉[1] 康立山[1] 阎震宇[1] 

机构地区：[1]武汉大学软件工程国家重点实验室,湖北武汉430072

出　　处：《计算机工程与设计》2003年第3期1-3,共3页Computer Engineering and Design

基　　金：国家自然科学基金资助项目(60073043;70071042;60133010);并行与分布处理国家重点实验室基金资助项目

摘　　要：约束选址问题是一个多目标约束优化问题,传统算法(加权法)一次只能得到一个候选解,用多目标演化优化算法对其进行求解,可以一次得到多个候选解,给决策者提供更多的选择余地,以期获得更大的利益。数字试验表明,该方法优于传统多目标优化方法。Constraints location problem is a multi-objective problem. Only one solution can be gotten with running traditional algorithm one time. This paper presented a new multi-objective optimization evolutionary algorithm to get a pareto set of the solutions in order to get more benefit and to give the decision maker more choices. The experiments have showed that it has a better performance than traditional methods.

关 键 词：多目标演化优化算法 约束选址问题 数学模型 目标函数 模拟退火算法 

分 类 号：O224[理学—运筹学与控制论] TP301.6[理学—数学]