摘要
约束选址问题是一个多目标约束优化问题,传统算法(加权法)一次只能得到一个候选解,用多目标演化优化算法对其进行求解,可以一次得到多个候选解,给决策者提供更多的选择余地,以期获得更大的利益。数字试验表明,该方法优于传统多目标优化方法。
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.
出处
《计算机工程与设计》
CSCD
2003年第3期1-3,共3页
Computer Engineering and Design
基金
国家自然科学基金资助项目(60073043
70071042
60133010)
并行与分布处理国家重点实验室基金资助项目
