Differential evolution harmony search algorithm for solving job-shop scheduling problem
Xia Li · Journal of Computer Applications · 2013
To solve the Job-Shop Scheduling Problem(JSSP) efficiently,a Differential Evolution Harmony Search Algorithm(DEHSA) was put forward.First of all,the sorting process number conversion method was designed for converting floating-point numbers harmony into a workpiece sequence to solve the phenomenon that the harmony function is continuous while the process is discrete.Secondly,in order to improve the convergence rate of HSA,its evolution model was improved instead of replacing a worst solution only,and the probability of the harmonies variable evolution depending on current optimal solution named guide excellent was also proposed.At last,the Differential Evolution Algorithm(DEA) was introduced to HSA to overcome the poor directional and late stagnation.A large number of simulation results show that DEHSA has good feasibility and effectiveness in job-shop scheduling problem.