Catalog Home Page

Multi-modal search with convex bounding neighbourhood

Nguyen, D.H.M., Wong, K.P. and Chung, C. (2006) Multi-modal search with convex bounding neighbourhood. In: 2006 International Conference on Machine Learning and Cybernetics, 13 - 16 August 2006, Dalian, China pp. 2081-2086.

PDF - Published Version
Download (400kB) | Preview
    Link to Published Version:
    *Subscription may be required


    This paper presents a new dynamic method of subpopulation in solving multi-modal search problems with evolutionary algorithms. The new method identify the modes found at each generation and equalises the subpopulation sizes assigned to each mode. Modes are identified sequentially starting with the highest fitness mode. Mode membership is determined by successive grouping of fitness dominated convex bounding neighbours, starting from the fittest individual. This new dynamic modal subpopulation approach is able to find a representative sample of optima for multi-modal landscape with infinite number of global and local optima with uneven heights and non-uniform distribution. The algorithm also facilitates parallel implementation

    Publication Type: Conference Paper
    Murdoch Affiliation: School of Engineering Science
    Notes: Appears In: Proceedings of the 2006 International Conference on Machine Learning and Cybernetics
    Item Control Page


    Downloads per month over past year