{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T02:53:08Z","timestamp":1763347988850,"version":"3.37.3"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,1,5]],"date-time":"2016-01-05T00:00:00Z","timestamp":1451952000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002920","name":"Research Grants Council, University Grants Committee, Hong Kong (HK)","doi-asserted-by":"publisher","award":["CityU 125313"],"award-info":[{"award-number":["CityU 125313"]}],"id":[{"id":"10.13039\/501100002920","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Memetic Comp."],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1007\/s12293-015-0178-6","type":"journal-article","created":{"date-parts":[[2016,1,5]],"date-time":"2016-01-05T02:19:35Z","timestamp":1451960375000},"page":"189-210","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["Non-revisiting genetic algorithm with adaptive mutation using constant memory"],"prefix":"10.1007","volume":"8","author":[{"given":"Yang","family":"Lou","sequence":"first","affiliation":[]},{"given":"Shiu Yin","family":"Yuen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,1,5]]},"reference":[{"issue":"1","key":"178_CR1","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1(1):67\u201382","journal-title":"IEEE Trans Evol Comput"},{"key":"178_CR2","unstructured":"Davis L (ed) (1991) Handbook of genetic algorithms, vol 115. Van Nostrand Reinhold, New York"},{"key":"178_CR3","doi-asserted-by":"publisher","unstructured":"Friedrich T, Hebbinghaus N, Neumann F (2007) Rigorous analyses of simple diversity mechanisms. In: Proceedings of the 9th annual conference on genetic and evolutionary computation (GECCO). ACM, New York, pp 1219\u20131225","DOI":"10.1145\/1276958.1277194"},{"key":"178_CR4","doi-asserted-by":"publisher","unstructured":"Ronald S (1998) Duplicate genotypes in a genetic algorithm. In: Proceedings of the IEEE world congress on computational intelligence (WCCI), pp 793\u2013798","DOI":"10.1109\/ICEC.1998.700153"},{"key":"178_CR5","unstructured":"Povinelli RJ, Feng X (1999) Improving genetic algorithms performance by hashing fitness values. In: Proceedings of the artificial neural networks in engineering (ANNIE), pp 399\u2013404"},{"issue":"3","key":"178_CR6","first-page":"271","volume":"18","author":"J Kratica","year":"1999","unstructured":"Kratica J (1999) Improving performances of the genetic algorithm by caching. Comput Artif Intell 18(3):271\u2013283","journal-title":"Comput Artif Intell"},{"issue":"2","key":"178_CR7","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1109\/TEVC.2008.2003008","volume":"13","author":"SY Yuen","year":"2009","unstructured":"Yuen SY, Chow CK (2009) A genetic algorithm that adaptively mutates and never revisits. IEEE Trans Evol Comput 13(2):454\u2013472","journal-title":"IEEE Trans Evol Comput"},{"key":"178_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu search","author":"F Glover","year":"1997","unstructured":"Glover F, Laguna M (1997) Tabu search. Kluwer, Norwell"},{"key":"178_CR9","doi-asserted-by":"publisher","unstructured":"Chow CK, Yuen SY (2010) Continuous non-revisiting genetic algorithm with random search space re-partitioning and one-gene-flip mutation. In: Proceedings of the IEEE congress on evolutionary computation (CEC) , Barcelona. doi:\n                        10.1109\/CEC.2012.6252926","DOI":"10.1109\/CEC.2012.6252926"},{"key":"178_CR10","doi-asserted-by":"publisher","unstructured":"Chow CK, Yuen SY (2012) Continuous Non-revisiting Genetic Algorithm with Overlapped Search Sub-region. In Proceedings of the IEEE congress on evolutionary computation (CEC), Brisbane, QLD, p 1\u20138. doi:\n                        10.1109\/CEC.2010.5586046","DOI":"10.1109\/CEC.2010.5586046"},{"key":"178_CR11","unstructured":"Yuen SY, Chow CK (2008) A non-revisiting simulated annealing algorithm. In: Proceedings of the IEEE congress on evolutionary computation (CEC), pp 1886\u20131892"},{"key":"178_CR12","unstructured":"Chow CK, Yuen SY (2008) A non-revisiting particle swarm optimization. In: Proceedings of the IEEE congress on evolutionary computation (CEC), pp 1879\u20131885"},{"issue":"2","key":"178_CR13","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s12293-012-0079-x","volume":"4","author":"J Du","year":"2012","unstructured":"Du J, Rada R (2012) Memetic algorithms, domain knowledge, and financial investing. Memet Comput 4(2):109\u2013125","journal-title":"Memet Comput"},{"issue":"2","key":"178_CR14","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1080\/0305215X.2012.669379","volume":"45","author":"CN Young","year":"2013","unstructured":"Young CN, LeBrese C, Zou JJ, Leo CJ (2013) A robust search paradigm with enhanced vine creeping optimization. Eng Optim 45(2):225\u2013244","journal-title":"Eng Optim"},{"key":"178_CR15","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.ins.2010.07.015","volume":"192","author":"B Akay","year":"2012","unstructured":"Akay B, Karaboga D (2012) A modified artificial bee colony algorithm for real-parameter optimization. Inf Sci 192:120\u2013142","journal-title":"Inf Sci"},{"issue":"3","key":"178_CR16","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s12293-015-0158-x","volume":"7","author":"SS Jadon","year":"2015","unstructured":"Jadon SS, Bansal JC, Tiwari R, Sharma H (2015) Accelerating artificial bee colony algorithm with adaptive local search. Memet Comput 7(3):215\u2013230","journal-title":"Memet Comput"},{"key":"178_CR17","doi-asserted-by":"publisher","first-page":"1449","DOI":"10.1007\/s00521-012-1069-0","volume":"21","author":"AH Gandomi","year":"2012","unstructured":"Gandomi AH, Yang XS (2012) Evolutionary boundary constraint handling scheme. Neural Comput Appl 21:1449\u20131462","journal-title":"Neural Comput Appl"},{"key":"178_CR18","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/j.asoc.2014.01.038","volume":"18","author":"Y Wang","year":"2014","unstructured":"Wang Y, Li HX, Huang T, Li L (2014) Differential evolution based on covariance matrix learning and bimodal distribution parameter setting. Appl Soft Comput 18:232\u2013247","journal-title":"Appl Soft Comput"},{"key":"178_CR19","doi-asserted-by":"publisher","unstructured":"Wang Y, Wang BC, Li HX, Yen GG (2015) Incorporating objective function information into the feasibility rule for constrained evolutionary optimization. IEEE Trans Cybern (in press). doi:\n                        10.1109\/TCYB.2015.2493239","DOI":"10.1109\/TCYB.2015.2493239"},{"key":"178_CR20","doi-asserted-by":"publisher","first-page":"4569","DOI":"10.1016\/j.ins.2010.11.030","volume":"181","author":"W Chu","year":"2011","unstructured":"Chu W, Gao X, Sorooshian S (2011) Handling boundary constraints for particle swarm optimization in high-dimensional search space. Inf Sci 181:4569\u20134581","journal-title":"Inf Sci"},{"key":"178_CR21","doi-asserted-by":"publisher","unstructured":"Zambrano-Bigiarini M, Clerc M, Rojas R (2013) Standard particle swarm optimisation 2011 at CEC-2013: a baseline for future PSO improvements. In: Proceedings of the IEEE congress on evolutionary computation (CEC), pp 2337\u20132344","DOI":"10.1109\/CEC.2013.6557848"},{"key":"178_CR22","doi-asserted-by":"publisher","unstructured":"Hansen N (2006) The CMA evolution strategy: a comparing review. In: Proceedings on towards a new evolutionary computation, pp 75\u2013102","DOI":"10.1007\/3-540-32494-1_4"},{"key":"178_CR23","unstructured":"Hansen N (2011) The CMA evolutionary strategy: a tutorial. In: Technical report. \n                        http:\/\/www.lri.fr\/~hansen\/cmatutorial.pdf\n                        \n                    . Accessed 14 June 2015"},{"issue":"2","key":"178_CR24","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1109\/TSM.2010.2096437","volume":"24","author":"CA Mack","year":"2011","unstructured":"Mack CA (2011) Fifty years of Moore\u2019s law. IEEE Trans Semicond Manuf 24(2):202\u2013207","journal-title":"IEEE Trans Semicond Manuf"},{"key":"178_CR25","doi-asserted-by":"publisher","unstructured":"Lou Y, Yuen SY (2015) Non-revisiting genetic algorithm with constant memory. In: Proceedings of the IEEE systems, man, and cybernetics (SMC), pp 1714\u20131719","DOI":"10.1109\/SMC.2015.301"},{"key":"178_CR26","unstructured":"Eshelman LJ, Schaffer JD (1992) Real-coded genetic algorithms and interval-schemata. In: Proceedings of the international conference on genetic algorithms (ICGA), pp 187\u2013202"},{"issue":"4","key":"178_CR27","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s12293-012-0098-7","volume":"4","author":"A Lihu","year":"2012","unstructured":"Lihu A, Holban S, Popescu O-A (2012) Real-valued genetic algorithms with disagreements. Memet Comput 4(4):317\u2013325","journal-title":"Memet Comput"},{"key":"178_CR28","unstructured":"Heris SMK (2015) Implementation of real-coded genetic algorithm in MATLAB. \n                        http:\/\/www.yarpiz.com\n                        \n                    . Accessed 23 Aug 2015"},{"issue":"6","key":"178_CR29","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1109\/TEVC.2010.2040180","volume":"15","author":"CK Chow","year":"2011","unstructured":"Chow CK, Yuen SY (2011) An evolutionary algorithm that makes decision based on the entire previous search history. IEEE Trans Evol Comput 15(6):741\u2013769","journal-title":"IEEE Trans Evol Comput"},{"issue":"9","key":"178_CR30","doi-asserted-by":"publisher","first-page":"3063","DOI":"10.1016\/j.asoc.2012.05.008","volume":"12","author":"SW Leung","year":"2012","unstructured":"Leung SW, Yuen SY, Chow CK (2012) Parameter control system of evolutionary algorithm that is aided by the entire search history. Appl Soft Comput 12(9):3063\u20133078","journal-title":"Appl Soft Comput"},{"key":"178_CR31","unstructured":"www.ee.cityu.edu.hk\/~syyuen\/Public\/Code.html\n                        \n                    . Accessed 28 Dec 2015"},{"key":"178_CR32","unstructured":"Liang JJ, Qu B-Y, Suganthan PN, Hern\u00e1ndez-D\u00edaz AG (2013) Problem definitions and evaluation criteria for the CEC 2013 special session and competition on real-parameter optimization. In: Technical report 2012, Computational Intelligence Laboratory, Zhengzhou University, Zhengzhou and technical report, Nanyang Technological University, Singapore"},{"issue":"2","key":"178_CR33","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1109\/TEVC.2014.2308294","volume":"19","author":"G Karafotias","year":"2014","unstructured":"Karafotias G, Hoogendoorn M, Eiben AE (2014) Parameter control in evolutionary algorithms: trends and challenges. IEEE Trans Evol Comput 19(2):167\u2013187","journal-title":"IEEE Trans Evol Comput"},{"key":"178_CR34","unstructured":"Sedgewick R (2002) Algorithms in Java, parts 1\u20134. Addison-Wesley, Boston"},{"key":"178_CR35","unstructured":"Knuth DE (1998) The art of computer programming: sorting and searching. Pearson Education, London"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-015-0178-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12293-015-0178-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-015-0178-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-015-0178-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T03:45:56Z","timestamp":1559447156000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12293-015-0178-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,5]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["178"],"URL":"https:\/\/doi.org\/10.1007\/s12293-015-0178-6","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"type":"print","value":"1865-9284"},{"type":"electronic","value":"1865-9292"}],"subject":[],"published":{"date-parts":[[2016,1,5]]}}}