基于遗传算法的装配序列优化-控制理论与控制工程专业论文.docxVIP

Ⅵ2 Ⅵ2 40 46 摘要 本文以某公司洗衣机装配一线为研究对象，利用遗传算法搜索并优化装配序列， 充分考虑了企业的制造资源，从而使优化结果接近生产实际。首先根据调研期间获得 的资料建立问题的数学模型，考虑了装配时间、可装配性和调度成本等指标。然后针 对子装配体的模式含义，设计了编码方案和遗传策略，分别讨论了不同生产工况下的 单目标、多目标优化问题。由于是一个多目标多约束模型，约束环境极易破坏遗传信 息从而出现有效基因缺失和早熟，针对这些问题，提出了基因修补算子，基于代沟信 息自适应调整算子等新的遗传策略。同时结合局部搜索算法加快了在最优值附近的收 敛速度。对算法的收敛性及其实际意义给予了理论分析。最后将优化结果与海尔采用 的方案做了分析比较。 关键词：遗传算法，装配序列规划，自适应遗传算法，组合优化 ABSTRACTIn ABSTRACT In this thesis，based on the washing machine production line ofHaler—Merloni Inc，the genetic algorithms ale applied to find the feasible and optimal assembly sequence．The constraints of manufacturing resources are introduced to make the sequence more accurate． According to the information collected from the assembly line，the mathematic model is firstly established，and the optimization criteria such as makespan，accessibility and scheduling cost ale concerned．Then the coding scheme and genetic operators are designed through which the static and dynamic optimization is discussed respectively．Because it’S a multi-objective and multi—constraint optimization model，the hereditary information is easy to be destroyed by the procedure constraints．Therefore，in the process of optimization，the premature convergence and the fault of effective gene are caused．To resolve this problem， several new genetic operators are proposed，such as gene repairing operator and adaptive operator．Combining with local searching，the hybrid genetic algorithms show great effectiveness．Furthermore，the global convergence of the algorithms is analyzed．At last， the optimal assembly sequence is compared with which adopted in Haier to testify the validity ofthe proposed approach． Key words：Genetic algorithms，Assembly sequence planning，Adaptive GA， Combinatorial optimization 瑙士{龟文 瑙士{龟文 基于遗馋算法瓣装配謦列撬饯 1绪论 {．{装配技术的发鬃 现代制造业鞠飞速教展，极大地促进了社会生产力。自80年代柔饿制造系统 (FMS)进入实用阶段以j|乏，霆藏世界上大约鸯1500条CIMS、FMS及爨多的FMC簌运 行，它使机械加工的面貌发生了质的变化。零件制造、金属成型、切黼加工等丑臻综 合鑫动纯，隧着柔往臻l逡渡拳、计算规辅秘技笨及铸怠技零的发袋，嵩今毽赛穰黼制 造她游避入众盘基动纯熬孵代。 然而，幽于加工技术超前于装配技术许多年，两者已形成了明显的反麓，装配技 术鑫裁为现代纯生产的薄弱环节，现代