The Mutate and Spread Metaheuristic | Zendy

Nicolas Abboud | Zendy; Masatoshi Sakawa | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

The Mutate and Spread Metaheuristic

Author(s) -

Nicolas Abboud,

Masatoshi Sakawa

Publication year - 1998

Publication title -

journal of advanced computational intelligence and intelligent informatics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.172

H-Index - 20

eISSN - 1343-0130

pISSN - 1883-8014

DOI - 10.20965/jaciii.1998.p0043

Subject(s) - metaheuristic , computer science , ranging , mathematical optimization , population , evolutionary algorithm , parallel metaheuristic , artificial intelligence , algorithm , mathematics , meta optimization , telecommunications , demography , sociology

Evolutionary and adaptive search is not limited to parameter optimization. More exciting, wide-ranging possibilities arise in the search for structures, operators, and algorithms. In this paper, we present a metaheuristic that maintains a diversified population in which only the building blocks of a good solution are permitted to spread.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research