{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T17:54:53Z","timestamp":1768413293850,"version":"3.49.0"},"reference-count":100,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,2,23]],"date-time":"2016-02-23T00:00:00Z","timestamp":1456185600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61150110488"],"award-info":[{"award-number":["61150110488"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Technological Fund of Anhui Province for Outstanding Youth","award":["1108085J16"],"award-info":[{"award-number":["1108085J16"]}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["201104329"],"award-info":[{"award-number":["201104329"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Chinese Academy of Sciences (CAS) Fellowship for Young International Scientists","award":["2011Y1GB01"],"award-info":[{"award-number":["2011Y1GB01"]}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities,","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]},{"name":"European Union 7th Framework Program","award":["247619"],"award-info":[{"award-number":["247619"]}]},{"name":"University of Newcastle Faculty of Science and Information Technology\u2019s Strategic Initiatives Research Fund","award":["10.31415"],"award-info":[{"award-number":["10.31415"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2016,11]]},"DOI":"10.1007\/s10898-016-0417-5","type":"journal-article","created":{"date-parts":[[2016,2,23]],"date-time":"2016-02-23T09:35:49Z","timestamp":1456220149000},"page":"511-534","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":27,"title":["Global versus local search: the impact of population sizes on evolutionary algorithm performance"],"prefix":"10.1007","volume":"66","author":[{"given":"Thomas","family":"Weise","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuezhong","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raymond","family":"Chiong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ke","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f6rg","family":"L\u00e4ssig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,2,23]]},"reference":[{"key":"417_CR1","unstructured":"Abu Bakar, N., Mahadzir, M.F.: The impact of population size on knowledge acquisition in genetic algorithms paradigm: finding solutions in the game of sudoku. In: Baharom, F., Mahmuddin, M., Yusof Y, Ishak, W.H.W., Saip, M.A. (eds.) Knowledge Management: Theory, Research, and Practice. Proceedings of the 5th International Conference on Knowledge Management (KMICe\u201910), Universiti Utara Malaysia (UUM), pp. 644\u2013648. Sintok, Kedah, Malaysia (2010)"},{"key":"417_CR2","unstructured":"Angeline, P.J.: Subtree crossover: building block engine or macromutation? In: Koza, J.R., Deb, K., Dorigo, M., Fogel, D.B., Garzon, M.H., Iba, H., Riolo, R.L. (eds.) Proceedings of the Second Annual Conference on Genetic Programming (GP\u201997), pp. 9\u201317. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA (1997)"},{"key":"417_CR3","doi-asserted-by":"crossref","unstructured":"Applegate, D.L., Bixby, R.E., Chv\u00e1tal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton Series in Applied Mathematics. Princeton University Press, Princeton, NJ (2007)","DOI":"10.1515\/9781400841103"},{"key":"417_CR4","doi-asserted-by":"publisher","unstructured":"Auger, A., Hansen, N.: A restart cma evolution strategy with increasing population size. In: Corne, D.W., Michalewicz, Z., McKay, R.I., Eiben \u00c1E, Fogel, D.B., Fonseca, C.M., Raidl, G.R., Tan, K.C., Zalzala, A.M.S. (eds.) Proceedings of the IEEE Congress on Evolutionary Computation (CEC\u201905), pp. 1769\u20131776. IEEE Computer Society, Piscataway, NJ, USA (2005). doi: 10.1109\/CEC.2005.1554902","DOI":"10.1109\/CEC.2005.1554902"},{"key":"417_CR5","doi-asserted-by":"crossref","unstructured":"B\u00e4ck, T., Fogel, D.B., Michalewicz, Z. (eds.): Handbook of Evolutionary Computation. Computational Intelligence Library. Oxford University Press Inc, New York (1997)","DOI":"10.1201\/9781420050387"},{"key":"417_CR6","unstructured":"Bentley, P.J., Kumar, S.P.: The ways to grow designs: a comparison of embryogenies for an evolutionary design problem. In: Banzhaf, W., Daida, J.M., Eiben, \u00c1.E., Garzon, M.H., Honavar, V., Jakiela, M.J., Smith, R.E. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference (GECCO\u201999), pp. 35\u201343. Morgan Kaufmann Publishers Inc., San Francisco (1999)"},{"issue":"4","key":"417_CR7","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1007\/s10898-011-9783-1","volume":"54","author":"D Berend","year":"2012","unstructured":"Berend, D., Korach, E., Zucker, S.: Tabu search for the BWC problem. J. Glob. Optim. 54(4), 649\u2013667 (2012). doi: 10.1007\/s10898-011-9783-1","journal-title":"J. Glob. Optim."},{"issue":"1","key":"417_CR8","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1023\/A:1015059928466","volume":"1","author":"H Beyer","year":"2002","unstructured":"Beyer, H., Schwefel, H.: Evolution strategies\u2014a comprehensive introduction. Nat Comput Int J 1(1), 3\u201352 (2002). doi: 10.1023\/A:1015059928466","journal-title":"Nat Comput Int J"},{"issue":"2\u20133","key":"417_CR9","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s10898-004-8270-3","volume":"30","author":"\u015e\u0130 Birbil","year":"2004","unstructured":"Birbil, \u015e\u0130., Fang, S., Sheu, R.: On the convergence of a population-based global optimization algorithm. J. Glob. Optim. 30(2\u20133), 301\u2013318 (2004). doi: 10.1007\/s10898-004-8270-3","journal-title":"J. Glob. Optim."},{"key":"417_CR10","unstructured":"Boddy, M.S., Dean, T.L.: Solving time-dependent planning problems. Tech. Rep. CS-89-03, Brown University, Department of Computer Science, Providence, RI, USA (1989)"},{"issue":"11","key":"417_CR11","doi-asserted-by":"publisher","first-page":"2157","DOI":"10.1007\/s00500-010-0644-5","volume":"15","author":"J Brest","year":"2011","unstructured":"Brest, J., Mau\u010dec, M.S.: Self-adaptive differential evolution algorithm using population size reduction and three strategies. Spacecom 15(11), 2157\u20132174 (2011). doi: 10.1007\/s00500-010-0644-5","journal-title":"Spacecom"},{"issue":"3","key":"417_CR12","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s10898-009-9493-0","volume":"48","author":"EF Campana","year":"2010","unstructured":"Campana, E.F., Fasano, G., Pinto, A.: Dynamic analysis for the selection of parameters and initial population, in particle swarm optimization. J. Glob. Optim. 48(3), 347\u2013397 (2010). doi: 10.1007\/s10898-009-9493-0","journal-title":"J. Glob. Optim."},{"issue":"2","key":"417_CR13","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s10898-007-9138-0","volume":"39","author":"D Chen","year":"2007","unstructured":"Chen, D., Lee, C., Park, C., Mendes, P.: Parallelizing simulated annealing algorithms based on high-performance computer. J. Glob. Optim. 39(2), 261\u2013289 (2007). doi: 10.1007\/s10898-007-9138-0","journal-title":"J. Glob. Optim."},{"key":"417_CR14","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.tcs.2011.02.016","volume":"436","author":"T Chen","year":"2012","unstructured":"Chen, T., Tang, K., Chen, G., Yao, X.: A large population size can be unhelpful in evolutionary algorithms. Theor. Comput. Sci. 436, 54\u201370 (2012). doi: 10.1016\/j.tcs.2011.02.016","journal-title":"Theor. Comput. Sci."},{"key":"417_CR15","doi-asserted-by":"publisher","unstructured":"Chen, W., Weise, T., Yang, Z., Tang, K.: Large-scale global optimization using cooperative coevolution with variable interaction learning. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) Proceedings of the 11th International Conference on Parallel Problem Solving From Nature, Part 2 (PPSN\u201910-2), Springer-Verlag GmbH, Berlin, Germany. Lecture Notes in Computer Science (LNCS), vol. 6239, pp. 300\u2013309 (2010). doi: 10.1007\/978-3-642-15871-1_31","DOI":"10.1007\/978-3-642-15871-1_31"},{"key":"417_CR16","doi-asserted-by":"publisher","unstructured":"Costa, J.C., Tavares, R., Da Rosa, A.C.: An experimental study on dynamic random variation of population size. In: IEEE International Conference on Systems, Man, and Cybernetics - Human Communication and Cybernetics (SMC\u201999), IEEE Computer Society, Piscataway, NJ, USA (1999). doi: 10.1109\/ICSMC.1999.814161","DOI":"10.1109\/ICSMC.1999.814161"},{"key":"417_CR17","volume-title":"Evolutionary Computation: A Unified Approach, Bradford Books","author":"KA Jong De","year":"2006","unstructured":"De Jong, K.A.: Evolutionary Computation: A Unified Approach, Bradford Books, vol. 4. MIT Press, Cambridge (2006)"},{"issue":"3","key":"417_CR18","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1162\/EVCO_a_00054","volume":"20","author":"A Devert","year":"2012","unstructured":"Devert, A., Weise, T., Tang, K.: A study on scalable representations for evolutionary optimization of ground structures. Evol. Comput. 20(3), 453\u2013472 (2012). doi: 10.1162\/EVCO_a_00054","journal-title":"Evol. Comput."},{"key":"417_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.10.035","author":"B Doerr","year":"2010","unstructured":"Doerr, B., Happ, E., Klein, C.: Crossover can provably be useful in evolutionary computation. Theor. Comput. Sci. (2010). doi: 10.1016\/j.tcs.2010.10.035","journal-title":"Theor. Comput. Sci."},{"key":"417_CR20","doi-asserted-by":"publisher","unstructured":"Eiben \u00c1E, Marchiori, E., Valk\u00f3, V.A.: Evolutionary algorithms with on-the-fly population size adjustment. In: Yao, X., Burke, E.K., Lozano, J.A., Smith, J., Merelo-Guerv\u00f3s, J.J., Bullinaria JA, Rowe, J.E., Ti\u00f1o, P., Kab\u00e1n, A., Schwefel, H. (eds.) Proceedings of the 8th International Conference on Parallel Problem Solving from Nature (PPSN VIII), Springer-Verlag GmbH, Berlin, Germany. Lecture Notes in Computer Science (LNCS), vol. 3242\/2004, pp. 41\u201350 (2008). doi: 10.1007\/978-3-540-30217-9_5","DOI":"10.1007\/978-3-540-30217-9_5"},{"key":"417_CR21","doi-asserted-by":"publisher","unstructured":"Fernandes, C., Da Rosa, A.C.: Self-regulated population size in evolutionary algorithms. In: Runarsson, T.P., Beyer, H., Burke, E.K., Merelo-Guerv\u00f3s, J.J., Whitley, L.D., Yao, X. (eds.) Proceedings of 9th International Conference on Parallel Problem Solving from Nature (PPSN IX), Springer-Verlag GmbH, Berlin, Germany. Lecture Notes in Computer Science (LNCS), vol. 4193\/2006, pp. 920\u2013929 (2006). doi: 10.1007\/11844297_93","DOI":"10.1007\/11844297_93"},{"key":"417_CR22","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1006\/jagm.1995.1018","volume":"18","author":"M Fredman","year":"1995","unstructured":"Fredman, M., Johnson, D., McGeoch, L., Ostheimer, G.: Data structures for traveling salesman. J. Algorithms 18, 432\u2013479 (1995). doi: 10.1006\/jagm.1995.1018","journal-title":"J. Algorithms"},{"key":"417_CR23","unstructured":"Gao, Y.: Population size and sampling complexity in genetic algorithms. Tech. rep., University of Alberta, Department of Computer Science, Edmonton, Alberta, Canada (2003)"},{"issue":"3","key":"417_CR24","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"FW Glover","year":"1989","unstructured":"Glover, F.W.: Tabu search\u2014part I. ORSA J. Comput. 1(3), 190\u2013206 (1989). doi: 10.1287\/ijoc.1.3.190","journal-title":"ORSA J. Comput."},{"issue":"1","key":"417_CR25","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"FW Glover","year":"1990","unstructured":"Glover, F.W.: Tabu search\u2014part II. ORSA J. Comput. 2(1), 190\u2013206 (1990). doi: 10.1287\/ijoc.2.1.4","journal-title":"ORSA J. Comput."},{"key":"417_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-32444-5","volume-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley Longman Publishing Co. Inc, Boston (1989). doi: 10.1007\/3-540-32444-5"},{"key":"417_CR27","unstructured":"Goldberg, D.E., Richardson, J.T.: Genetic algorithms with sharing for multimodal function optimization. In: Grefenstette, J.J. (ed.) Proceedings of the Second International Conference on Genetic Algorithms and their Applications (ICGA\u201987), pp. 41\u201349. Lawrence Erlbaum Associates Inc, Mahwah, NJ, USA (1987)"},{"key":"417_CR28","unstructured":"Gotshall, S., Rylander, B.: Optimal population size and the genetic algorithm. In: Proceedings of the 2002 WSEAS International Conferences: 2nd IMCCAS; 2nd ISA; 2nd SOSM; 4th MEM, World Scientific and Engineering Academy and Society (WSEAS), pp. 2151\u20132155. Greece, Athens (2002)"},{"key":"417_CR29","doi-asserted-by":"publisher","unstructured":"Gutin, G.Z., Punnen, A.P. (eds.): The Traveling Salesman Problem and its Variations, Combinatorial Optimization, vol. 12. Kluwer Academic Publishers, Norwell (2002). doi: 10.1007\/b101971","DOI":"10.1007\/b101971"},{"issue":"4","key":"417_CR30","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1007\/s00180-010-0197-1","volume":"25","author":"JW Hallam","year":"2010","unstructured":"Hallam, J.W., Akman, O., Akman, F.: Genetic algorithms with shrinking population size. Comput. Stat. 25(4), 691\u2013705 (2010). doi: 10.1007\/s00180-010-0197-1","journal-title":"Comput. Stat."},{"key":"417_CR31","unstructured":"Hansen, N., Auger, A., Finck, S., Ros, R.: Real-parameter black-box optimization benchmarking: experimental setup. Tech. rep., Universit\u00e9 Paris Sud, Institut National de Recherche en Informatique et en Automatique (INRIA) Futurs, \u00c9quipe TAO, Orsay, France (2012)"},{"key":"417_CR32","unstructured":"Harik, G.R.: Learning gene linkage to efficiently solve problems of bounded difficulty using genetic algorithms. PhD thesis, University of Michigan, Ann Arbor, MI, USA (1997)"},{"issue":"5","key":"417_CR33","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1109\/TEVC.2002.800886","volume":"6","author":"J He","year":"2002","unstructured":"He, J., Yao, X.: From an individual to a population: an analysis of the first hitting time of population-based evolutionary algorithms. IEEE Trans. Evol. Comput. 6(5), 495\u2013511 (2002). doi: 10.1109\/TEVC.2002.800886","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2\u20133","key":"417_CR34","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s12532-009-0004-6","volume":"1","author":"K Helsgaun","year":"2009","unstructured":"Helsgaun, K.: General k-opt submoves for the Lin\u2013Kernighan TSP heuristic. Math. Program. Comput. 1(2\u20133), 119\u2013163 (2009). doi: 10.1007\/s12532-009-0004-6","journal-title":"Math. Program. Comput."},{"key":"417_CR35","doi-asserted-by":"publisher","unstructured":"Hidalgo, J.I.: Balancing the computation effort in genetic algorithms. In: Corne, D.W., Michalewicz Z, McKay, R.I., Eiben \u00c1E, Fogel, D.B., Fonseca, C.M., Raidl, G.R., Tan, K.C., Zalzala AMS (eds.) Proceedings of the IEEE Congress on Evolutionary Computation (CEC\u201905), IEEE Computer Society, Piscataway, NJ, USA, pp. 1645\u20131652 (2005). doi: 10.1109\/CEC.2005.1554886","DOI":"10.1109\/CEC.2005.1554886"},{"key":"417_CR36","volume-title":"Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence","author":"JH Holland","year":"1975","unstructured":"Holland, J.H.: Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. University of Michigan Press, Ann Arbor (1975)"},{"key":"417_CR37","unstructured":"Hoos, H.H., St\u00fctzle, T.: Evaluating las vegas algorithms: pitfalls and remedies. In: Cooper, G.F., Moral, S. (eds.) Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence (UAI\u201998), Morgan Kaufmann Publishers Inc., San Francisco, C.A., USA, pp. 238\u2013245, also published as Technical Report \u201cForschungsbericht AIDA-98-02\u201c of the Fachgebiet Intellektik, Fachbereich Informatik, Technische Hochschule Darmstadt, Germany (1998)"},{"key":"417_CR38","doi-asserted-by":"publisher","unstructured":"Hu, T., Banzhaf, W.: Nonsynonymous to synonymous substitution ratio $$k_a\/k_s$$ k a \/ k s : measurement for rate of evolution in evolutionary computation. In: Proceedings of 10th International Conference on Parallel Problem Solving from Nature (PPSN X), Springer-Verlag GmbH, Berlin, Germany. Lecture Notes in Computer Science (LNCS), vol. 5199\/2008, pp. 448\u2013457 (2008). doi: 10.1007\/978-3-540-87700-4_45","DOI":"10.1007\/978-3-540-87700-4_45"},{"key":"417_CR39","doi-asserted-by":"crossref","unstructured":"Hu, T., Banzhaf, W.: The role of population size in rate of evolution in genetic programming. In: Vanneschi, L., Gustafson, S.M., Moraglio, A., de Falco, I., Ebner, M. (eds.) Proceedings of the 12th European Conference on Genetic Programming (EuroGP\u201909), Springer-Verlag GmbH, Berlin, Germany. Lecture Notes in Computer Science (LNCS), vol. 5481\/2009, pp. 85\u201396 (2009)","DOI":"10.1007\/978-3-642-01181-8_8"},{"issue":"2","key":"417_CR40","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/s10710-010-9105-2","volume":"11","author":"T Hu","year":"2010","unstructured":"Hu, T., Harding, S., Banzhaf, W.: Variable population size and evolution acceleration: a case study with a parallel evolutionary algorithm. Genet. Program. Evol. Mach. 11(2), 205\u2013225 (2010). doi: 10.1007\/s10710-010-9105-2","journal-title":"Genet. Program. Evol. Mach."},{"issue":"5","key":"417_CR41","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1109\/TEVC.2005.863127","volume":"10","author":"M Hutter","year":"2006","unstructured":"Hutter, M., Legg, S.: Fitness uniform optimization. IEEE Trans. Evol. Comput. 10(5), 568\u2013589 (2006). doi: 10.1109\/TEVC.2005.863127","journal-title":"IEEE Trans. Evol. Comput."},{"key":"417_CR42","doi-asserted-by":"publisher","unstructured":"J\u00e4gersk\u00fcpper, J., Storch, T.: When the plus strategy outperforms the comma strategy and when not. In: Mendel, J.M., Omari, T., Yao, X. (eds.) The First IEEE Symposium on Foundations of Computational Intelligence (FOCI\u201907), IEEE Computer Society, Piscataway, NJ, USA, pp. 25\u201332 (2007). doi: 10.1109\/FOCI.2007.372143","DOI":"10.1109\/FOCI.2007.372143"},{"key":"417_CR43","unstructured":"Jansen, T., Wegener, I.: On the utility of populations in evolutionary algorithms. In: Spector, L., Goodman, E.D., Wu, A.S., Langdon, W.B., Voigt, H., Gen, M., Sen, S., Dorigo, M., Pezeshk, S., Garzon, M.H., Burke, E.K. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference (GECCO\u201901), pp. 1034\u20131041. Morgan Kaufmann Publishers Inc, San Francisco, CA, USA (2001)"},{"issue":"4","key":"417_CR44","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1162\/106365605774666921","volume":"13","author":"T Jansen","year":"2005","unstructured":"Jansen, T., De Jong, K.A., Wegener, I.: On the choice of the offspring population size in evolutionary algorithms. Evol. Comput. 13(4), 413\u2013440 (2005). doi: 10.1162\/106365605774666921","journal-title":"Evol. Comput."},{"key":"417_CR45","doi-asserted-by":"publisher","unstructured":"Khor, E.F., Tan, K.C., Wang, M.L., Lee, T.H.: Evolutionary algorithm with dynamic population size for multi-objective optimization. In: Proceedings of the 26th Annual Confjerence of the IEEE Industrial Electronics Society (IECON\u201900), IEEE, IEEE Singapore Section, Singapore, pp. 2768\u20132773 (2000). doi: 10.1109\/IECON.2000.972436","DOI":"10.1109\/IECON.2000.972436"},{"issue":"4598","key":"417_CR46","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt Jr., C.D., Vecchi, M.P.: Optimization by simulated annealing. Sci. Mag. 220(4598), 671\u2013680 (1983). doi: 10.1126\/science.220.4598.671","journal-title":"Sci. Mag."},{"issue":"1","key":"417_CR47","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1109\/TEVC.2005.860765","volume":"10","author":"VK Koumousis","year":"2006","unstructured":"Koumousis, V.K., Katsaras, C.P.: A saw-tooth genetic algorithm combining the effects of variable population size and reinitialization to enhance performance. IEEE Trans. Evol. Comput. 10(1), 19\u201328 (2006). doi: 10.1109\/TEVC.2005.860765","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"417_CR48","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1023\/A:1006529012972","volume":"13","author":"P Larra\u00f1aga","year":"1999","unstructured":"Larra\u00f1aga, P., Kuijpers, C.M.H., Murga, R.H., Inza, I., Dizdarevic, S.: Genetic algorithms for the travelling salesman problem: a review of representations and operators. J. Artif. Intell. Res. 13(2), 129\u2013170 (1999). doi: 10.1023\/A:1006529012972","journal-title":"J. Artif. Intell. Res."},{"key":"417_CR49","unstructured":"Lawler, E.L.G., Lenstra, J.K., Kan, A.H.G.R., Shmoys, D.B.: The traveling salesman problem: a guided tour of combinatorial optimization. Estimation, Simulation, and Control\u2014Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley Interscience, Chichester (1985)"},{"issue":"2","key":"417_CR50","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1162\/EVCO_a_00025","volume":"19","author":"J Lehman","year":"2011","unstructured":"Lehman, J., Stanley, K.O.: Abandoning objectives: evolution through the search for novelty alone. Evol. Comput. 19(2), 189\u2013223 (2011). doi: 10.1162\/EVCO_a_00025","journal-title":"Evol. Comput."},{"key":"417_CR51","doi-asserted-by":"publisher","unstructured":"Li, D., Wang, L.: A study on the optimal population size of genetic algorithm. In: Proceedings of Fourth World Congress on Intelligent Control and Automation, vol. 4 (WCICA\u201902), IEEE, IEEE Singapore Section, Singapore, pp. 3019\u20133021 (2002). doi: 10.1109\/WCICA.2002.1020082 (in Chinese)","DOI":"10.1109\/WCICA.2002.1020082"},{"issue":"3","key":"417_CR52","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s10898-010-9643-4","volume":"51","author":"W Li","year":"2011","unstructured":"Li, W.: Seeking global edges for traveling salesman problem in multi-start search. J. Glob. Optim. 51(3), 515\u2013540 (2011). doi: 10.1007\/s10898-010-9643-4","journal-title":"J. Glob. Optim."},{"key":"417_CR53","doi-asserted-by":"publisher","unstructured":"Lin, J., Chen, Y.: On the effect of population size and selection mechanism from the viewpoint of collaboration between exploration and exploitation. In: Proceedings of the 2013 IEEE Workshop on Memetic Computing (MC), 2013 IEEE Symposium Series on Computational Intelligence (SSCI\u201913), IEEE Computer Society Press, Los Alamitos, CA, USA, pp. 16\u201323 (2013). doi: 10.1109\/MC.2013.6608202","DOI":"10.1109\/MC.2013.6608202"},{"issue":"2","key":"417_CR54","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21(2), 498\u2013516 (1973). doi: 10.1287\/opre.21.2.498","journal-title":"Oper. Res."},{"key":"417_CR55","doi-asserted-by":"crossref","unstructured":"Liu, W., Weise, T., Wu, Y., Chiong, R.: Hybrid ejection chain methods for the traveling salesman problem. In: Gong, M., Pan, L., Song, T., Tang K, Zhang, X. (eds.) The 10th International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA\u201915), Springer-Verlag GmbH, Berlin, Germany, Communications in Computer and Information Science, vol. 562, pp. 268\u2013282 (2015)","DOI":"10.1007\/978-3-662-49014-3_25"},{"key":"417_CR56","doi-asserted-by":"publisher","unstructured":"Lobo, F.G.: A review of adaptive population sizing schemes in genetic algorithms. In: Beyer, H., O\u2019Reilly, U., Arnold, D.V., Banzhaf, W., Blum, C., Bonabeau, E.W., Cant\u00fa-Paz, E., Dasgupta, D., Deb, K., Foster JA, de Jong, E.D., Lipson, H., Llor\u00e0, X., Mancoridis, S., Pelikan, M., Raidl, G.R., Soule, T., Watson, J., Zitzler, E. (eds.) Proceedings of Genetic and Evolutionary Computation Conference (GECCO\u201905), ACM Press, New York, NY, USA, pp. 228\u2013234 (2005). doi: 10.1145\/1102256.1102310","DOI":"10.1145\/1102256.1102310"},{"key":"417_CR57","doi-asserted-by":"publisher","unstructured":"Lu, H., Yen, G.G.: Dynamic population size in multiobjective evolutionary algorithms. In: Fogel, D.B., El-Sharkawi, M.A., Yao, X., Iba H, Marrow, P., Shackleton, M. (eds.) Proceedings of the IEEE Congress on Evolutionary Computation (CEC\u201902), 2002 IEEE World Congress on Computation Intelligence (WCCI\u201902), IEEE Computer Society Press, Los Alamitos, CA, USA, vol. 1\u20132, pp. 1648\u20131653 (2002). doi: 10.1109\/CEC.2002.1004489","DOI":"10.1109\/CEC.2002.1004489"},{"issue":"2","key":"417_CR58","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1109\/TSMCC.2004.841914","volume":"35","author":"Q Lu","year":"2005","unstructured":"Lu, Q., Yao, X.: Clustering and learning gaussian distribution for continuous optimization. IEEE Trans. Syst. Man Cybern. Part C Appl. Rev. 35(2), 195\u2013204 (2005). doi: 10.1109\/TSMCC.2004.841914","journal-title":"IEEE Trans. Syst. Man Cybern. Part C Appl. Rev."},{"issue":"3","key":"417_CR59","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s10898-006-9056-6","volume":"37","author":"H Maaranen","year":"2007","unstructured":"Maaranen, H., Miettinen, K., Penttinen, A.: On initial populations of a genetic algorithm for continuous optimization problems. J. Glob. Optim. 37(3), 405\u2013436 (2007). doi: 10.1007\/s10898-006-9056-6","journal-title":"J. Glob. Optim."},{"issue":"4","key":"417_CR60","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/s10898-006-9094-0","volume":"38","author":"Y Marinakis","year":"2007","unstructured":"Marinakis, Y., Migdalas, A., Pardalos, P.M.: A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm. J. Glob. Optim. 38(4), 555\u2013580 (2007). doi: 10.1007\/s10898-006-9094-0","journal-title":"J. Glob. Optim."},{"key":"417_CR61","doi-asserted-by":"publisher","unstructured":"Minetti, G.F., Alfonso, H.A.: Variable size population in parallel evolutionary algorithms. In: Kwa\u015bnicka, H., Paprzycki, M. (eds.) Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (ISDA\u201905), IEEE Computer Society Press, Los Alamitos, CA, USA, pp. 350\u2013355 (2005). doi: 10.1109\/ISDA.2005.99","DOI":"10.1109\/ISDA.2005.99"},{"key":"417_CR62","unstructured":"Osterman, C., Rego, C.: The satellite list and new data structures for traveling salesman problems. Working Paper Series HCES-06-03, University of Mississippi, School of Business Administration, Hearin Center for Enterprise Science, University, MS, USA, (2006). http:\/\/www.akira.ruc.dk\/keld\/teaching\/algoritmedesign_f08\/Artikler\/02\/Osterman03"},{"key":"417_CR63","doi-asserted-by":"publisher","unstructured":"Ouyang, J., Weise, T., Devert, A., Chiong, R.: Sdgp: A developmental approach for traveling salesman problems. In: Proceedings of the 2013 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS\u201913), IEEE Computer Society Press, Los Alamitos, CA, USA, pp. 78\u201385 (2013). doi: 10.1109\/CIPLS.2013.6595203","DOI":"10.1109\/CIPLS.2013.6595203"},{"key":"417_CR64","doi-asserted-by":"crossref","unstructured":"Palmer, C.C., Kershenbaum, A.: Representing trees in genetic algorithms. In: Michalewicz, Z., Schaffer, J.D., Schwefel, H., Fogel, D.B., Kitano, H. (eds.) Proceedings of the First IEEE Conference on Evolutionary Computation (CEC\u201994), IEEE Computer Society, Piscataway, NJ, USA, vol. 1, pp. 379\u2013384 (1994)","DOI":"10.1109\/ICEC.1994.349921"},{"key":"417_CR65","doi-asserted-by":"publisher","unstructured":"P\u00e9trowski, A.: A clearing procedure as a niching method for genetic algorithms. In: Jid\u014d, K., Gakkai, S. (eds.) Proceedings of IEEE International Conference on Evolutionary Computation (CEC\u201996), IEEE Computer Society Press, Los Alamitos, CA, USA, pp. 798\u2013803 (1996). doi: 10.1109\/ICEC.1996.542703","DOI":"10.1109\/ICEC.1996.542703"},{"key":"417_CR66","doi-asserted-by":"publisher","unstructured":"Piszcz, A.T., Soule, T.: Genetic programming: optimal population sizes for varying complexity problems. In: Keijzer, M., Cattolico, M. (eds.) Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation (GECCO\u201906), ACM Press, New York, NY, USA, pp. 953\u2013954 (2006). doi: 10.1145\/1143997.1144166","DOI":"10.1145\/1143997.1144166"},{"issue":"1","key":"417_CR67","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1162\/106365600568086","volume":"8","author":"MA Potter","year":"2000","unstructured":"Potter, M.A., De Jong, K.A.: Cooperative coevolution: an architecture for evolving coadapted subcomponents. Evol. Comput. 8(1), 1\u201329 (2000). doi: 10.1162\/106365600568086","journal-title":"Evol. Comput."},{"key":"417_CR68","doi-asserted-by":"publisher","unstructured":"Poursoltan, S., Neumann, F.: Ruggedness quantifying for constrained continuous fitness landscapes. In: Datta, R., Deb, K. (eds.) Evolutionary Constrained Optimization, Infosys Science Foundation Series, chap 2. Springer, India, pp. 29\u201350 (2015). doi: 10.1007\/978-81-322-2184-5_2","DOI":"10.1007\/978-81-322-2184-5_2"},{"issue":"4","key":"417_CR69","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/BF01531276","volume":"10","author":"NJ Radcliffe","year":"1994","unstructured":"Radcliffe, N.J.: The algebra of genetic algorithms. Ann. Math. Artif. Intell. 10(4), 339\u2013384 (1994). doi: 10.1007\/BF01531276","journal-title":"Ann. Math. Artif. Intell."},{"key":"417_CR70","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/j.ejor.2010.09.010","volume":"2011","author":"C Rego","year":"2011","unstructured":"Rego, C., Gamboa, D., Glover, F., Osterman, C.: Traveling salesman problem heuristics: leading methods, implementations and latest advances. Eur. J. Oper. Res. 2011, 427\u2013441 (2011). doi: 10.1016\/j.ejor.2010.09.010","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"417_CR71","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt, G.: TSPLIB\u2014a traveling salesman problem library. ORSA J. Comput. 3(4), 376\u2013384 (1991). doi: 10.1287\/ijoc.3.4.376","journal-title":"ORSA J. Comput."},{"issue":"1","key":"417_CR72","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s10898-012-9860-0","volume":"56","author":"MC Robini","year":"2013","unstructured":"Robini, M.C., Reissman, P.: From simulated annealing to stochastic continuation: a new trend in combinatorial optimization. J. Glob. Optim. 56(1), 185\u2013215 (2013). doi: 10.1007\/s10898-012-9860-0","journal-title":"J. Glob. Optim."},{"key":"417_CR73","unstructured":"Roeva, O., Fidanova, S., Paprzycki, M.: Influence of the population size on the genetic algorithm performance in case of cultivation process modelling. In: Ganzha, M., Maciaszek, L., Paprzycki, M. (eds.) Proceedings of the 2013 Federated Conference on Computer Science and Information Systems (FedCSIS\u201913), pp. 371\u2013376. IEEE, IEEE Singapore Section, Singapore (2013)"},{"key":"417_CR74","doi-asserted-by":"publisher","unstructured":"Ronald, S.: Robust encodings in genetic algorithms: a survey of encoding issues. In: B\u00e4ck, T., Michalewicz, Z., Yao, X. (eds.) IEEE International Conference on Evolutionary Computation (CEC\u201997), IEEE Computer Society, Piscataway, NJ, USA, pp. 43\u201348 (1997). doi: 10.1109\/ICEC.1997.592265","DOI":"10.1109\/ICEC.1997.592265"},{"key":"417_CR75","volume-title":"Representations for Genetic and Evolutionary Algorithms, Studies in Fuzziness and Soft Computing,","author":"F Rothlauf","year":"2006","unstructured":"Rothlauf, F.: Representations for Genetic and Evolutionary Algorithms, Studies in Fuzziness and Soft Computing, vol. 104, 2nd edn. Springer, Heidelberg (2006)","edition":"2"},{"key":"417_CR76","doi-asserted-by":"publisher","unstructured":"Rowe, J.E., Sudholt, D.: The choice of the offspring population size in the (1, $$\\lambda $$ \u03bb ) ea. In: Soule, T., Moore, J.H. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference (GECCO\u201912), ACM, New York, NY, USA, pp. 1349\u20131356 (2012). doi: 10.1145\/2330163.2330350","DOI":"10.1145\/2330163.2330350"},{"issue":"4","key":"417_CR77","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1109\/4235.942534","volume":"5","author":"G Rudolph","year":"2001","unstructured":"Rudolph, G.: Self-adaptive mutations may lead to premature convergence. IEEE Trans. Evol. Comput. 5(4), 410\u2013414 (2001). doi: 10.1109\/4235.942534","journal-title":"IEEE Trans. Evol. Comput."},{"key":"417_CR78","doi-asserted-by":"publisher","unstructured":"Sarker, R.A., Kazi, M.F.A.: Population size, search space and quality of solution: an experimental study. In: Sarker, R.A., Reynolds, R.G., Abbass Amein, H.A., Tan, K.C., McKay, R.I., Essam, D.L., Gedeon, T. (eds.) Proceedings of the IEEE Congress on Evolutionary Computation (CEC\u201903), IEEE Computer Society, Piscataway, NJ, USA, pp. 2011\u20132018 (2003). doi: 10.1109\/CEC.2003.1299920","DOI":"10.1109\/CEC.2003.1299920"},{"issue":"1","key":"417_CR79","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s10898-003-6454-x","volume":"31","author":"JF Schutte","year":"2005","unstructured":"Schutte, J.F., Groenwold, A.A.: A study of global optimization using particle swarms. J. Glob. Optim. 31(1), 93\u2013108 (2005). doi: 10.1007\/s10898-003-6454-x","journal-title":"J. Glob. Optim."},{"key":"417_CR80","volume-title":"Hierarchical Strategy Learning for FLUX Agents: An Applied Technique","author":"H Skubch","year":"2006","unstructured":"Skubch, H.: Hierarchical Strategy Learning for FLUX Agents: An Applied Technique. VDM Verlag Dr. M\u00fcller AG und Co, KG, Saarbr\u00fccken (2006)"},{"key":"417_CR81","doi-asserted-by":"crossref","unstructured":"Storch, T.: On the choice of the population size. In: Deb, K., Poli, R., Banzhaf, W., Beyer, H., Burke, E.K., Darwen, P.J., Dasgupta, D., Floreano, D., Foster, J.A., Harman, M., Holland, O.E., Lanzi, P.L., Spector, L., Tettamanzi, A.G.B., Thierens, D. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference, Part I (GECCO\u201904), Springer-Verlag GmbH, Berlin, Germany. Lecture Notes in Computer Science (LNCS), vol. 3102\/2004, pp. 748\u2013760 (2004)","DOI":"10.1007\/978-3-540-24854-5_76"},{"issue":"4","key":"417_CR82","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1162\/evco.2008.16.4.557","volume":"16","author":"T Storch","year":"2008","unstructured":"Storch, T.: On the choice of the parent population size. Evol. Comput. 16(4), 557\u2013578 (2008). doi: 10.1162\/evco.2008.16.4.557","journal-title":"Evol. Comput."},{"key":"417_CR83","doi-asserted-by":"publisher","unstructured":"Tompkins, D.A.D., Hoos, H.H.: Ubcsat: An implementation and experimentation environment for SLS algorithms for SAT and MAX-SAT. In: Hoos, H.H., Mitchell, D.G. (eds.) Revised Selected Papers from the Seventh International Conference on Theory and Applications of Satisfiability Testing (SAT\u201904), Springer-Verlag GmbH, Berlin, Germany, Lecture Notes in Computer Science (LNCS), vol. 3542, pp. 306\u2013320 (2004). doi: 10.1007\/11527695_24","DOI":"10.1007\/11527695_24"},{"issue":"3","key":"417_CR84","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/s10898-009-9503-2","volume":"48","author":"A Vincenti","year":"2010","unstructured":"Vincenti, A., Ahmadian, M.R., Vannucci, P.: BIANCA: a genetic algorithm to solve hard combinatorial optimisation problems in engineering. J. Glob. Optim. 48(3), 399\u2013421 (2010). doi: 10.1007\/s10898-009-9503-2","journal-title":"J. Glob. Optim."},{"key":"417_CR85","unstructured":"Weise, T.: Global Optimization Algorithms\u2014Theory and Application. it-weise.de (self-published), Germany (2009)"},{"key":"417_CR86","doi-asserted-by":"publisher","unstructured":"Weise, T., Zapf, M., Chiong, R., Nebro Urbaneja, A.J.: Why is optimization difficult? In: Chiong, R. (ed.) Nature-Inspired Algorithms for Optimisation, Studies in Computational Intelligence, vol. 193, chap 1. Springer-Verlag, Berlin\/Heidelberg, pp. 1\u201350 (2009). doi: 10.1007\/978-3-642-00267-0_1","DOI":"10.1007\/978-3-642-00267-0_1"},{"key":"417_CR87","doi-asserted-by":"publisher","unstructured":"Weise, T., Niemczyk, S., Chiong, R., Wan, M.: A framework for multi-model edas with model recombination. In: Applications of Evolutionary Computation. Proceedings of EvoApplications 2011: EvoCOMPLEX, EvoGAMES, EvoIASP, EvoINTELLIGENCE, EvoNUM, and EvoSTOC, Part 1 (EvoAPPLICATIONS\u201911), Springer-Verlag GmbH, Berlin, Germany. Lecture Notes in Computer Science (LNCS), vol. 6624, pp. 304\u2013313 (2011). doi: 10.1007\/978-3-642-20525-5_31","DOI":"10.1007\/978-3-642-20525-5_31"},{"issue":"5","key":"417_CR88","doi-asserted-by":"publisher","first-page":"907","DOI":"10.1007\/s11390-012-1274-4","volume":"27","author":"T Weise","year":"2012","unstructured":"Weise, T., Chiong, R., Tang, K.: Evolutionary optimization: pitfalls and booby traps. J. Comput. Sci. Technol. 27(5), 907\u2013936 (2012). doi: 10.1007\/s11390-012-1274-4","journal-title":"J. Comput. Sci. Technol."},{"key":"417_CR89","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1109\/TEVC.2013.2251885","volume":"18","author":"T Weise","year":"2013","unstructured":"Weise, T., Wan, M., Tang, K., Wang, P., Devert, A., Yao, X.: Frequency fitness assignment. IEEE Trans. Evol. Comput. 18, 226\u2013243 (2013). doi: 10.1109\/TEVC.2013.2251885","journal-title":"IEEE Trans. Evol. Comput."},{"key":"417_CR90","doi-asserted-by":"publisher","unstructured":"Weise, T., Chiong, R., Tang, K., L\u00e4ssig, J., Tsutsui, S., Chen, W., Michalewicz, Z., Yao, X.: Benchmarking optimization algorithms: an open source framework for the traveling salesman problem. IEEE Comput. Intell. Mag. 9(3):40\u201352 (2014). doi: 10.1109\/MCI.2014.2326101 , featured article and selected paper at the website of the IEEE Computational Intelligence Society ( http:\/\/cis.ieee.org\/ )","DOI":"10.1109\/MCI.2014.2326101"},{"key":"417_CR91","unstructured":"Whitley, L.D.: A genetic algorithm tutorial. Tech. Rep. CS-93-103, Colorado State University, Computer Science Department, Fort Collins, CO, USA (1993)"},{"issue":"2","key":"417_CR92","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF00175354","volume":"4","author":"LD Whitley","year":"1994","unstructured":"Whitley, L.D.: A genetic algorithm tutorial. Stat. Comput. 4(2), 65\u201385 (1994). doi: 10.1007\/BF00175354","journal-title":"Stat. Comput."},{"key":"417_CR93","unstructured":"Whitley, L.D., Starkweather, T., Fuquay, D.: Scheduling problems and traveling salesman: the genetic edge recombination operator. In: Schaffer, J.D. (ed.) Proceedings of the Third International Conference on Genetic Algorithms (ICGA\u201989), pp. 133\u2013140. Morgan Kaufmann Publishers Inc, San Francisco, CA, USA (1989)"},{"key":"417_CR94","unstructured":"Witt, C.: Population size vs. runtime of a simple evolutionary algorithm. In: Reihe Computational Intelligence Collaborative Research Center 531: Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods CI-156\/03, University of Dortmund, Dept. of Computer Science\/XI, Secretary of the SFB 531, Dortmund, North Rhine-Westphalia, Germany (2003)"},{"issue":"1","key":"417_CR95","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.tcs.2008.05.011","volume":"403","author":"C Witt","year":"2008","unstructured":"Witt, C.: Population size versus runtime of a simple evolutionary algorithm. Theor. Comput. Sci. 403(1), 104\u2013120 (2008). doi: 10.1016\/j.tcs.2008.05.011","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"417_CR96","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert, D.H., Macready, W.G.: No free lunch theorems for optimization. IEEE Trans. Evol. Comput. 1(1), 67\u201382 (1997). doi: 10.1109\/4235.585893","journal-title":"IEEE Trans. Evol. Comput."},{"key":"417_CR97","doi-asserted-by":"crossref","unstructured":"Wu, Y., Weise, T., Chiong, R.: Local search for the traveling salesman problem: a comparative study. In: Ge, N., Lu, J., Wang, Y., Howard, N., Chen, P., Tao, X., Zhang, B., Zadeh, L.A. (eds.) 14th IEEE International Conference on Cognitive Informatics and Cognitive Computing (ICCI*CC\u201915), pp. 213\u2013220. IEEE, Piscataway, NJ, USA (2015)","DOI":"10.1109\/ICCI-CC.2015.7259388"},{"key":"417_CR98","doi-asserted-by":"crossref","unstructured":"Xu, D., Weise, T., Wu, Y., L\u00e4ssig, J., Chiong, R.: An investigation of hybrid tabu search for the traveling salesman problem. In: Gong M, Pan, L., Song, T., Tang, K., Zhang, X. (eds.) The 10th International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA\u201915), Springer-Verlag GmbH, Berlin, Germany, Communications in Computer and Information Science, vol. 562, pp. 523\u2013537 (2015)","DOI":"10.1007\/978-3-662-49014-3_47"},{"key":"417_CR99","doi-asserted-by":"publisher","unstructured":"Yao, X.: Unpacking and understanding evolutionary algorithms. In: Liu, J., Alippi, C., Bouchon-Meunier, B. (eds.) Advances in Computational Intelligence: Plenary\/Invited Lectures at the IEEE World Congress on Computational Intelligence (WCCI\u201912), Springer-Verlag GmbH, Berlin, Germany. Lecture Notes in Computer Science (LNCS), pp. 60\u201376 (2012). doi: 10.1007\/978-3-642-30687-7_4","DOI":"10.1007\/978-3-642-30687-7_4"},{"key":"417_CR100","unstructured":"Zhang, J., Yuan, X., Buckles, B.P.: Multimodal function optimization using local ruggedness information. In: Barr, V., Markov, Z. (eds.) Proceedings of the Seventeenth International Florida Artificial Intelligence Research Society Conference (FLAIRS 17), pp. 380\u2013386. AAAI Press, Menlo Park, CA, USA (2004)"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-016-0417-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-016-0417-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-016-0417-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-016-0417-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,15]],"date-time":"2020-09-15T23:56:03Z","timestamp":1600214163000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-016-0417-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,23]]},"references-count":100,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,11]]}},"alternative-id":["417"],"URL":"https:\/\/doi.org\/10.1007\/s10898-016-0417-5","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,2,23]]}}}