科研之友
微信
新浪微博
Facebook
分享链接
摘要
A tabu search algorithm having robust solution searching power is proposed. To avoid excessive computation burdens which are needed for the expected fitness evaluations in tabu searches, it is proposed that the Gaussian distributed neighborhood vector, the strategy for assigning expected fitness only to promising solutions, and the utilization of neighborhood solutions to determine the fitness values of the potential solutions are to be used. A new distance-weighted formula for the expected fitness assignments is also proposed. Two case studies are reported to validate and demonstrate the feasibility and advantages of using the proposed algorithm in finding the robust solution of an optimal design problem.
