首页 | 本学科首页   官方微博 | 高级检索  
     

基于摹加代数优化的装配线平衡方法
引用本文:李平,夏绪辉,唐秋华. 基于摹加代数优化的装配线平衡方法[J]. 武汉科技大学学报(自然科学版), 2011, 34(3)
作者姓名:李平  夏绪辉  唐秋华
作者单位:1. 武汉科技大学机械自动化学院,湖北,武汉,430081;黄冈师范学院信息与计算科学学院,湖北,黄冈,438000
2. 武汉科技大学机械自动化学院,湖北,武汉,430081
基金项目:国家自然科学基金资助项目
摘    要:基于摹加代数,将一类装配线平衡问题转化为TSP问题.在摹加运算的基础上,将装配线平衡问题的优先关系图转化为混合图中的TSP问题,通过案例演示,以改进的遗传算法为求解混合图中的TSP算法,以路径最短为目标函数.利用随机变异跳出局部最优,最终结果收敛于全局最优或近似全局最优.

关 键 词:装配线平衡  混合图  取整摹加  极优代数

Optimal method for assembly line balancing based on imiti adding algebra
Li Ping,Xia Xuhui,Tang Qiuhua. Optimal method for assembly line balancing based on imiti adding algebra[J]. Journal of Wuhan University of Science and Technology(Natural Science Edition), 2011, 34(3)
Authors:Li Ping  Xia Xuhui  Tang Qiuhua
Affiliation:Li Ping1,2,Xia Xuhui1,Tang Qiuhua2(1.College of Machinery and Automation,Wuhan University of Science and Technology,Wuhan 430081,China,2.School of Mathematics and Information,Huanggang Normal University,Huanggang 438000,China)
Abstract:Based on imiti adding algebra,an assembly line balancing problem was converted into fundamental graph theory question which was much easier to solve.First,the precedence diagram in the assembly line balancing was converted into TSP problem of combined graph based on imiti adding.Then,by means of case illustration,an improved genetic algorithm was employed to solve the TSP problem of combined graph with the shortest path as the objective function.Through random mutation,local optimum was transcended and the ...
Keywords:assembly line balancing  combined graph  imiti adding  optimum algebra  
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号