矢量禁忌算法及其在电磁场逆问题中的应用

作者：吴烈1,吴向军2 日期：2008-06-23/span> 浏览：3348 查看PDF文档

矢量禁忌算法及其在电磁场逆问题中的应用

吴烈1,吴向军2
(1.温州大学 物理与电子信息学院,浙江 温州 325027; 2.西南电力设计院,四川 成都 610016)

摘要：为分析、计算多目标优化设计的电磁场逆问题，提出了矢量禁忌优化算法。在矢量禁忌算法中，应用接触理论判断Pareto最优解、应用排序法确定可行解的适值。为保证搜索到的Pareto最优解均匀分布于目标函数和决策变量空间，提出了一种简单、有效的适值共享函数。通过典型算例的验证，可以看出，对于多目标优化设计问题，所提出的矢量禁忌能够搜索到均匀、平滑的Pareto曲线，由此可见，矢量禁忌算法可实际运用于复杂工程电磁场逆问题的分析和计算。
关键词：多目标优化;禁忌搜索算法;矢量优化算法;电磁场逆问题
中图分类号：TM154.4文献标识码：A文章编号：1001-4551(2008)05-0051-03

A vector tabu search method and its application in inverse electromagnetic problems
WU Lie, WU Xiangjun
(1.College of Physics & Electrical Information, Wenzhou University, Wenzhou 325027, China;
2.Southwest Electric Power Design Institute, Chengdu 610016, China)
Abstract: To find out the Pareto solutions of multiobjective optimal design problems arising from inverse electromagnetic problems, a tabu search method was proposed. For this goal, the contact theorem was used to determine the Pareto solutions. To scale the multiobjective in sense of Pareto optimal, the ranking approach was used and the fitness sharing function was introduced to guarantee the diversity of the searched Pareto solutions in both parameter and objective spaces. Numerical results are reported to demonstrate the power of the proposed algorithm in ensuring uniform sampling and obtaining the Pareto optimal front of the multiobjective design problems.
Key words: multiobjective optimization; tabu search method; vector optimal method; inverse electromagnetic problems
参考文献(Reference):
［1］高瞩.卷绕机旋臂四杆机构的蚁群优化算法［J］.轻工机械,2007,25(3):38-71.
［2］EBERHART R C, SIMPSON P K, DOBBINS R W. Computational intelligence PC tool［J］. Academic,1996(6):212-226.
［3］VELDHUIZEN D A V, LAMONT G B. Multiobjective evolutionary algorithms: analyzing the stateoftheart［J］. Evol. Comput,2000,8:125-147.
［4］GOLDBERG D E. Genetic Algorithms in Search, Optimization, and Machine Learning. Reading［M］. AddisionWesley, 1989.
［5］杨仕友，倪光正，李岩，等.模拟退火算法的改进及其在电机电磁场逆问题数值计算中的应用［J］.电工技术学报，1998,13（2）：21-23.
［6］张慧,杨仁友,倪光正.快速全局优化算法在电磁场逆问题中的应用［J］.机电工程,2007,24(10):44-47.