节点文献
求解Job-shop调度问题的遗传算法
Algorithm for Job-shop Base on Hybrid Genetic Algorithm
【摘要】 在引入一种新的具有自适应性的杂交概率和变异概率的基础上,提出了一种构造染色体的新方法,进而提出了一种面向工作车间问题的新的遗传算法。同时给出了一个例子来说明算法的收敛性和收敛效率。仿真结果表明了该算法的有效性。
【Abstract】 Job-shop problem is a NP-hard problem. Based on the introduction of the new method of self adapting pro bability for chromosome cross and chromosome mutate, this paper presents a new method for constructing chromosome. A new genetic algorithm for job-shop problems is developed. This paper gives a example to illustrate the convergence property and the convergence efficiency of the algorithm. Simulation shows that this method is effective.
【关键词】 工作车间问题;
遗传算法;
自适应方向;
【Key words】 Job-shop problem; Genetic algorithm; Semi-feasible direction;
【Key words】 Job-shop problem; Genetic algorithm; Semi-feasible direction;
- 【文献出处】 高技术通讯 ,High Technology Letters , 编辑部邮箱 ,2003年05期
- 【分类号】O224
- 【被引频次】10
- 【下载频次】67