论文部分内容阅读
针对焊接任务规划的实际要求,确定了所需要的最优排序搜索方案.首先,弧焊作业的任务规划是多目标优化,在分析、归纳弧焊作业所必须面对的一系列约束的基础上,明确了此任务规划问题属于旅行商问题,并形成了一个归一化的约束表述,以此为依据形成了适应度指标函数.其次,考虑到旅行商问题是NP完全问题,采用蚁群搜索算法,利用算法的收敛性和并行性找出旅行商问题的近优解.最后,对弧焊作业焊接任务的排序进行了初步的编程仿真,验证了方案的合理性和可行性.
According to the actual requirements of the welding task planning, the optimal sequencing solution is determined.Firstly, the task planning of arc welding is multi-objective optimization, based on the analysis and induction of a series of constraints that arc welding operations must face , It is clear that this task planning problem belongs to the traveling salesman problem and forms a normalized constraint expression, which forms a fitness index function.Secondly, considering that the traveling salesman problem is a NP complete problem, an ant colony search Algorithm, the convergence and parallelism of the algorithm are used to find out the near optimal solutions of the traveling salesman problem.Finally, the preliminary programming simulation of the welding task of arc welding job is carried out to verify the rationality and feasibility of the scheme.