摘要
在基本的单机加权成套订单数问题[1]研究的基础上,增加考虑加工工件具有多种类型,且同类工件可分开加工,不同类工件之间接连加工需要机器调整时间的情况。建立了该类问题的0-1整数规划模型,设计求解该类问题的遗传算法,并通过一个算例对这类排序问题和所提出的算法进行说明。算法在文中所列三种初始种群规模下的10次运算内都能得到算例的最优解0.77,每次运算大都在100代以内得到收敛,多次试验结果显示算法具有较强的寻优功能、收敛平稳且运算时间较短,表明了算法求解此类问题的有效性。
On the basis of the basic research of whole set order problem in Single Macnlne Scheduling, considerations were increased. such as the job has many kinds, it needs setup time between the process of different kinds of jobs and the similar jobs can be processed separately, this situation is more practical. A 0-1 integer program model was proposed, and a Genetic Algorithm to solve this problem was designed. A numerial example was given in the end of the paper to prove the efficiency of the Genetic Algorithm for solving the whole set order problem. Under all 3 different population sizes, the algorithm could reach the optimal solution through running 10 times and could also be converged within 100 generations.
出处
《工业工程与管理》
2006年第6期75-79,共5页
Industrial Engineering and Management
基金
国家自然科学基金重点资助项目(70332001)
国家自然科学基金资助项目(70572032)
