检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:丁力平[1] 谭建荣[1] 冯毅雄[1] 高一聪[1]
机构地区:[1]浙江大学CAD&CG国家重点实验室,浙江杭州310027
出 处:《计算机集成制造系统》2009年第7期1406-1413,1429,共9页Computer Integrated Manufacturing Systems
基 金:国家863计划资助项目(2007AA04Z190);国家科技支撑计划资助项目(2006BAF01A37)~~
摘 要:为提高产品拆卸效率,针对拆卸线平衡问题建立了数学模型。该模型以最小拆卸线闲置率、负荷均衡和最小拆卸成本为优化目标。结合拆卸线平衡问题的具体特点,提出了一种改进的基于Pareto解集的多目标蚁群优化算法。算法采用小生境技术,引导蚂蚁搜索到分布良好的Pareto最优解集,并以被支配度和分散度为个体评价规则。实验测试结果表明了该算法的可行性。最后,结合企业生产实际,给出了所提模型与算法的具体应用。To improve product disassembly efficiency and aiming at disassembly line balancing problem, a mathematical model was established with optimization objectives of minimum line idle rate, workload equilibrium and minimum disassembly cost. Then, combining characteristics of disassembly line balancing problem, an improved multi-objective ant colony algorithm based on Pareto set was developed. In this algorithm, niche technology was used to guide the ant colony to search the well-distributed Pareto optimal set, and the heuristic rules about dominated degree and dispersion degree were applied to appraise the ant. The effectiveness of proposed algorithm was proved by testing result. Finally, an application case was provided to illustrate the proposed model and algorithm.
关 键 词:拆卸线平衡 多目标优化 蚁群算法 PARETO解集 小生境技术
分 类 号:TH122[机械工程—机械设计及理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15