基于混合群集智能算法的并行公差优化设计

• 论文 •

基于混合群集智能算法的并行公差优化设计

肖人彬, ，陶振武，邹洪富

1.华中科技大学管理学院，湖北武汉430074；2.华中科技大学 CAD中心，湖北武汉430074

出版日期:2007-04-15 发布日期:2007-04-25

Concurrent tolerance optimization design based on hybrid swarm intelligence algorithm

XIAO Ren-bin, TAO Zhen-wu, ZOU Hong-fu

1.Sch. of Management, Huazhong Univ. of S&T, Wuhan430074, China; 2.CAD Cent., Huazhong Univ. of S&T, Wuhan430074, China

Online:2007-04-15 Published:2007-04-25

摘要/Abstract

摘要： 通过对并行公差优化设计的分析，将其视为一种混合变量组合优化问题。首先给出了并行公差优化设计的数学模型，然后将其映射为一类特殊的旅行商问题——顺序多路旅行商问题，从而降低了问题的求解难度。利用蚁群优化算法和粒子群优化算法，分别在求解离散和连续变量优化时的优势，提出了一种求解并行公差优化设计问题的混合群集智能算法。通过一个计算实例，将混合群集智能算法分别与遗传算法和模拟退火算法进行了比较，结果表明，前者具有更强的搜索能力和较高的效率。同时，混合群集智能算法也为求解一般意义的混合变量优化问题提供了借鉴和参考。

关键词: 并行公差设计, 混合变量优化, 群集智能, 旅行商问题

Abstract: According to the analysis of the characteristics of concurrent tolerance optimization design, it could be regarded as the hybrid variable combinational optimization problem. Firstly, the mathematical model of concurrent optimization was presented. Then it was mapped to a kind of special Traveling Salesman Problem (TSP)－the Sequence Multi-way Traveling Salesman Problem (SMTSP), which could reduce the difficulty of solving problem. Borrowing the advantages of Ant Colony Optimization (ACO) in discrete problems and Particle Swarm Optimization (PSO) in continuous problems, a Hybrid Swarm Intelligence Algorithm (HSIA) was proposed, which was applied to concurrent tolerance optimization design and searching satisfied results. Result of a simple computational example showed that the HSIA was more efficient with stronger searching ability than Genetic Algorithm (GA) and Simulation Annealing (SA) algorithm. Furthermore, it also provided a new idea to solve the general hybrid variable optimization problem.

Key words: concurrent tolerance design, hybrid variable optimization, swarm intelligence, traveling salesman problem

中图分类号:

TG802
TP18

肖人彬, ，陶振武，邹洪富. 基于混合群集智能算法的并行公差优化设计[J]. .

XIAO Ren-bin,, TAO Zhen-wu, ZOU Hong-fu. Concurrent tolerance optimization design based on hybrid swarm intelligence algorithm[J]. .

[1]	张玉茹,王晨旸. 引入变异算子的改进贪心和蚁群混合算法[J]. 计算机集成制造系统, 2020, 26(第3): 860-870.
[2]	吴腾宇,余海燕4. 带有线性惩罚的在线旅行商问题[J]. 计算机集成制造系统, 2017, 23(第4期): 913-920.
[3]	李明富,马建华,张玉彦,周后明. 基于离散萤火虫算法的自由曲面测量序列规划[J]. 计算机集成制造系统, 2014, 20(11): 2719-2727.
[4]	杨凡,李歧强,刘珊,王桂荣. 浇次计划编制的混合启发式—交叉熵算法[J]. 计算机集成制造系统, 2014, 20(09): 2241-2247.
[5]	吴昊,,倪志伟,,王会颖,,+. 基于MapReduce的蚁群算法[J]. , 2012, 18(07): 0-0.
[6]	薛云灿,，郑东亮,，杨启文,. 基于改进离散粒子群算法的炼钢连铸最优炉次计划[J]. , 2011, 17(07): 0-0.
[7]	肖人彬,，易文明，陶振武，芦进. 面向拉式生产系统的蚁群劳动分工建模及仿真[J]. , 2010, 16(09): 0-0.
[8]	赵，王伟，潘学军. 一种并行粒子群算法及其在热轧计划中的应用[J]. , 2007, 13(04): 0-0.
[9]	张旭梅，邱晗光. 基于k-中心点法的改进粒子群算法在旅行商问题中的应用[J]. , 2007, 13(01): 0-0.