The Swine Influenza Model Based Optimization (SIMBO) family is a newly introduced speedy optimization technique having the adaptive features in its mechanism. In this paper, the authors modified the SIMBO to make the algorithm further quicker. As the SIMBO family is faster, it is a better option for searching the basin. Thus, it is utilized in local searches in developing the proposed memetic algorithms (MAs). The MA has a faster speed compared to SIMBO with the balance in exploration and exploitation. So, MAs have small tradeoffs in convergence velocity for comprehensively optimizing the numerical standard benchmark test bed having functions with different properties. The utilization of SIMBO in the local searching is inherently the exploitation of better characteristics of the algorithms employed for the hybridization. The developed MA is applied to eliminate the power line interference (PLI) from the biomedical signal ECG with the use of adaptive filter whose weights are optimized by the MA. The inference signal required for adaptive filter is obtained using the selective reconstruction of ECG from the intrinsic mode functions (IMFs) of empirical mode decomposition (EMD). 1. Introduction Genetic algorithm, particle swarm optimization, bacterial foraging optimization, differential evolution, evolutionary programming, and so forth are the stochastic optimizers that have drawn the attentions in recent time [1–7]. In these, a population of the solutions is utilized in the search process. These algorithms are capable of exploring and exploiting the promising regions in the search space but take relatively longer time [1]. Hence, algorithms are combined for required properties like faster exploration and exploitation capabilities making the combination faster and accurate [8–11]. Since 1960, genetic algorithm (GA) is a potential optimizer in the field of optimization [2]. In GA, chromosomes are used to encode problem parameters and to search for solution with iterations or generations in a natural selection process using genetic operations such as selection, crossover, and mutation. GA offers a robust search mechanism in complex spaces applicable to problems in various fields like science, engineering, commerce, and so forth. The hybrid algorithm tries to keep a balance in processes of exploration and exploitation achieving global optimization. Hybrid methods like least-square-fuzzy BFO [8], GA-BFO [9], and BFO-Nelder-Mead [10] are developed for taking advantage of such combinations. In developing some of the memetic algorithms, GA is used, in which
References
[1]
Q. H. Nguyen, Y. S. Ong, and N. Krasnogor, “A study on the design issues of memetic algorithm,” in Proceedings of IEEE Congress on Evolutionary Computation (CEC '07), pp. 2390–2397, September 2007.
[2]
Z. Michalewicz, Genetic Algorithms？+？Data Structures？=？Evolution Programs, Springer-, 1996.
[3]
S. Das and P. N. Suganthan, “Differential evolution: a survey of the state-of-the-art,” IEEE Transactions on Evolutionary Computation, vol. 15, no. 1, pp. 4–31, 2011.
[4]
J. J. Liang, A. K. Qin, P. N. Suganthan, and S. Baskar, “Comprehensive learning particle swarm optimizer for global optimization of multimodal functions,” IEEE Transactions on Evolutionary Computation, vol. 10, no. 3, pp. 281–295, 2006.
[5]
N. V. George and G. Panda, “A particle-swarm-optimization-based decentralized nonlinear active noise control system,” IEEE Transactions on Instrumentation and Measurement, vol. 61, no. 12, pp. 3378–3386, 2012.
[6]
K. M. Passino, “Biomimicry of bacterial foraging for distributed optimization and control,” IEEE Control Systems Magazine, vol. 22, no. 3, pp. 52–67, 2002.
[7]
X. Yao, Y. Liu, and G. Lin, “Evolutionary programming made faster,” IEEE Transactions on Evolutionary Computation, vol. 3, no. 2, pp. 82–102, 1999.
[8]
S. Mishra, “A hybrid least square-fuzzy bacterial foraging strategy for harmonic estimation,” IEEE Transactions on Evolutionary Computation, vol. 9, no. 1, pp. 61–73, 2005.
[9]
D. H. Kim, A. Abraham, and J. H. Cho, “A hybrid genetic algorithm and bacterial foraging approach for global optimization,” Information Sciences, vol. 177, no. 18, pp. 3918–3937, 2007.
[10]
B. K. Panigrahi and V. R. Pandi, “Bacterial foraging optimisation: nelder-mead hybrid algorithm for economic load dispatch,” IET Generation, Transmission & Distribution, vol. 2, no. 4, pp. 556–565, 2008.
[11]
D. P. Acharya, G. Panda, S. Mishra, and Y. V. S. Lakshmi, “Bacteria foraging based independent component analysis,” in Proceedings of the International Conference on Computational Intelligence and Multimedia Applications (ICCIMA '07), pp. 527–531, December 2007.
[12]
B. Li, Y. S. Ong, M. N. Le, and C. K. Goh, “Memetic gradient search,” in Proceedings of IEEE Congress on Evolutionary Computation (CEC '08), pp. 2894–2901, June 2008.
[13]
R. Akbari and K. Ziarati, “Combination of particle swarm optimization and stochastic local search for multimodal function optimization,” in Proceedings of the Pacific-Asia Workshop on Computational Intelligence and Industrial Application (PACIIA '08), pp. 388–392, December 2008.
[14]
D. G. Jadhav, S. S. Pattnaik, S. Devi, M. R. Lohokare, and K. M. Bakwad, “Approximate memetic algorithm for consistent convergence,” in Proceedings of the National Conference on Computational Instrumentation CSIO Chandigarh (NCCI '10), pp. 118–122, India, March 2010.
[15]
P. A. Moscato, “On evolution, search, optimization, genetic algorithms and martial arts: towards memetic algorithms,” Caltech Concurrent Computation Program, Report 826, California Institute of Technology, Pasadena, Calif, USA, 1989.
[16]
S. S. Pattnaik, K. M. Bakwad, B. S. Sohi, R. K. Ratho, and S. Devi, “Swine influenza models based optimization (SIMBO),” Applied Soft Computing, vol. 13, no. 1, pp. 628–653, 2013.
[17]
B. J. Coburn, B. G. Wagner, and S. Blower, “Modeling influenza epidemics and pandemics: insights into the future of swine flu (H1N1),” BMC Medicine, vol. 7, article 30, 2009.
[18]
A. Biswas, K. K. Mishra, S. Tiwari, and A. K. Misra, “Physics-inspired optimization algorithms: a survey,” Journal of Optimization, vol. 2013, Article ID 438152, 16 pages, 2013.
[19]
D. Dasgupta, “Advances in artificial immune systems,” IEEE Computational Intelligence Magazine, vol. 1, no. 4, pp. 40–49, 2006.
[20]
D. Dasgupta, S. Yu, and F. Nino, “Recent advances in artificial immune systems: models and applications,” Applied Soft Computing, vol. 11, no. 2, pp. 1574–1587, 2011.
[21]
S. Knobler, A. Mack, A. Mahmoud, and S. Lemon, The Story of Influenza: The Threat of Pandemic Influenza: Are We Ready? Workshop Summary, The National Academies Press, Washington, DC, USA, 2005, http://books.nap.edu/openbook.php?isbn=0309095042&page=75.
[22]
Q. H. Nguyen, Y.-S. Ong, and M. H. Lim, “A probabilistic memetic framework,” IEEE Transactions on Evolutionary Computation, vol. 13, no. 3, pp. 604–623, 2009.
[23]
M. Lozano, F. Herrera, N. Krasnogor, and D. Molina, “Real-coded memetic algorithms with crossover hill-climbing,” Evolutionary Computation, vol. 12, no. 3, pp. 273–302, 2004.
[24]
D. E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Reading, Mass, USA, 1989.
[25]
D. E. Goldberg and K. Deb, “A comparative analysis of selection schemes used in genetic algorithms,” in Proceedings of the Foundations of Genetic Algorithms, pp. 69–93, 1991.
[26]
J. A. Vasconcelos, J. A. Ramírez, R. H. C. Takahashi, and R. R. Saldanha, “Improvements in genetic algorithms,” IEEE Transactions on Magnetics, vol. 37, no. 5, pp. 3414–3417, 2001.
[27]
P. Moscato and C. Cotta, “A gentle introduction to memetic algorithms,” in Handbook of Metaheuristics, chapter 5, pp. 105–144, Springer, New York, NY, USA, 2003.
[28]
D. Garrett and D. Dasgupta, “An empirical comparison of memetic algorithm strategies on the multiobjective quadratic assignment problem,” in Proceedings of IEEE Symposium on Computational Intelligence in Multi-Criteria Decision-Making (MCDM '09), pp. 80–87, March-April 2009.
[29]
P. N. Suganthan, N. Hansen, J. J. Liang et al., “Problem definition and evaluation criteria for the CEC, 2005 special session on real parameter optimization,” Nanyang Technological University and KanGAL Report 2005005, IIT Kanpur, 2005, http://www.ntu.edu.sg/home/epnsugan.
[30]
L. J. Eshelman and J. D. Schaffer, “Real-coded genetic algorithms and interval-shemata,” in Foundation of Genetic Algorithms 2, L. Darrell Whitley, Ed., pp. 187–202, Morgan Kaufmann, San Mateo, Calif, USA, 1993.
[31]
K. Deb and R. B. Agrawal, “Simulated binary crossover for continuous search space,” Complex System, vol. 9, no. 2, pp. 115–148, 1995.
[32]
R. Mallipeddi, P. N. Suganthan, Q. K. Pan, and M. F. Tasgetiren, “Differential evolution algorithm with ensemble of parameters and mutation strategies,” Applied Soft Computing, vol. 11, no. 2, pp. 1679–1696, 2011.
[33]
J. Derrac, S. García, D. Molina, and F. Herrera, “A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms,” Swarm and Evolutionary Computation, vol. 1, no. 1, pp. 3–18, 2011.
[34]
Z. Zhidong and M. Chan, “A novel cancellation method of power line interference in ECG signal based on EMD and adaptive filter,” in Proceedings of the 11th IEEE International Conference on Communication Technology (ICCT '08), pp. 517–520, Hangzhou, China, November 2008.
[35]
G. B. Moody and R. G. Mark, “The impact of the MIT-BIH arrhythmia database,” IEEE Engineering in Medicine and Biology Magazine, vol. 20, no. 3, pp. 45–50, 2001.
[36]
A. L. Goldberger, L. A. N. Amaral, L. Glass, et al., “PhysioBank, PhysioToolkit, and PhysioNet: components of a new researchresource for complex physiologic signals,” Circulation, vol. 101, no. 23, pp. e215–e220, 2000.
