By Topic

Neural meta-memes framework for managing search algorithms in combinatorial optimization

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Song, L.Q. ; Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ., Singapore, Singapore ; Lim, M.H. ; Ong, Y.S.

A meme in the context of optimization represents a unit of algorithmic abstraction that dictates how solution search is carried out. At a higher level, a meta-meme serves as an encapsulation of the scheme of interplay between memes involved in the search process. This paper puts forth the notion of neural meta-memes to extend the collective capacity of memes in problem-solving. We term this as Neural Meta-Memes Framework (NMMF) for combinatorial optimization. NMMF models basic optimization algorithms as memes and manages them dynamically. We show the efficacy of the proposed NMMF through empirical study on a class of combinatorial optimization problem, the quadratic assignment problem (QAP).

Published in:

Memetic Computing (MC), 2011 IEEE Workshop on

Date of Conference:

11-15 April 2011