共查询到19条相似文献,搜索用时 390 毫秒
1.
2.
《计算机集成制造系统》2017,(6)
为了改善反射面天线面板的装配变形,从装配工艺入手,基于蚁群算法和遗传算法,结合传统的天线反射面装配方法,提出一种天线装配序列规划的混合算法。该算法利用蚁群算法快速得到初始种群,随后使用遗传算法对初始种群进行优化,根据所得优化解生成蚁群算法中路径上的信息素,通过加速蚁群算法最优解信息的积累来更快地得到最优解;同时,建立反射面装配的有限元仿真模型,利用该模型及时对得到的最优解(即装配序列)进行面向装配过程的面板装配变形动态仿真,将仿真结果返回算法中,进一步校正算法并得到最优解。以某工程抛物面天线的面板装配为例,验证了所提混合算法的正确性。 相似文献
3.
4.
为获取最佳的装配序列,提高飞机装配效率,扩展装配序列多样性,设计改进遗传算法的飞机结构件装配序列优化方法,以此作为飞机结构件装配序列优化的评价指标并设计对应的约束条件。依据评价指标及对应的约束条件,建立装配序列优化的目标函数;利用改进遗传算法求解目标函数的解。实验证明:该方法可有效优化装配序列,提高装配效率;在同种群容量时,该方法获取的可行装配序列数量较多,即装配序列多样性较佳,且收敛速度较快。 相似文献
5.
为提高大型反射面天线形面装配精度及装配效率,提出一种反射面天线面板装配优化方法。该方法从装配工艺入手,基于传统遗传算法的思想,建立了天线装配序列规划的遗传算法数学模型,其适应度函数包含了对装配变形、装配周期及装配人工消耗等方面的评价,考虑到装配精度和装配过程中的功耗,为相应的项赋予权重使其达到多目标优化的目的;同时,建立了天线装配的有限元仿真模型,对遗传算法得到的装配序列结果进行了面向装配过程的面板装配变形动态仿真,并将仿真结果反馈于装配序列规划模型的评价中,及时对遗传算法所求得最优解作出准确评估。以某工程9 m圆抛物面天线的面板装配为例,讨论了不同目标函数时的算法结果和仿真结果,分别求得了精度最高的装配序列、经济度最好的装配序列,以及考虑同时提高装配精度和增强经济度的装配序列。从而证明了所建立的反射面装配遗传算法数学模型的正确性及所提天线装配序列规划方法的高效性。 相似文献
6.
基于混合蛙跳算法的复杂产品装配序列规划 总被引:1,自引:0,他引:1
《计算机集成制造系统》2014,(12)
为提高机械产品的装配效率,提出一种基于混合蛙跳算法的产品装配序列规划方法。该方法针对混合蛙跳算法中各个模因组内的最优样本容易出现趋同性的现象,引入遗传算法,提出最优样本的差异性控制策略,以改善种群的差异性。建立了以装配操作稳定性、惩罚函数、装配方向改变次数和装配工具改变次数为装配序列评价指标的适应度函数模型。以一个装配体实例分析该算法的特性,验证了改进混合蛙跳算法的可行性和稳定性,并将该算法与标准混合蛙跳算法和遗传算法相比较,证明了改进混合蛙跳算法更有效。 相似文献
7.
8.
9.
《机械工程与自动化》2016,(5)
根据复杂产品的序列规划特点,为提高求解效率,提出了面向序列规划的混合算法。利用遗传算法和帝国主义竞争算法各自的优点,将二者有机联合,以重定向次数、装配工具改变次数以及装配类型变化次数为约束条件来构造目标函数,提出最小装配成本概念。以一个包含8个零件的装配体实例进行MATLAB仿真试验,分析混合算法特性,并将混合算法与单独的帝国主义竞争算法和遗传算法进行比较。试验证明该混合算法在求解效率上明显优于单独的智能算法,且求得的序列更加符合实际的装配需求。 相似文献
10.
基于遗传模拟退火融合算法的船舶分段装配序列优化 总被引:1,自引:0,他引:1
针对复杂船舶分段装配序列规划问题,提出基于遗传模拟退火算法的分段装配序列规划求解方法,综合考虑分段装配中的工艺约束和几何约束,建立以分段装配所需时间和消耗成本为优化目标的问题模型,并为模型求解设计了遗传模拟退火融合算法,将模拟退火算法的局部搜索能力与遗传算法的快速全局搜索能力相结合,达到快速收敛到全局最优解的目的.通过实例验证了该算法的有效性. 相似文献
11.
12.
L. Luo Z. Lin X. Lai 《The International Journal of Advanced Manufacturing Technology》2003,21(10-11):896-901
The optimisation fitting problems between two 3D parts with complicated profiles are the key focus in the problem of "body-in-white" (BIW) assembly for cars, which causes many assembly fitting issues. The paper present a novel algorithm based on a genetic algorithm (GA) to solve such assembly problems and treats it as a two-space curves-fitting problem. The analytical model of the global optimal fitting position of two space curves is discussed, and the mathematical optimal functions for 2D and 3D curves are set up separately. The global research procedure based on the genetic algorithm is described in detail, and some improved ways for GA in constrained optimisation are also discussed in the paper. 相似文献
13.
14.
15.
16.
针对影响管控一体柔性装配线平衡因素的复杂性与多样性问题,提出一种基于实时分析工序装配柔性因子的管控策略和改进型遗传算法的优化处理方法。首先综合权衡管控一体柔性装配线不平衡的各类因素,为装配工序建立装配次数-预期时间函数与平衡模型;其次在管控决策台对平衡状态实时分析的基础上,构建了基于改进型遗传算法的优化处理模型,并给出基于动态工位分割算法和动态交叉、变异概率的算法改进步骤。 相似文献
17.
基于混合遗传算法的混合装配线排序问题研究 总被引:3,自引:0,他引:3
为使混合装配线有效运作,研究了混合装配线的生产排序问题。以装配线上各种零部件消耗速率均匀化和最小生产循环周期最短为优化目标,描述了多目标排序问题,并建立了优化模型。针对基本遗传算法在求解排序问题时的早熟收敛问题,提出一种改进混合遗传算法。该算法借助模拟退火算法思想对适应度尺度进行调整,使遗传进化初期削弱种群中个体适应度差异,而在遗传进化后期强化种群中个体适应度差异,以提高对最优解的搜索能力。同时,根据个体适应度自动调整遗传操作参数,既保存了种群中的优良个体,又不失个体的多样性。最后通过案例分析验证了算法的有效性。 相似文献
18.
Adil Baykasoğlu Lale Özbakır 《The International Journal of Advanced Manufacturing Technology》2007,32(1-2):139-147
The advantages of U-type lines are very well known in industry. They offer improved productivity and quality, and are considered
as one of the better techniques in implementing just-in-time (JIT) systems. There is a growing interest in the literature
to organize traditional assembly lines as U-lines for improved performance. U-type assembly line balancing is an extension
of the traditional line balancing problem, in which tasks can be assigned from both sides of the precedence diagram. Although
there are many studies in the literature for the design of traditional straight assembly lines, the work on U-type lines is
limited. Moreover, in most of the previous studies, task times are assumed to be deterministic. In this paper, a new multiple-rule-based
genetic algorithm (GA) is proposed for balancing U-type assembly lines with stochastic task times. 相似文献
19.
Liang Hou Yong-ming Wu Rong-shen Lai Chi-Tay Tsai 《The International Journal of Advanced Manufacturing Technology》2014,70(9-12):1775-1786
Product family assembly line (PFAL) is a mixed-model assembly line on which a family of similar products can be assembled at the same time. Aiming at the balance problem of PFAL, a balancing model for PFAL is established, and simultaneously an improved dual-population genetic algorithm is proposed. Firstly, through the characteristic analysis of PFAL, the tasks on PFAL are divided into three categories, namely the common, optional, and personality tasks. In addition, the correlation between the tasks is mainly considered. In the improved genetic algorithm, minimizing the number of stations, minimizing the load indexes between stations and within each station, and maximizing task-related degree are used as optimization objectives. In the initialization process, a method based on a TOP sorting algorithm is adopted for generating chromosomes. Furthermore, a new decoding algorithm is proposed to make up for the lack of the traditional decoding method, and individuals in the two populations are exchanged. Therefore, the search speed of the algorithm is accelerated, which shows good performance through classic tested problems. Finally, the effectiveness and feasibility of the method were validated by optimizing assembly line balancing of loaders. 相似文献