Abstract
From a computing perspective, a meme denotes information that represents knowledge, patterns, rules, or strategies used to solve complex problems. When applied on a problem, memes help a solver to arrive at good quality solutions more efficiently, guiding the search process according to certain procedures or rules, instead of randomly searching through the solution space. Depending on the complexity of the problems, evaluating the suitability of memes and selecting a set of effective memes for different problems, however, are not straightforward tasks. A meme that works well for some problems may not be effective for other problems. Besides, different memes might have different degrees of importance in solving a problem. The level of importance of each meme might also change at different stages of the search. In this paper, we discuss how multiple memes can be generated and applied to solve computational optimization problems. A case study in combinatorial optimization is also presented and discussed.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
A.E. Carter, C.T. Ragsdale, A new approach to solving the multiple traveling salesperson problem using genetic algorithms. Eur. J. Oper. Res. 175(1), 246–257 (2006)
X. Chen, Y.-S. Ong, M.-H. Lim, K.C. Tan, A multi-facet survey on memetic computation. IEEE Trans. Evol. Comput. 15(5), 591–607 (2011)
X. Chen, Y.S. Ong, A conceptual modeling of meme complexes in stochastic search. IEEE Trans. Syst. Man Cybern. Part C (Applications and Reviews), 42(5), 612–625 (2012)
D. Hales, Modelling meta-memes, in Simulating Social Phenomena (Springer, Berlin, 1997) (pp. 365–384)
K. Helsgaun, An Effective Implementation of K-Opt Moves for the Lin-Kernighan TSP Heuristic. Roskilde University. Department of Computer Science (2006)
H. Ismkhan, K. Zamanifar, Using ants as a genetic crossover operator in GLS to solve STSP, in Paper Presented at the 2010 International Conference of Soft Computing and Pattern Recognition (2010)
A. Király, J. Abonyi, A novel approach to solve multiple traveling salesmen problem by genetic algorithm, in Computational Intelligence in Engineering (Springer, Berlin, 2010) (pp. 141–151)
N. Krasnogor, B. Blackburne, E.K. Burke, J.D. Hirst, Multimeme algorithms for protein structure prediction, in Paper Presented at the International Conference on Parallel Problem Solving from Nature (2002)
S. Lin, B.W. Kernighan, An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21(2), 498–516 (1973)
Z. Meng, J.-S. Pan, Monkey king evolution: a new memetic evolutionary algorithm and its application in vehicle fuel consumption optimization. Knowl.-Based Syst. 97, 144–157 (2016)
R. Meuth, M.-H. Lim, Y.-S. Ong, D.C. Wunsch, A proposition on memes and meta-memes in computing for higher-order learning. Memetic Comput, 1(2), 85–100 (2009)
Y.-S. Ong, M.-H. Lim, N. Zhu, K.-W Wong, Classification of adaptive memetic algorithms: a comparative study. IEEE Trans. Syst. Man Cybern. Part B (Cybernetics) 36(1), 141–152 (2006)
Y.-S. Ong, M.H. Lim, X. Chen, Memetic computation—past, present and future. IEEE Comput. Intell. Mag. 5(2), 24–31 (2010)
E. Özcan, J.H. Drake, C. Altıntaş, S. Asta, A self-adaptive multimeme memetic algorithm co-evolving utility scores to control genetic operators and their parameter settings. Appl. Soft Comput. 49, 81–93 (2016)
P.V. Paul, N. Moganarangan, S.S. Kumar, R. Raju, T. Vengattaraman, P. Dhavachelvan, Performance analyses over population seeding techniques of the permutation-coded genetic algorithm: an empirical study based on traveling salesman problems. Appl. Soft Comput. 32, 383–402 (2015)
L.Q. Song, M.-H. Lim, Y.-S. Ong, Neural meta-memes framework for managing search algorithms in combinatorial optimization, in Paper Presented at the IEEE Workshop on Memetic Computing (MC) (2011)
S. Starke, N. Hendrich, J. Zhang, Memetic evolution for generic full-body inverse kinematics in robotics and animation. IEEE Trans. Evolut. Comput. (2018)
Y. Yuan, H. Xu, Multiobjective flexible job shop scheduling using memetic algorithms. IEEE Trans. Autom. Sci. Eng. 12(1), 336–353 (2015)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Dwiyasa, F., Lim, MH., Foo, RX., Teo, SW.J. (2020). Meme-Based Computational Optimization Framework. In: Nagar, A., Deep, K., Bansal, J., Das, K. (eds) Soft Computing for Problem Solving 2019 . Advances in Intelligent Systems and Computing, vol 1139. Springer, Singapore. https://doi.org/10.1007/978-981-15-3287-0_12
Download citation
DOI: https://doi.org/10.1007/978-981-15-3287-0_12
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-15-3286-3
Online ISBN: 978-981-15-3287-0
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)