Improving Search Performance for Coevolutionary Algorithm with Restart Strategy
Daming Zhu · Jisuanji fangzhen · 2011
Restart strategy improves performance of probabilistic algorithms.To introduce restart strategy to coevolutionary algorithms,a new method to evaluate status of populations was proposed and applied to terminate or restart search process.Improved coevolutionary algorithm was applied to dealing with complex flexible job-shop scheduling problem.Experimental results of extensive computational simulations show that the improved coevolutionary algorithm with restart strategy provides higher quality solutions and better search efficiency no matter the test-bed problem is large or not.Coevolutionary algorithms are widely applied in many fields and this improvement presents a feasible and effective way to enhance its application extension and depth.