{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:13:07Z","timestamp":1761894787819,"version":"3.35.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,9,20]],"date-time":"2008-09-20T00:00:00Z","timestamp":1221868800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1007\/s10489-008-0146-7","type":"journal-article","created":{"date-parts":[[2008,9,19]],"date-time":"2008-09-19T18:57:23Z","timestamp":1221850643000},"page":"292-310","source":"Crossref","is-referenced-by-count":21,"title":["Multi-population co-genetic algorithm with double chain-like agents structure for parallel global numerical optimization"],"prefix":"10.1007","volume":"32","author":[{"given":"Yongming","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoping","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,9,20]]},"reference":[{"key":"146_CR1","volume-title":"Genetic algorithms in search optimization & machine learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg DE (1989) Genetic algorithms in search optimization & machine learning. Addison-Wesley, Reading"},{"key":"146_CR2","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1090.001.0001","volume-title":"Adaptation in nature and artificial system","author":"JH Holland","year":"1992","unstructured":"Holland JH (1992) Adaptation in nature and artificial system. MIT Press, Cambridge"},{"key":"146_CR3","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/978-3-662-04131-4","volume-title":"How to solve it: modern heuristics","author":"Z Michalewicz","year":"2000","unstructured":"Michalewicz Z, Fogel DB (2000) How to solve it: modern heuristics. Springer, Berlin, pp.\u00a083\u2013234"},{"issue":"3","key":"146_CR4","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF00126629","volume":"6","author":"J Potvin","year":"1966","unstructured":"Potvin J, Dube D, Robillard C (1966) Hybrid approach to vehicle routing using neural networks and genetic algorithm. Appl Intell 6(3), 241\u2013252","journal-title":"Appl Intell"},{"issue":"4","key":"146_CR5","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1109\/21.286385","volume":"24","author":"M Srinivas","year":"1994","unstructured":"Srinivas M, Patnaik LM (1994) Adaptive probabilities of crossover and mutation in genetic algorithms. IEEE Trans Syst Man Cybern Part B 24(4), 656\u2013667","journal-title":"IEEE Trans Syst Man Cybern Part B"},{"issue":"6","key":"146_CR6","first-page":"908","volume":"17","author":"D-W Gong","year":"2002","unstructured":"Gong D-W, Sun X-Y, Guo X-J (2002) Novel survival of the fittest genetic algorithm. Control Decis 17(6), 908\u2013911","journal-title":"Control Decis"},{"issue":"2","key":"146_CR7","doi-asserted-by":"crossref","first-page":"1128","DOI":"10.1109\/TSMCB.2003.821456","volume":"34","author":"W Zhong","year":"2004","unstructured":"Zhong W, Liu J, Xue M, Jiao L (2004) A multi-agent genetic algorithm for global numerical optimization. IEEE Trans Syst Man Cybern Part B 34(2), 1128\u20131141","journal-title":"IEEE Trans Syst Man Cybern Part B"},{"key":"146_CR8","unstructured":"Zeng X-P, Li Y-M, Qin J A dynamic chain-like agent genetic algorithm for global numerical optimization and feature selection, Neurocomputing. Available online at www.sciencedirect.com"},{"issue":"3\u20134","key":"146_CR9","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/S0020-0255(01)00080-9","volume":"133","author":"B Olsson","year":"2001","unstructured":"Olsson B (2001) Co-evolutionary search in asymmetric spaces. Inf Sci 133(3\u20134), 103\u2013125","journal-title":"Inf Sci"},{"issue":"1","key":"146_CR10","first-page":"1","volume":"8","author":"MA Potter","year":"2000","unstructured":"Potter MA, De Jong KA (2000) Cooperative coevolution: an architecture for evolving coadapted subcomponents. IEEE Trans Evol Comput 8(1), 1\u201329","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"146_CR11","first-page":"40","volume":"23","author":"Y Gao","year":"2006","unstructured":"Gao Y, Xie S-L, Xu R-N, Li Z-H (2006) A multi sub-population particle swarm optimizer based on clustering. Appl Res Comput 23(4), 40\u201341","journal-title":"Appl Res Comput"},{"issue":"4","key":"146_CR12","doi-asserted-by":"crossref","first-page":"2502","DOI":"10.1016\/j.eswa.2007.04.017","volume":"34","author":"C-H Su","year":"2008","unstructured":"Su C-H, Hou T-H (2008) Using multi-population intelligent genetic algorithm to find the Pareto-optimal parameters for a nano-particle milling process. Expert Syst Appl 34(4), 2502\u20132510","journal-title":"Expert Syst Appl"},{"issue":"2","key":"146_CR13","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1109\/4235.910464","volume":"5","author":"YW Leung","year":"2001","unstructured":"Leung YW, Wang Y (2001) An orthogonal genetic algorithm with quantization for global numerical optimization. IEEE Trans Evol Comput 5(2), 41\u201353","journal-title":"IEEE Trans Evol Comput"},{"key":"146_CR14","series-title":"Lecture notes in artificial intelligence","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BFb0028518","volume-title":"Simulated evolution and learning","author":"ZJ Pan","year":"1997","unstructured":"Pan ZJ, Kang LS (1997) An adaptive evolutionary algorithms for numerical optimization. In: X Yao, JH Kim, T Furuhashi (eds.) Simulated evolution and learning. Lecture notes in artificial intelligence. Springer, Berlin, pp\u00a027\u201334"},{"issue":"7","key":"146_CR15","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1109\/4235.771163","volume":"3","author":"X Yao","year":"1999","unstructured":"Yao X, Liu Y, Lin G (1999) Evolutionary programming made faster. IEEE Trans Evol Comput 3(7), 82\u2013102","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"146_CR16","doi-asserted-by":"crossref","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":"146_CR17","first-page":"726","volume-title":"Proceedings of the genetic and evolutionary computation conference (GECCO\u201999)","author":"D Whitley","year":"1999","unstructured":"Whitley D (1999) A Free Lunch proof for gray versus binary encodings. In: W Banzhaf, J Daida, AE Eiben, MH Garzon, V Honavar, M Jakiela, RE Smith (eds.), Proceedings of the genetic and evolutionary computation conference (GECCO\u201999), Orlando, FL, vol\u00a01. Morgan Kaufmann, San Francisco, pp\u00a0726\u2013733"},{"key":"146_CR18","unstructured":"Kimbrough SO, Koehler GJ, Lu M, Wood DH On a Feasible\u2013Infeasible Two-Population (FI-2Pop) genetic algorithm for constrained optimization: Distance tracing and no free lunch. European J Oper Res. Available online at www.sciencedirect.com"},{"key":"146_CR19","first-page":"565","volume-title":"Proceedings of the genetic and evolutionary computation conference (GECCO 2001)","author":"C Schumacher","year":"2001","unstructured":"Schumacher C, Vose MD, Whitley LD (2001) The No Free Lunch and description length. In: L Spector, E Goodman, A Wu, W Langdon, H-M Voigt, M Gen, S Sen, M Dorigo, S Pezeshk, M Garzon, E Burke (eds.), Proceedings of the genetic and evolutionary computation conference (GECCO 2001), San Francisco, CA. Morgan Kaufmann, San Francisco, pp\u00a0565\u2013570"},{"issue":"5","key":"146_CR20","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1109\/TEVC.2004.831258","volume":"8","author":"ZG Tu","year":"2004","unstructured":"Tu ZG, Lu Y (2004) A robust stochastic genetic algorithms (StGA) for global numerical optimization. IEEE Trans Evol Comput 8(5), 456\u2013470","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"146_CR21","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1287\/ijoc.1060.0194","volume":"19","author":"GJ Koehler","year":"2007","unstructured":"Koehler GJ (2007) Conditions that obviate the no free lunch theorems for optimization. Inf J Comput 19(2), 273\u2013279","journal-title":"Inf J Comput"},{"issue":"6","key":"146_CR22","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0020-0190(03)00222-9","volume":"86","author":"C Igel","year":"2003","unstructured":"Igel C, Toussaint M (2003) On classes of functions for which no free lunch results hold. Inf Process Lett 86(6), 317\u2013321","journal-title":"Inf Process Lett"},{"issue":"2","key":"146_CR23","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S, Meyarivan TA (2002) A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2), 182\u2013197","journal-title":"IEEE Trans Evol Comput"},{"key":"146_CR24","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3927.001.0001","volume-title":"An introduction to genetic algorithms","author":"M Mitchell","year":"1996","unstructured":"Mitchell M (1996) An introduction to genetic algorithms. MIT Press, Cambridge, pp\u00a0155\u2013181"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-008-0146-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-008-0146-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-008-0146-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:36:25Z","timestamp":1738370185000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-008-0146-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,9,20]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["146"],"URL":"https:\/\/doi.org\/10.1007\/s10489-008-0146-7","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"type":"print","value":"0924-669X"},{"type":"electronic","value":"1573-7497"}],"subject":[],"published":{"date-parts":[[2008,9,20]]}}}