摘 要

在机械制造领域中，数控机床作为主要的加工设备，扮演着极为重要的角色，因此有着“工业之母”的美称。随着信息技术在机械制造领域的应用革新，数控机床的出现极大地提高了机械制造行业的效率，使得相对较为复杂的零件加工变得更加容易。在商品经济高度发展的今天，数控机床的加工效率成为影响工业生产的重要因素。因此，然后如何实现数控机床加工效率的提升，已成为整个行业重点研究的内容。数控机床在加工过程中大部分时间花费在刀具的切割和工件之间的转移上，而刀具的切割和工件之间的转移又受模型的加工顺序的影响，合理地安排数控机床加工次序，缩短加工路径长度，能有效地提高加工效率。在大批量制造加工过程中，按照最短的路径进行加工任务，能够降低单位能耗，创造可观的环境价值和经济效益。

本文的主要工作为：研究分析数控机床路径规划问题，借鉴路径规划的经典模型旅行商问题建立数控机床路径规划模型，分析比较目前主流路径规划算法优缺点，选择遗传算法作为主要的求解算法并在其基础上加以改进，吸取其他算法的优点，大量运用自适应相关知识，提高算法的性能，最后运用MATLAB进行仿真设计，验证算法的有效性和可靠性。

关键词：数控机床路径规划；旅行商问题；改进遗传算法；MATLAB

ABSTRACT

In the field of mechanical manufacturing, CNC machine tools play an extremely important role as the main processing equipment, so they have the reputation of “the mother of industry”. With the application innovation of information technology in the field of mechanical manufacturing, the emergence of CNC machine tools has greatly improved the efficiency of the machine manufacturing industry, making the processing of relatively complex parts easier. In today's highly developed commodity economy, the processing efficiency of CNC machine tools has become an important factor affecting industrial production. Therefore, how to achieve the improvement of CNC machine tool processing efficiency has become the focus of the entire industry. CNC machine tools spend most of the time in the machining process between the cutting of the tool and the transfer of the workpiece, and the cutting between the cutting and the workpiece is affected by the processing sequence of the model, and the processing sequence of the CNC machine is reasonably arranged to shorten The processing path length can effectively improve the processing efficiency. In the process of mass production and processing, processing tasks according to the shortest path can reduce unit energy consumption and create considerable environmental and economic benefits.

The main work of this thesis is to study and analyze the path planning problem of CNC machine tools, to build a path model of CNC machine tools based on the classic model traveling salesman problem of path planning, analyze and compare the advantages and disadvantages of current mainstream path planning algorithms, and choose genetic algorithm as the main solving algorithm. Based on the improvement, the advantages of other algorithms are absorbed, and the adaptive knowledge is used in a large amount to improve the performance of the algorithm. Finally, the simulation design is carried out by using MATLAB to verify the validity and reliability of the algorithm.

Keywords: CNC machine tool path planning；traveling salesman problem；improved genetic algorithm；MATLAB

目 录

第一章 绪论 1

1.1课题来源 1

1.2课题研究背景及意义 1

1.2.1课题研究背景 1

1.2.2研究意义 2

1.3国内外研究现状 2

1.4本文主要研究内容及组织结构 3

1.4.1本文主要研究内容 3

1.4.2论文组织结构 4

第二章 数控机床路径规划问题及求解算法 5

2.1数控机床路径规划问题描述 5

2.2相关算法概述 6

2.2.1遗传算法 6

2.2.2模拟退火算法 7

2.2.3蚁群算法 8

2.2.4算法比较选择 9

第三章 建立数学模型 11

3.1数据预处理 11

3.2数学模型建立的假设条件 12

3.3数学模型建立 12

3.3.1距离矩阵的生成 12

3.3.2约束条件 13

3.3.3建立数学模型 13

第四章 改进遗传算法的设计 15

4.1遗传算法迭代过程分析 15

4.2种群初始化设计 15

4.3选择算子改进设计 18

4.4交叉算子改进设计 20

4.5变异算子改进设计 22

4.6遗传算法的流程 22

第五章 实验验证 25

5.1种群整体适应函数值 25

5.2实例验证 27

5.2.1传统遗传算法的设定 27

5.2.2算法实验数据以及分析 27

5.3实验总结 30

第六章 总结与展望 31

6.1总结 31

6.2展望 31

参考文献 33

致谢 35

第一章 绪论

1.1课题来源

本课题的主要研究工作来源于国家科技部项目：“重型数控机床光纤传感在线监测与热误差补偿合作研究”项目，项目编号：Grant No.2015DFA70340。

1.2课题研究背景及意义

1.2.1课题研究背景