基于改进遗传算法的Job Shop问题求解  

Approach to Job Shop Scheduling Based on Improved Genetic Algorithm

作　　者：朱华炳[1] 程翔宇[2] 唐自玉[3] 刘光复[4] 

机构地区：[1]合肥工业大学工业培训中心 [2]合肥工业大学机械与汽车工程学院 [3]合肥车桥有限责任公司车桥研究所 [4]合肥工业大学

出　　处：《农业机械学报》2005年第11期146-150,共5页Transactions of the Chinese Society for Agricultural Machinery

摘　　要：改进遗传算法使JobShop的可行调度这一决策过程时间减少,合理性提高,为快速找到最优调度提供了有效途径。用可视化程度较高的Visual Basic6.0开发了相应的软件,通过采用种群多次产生法,解决了遗传算法在解传统JobShop问题中因近亲繁殖所导致的早熟现象。Job Shop Scheduling based on improved genetic algorithm can change a feasible scheduling solution and offers a method to decrease the time of decision-making, increase the reasonable factors and search the optimum fleetly. We compiled a software with the highly visual computer language VB6.0 based on this idea. In the course of compiling the software, we designed an arithmetic to change the array in program creatively, which broke through some limits of twodimensional array. We also designed the means of creating population in times without number, which could solve premature phenomena led by close relative breeding with traditional Job Shop Scheduling.

关 键 词：JOB SHOP 遗传算法 活动种群法 

分 类 号：TP278[自动化与计算机技术—检测技术与自动化装置]