{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T04:12:09Z","timestamp":1750997529944,"version":"3.41.0"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319694559"},{"type":"electronic","value":"9783319694566"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-69456-6_37","type":"book-chapter","created":{"date-parts":[[2017,10,18]],"date-time":"2017-10-18T14:04:34Z","timestamp":1508335474000},"page":"450-461","source":"Crossref","is-referenced-by-count":1,"title":["A Spy Search Mechanism (SSM) for Memetic Algorithm (MA) in Dynamic Environments"],"prefix":"10.1007","author":[{"given":"Stephen M.","family":"Akandwanaho","sequence":"first","affiliation":[]},{"given":"Serestina","family":"Viriri","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,10,19]]},"reference":[{"key":"37_CR1","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/978-1-4419-1665-5_15","volume-title":"Handbook of Meta-heuristics, International Series in Operations Research & Management Science","author":"EK Burke","year":"2010","unstructured":"Burke, E.K., Hyde, M., Kendall, G., Ochoa, G., Ozcan, E.: A classification of hyper-heuristic approaches. In: Gendreau, M., Potvin, J. (eds.) Handbook of Meta-heuristics, International Series in Operations Research & Management Science. LNCS, vol. 146, pp. 449\u2013468. Springer, Heidelberg (2010). doi: 10.1007\/978-1-4419-1665-5_15"},{"key":"37_CR2","volume-title":"The Selfish Gene","author":"R Dawkins","year":"1976","unstructured":"Dawkins, R.: The Selfish Gene. Clarendon Press, Oxford (1976)"},{"key":"37_CR3","unstructured":"Norman, G.M., Moscato, P.: A competitive cooperative complex combinatorial search. In: Proceedings of Joint Conference on Informatics and Operations Research, pp. 15\u201329 (1991)"},{"key":"37_CR4","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1007\/s12293-009-0011-1","volume":"1","author":"R Meuth","year":"2009","unstructured":"Meuth, R., Lim, M., Ong, Y., Wunsch, D.C.: A proposition on memes and meta-memes in computing for higher-order learning. Memetic Comput. 1, 86\u201399 (2009)","journal-title":"Memetic Comput."},{"key":"37_CR5","first-page":"26","volume":"2","author":"N Fouladgar","year":"2015","unstructured":"Fouladgar, N., Lotfi, S.: A brief review of solving dynamic optimization problems. Int. Acad. J. Sci. Eng. 2, 26\u201333 (2015)","journal-title":"Int. Acad. J. Sci. Eng."},{"key":"37_CR6","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1002\/bies.201100144","volume":"34","author":"DB Kell","year":"2012","unstructured":"Kell, D.B.: Scientific discovery as a combinatorial optimization problem: how best to navigate the landscape of possible experiments. BioEssays 34, 236\u2013244 (2012)","journal-title":"BioEssays"},{"key":"37_CR7","doi-asserted-by":"crossref","unstructured":"Khan, M.B., Zhang, D., Jun, M., Li, Z.J.: An intelligent search technique to train scheduling problem based on genetic algorithm. In: International Conference on Emerging Technologies, pp. 593\u2013598 (2006)","DOI":"10.1109\/ICET.2006.335970"},{"key":"37_CR8","doi-asserted-by":"crossref","unstructured":"Ming, G., Li, H.: An improved algorithm based on max-min for cloud task scheduling. In: Recent Advances in Computer Science and Information Engineering, pp. 217\u2013223 (2012)","DOI":"10.1007\/978-3-642-25789-6_32"},{"key":"37_CR9","doi-asserted-by":"crossref","first-page":"1166","DOI":"10.3923\/itj.2007.1166.1170","volume":"6","author":"EU Munir","year":"2007","unstructured":"Munir, E.U., Li, J., Shi, S.: QoS sufferage heuristic for independent task scheduling in grid. Inf. Technol. J. 6, 1166\u20131170 (2007)","journal-title":"Inf. Technol. J."},{"key":"37_CR10","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1109\/TCC.2014.2315797","volume":"2","author":"C Tsai","year":"2014","unstructured":"Tsai, C., Huang, W., Chian, M.: A hyperheuristic scheduling algorithm for cloud. IEEE Trans. Cloud Comput. 2, 236\u2013250 (2014)","journal-title":"IEEE Trans. Cloud Comput."},{"key":"37_CR11","first-page":"7","volume":"136","author":"A Amen","year":"2016","unstructured":"Amen, A.: Memetic algorithm for dynamic optimization problems. Int. J. Comput. Appl. 136, 7\u201310 (2016)","journal-title":"Int. J. Comput. Appl."},{"key":"37_CR12","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1016\/j.ejor.2007.07.034","volume":"195","author":"M Boudia","year":"2009","unstructured":"Boudia, M., Prins, C.: A memetic algorithm with dynamic population management for an integrated production-distribution problem. Eur. J. Oper. Res. 195, 703\u2013715 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"37_CR13","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1016\/j.comcom.2009.09.004","volume":"33","author":"KP Ferentinos","year":"2009","unstructured":"Ferentinos, K.P., Tsiligiridis, T.A.: A memetic algorithm for optimal dynamic design of wireless sensor networks. Comput. Commun. 33, 250\u2013258 (2009)","journal-title":"Comput. Commun."},{"key":"37_CR14","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/j.jksuci.2015.09.002","volume":"28","author":"G Bencheikh","year":"2016","unstructured":"Bencheikh, G., Boukachour, J., Alaoui, A.E.H.: A memetic algorithm to solve the dynamic multiple runway aircraft landing problem. J. King Saud Univ. - Comput. Inf. Sci. 28, 98\u2013109 (2016)","journal-title":"J. King Saud Univ. - Comput. Inf. Sci."},{"key":"37_CR15","doi-asserted-by":"crossref","unstructured":"Moser, I., Chiong, R.: A Hooke-Jeeves based memetic algorithm for solving dynamic optimization problems. In: Hybrid Artificial Intelligence System, pp. 301\u2013309 (2009)","DOI":"10.1007\/978-3-642-02319-4_36"},{"key":"37_CR16","doi-asserted-by":"crossref","unstructured":"Liu, M., Singh, H.K., Ray, T.: A memetic algorithm with a new split scheme for solving dynamic capacitated arc routing problems. In: IEEE Congress on Evolutionary Computation, pp. 595\u2013613 (2014)","DOI":"10.1109\/CEC.2014.6900358"},{"key":"37_CR17","doi-asserted-by":"crossref","first-page":"1151","DOI":"10.1109\/TEVC.2009.2023449","volume":"13","author":"K Tang","year":"2009","unstructured":"Tang, K., Mei, Y., Yao, X.: Memetic algorithm with extended neighborhood search for capacitated arc routing problems. IEEE Trans. Evol. Comput. 13, 1151\u20131166 (2009)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"37_CR18","doi-asserted-by":"crossref","unstructured":"Isaacs, A., Ray, T., Smith, W.: Memetic algorithm for dynamic bi-objective optimization problems. IEEE Trans. Evol. Comput. 31\u201347 (2009)","DOI":"10.1109\/CEC.2009.4983147"},{"key":"37_CR19","first-page":"1","volume":"2016","author":"S Hamam","year":"2016","unstructured":"Hamam, S., Almogren, A.S.: Distributed dynamic memetic algorithm based coding aware routing for wireless mesh sensor networks. Int. J. Distrib. Sens. Netw. 2016, 1\u20137 (2016)","journal-title":"Int. J. Distrib. Sens. Netw."},{"key":"37_CR20","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1007\/s00500-008-0347-3","volume":"13","author":"H Wang","year":"2009","unstructured":"Wang, H., Wang, D., Yang, S.: A memetic algorithm with adaptive hill climbing strategy for dynamic optimization problems. Soft. Comput. 13, 763\u2013780 (2009)","journal-title":"Soft. Comput."},{"key":"37_CR21","first-page":"738","volume":"4","author":"M Vaid","year":"2014","unstructured":"Vaid, M., Verma, A.: Memetic algorithm: hybridization of hill climbing with replacement operator. Int. J. Adv. Res. Comput. Sci. Softw. Eng. 4, 738\u2013743 (2014)","journal-title":"Int. J. Adv. Res. Comput. Sci. Softw. Eng."},{"key":"37_CR22","doi-asserted-by":"crossref","unstructured":"Mavrovouniotis, M., Muller, F.M., Yang, S.: An ant colony optimization based memetic algorithm for the dynamic traveling salesman problem. In: Proceedings of 2015 Annual Conference on Genetic and Evolutionary Computation, pp. 49\u201356 (2015)","DOI":"10.1145\/2739480.2754651"},{"key":"37_CR23","doi-asserted-by":"crossref","unstructured":"Duan, H., Yu, X.: Hybrid ant colony optimization using memetic algorithm for traveling salesman problem. In: IEEE International Symposium on Approximate Dynamic Programming and Reinforcement Learning, pp. 92\u201395 (2007)","DOI":"10.1109\/ADPRL.2007.368174"},{"key":"37_CR24","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-642-04962-0_17","volume-title":"Computational Intelligence and Intelligent Systems","author":"G Lin","year":"2009","unstructured":"Lin, G., Lu, X., Kang, L.: Search direction made evolution strategies faster. In: Cai, Z., Li, Z., Kang, Z., Liu, Y. (eds.) ISICA 2009. CCIS, vol. 51, pp. 146\u2013155. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-04962-0_17"},{"key":"37_CR25","doi-asserted-by":"crossref","unstructured":"Morrison, R.W., DeJong, K.A.: A test problem generator for non-stationary environments. In: Congress on Evolutionary Computation, vol. 3, pp. 2047\u20132053 (1999)","DOI":"10.1109\/CEC.1999.785526"},{"key":"37_CR26","doi-asserted-by":"crossref","unstructured":"Yang, S.: Non-stationary problem optimization using the primal-dual genetic algorithm. In: Proceedings of 2003 Congress on Evolutionary Computation, vol. 3, pp. 2246\u20132253 (2003)","DOI":"10.1109\/CEC.2003.1299951"},{"key":"37_CR27","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1007\/s00500-004-0422-3","volume":"9","author":"S Yang","year":"2005","unstructured":"Yang, S., Yao, X.: Experimental study on population-based incremental learning algorithms for dynamic optimization problems. Soft Comput. 9, 815\u2013834 (2005)","journal-title":"Soft Comput."},{"key":"37_CR28","unstructured":"Mitchell, M., Forrest, S., Holland, J.H.: The royal road for genetic algorithms: fitness landscapes and GA performance. In: Proceedings of 1st European Conference on Artificial Life, vol. 3, pp. 245\u2013254 (1992)"},{"key":"37_CR29","doi-asserted-by":"crossref","unstructured":"Yang, S.: Memory-based immigrants for genetic algorithms in dynamic environments. In: Proceedings of 2005 Genetic and Evolutionary Computation Conference, vol. 2, pp. 1115\u20131122 (2005)","DOI":"10.1145\/1068009.1068196"},{"key":"37_CR30","doi-asserted-by":"crossref","unstructured":"Forrest, S., Mitchell, M.: Relative building-block fitness and the building-block hyperthesis. In: Proceedings of Foundations of Genetic Algorithms, pp. 1\u20138 (1993)","DOI":"10.1016\/B978-0-08-094832-4.50013-1"},{"key":"37_CR31","unstructured":"Yang, S.: On the design of diploid genetic algorithms for problem optimization in dynamic environment. In: Proceedings of 2006 IEEE Congress on Evolutionary Computation, pp. 1362\u20131369 (2006)"},{"key":"37_CR32","doi-asserted-by":"crossref","unstructured":"Turky, A.M., Abdullah, S., Sabar, N.R.: Meta-heuristic algorithm for binary dynamic optimization problems and its relevancy to timetabling. In: Proceedings of 10th International Conference of the Practice and Theory of Automated Timetabling, pp. 26\u201329 (2014)","DOI":"10.1016\/j.procs.2014.05.177"},{"key":"37_CR33","doi-asserted-by":"crossref","first-page":"1375","DOI":"10.1109\/TCYB.2015.2447574","volume":"46","author":"G Zhang","year":"2016","unstructured":"Zhang, G., Li, Y.: A memetic algorithm for global optimization of multimodal nonseparable problems. IEEE Trans. Cybern. 46, 1375\u20131387 (2016)","journal-title":"IEEE Trans. Cybern."},{"key":"37_CR34","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/j.ins.2014.02.084","volume":"172","author":"AM Turky","year":"2014","unstructured":"Turky, A.M., Abdullah, S.: A multi-population harmony search algorithm with external archive for dynamic optimization problems. Inf. Sci. 172, 84\u201395 (2014)","journal-title":"Inf. Sci."}],"container-title":["Lecture Notes in Computer Science","Multi-disciplinary Trends in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-69456-6_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T15:14:18Z","timestamp":1750950858000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-69456-6_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319694559","9783319694566"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-69456-6_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}