A conceptual modeling of meme complexes in stochastic search

• Main Authors: Chen, Xianshun, Ong, Yew Soon
• Other Authors: School of Computer Engineering
• Format: Article
• Language: English
• Published: 2013
• Subjects: DRNTU::Engineering::Computer science and engineering::Theory of computation::Analysis of algorithms and problem complexity
• Online Access: https://hdl.handle.net/10356/102283; http://hdl.handle.net/10220/16521
• Institution: Nanyang Technological University

In science, gene provides the instruction for making proteins, while meme is the sociocultural equivalent of a gene containing instructions for carrying out behavior. Taking inspiration from nature, we model the memeplex in search as instructions that specify the coadapted meme complexes of individuals in their lifetime. In particular, this paper presents a study on the conceptual modeling of meme complexes or memeplexes for more effective problem solving in the context of modern stochastic optimization. The memeplex representation, credit assignment criteria for meme coadaptation, and the role of emergent memeplexes in the lifetime learning process of a memetic algorithm in search are presented. A coadapted memetic algorithm that takes the proposed conceptual modeling of memeplexes into actions to solve capacitated vehicle routing problems (CVRPs) of diverse characteristics is then designed. Results showed that adaptive memeplexes provide a means of creating highly robust, self-configuring, and scalable algorithms, thus generating improved or competitive results when benchmarking against several existing adaptive or human-designed state-of-the-art memetic algorithms and metaheuristics, on a plethora of CVRP sets considered.