首页 | 官方网站   微博 | 高级检索  
     

蚂蚁算法在概念设计方案求解中的应用
引用本文:薄瑞峰,黄洪钟,吴卫东.蚂蚁算法在概念设计方案求解中的应用[J].西安交通大学学报,2005,39(11):1236-1240.
作者姓名:薄瑞峰  黄洪钟  吴卫东
作者单位:1. 大连理工大学精密与特种加工教育部重点实验室,116023,大连
2. 大连理工大学精密与特种加工教育部重点实验室,116023,大连;电子科技大学机械电子工程学院,610054,成都
基金项目:国家自然科学基金资助项目(59685003);教育部高等学校全国优秀博士学位论文专项基金资助项目(200232).
摘    要:通过分析概念设计方案求解问题与旅行商问题的相似性,将方案求解问题转化为组合优化的最优路径问题,建立了基于动态规划的解空间模型和基于最长路径的优化模型,利用蚁群系统内在的正反馈寻优机制,将求解旅行商问题的基本蚂蚁算法应用于方案求解的组合优化过程,结合遗传算法的交叉变异操作,提出一种基于改进蚂蚁算法的求解方法,从而快速有效地获得了最优方案解,最后,以压力机的概念设计为例验证了该方法,研究表明,该方法是合理可行的,它可以使方案求解的人工寻优过程实现算法化,并具有较好的可操作性,从而为解决方案优化的组合爆炸问题提供了一种新的思路。

关 键 词:蚂蚁算法  方案求解  概念设计  旅行商问题
文章编号:0253-987X(2005)11-1236-05
收稿时间:2005-03-17
修稿时间:2005年3月17日

Application of Ant Algorithm to Scheme Solving for Conceptual Design
Bo Ruifeng,Huang Hongzhong,Wu Weidong.Application of Ant Algorithm to Scheme Solving for Conceptual Design[J].Journal of Xi'an Jiaotong University,2005,39(11):1236-1240.
Authors:Bo Ruifeng  Huang Hongzhong  Wu Weidong
Affiliation:Bo Ruifeng , Huang Hongzhong , Wu Weidong (1. Key Laboratory of Precision
Abstract:Analyzed the similarity between scheme solving problem and traveling salesman problem(TSP),the scheme solving problem for conceptual design is transformed into an optimal path problem in combinatorial optimization,where the dynamic programming based solution space model and the longest path based optimization model are developed.Then ant algorithm to resolve TSP is adopted to carry out scheme optimization according to the positive feedback searching mechanism of ant colony system,and some improvements are made incorporating crossover and mutation operators of genetic algorithm,to obtain the optimal scheme rapidly and effectively.A conceptual design case of presser is given to demonstrate the feasibility and rationality of this proposed approach.It is verified that this method enables scheme solving to be implemented with a better operability,which offers a promising way to solve combinatorial explosion problem in conceptual design.
Keywords:ant algorithm  scheme solving  conceptual design  traveling salesman problem
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号