Abstract
Low-dimensional simplex evolution (LDSE) is a real-coded evolutionary algorithm for global optimization. In this paper, we introduce three techniques to improve its performance: low-dimensional reproduction (LDR), normal struggle (NS) and variable dimension (VD). LDR tries to preserve the elite by keeping some of its (randomly chosen) components. LDR can also help the offspring individuals to escape from the hyperplane determined by their parents. NS tries to enhance its local search capability by allowing unlucky individual search around the best vertex of m-simplex. VD tries to draw lessons from recent failure by making further exploitation on its most promising sub-facet. Numerical results show that these techniques can improve the efficiency and reliability of LDSE considerably. The convergence properties are then analysed by finite Markov chains. It shows that the original LDSE might fail to converge, but modified LDSE with the above three techniques will converge for any initial population. To evaluate the convergence speed of modified LDSE, an estimation of its first passage time (of reaching the global minimum) is provided.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
