{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T23:30:40Z","timestamp":1764977440124,"version":"3.46.0"},"reference-count":38,"publisher":"Walter de Gruyter GmbH","issue":"2","license":[{"start":{"date-parts":[[2016,4,18]],"date-time":"2016-04-18T00:00:00Z","timestamp":1460937600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,4,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Nature-inspired algorithms are seen as potential tools to solve large-scale global optimization problems. Memetic algorithms (MAs) are nature-inspired techniques based on evolutionary computation. MAs are considered as modified genetic algorithms integrated with a local search mechanism. Conventional MAs perform well for small dimensions; however, their performance starts declining with the increase in dimensions. It is popularly known as the \u201ccurse of dimensionality\u201d problem. In order to solve this problem, MA with constrained local search (MACLS) is proposed for single-objective optimization problems. MACLS restricts the local search to be performed after every generation. Controlled local search enhances the optimization capability of the MA. MACLS has been evaluated with respect to GS-MPSO (the latest modification of MA) and MLCC, EPUS-PSO, JDEdynNP-F, MTS, DewSAcc, DMS-PSO, LSEDA-gl, UEP, ALPSEA, classical DE (differential evolution), and real-coded CHC algorithms that participated in the Congress on Evolutionary Computation 2008 competition. The results establish that MACLS significantly outperforms these algorithms in attaining global optima for unimodal and multimodal single-objective optimization problems for small as well as large dimensions.<\/jats:p>","DOI":"10.1515\/jisys-2015-0103","type":"journal-article","created":{"date-parts":[[2016,4,18]],"date-time":"2016-04-18T13:22:17Z","timestamp":1460985737000},"page":"287-300","source":"Crossref","is-referenced-by-count":2,"title":["Memetic Algorithm with Constrained Local Search for Large-Scale Global Optimization"],"prefix":"10.1515","volume":"26","author":[{"given":"Shikha","family":"Mehta","sequence":"first","affiliation":[{"name":"Department of Computer Science Engineering, Jaypee Institute of Information Technology, Noida, India"}]}],"member":"374","published-online":{"date-parts":[[2016,4,18]]},"reference":[{"key":"2025120523270267893_j_jisys-2015-0103_ref_001_w2aab3b7d232b1b6b1ab2ab1Aa","doi-asserted-by":"crossref","unstructured":"H. Banati and S. Mehta, SEVO: bio-inspired analytical tool for uni-modal and multimodal optimization, in: Proceedings of the International Conference on Soft Computing for Problem Solving (SocProS 2011), Advances in Intelligent and Soft Computing, pp. 557\u2013566, 130, Springer, Berlin, 2011.","DOI":"10.1007\/978-81-322-0487-9_54"},{"key":"2025120523270267893_j_jisys-2015-0103_ref_002_w2aab3b7d232b1b6b1ab2ab2Aa","doi-asserted-by":"crossref","unstructured":"H. Banati and S. Mehta, Improved shuffled frog leaping algorithm for continuous optimization adapted SEVO toolbox, Intl. J. Adv. Intel. Paradigms.5 (2013), 31\u201344.","DOI":"10.1504\/IJAIP.2013.054670"},{"key":"2025120523270267893_j_jisys-2015-0103_ref_003_w2aab3b7d232b1b6b1ab2ab3Aa","doi-asserted-by":"crossref","unstructured":"J. Brest, A. Zamuda, B. Boskovic, M.S. Mau\u010dec and V. Zumer, High-dimensional real-parameter optimization using self-adaptive differential evolution algorithm with population size reduction, in: Proceedings of the IEEE Congress on Evolutionary Computation (CEC 2008), pp. 2032\u20132039, 2008.","DOI":"10.1109\/CEC.2008.4631067"},{"key":"2025120523270267893_j_jisys-2015-0103_ref_004_w2aab3b7d232b1b6b1ab2ab4Aa","doi-asserted-by":"crossref","unstructured":"X. S. Chen, Y. S. Ong, M. H. Lim and K. C. Tan, A multi-facet survey on memetic computation, IEEE T. Evolut. Comput.5 (2011), 591\u2013607.","DOI":"10.1109\/TEVC.2011.2132725"},{"key":"2025120523270267893_j_jisys-2015-0103_ref_005_w2aab3b7d232b1b6b1ab2ab5Aa","unstructured":"R. Chiong, Nature inspired algorithms for optimization, in: Studies in Computational Intelligence, 193, Springer, Berlin, 2009, ISBN 978-3-642-00266-3."},{"key":"2025120523270267893_j_jisys-2015-0103_ref_006_w2aab3b7d232b1b6b1ab2ab6Aa","unstructured":"R. Dawkins, The selfish gene, Oxford University Press, New York, 1976."},{"key":"2025120523270267893_j_jisys-2015-0103_ref_007_w2aab3b7d232b1b6b1ab2ab7Aa","doi-asserted-by":"crossref","unstructured":"A. E. Eiben and J. E. Smith, Introduction to evolutionary computing, Springer, Berlin, 2003.","DOI":"10.1007\/978-3-662-05094-1"},{"key":"2025120523270267893_j_jisys-2015-0103_ref_008_w2aab3b7d232b1b6b1ab2ab8Aa","doi-asserted-by":"crossref","unstructured":"E. Elbeltagi, T. Hegazy and D. Grierson, Comparison among five evolutionary-based optimization algorithms, Adv. Eng. Inform.19 (2005), 43\u201353.","DOI":"10.1016\/j.aei.2005.01.004"},{"key":"2025120523270267893_j_jisys-2015-0103_ref_009_w2aab3b7d232b1b6b1ab2ab9Aa","doi-asserted-by":"crossref","unstructured":"L. J. Eshelman and J. D. Schaffer, Real-coded genetic algorithms and interval-schemata, in: Foundations of Genetic Algorithms, L. D. Whitley, ed., pp. 187\u2013202, Morgan Kaufmann, San Mateo, CA, 1993.","DOI":"10.1016\/B978-0-08-094832-4.50018-0"},{"key":"2025120523270267893_j_jisys-2015-0103_ref_010_w2aab3b7d232b1b6b1ab2ac10Aa","unstructured":"W. E. Hart, Adaptive global optimization with local search, PhD thesis, University of California, San Diego, 1994."},{"key":"2025120523270267893_j_jisys-2015-0103_ref_011_w2aab3b7d232b1b6b1ab2ac11Aa","doi-asserted-by":"crossref","unstructured":"G. S. Hornsby, ALPS: the age-layered population structure for reducing the problem of premature convergence, in: Proceedings of GECCO\u201906, pp. 815\u2013822, 2006.","DOI":"10.1145\/1143997.1144142"},{"key":"2025120523270267893_j_jisys-2015-0103_ref_012_w2aab3b7d232b1b6b1ab2ac12Aa","doi-asserted-by":"crossref","unstructured":"S. Hsieh, T. Sun, C. Liu and S. Tsai, Solving large scale global optimization using improved particle swarm optimizer, in: Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2008, pp. 1777\u20131784, 2008.","DOI":"10.1109\/CEC.2008.4631030"},{"key":"2025120523270267893_j_jisys-2015-0103_ref_013_w2aab3b7d232b1b6b1ab2ac13Aa","doi-asserted-by":"crossref","unstructured":"H. Ishibuchi, T. Yoshida and T. Murata, Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling, IEEE T. Evolut. Comput.7 (2003), 204\u2013223.","DOI":"10.1109\/TEVC.2003.810752"},{"key":"2025120523270267893_j_jisys-2015-0103_ref_014_w2aab3b7d232b1b6b1ab2ac14Aa","doi-asserted-by":"crossref","unstructured":"H. Ishibuchi, Y. Tanigaki, N. Akedo and Y. Nojima, How to strike a balance between local search and global search in multiobjective memetic algorithms for multiobjective 0\/1 knapsack problems, in: Proceedings of 2013 IEEE Congress on Evolutionary Computation, pp. 1643\u20131650, Cancun, Mexico, June 20\u201323, 2013.","DOI":"10.1109\/CEC.2013.6557758"},{"key":"2025120523270267893_j_jisys-2015-0103_ref_015_w2aab3b7d232b1b6b1ab2ac15Aa","doi-asserted-by":"crossref","unstructured":"L. Jiao, Y. Li, M. Gong and X. Zhang, Quantum-inspired immune clonal algorithm for global optimization, IEEE T. Syst. Man Cy. B38 (2008), 1234\u20131253.","DOI":"10.1109\/TSMCB.2008.927271"},{"key":"2025120523270267893_j_jisys-2015-0103_ref_016_w2aab3b7d232b1b6b1ab2ac16Aa","doi-asserted-by":"crossref","unstructured":"J. Knowles and D. Corne, M-PAES: a memetic algorithm for multiobjective optimization, in: CEC 2000, pp. 325\u2013332, IEEE Press, San Diego CA, 2000.","DOI":"10.1109\/CEC.2000.870313"},{"key":"2025120523270267893_j_jisys-2015-0103_ref_017_w2aab3b7d232b1b6b1ab2ac17Aa","doi-asserted-by":"crossref","unstructured":"N. Krasnogor and J. Smith, A tutorial for competent memetic algorithms: model, taxonomy, and design issues, IEEE T. Evolut. Comput.9 (2005), 474\u2013488.","DOI":"10.1109\/TEVC.2005.850260"},{"key":"2025120523270267893_j_jisys-2015-0103_ref_018_w2aab3b7d232b1b6b1ab2ac18Aa","doi-asserted-by":"crossref","unstructured":"Y. Li, H. Shi, L.C. Jiao and R. Liu. Quantum evolutionary clustering algorithm based on watershed applied to SAR image segmentation, Neurocomputing87 (2012), 90\u201398.","DOI":"10.1016\/j.neucom.2012.02.008"},{"key":"2025120523270267893_j_jisys-2015-0103_ref_019_w2aab3b7d232b1b6b1ab2ac19Aa","doi-asserted-by":"crossref","unstructured":"Y. Li, L. Jiao, P. Li and B. Wu, A hybrid memetic algorithm for global optimization, Neurocomputing134 (2014), 132\u2013139.","DOI":"10.1016\/j.neucom.2012.12.068"},{"key":"2025120523270267893_j_jisys-2015-0103_ref_020_w2aab3b7d232b1b6b1ab2ac20Aa","unstructured":"T. Lin-Yu and C. Chen, Multiple trajectory search for large scale global optimization, in: Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2008, pp. 3052\u20133059, 2008."},{"key":"2025120523270267893_j_jisys-2015-0103_ref_021_w2aab3b7d232b1b6b1ab2ac21Aa","doi-asserted-by":"crossref","unstructured":"C. MacNish and X. Yao, Direction matters in high-dimensional optimization, in: Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2008, pp. 2372\u20132379, 2008.","DOI":"10.1109\/CEC.2008.4631115"},{"key":"2025120523270267893_j_jisys-2015-0103_ref_022_w2aab3b7d232b1b6b1ab2ac22Aa","unstructured":"P. Merz and B. Freisleben, A genetic local search approach to the quadratic assignment problem, in: Proceedings of the 7th International Conference on Genetic Algorithms, pp. 465\u2013472, Morgan Kaufmann, San Diego, CA, 1997."},{"key":"2025120523270267893_j_jisys-2015-0103_ref_023_w2aab3b7d232b1b6b1ab2ac23Aa","unstructured":"P. Merz, On the performance of memetic algorithms in combinatorial optimization, in: Second Workshop on Memetic Algorithms (WOMA II), Genetic and Evolutionary Computation Conference, GECCO 2001, pp. 297\u2013345, Morgan Kaufmann, San Diego, CA, 2001."},{"key":"2025120523270267893_j_jisys-2015-0103_ref_024_w2aab3b7d232b1b6b1ab2ac24Aa","unstructured":"P. Moscato and C. Cotta, A gentle introduction to memetic algorithms, in: Handbook of Meta-heuristics, pp. 1\u201356, Kluwer, Dordrecht, 1999."},{"key":"2025120523270267893_j_jisys-2015-0103_ref_025_w2aab3b7d232b1b6b1ab2ac25Aa","doi-asserted-by":"crossref","unstructured":"Q. H. Nguyen, Y. S. Ong and M. H. Lim, A probabilistic memetic framework, IEEE T. Evolut. Comput.13 (2009), 604\u2013623.","DOI":"10.1109\/TEVC.2008.2009460"},{"key":"2025120523270267893_j_jisys-2015-0103_ref_026_w2aab3b7d232b1b6b1ab2ac26Aa","doi-asserted-by":"crossref","unstructured":"J. C. Ni, L. Li, F. Qiao and Q. Wu, A novel memetic algorithm and its application to clustering, Memetic Computing5 (2013), 65\u201378.","DOI":"10.1007\/s12293-012-0087-x"},{"key":"2025120523270267893_j_jisys-2015-0103_ref_027_w2aab3b7d232b1b6b1ab2ac27Aa","doi-asserted-by":"crossref","unstructured":"Y. S. Ong, M. H. Lim and X. S. Chen, Research frontier: memetic computation \u2013 past, present & future, IEEE comput. Intell. M.5 (2010), 24\u201336.","DOI":"10.1109\/MCI.2010.936309"},{"key":"2025120523270267893_j_jisys-2015-0103_ref_028_w2aab3b7d232b1b6b1ab2ac28Aa","unstructured":"N. P. Padhy, Artificial intelligence and intelligence systems, Oxford University Press, India, 2005."},{"key":"2025120523270267893_j_jisys-2015-0103_ref_029_w2aab3b7d232b1b6b1ab2ac29Aa","doi-asserted-by":"crossref","unstructured":"R. Storn and K. Price, Differential evolution \u2013 a simple and efficient heuristic for global optimization over continuous spaces, J. Global Optimi.11 (1997), 341\u2013359.","DOI":"10.1023\/A:1008202821328"},{"key":"2025120523270267893_j_jisys-2015-0103_ref_030_w2aab3b7d232b1b6b1ab2ac30Aa","doi-asserted-by":"crossref","unstructured":"J. Sun, J. M. Garibaldi, N. Krasnogor and Q. Zhang, An intelligent multi-restart memetic algorithm for box-constrained global optimisation, Evol. Comput.21 (2013), 107\u2013147.","DOI":"10.1162\/EVCO_a_00068"},{"key":"2025120523270267893_j_jisys-2015-0103_ref_031_w2aab3b7d232b1b6b1ab2ac31Aa","unstructured":"K. Tang, X. Yao, P. N. Suganthan, C. MacNish, Y. P. Chen, C. M. Chen and Z. Yang, Benchmark functions for the CEC\u20192008 special session and competition on large scale global optimization, Technical report, Nature Inspired Computation and Applications Laboratory, 2007, USTC, China, http:\/\/nical.ustc.edu.cn\/cec08ss.php, Accessed January, 2012."},{"key":"2025120523270267893_j_jisys-2015-0103_ref_032_w2aab3b7d232b1b6b1ab2ac32Aa","doi-asserted-by":"crossref","unstructured":"F. Vavak, T. C. Fogarty and K. A. Jukes, A genetic algorithm with variable range of local search for tracking changing environments, in: Parallel Problem Solving from Nature \u2013 PPSN IV. Lect. Notes Comput. Sci. 1141, pp. 376\u2013385, Springer, Berlin, Germany, 2005.","DOI":"10.1007\/3-540-61723-X_1002"},{"key":"2025120523270267893_j_jisys-2015-0103_ref_033_w2aab3b7d232b1b6b1ab2ac33Aa","doi-asserted-by":"crossref","unstructured":"Y. Wang and B. Li, A restart univariate estimation of distribution algorithm: sampling under mixed Gaussian and L\u00e9vy probability distribution, in: Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2008, pp. 3917\u20133924, 2008.","DOI":"10.1109\/CEC.2008.4631330"},{"key":"2025120523270267893_j_jisys-2015-0103_ref_034_w2aab3b7d232b1b6b1ab2ac34Aa","unstructured":"X. S. Yang, Test problems in optimization, in: Engineering Optimization: An Introduction with Metaheuristic Applications, X.-S. Yang, ed., John Wiley & Sons, New York, 2010."},{"key":"2025120523270267893_j_jisys-2015-0103_ref_035_w2aab3b7d232b1b6b1ab2ac35Aa","doi-asserted-by":"crossref","unstructured":"Z. Yang, K. Tang and X. Yao, Multilevel cooperative coevolution for large scale optimization, in: Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2008, pp. 1663\u20131670, 2008.","DOI":"10.1109\/CEC.2008.4631014"},{"key":"2025120523270267893_j_jisys-2015-0103_ref_036_w2aab3b7d232b1b6b1ab2ac36Aa","doi-asserted-by":"crossref","unstructured":"X. Yao, Y. Liu and G. Lin, Evolutionary programming made faster, IEEE T. Evolut. Comput.3 (1999), 82\u2013102.","DOI":"10.1109\/4235.771163"},{"key":"2025120523270267893_j_jisys-2015-0103_ref_037_w2aab3b7d232b1b6b1ab2ac37Aa","doi-asserted-by":"crossref","unstructured":"A. Zamuda, J. Brest, B. Bo\u0161kovi\u0107 and V. Zumer, Large scale global optimization using differential evolution with self-adaptation and cooperative co-evolution, in: Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2008, pp. 3718\u20133725, 2008.","DOI":"10.1109\/CEC.2008.4631301"},{"key":"2025120523270267893_j_jisys-2015-0103_ref_038_w2aab3b7d232b1b6b1ab2ac38Aa","doi-asserted-by":"crossref","unstructured":"S. Z. Zhao, J. J. Liang, P. N. Suganthan and M. F. Tasgetiren, Dynamic multi-swarm particle swarm optimizer with local search for large scale global optimization, in: Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2008, pp. 3845\u20133852, 2008.","DOI":"10.1109\/CEC.2008.4631320"}],"container-title":["Journal of Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyter.com\/view\/journals\/jisys\/26\/2\/article-p287.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2015-0103\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2015-0103\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T23:27:36Z","timestamp":1764977256000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyterbrill.com\/document\/doi\/10.1515\/jisys-2015-0103\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,18]]},"references-count":38,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2016,2,27]]},"published-print":{"date-parts":[[2017,4,1]]}},"alternative-id":["10.1515\/jisys-2015-0103"],"URL":"https:\/\/doi.org\/10.1515\/jisys-2015-0103","relation":{},"ISSN":["2191-026X","0334-1860"],"issn-type":[{"type":"electronic","value":"2191-026X"},{"type":"print","value":"0334-1860"}],"subject":[],"published":{"date-parts":[[2016,4,18]]}}}