检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]杭州数源科技股份有限公司西沙项目筹建办公室,浙江杭州310018 [2]中国计量学院信息工程学院,浙江杭州310018
出 处:《中国计量学院学报》2006年第3期203-206,共4页Journal of China Jiliang University
基 金:浙江省自然科学基金资助项目(No.Y109456)
摘 要:针对一般的二次载波的混沌优化方法收敛慢的弱点,提出了一些改进的方法.主要是利用当前解的信息,自动改变最优点的搜索路径,能明显提高首次载波寻找最佳点大概位置的速度和效能;同时能更快更精确实现二次载波的精细搜索.将该算法用于一机械设计问题———箱形盖板优化设计计算之中,取得了优于常规方法———Powell法的结果,说明该方法在机械优化设计中具有较好的应用价值.In this paper, some methods are put forward, to use the information of the current solution and to change the search path to the optimal point, thus improving the converging velocity of the COA (chaos optimization algorithm) based on carrier wave two times. This can greatly increase the velocity and efficiency of carrier wave the first time to search for the optimal point at comparatively rough precision. The refined search can be performed during carrying wave the second time more quickly and accurately. Quite a number of typical multiple-peak optimization computing examples indicate that the method in this paper is quite effective. Finally, this method is successfully applied to the mechanism optimization computation of a trunk cover board design. The outcome is better than that got by the Powell method, which means that the algorithm put forward in this paper has a good outlook in mechanism optimization design.
分 类 号:TH122[机械工程—机械设计及理论] TP309[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15