欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
基于摹加代数,将一类装配线平衡问题转化为TSP问题。在摹加运算的基础上,将装配线平衡问题的优先关系图转化为混合图中的TSP问题,通过案例演示,以改进的遗传算法为求解混合图中的TSP算法,以路径最短为目标函数,利用随机变异跳出局部最优,最终结果收敛于全局最优或近似全局最优。
英文摘要：
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 final results converged to global optimum or near global optimum.
同期刊论文项目
同项目期刊论文
位置：