摘要
针对多品种装配顺序的安排问题,以总工艺辅助时间最小为目标,表达为求解旅行商问题(TSP),提出并设计了合理的遗传算法。计算和仿真结果显示,该遗传算法的实用性和有效性。
A problem of assembly production scheduling is discussed and represented as a traveling salesman problem(TSP),aiming at minimization of the sum of overhead time.A genetic algorithm(GA) is presented and designed to solve the problem.The results of simulation and the application in assembly workshop shows that the algorithm is practical and effective.
出处
《现代制造工程》
CSCD
2005年第7期59-62,共4页
Modern Manufacturing Engineering
