基于RUD的和声搜索算法求解作业车间调度问题

摘要

为了能更有效地解决作业车间调度问题,提出一种基于随机化均匀设计方法的和声搜索优化算法(RUDHS).首先,基于工序的编码方式,采用最大位置排序(LPV)规则实现了作业车间调度离散问题的连续编码,通过随机化均匀设计方法择优构造更加高质量的初始和声库.其次,在搜索过程中进行参数动态调整,每次迭代产生多个新解,充分利用和声记忆库的信息,以提高算法的全局搜索能力和收敛速度.最后,结合作业车间调度典型测试用例进行仿真实验,结果表明RUDHS较HS和GHS算法能够更高效地解决作业车间调度问题.%In order to solve the job-shop scheduling problem (JSP) more effectively,an improved harmony search optimization algorithm based on random uniform design method (RUDHS) is proposed.First of all,the largest position value (LPV) rule is used to realize harmony search optimization algorithm for the job-shop scheduling discrete problem by encoding based on stage,and the random uniform design method is preferred to construct a better quality of initial harmony library.Secondly,when the parameters are dynamically adjusted during the search process and several new solutions in each iteration are generated so as the information of harmony memory can be full used the global search ability and convergence speed of algorithm can be improved.Finally,the proposed algorithm is performed for JSP typical test cases.The simulation results show that the RUDHS algorithm obtains higher efficiency than those from HS and GHS algorithm for solving JSP.