Mutating real-valued vectors using angular displacement
暂无分享,去创建一个
A new self-adaptive mutation operator, Angular Displacement, for optimizing real-valued vectors is presented. This is designed for applications, called directional problems, where the quality of a solution vector is based exclusively on the direction of the vector and not the length of the vector. Angular Displacement maintains one control parameter that stochastically governs the amount of angular displacement, θ, induced by a single mutation. After θ is chosen, a random vector is selected that forms an angle of θ radians with the input vector. This approach contrasts the standard mutation operator that maintains one extra parameter for each vector component to control the displacement of the vector's head. Experiments show Angular Displacement is superior to the standard mutation operator in a directional problem involving the optimization of a hyperplane's parameters.
[1] Lothar Thiele,et al. Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..
[2] Bernd Freisleben. Meta-evolutionary approaches , 2000 .
[3] George G. Mitchell,et al. A NEW OPERATOR FOR EFFICIENT EVOLUTIONARY SOLUTIONS TO THE TRAVELLING SALESMAN PROBLEM , 2000 .