{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T05:25:11Z","timestamp":1740029111104,"version":"3.37.3"},"reference-count":139,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,4,22]],"date-time":"2010-04-22T00:00:00Z","timestamp":1271894400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cogn Comput"],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1007\/s12559-010-9039-2","type":"journal-article","created":{"date-parts":[[2010,4,21]],"date-time":"2010-04-21T15:38:34Z","timestamp":1271864314000},"page":"97-119","source":"Crossref","is-referenced-by-count":10,"title":["On Natural Based Optimization"],"prefix":"10.1007","volume":"2","author":[{"given":"Amin","family":"Nobakhti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,4,22]]},"reference":[{"key":"9039_CR1","volume-title":"Genetic algorithms in search, optimisation and machine learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg DE. Genetic algorithms in search, optimisation and machine learning. Harlow: Addidon-Wesley; 1989."},{"key":"9039_CR2","volume-title":"Foundations of optimization","author":"CS Beightler","year":"1979","unstructured":"Beightler CS, Philips DT, Wilde DJ. Foundations of optimization. Englewood Cliffs: Prentice-Hall; 1979."},{"key":"9039_CR3","volume-title":"Numerical optimisation for computer models","author":"HP Schwefel","year":"1981","unstructured":"Schwefel HP. Numerical optimisation for computer models. Chichester: Wiley; 1981."},{"key":"9039_CR4","doi-asserted-by":"crossref","DOI":"10.1515\/9781400874668","volume-title":"Adaptive control processes: a guided tour","author":"R Bellman","year":"1961","unstructured":"Bellman R. Adaptive control processes: a guided tour. Princeton: Princeton University Press; 1961."},{"key":"9039_CR5","volume-title":"Computer methods for mathematical computations","author":"GE Forsythe","year":"1976","unstructured":"Forsythe GE, Malcolm MA, Moler CB. Computer methods for mathematical computations. Englewood Cliffs: Prentice Hall; 1976."},{"issue":"11","key":"9039_CR6","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0895-7177(93)90204-C","volume":"18","author":"LA Ingber","year":"1993","unstructured":"Ingber LA. Simulated annealing: practice versus theory. J Math Comput Model. 1993;18(11):29\u201357.","journal-title":"J Math Comput Model"},{"issue":"6","key":"9039_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0898-1221(94)00147-2","volume":"28","author":"R Battiti","year":"1984","unstructured":"Battiti R, Tecchiolli G. Simulated annealing and tabu search in the long run: a comparison on qap tasks. Comput Math Appl. 1984;28(6):1\u20138.","journal-title":"Comput Math Appl"},{"key":"9039_CR8","doi-asserted-by":"crossref","unstructured":"Vujcic VVK, Cangalovic MM. Tabu search methodology in global optimisation. Comput Math Appl. 1999;37(5):125\u201333.","DOI":"10.1016\/S0898-1221(99)00064-4"},{"key":"9039_CR9","unstructured":"Paulli J. Information utilization in simulated annealing and tabu search. COAL Bull. 1993;22:28\u201334."},{"key":"9039_CR10","unstructured":"Haykin S. Neural networks a comprehensive foundation. Englewood Cliffs: Prentice Hall; 1994."},{"key":"9039_CR11","doi-asserted-by":"crossref","unstructured":"Fogel DB. An overview of evolutionary programming. In: Evolutionary algorithms. Berlin: Springer; 1999. p. 89\u2013109.","DOI":"10.1007\/978-1-4612-1542-4_5"},{"key":"9039_CR12","volume-title":"The genetic basis of evolutionary change","author":"RC Lewontin","year":"1974","unstructured":"Lewontin RC. The genetic basis of evolutionary change. NY: Columbia University Press; 1974."},{"key":"9039_CR13","unstructured":"Atmar JW. On the rules and nature of simulated evolutionary programming. In: Proceedings of the first annual conference on evolutionary programming. 1992."},{"key":"9039_CR14","unstructured":"Mayr E. The evolution of life. In: Tax S, Callender C, editors. Evolution after Darwin: issues in evolution, vol. 3. USA: University of Chicago Press; 1960."},{"key":"9039_CR15","volume-title":"Principles of population genetics","author":"DL Hartl","year":"1989","unstructured":"Hartl DL, Clark AG. Principles of population genetics. Sunderland: Sinauer; 1989."},{"key":"9039_CR16","volume-title":"Towards a new philosophy of biology: observations of an evolutionist","author":"E Mayr","year":"1988","unstructured":"Mayr E. Towards a new philosophy of biology: observations of an evolutionist. Cambridge: The Belknap Press of Harvard University Press; 1988."},{"key":"9039_CR17","unstructured":"Bremermann HJ. The evolution of intelligence. The nervous system as a model of its environment. Technical report, Department of Mathematics, University of Washington, Seattle, July; 1958."},{"key":"9039_CR18","volume-title":"Adaptation in natural and artificial systems","author":"JH Holland","year":"1975","unstructured":"Holland JH. Adaptation in natural and artificial systems. Ann Arbor: The University of Michigan Press; 1975."},{"key":"9039_CR19","doi-asserted-by":"crossref","unstructured":"Reeves CR, Wright CC. Evolutionary algorithms, In: Genetic algorithms and the design of experiments. Berlin: Springer; 1999. p. 207\u201327.","DOI":"10.1007\/978-1-4612-1542-4_12"},{"key":"9039_CR20","doi-asserted-by":"crossref","unstructured":"Vose MD. Evolutionary algorithms. In: What are genetic algorithms? A mathematical perspective. USA: Springer; 1999. p. 251\u201376.","DOI":"10.1007\/978-1-4612-1542-4_14"},{"issue":"1","key":"9039_CR21","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert DH, Macready WG. No free lunch theorem for optimization. IEEE Trans Evol Comput. 1997;1(1):67\u201382.","journal-title":"IEEE Trans Evol Comput"},{"key":"9039_CR22","unstructured":"Droste S, Jansen T, Wegener I. Perhaps not a free lunch but at least a free appetizer. Technical report ISSN 1433-3325, Reihe computational intelligence collaborative research center 531, University of Dortmund; 1998."},{"key":"9039_CR23","doi-asserted-by":"crossref","unstructured":"Corne DW, Joshua DK. No free lunch and free leftovers theorems for multiobjective optimisation problems. 2003.","DOI":"10.1007\/3-540-36970-8_23"},{"key":"9039_CR24","doi-asserted-by":"crossref","unstructured":"Grefenstette JJ. Deception considered harmful. In: Whitley LD, editor. Foundations of genetic algorithms 2. 1993.","DOI":"10.21236\/ADA294072"},{"key":"9039_CR25","doi-asserted-by":"crossref","unstructured":"Fogel DB, Ghozeil A. Schema processing under proportional selection in the presence of random effects. IEEE Trans Evol Comput. 1997;1(4).","DOI":"10.1109\/4235.687889"},{"key":"9039_CR26","doi-asserted-by":"crossref","unstructured":"Poli R. Why the schema theorem is correct also in the presence of stochastic ffects. In: Proceedings of the 2002 congress on evolutionary computation, vol. 1. 2000. p. 487\u201392.","DOI":"10.1109\/CEC.2000.870336"},{"key":"9039_CR27","doi-asserted-by":"crossref","unstructured":"Radcliff NJ. Schema processing. In: Back T, Fogel DB, Michalewicz Z, editors. Handbook of evolutionary computation. New York: Oxford University Press; 1997.","DOI":"10.1887\/0750308958\/b386c16"},{"key":"9039_CR28","unstructured":"Goldberg DE. An analysis of reproduction and crossover in a binary coded genetic algorithm. 1987."},{"key":"9039_CR29","first-page":"31","volume":"5","author":"MD Vose","year":"1991","unstructured":"Vose MD, Liepins GE. Punctuated equilibria in genetic search. Complex Syst. 1991;5:31\u201344.","journal-title":"Complex Syst"},{"key":"9039_CR30","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF01530781","volume":"4","author":"EA Nix","year":"1992","unstructured":"Nix EA, Vose MD. Modelling genetic algorithms using markov chains. Ann Math Artif Intell. 1992;4:79\u201388.","journal-title":"Ann Math Artif Intell"},{"key":"9039_CR31","first-page":"1305","volume":"9","author":"A Prugel-Bennet","year":"1992","unstructured":"Prugel-Bennet A, Shaprio JL. An analysis of genetic algorithms using statistical mechanics. Phys Rev Lett. 1992;9:1305\u20139.","journal-title":"Phys Rev Lett"},{"key":"9039_CR32","first-page":"57","volume":"5","author":"A Rogers","year":"1992","unstructured":"Rogers A, Pr\u00fcgel-Bennett A. Modelling the dynamics of a steady state genetic algorithm. Proc Found Genet\u00a0Algorithms. 1999;5:57\u201368.","journal-title":"Proc Found Genet\u00a0Algorithms"},{"key":"9039_CR33","unstructured":"Goldberg D. The race, the hurdle, and the sweet spot. In: Peter B, editor. Evolutionary design by computers. San Francisco: Morgan Kaufmann; 1999. p. 105\u201318."},{"key":"9039_CR34","unstructured":"Goldberg DE. Genetic algorithms with walsh functions: part ii, deception and its analysis. Complex Syst. 1989;3."},{"key":"9039_CR35","doi-asserted-by":"crossref","unstructured":"Whitley D. Fundamental principles of deception in genetic search. In: Rawlins GJE, editor. Foundations of genetic algorithms. San Francisco: Morgan Kaufmann; 1991. p. 221\u201341.","DOI":"10.1016\/B978-0-08-050684-5.50017-3"},{"key":"9039_CR36","unstructured":"Mitchell M, Holland JH, Forrest S. When will a genetic algorithm outperform hill climbing? In: Cowan JD, Tesauro G, Alspector J, editors. Advances in neural information processing systems 6. San Mateo: Morgan Kaufmann; 1994."},{"key":"9039_CR37","doi-asserted-by":"crossref","unstructured":"Reeves CR, Wright CC. Epistasis in genetic algorithms: an experimental design perspective. In: Proceedings of the 6th international conference on genetic algorithms. 1995.","DOI":"10.1016\/B978-1-55860-356-1.50005-4"},{"key":"9039_CR38","unstructured":"Shaffer JD. Some experiments in machine learning using vector evaluated genetic algorithms. PhD thesis, Vanderbilt University, Nashville; 1984."},{"key":"9039_CR39","unstructured":"Spears WM, De Jong KA. Analyzing gas suing markov models with semantically ordered and lumped states. Foundations of genetic algorithms 4. 1996."},{"key":"9039_CR40","unstructured":"Rechenberg I. Cybernetic solution path of an experimental problem. Royal aircraft establishment, library translation no 1122, Farnsborough, Hants; 1965."},{"key":"9039_CR41","volume-title":"Evolutionsstrategie: Optmierung technischer systeme nach Prinzipien der biologischen Evolution","author":"I Rechenberg","year":"1973","unstructured":"Rechenberg I. Evolutionsstrategie: Optmierung technischer systeme nach Prinzipien der biologischen Evolution. Stuttgart: Frommann-Holzboog; 1973."},{"key":"9039_CR42","unstructured":"Schwefel HP. Evolutionsstrategie und Numerische Optimiernug. PhD thesis, Technische Universitat Berlin, May; 1975."},{"key":"9039_CR43","doi-asserted-by":"crossref","unstructured":"Schwefel HP. Numerische Optimierung von Computer-Modellen mittels der Evolutionsstrategie, volume 26 of interdisciplinary systems research. Basel: Birkhauser; 1977.","DOI":"10.1007\/978-3-0348-5927-1"},{"key":"9039_CR44","doi-asserted-by":"crossref","unstructured":"Radding C. Homologous pairing and strand exchange in genetic recombination. Annu Rev Genet. 1982;16:405\u201337.","DOI":"10.1146\/annurev.ge.16.120182.002201"},{"key":"9039_CR45","volume-title":"Evolutionary biology","author":"DJ Futuyma","year":"1986","unstructured":"Futuyma DJ. Evolutionary biology. Sunderland: Sinauer Associates; 1986."},{"key":"9039_CR46","unstructured":"Hansen N, Ostermeier A. Adapting arbitrary normal mutation distributions in evolution strategies: the covariance matrix adaptation. In: Proceedings of the IEEE international conference on evolutionary computation. 1996. p. 312\u20137."},{"key":"9039_CR47","unstructured":"Baker JE. Reducing bias and inefficiency in the selection algorithms. In: Proceedings of the 1st international conference on genetic algorithms. 1987."},{"key":"9039_CR48","unstructured":"Le Riche R, Vayssade RT, Haftka RT. A segregated genetic algorithm for constrained optimisation in structural mechanics. Technical report, Univesite de Technologie de Compiegne, France; 1995."},{"key":"9039_CR49","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-07418-3","volume-title":"Genetic algorithms + data structures = evolution programs","author":"Z Michalewicz","year":"1994","unstructured":"Michalewicz Z. Genetic algorithms + data structures = evolution programs. Berlin: Springer; 1994."},{"key":"9039_CR50","unstructured":"Richardson JT, Palmer MR, Liepins G, Hillard M. Some guidelines for genetic algorithms with penalty functions. In: Proceedings of the 3rd international conference on genetic algorithms. 1989."},{"issue":"4","key":"9039_CR51","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1177\/003754979406200405","volume":"62","author":"A Homaifar","year":"1994","unstructured":"Homaifar A, Lai SHY, Qi X. Constrained optimisation via genetic algorithms. Simulation. 1994;62(4):242\u2013354.","journal-title":"Simulation"},{"key":"9039_CR52","doi-asserted-by":"crossref","unstructured":"Joines J, Houck C. On the use of non-stationary penalty functions to solve nonlinear constrained optimisation problems with GAs. In: David F, editor. Proceedings of the first IEEE conference on evolutionary computation. IEEE press, Piscataway. 1994. p. 579\u201384.","DOI":"10.1109\/ICEC.1994.349995"},{"key":"9039_CR53","unstructured":"Siedlecki W, Sklanski J. Constrained genetic optimisation via dynamic reward-penalty balancing and its use in pattern recognition In: Schaffer JD, editor. Proceedings of the third International conference on genetic algorithms. San Francisco: Morgan Kaufmann; 1989. p. 10\u20139."},{"key":"9039_CR54","unstructured":"Michalewicz Z, Attia N. Evolutionary optimisation of constrained problems. In: Proceedings of the 3rd annual conference on evolutionary programming. 1994."},{"key":"9039_CR55","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatric","year":"1983","unstructured":"Kirkpatric S, Gelatt CD, Vecchi MP. Optimisation by simulated annealing. Science. 1983;220: 671\u201380.","journal-title":"Science"},{"key":"9039_CR56","unstructured":"Bean JC, Hadj-Alouane AB. A dual genetic algorithm for bounded integer programs. Technical report TR 92-53, Department of Industrial and Operations Engineering, The University of Michigan; 1992."},{"key":"9039_CR57","unstructured":"Hadj-Alouane AB, Bean JC. A genetic algorithm for the multiple-choice integer program. Technical report TR 92-50, Department of Industrial and Operations Engineering, The University of Michigan; 1992."},{"key":"9039_CR58","unstructured":"Smith AE, Tate DM. Genetic optimisation using a penalty function. In: Proceedings of the 5th international conference on genetic algorithms. 1993."},{"issue":"2","key":"9039_CR59","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1287\/ijoc.8.2.173","volume":"8","author":"DW Coit","year":"1996","unstructured":"Coit DW, Smith AE, Tate DM. Adaptive penalty methods for genetic optimisation of constrained combinatorial problems. INFORMS J Comput. 1996;8(2):173\u201382.","journal-title":"INFORMS J Comput"},{"issue":"4","key":"9039_CR60","doi-asserted-by":"crossref","first-page":"895","DOI":"10.1016\/0360-8352(96)00040-X","volume":"30","author":"DW Coit","year":"1996","unstructured":"Coit DW, Smith AE. A penalty guided genetic search for reliability design optimisation. Comput Ind Eng. 1996;30(4):895\u2013904.","journal-title":"Comput Ind Eng"},{"issue":"1","key":"9039_CR61","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1162\/evco.1996.4.1.1","volume":"4","author":"Z Michalewicz","year":"1996","unstructured":"Michalewicz Z, Schoenauer M. Evolutionary algorithms for constrained parameter optimisation problems. Evol Comput. 1996;4(1):1\u201332.","journal-title":"Evol Comput"},{"key":"9039_CR62","doi-asserted-by":"crossref","unstructured":"Gen M, Cheng R. A survey of penalty techniques in genetic algorithms. In: Proceedings of the 1996 international conference on evolutionary computation. 1996.","DOI":"10.1109\/ICEC.1996.542704"},{"key":"9039_CR63","unstructured":"Ebiden AE, Van der Hauw JK. Adaptive Penalties for Evolutionary graph-coloring, pages No. 1363 in LNCS. In: Hao JK, Lutton E, Ronald E, Schoenauer M, Snyers D, editors. Artificial evolution. Berlin: Springer; 1997. p. 95\u2013106."},{"key":"9039_CR64","unstructured":"Coello CA. Use of a self-adaptive penalty approach for engineering optimisation problems. Comput Ind. 1999."},{"key":"9039_CR65","unstructured":"Coello CA. Self-adaptive penalties for ga-based optimisation. In: Proceedings of the 1999 congress on evolutionary computation. 1999."},{"key":"9039_CR66","unstructured":"Deb K. An efficient constraint handling method for genetic algorithms. Comput Methods Appl Mech Eng. 1999."},{"key":"9039_CR67","doi-asserted-by":"crossref","unstructured":"Whitley D, Gordon VS, Mathias K. Lamarckian evolution, the baldwin effect and function optimisation. In: Proceedings of the parallel problem solving from Nature 3. 1994.","DOI":"10.1007\/3-540-58484-6_245"},{"key":"9039_CR68","doi-asserted-by":"crossref","first-page":"843","DOI":"10.1049\/el:19920533","volume":"28","author":"B Porter","year":"1992","unstructured":"Porter B, Jones AH. Genetic tuning of digital PID controllers. Electron Lett. 1992;28:843\u20134.","journal-title":"Electron Lett"},{"key":"9039_CR69","doi-asserted-by":"crossref","first-page":"1387","DOI":"10.1080\/00207729208949392","volume":"23","author":"B Porter","year":"1992","unstructured":"Porter B, Borairi M. Genetic design of linear multivariable feedback control systems using eigenstructure assignment. Int J Syst Sci. 1992;23:1387\u201390.","journal-title":"Int J Syst Sci"},{"key":"9039_CR70","doi-asserted-by":"crossref","first-page":"1897","DOI":"10.1049\/el:19931263","volume":"29","author":"B Porter","year":"1993","unstructured":"Porter B, Mohamed SS. Genetic design of minimum-time controllers. Electron Lett. 1993;29:1897\u20138.","journal-title":"Electron Lett"},{"issue":"5","key":"9039_CR71","first-page":"393","volume":"34","author":"B Porter","year":"1995","unstructured":"Porter B. Genetic design of control systems. Trans Soc Instrum Control Eng. 1995;34(5):393\u2013402.","journal-title":"Trans Soc Instrum Control Eng"},{"key":"9039_CR72","unstructured":"Booker L. Improving search in genetic algorithms. In: Davis L, editor. Genetic algorithms and simulated annealing. San Francisco: Morgan Kaufmann; 1987. p. 61\u201373."},{"key":"9039_CR73","unstructured":"Spears WM, De Jong KA. On the Virtues of parameterised uniform crossover. In: Belew RK, Booker LB, editors. Proceedings of the fourth international conference on genetic algorithms. San Francisco: Morgan Kaufmann; 1991. p. 230\u20136."},{"key":"9039_CR74","unstructured":"Syswerda G. Uniform crossover in genetic algorithms. In: Schaffer JD, editor. Proceedings of the third international conference on genetic algorithms. San Francisco: Morgan Kaufmann; 1989. p. 2\u20139."},{"key":"9039_CR75","unstructured":"Eshelman LJ, Caruna R, Schaffer JD. Biases in the crossover landscape In: Schaffer JD, editor. Proceedings of the third international conference on genetic algorithms. San Francisco: Morgan Kaufmann; 1989. p. 10\u20139."},{"key":"9039_CR76","unstructured":"De Jong K. The analysis and behaviour of a class of genetic adaptive systems. PhD thesis, University of Michigan, Ann Arbor; 1975."},{"key":"9039_CR77","doi-asserted-by":"crossref","unstructured":"Spears WM, De Jong KA. In: Rawlins GJE, editor. Foundations of genetic algorithms. 1991. p. 301\u201315.","DOI":"10.1016\/B978-0-08-050684-5.50022-7"},{"issue":"1","key":"9039_CR78","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1162\/evco.1993.1.1.25","volume":"1","author":"H M\u00fchlenbein","year":"1993","unstructured":"M\u00fchlenbein H, Schlierkamp-Voosen D. Predictive models for the breeder genetic algorithm: I. continuous parameter optimization. Evol Comput. 1993;1(1):25\u201349.","journal-title":"Evol Comput"},{"key":"9039_CR79","unstructured":"Muhlenbein H. The breeder genetic algorithm\u2014a provable optimal search algorithm and its application. In: Proceedings of the IEE colloquium on applications of genetic algorithms, London; 1994."},{"key":"9039_CR80","doi-asserted-by":"crossref","unstructured":"Voigt H-M, Born J, Santibanez-Koref I. Modeling and simulation of distributed evolutionary search processes for function optimization. In: Parallel problem solving from nature, volume 496 of lecture notes in computer science, chapter . New York: Springer; 1991. p. 373\u201380.","DOI":"10.1007\/BFb0029778"},{"key":"9039_CR81","doi-asserted-by":"crossref","unstructured":"Goldberg DE, Deb K. In: Rawlins GJE, editor. Foundations of genetic algorithms. 1991. p. 69\u201393.","DOI":"10.1016\/B978-0-08-050684-5.50008-2"},{"key":"9039_CR82","unstructured":"Brindle A. Genetic algorithms for function optimization. PhD thesis, University of Alberta; 1981."},{"key":"9039_CR83","unstructured":"Grefenstette JJ. Gnesis: a system for using genetic search procedures. In: Proceedings of the 1984 conference on intelligent systems and machines. 1984. p. 161\u20135"},{"key":"9039_CR84","unstructured":"Grefenstette JJ, Baker JE. How genetic algorithms work: a critical look at implicit parallelism. In: Schaffer JD, editor. Proceedings of the third international conference on genetic algorithms. San Francisco: Morgan Kaufmann; 1989. p. 20\u20137."},{"key":"9039_CR85","unstructured":"Davis L. Adapting operator probabilities in genetic algorithms. In: Schaffer JD, editor. Proceedings of the third international conference on genetic algorithms. San Francisco: Morgan Kaufmann; 1989. p. 61\u20139."},{"key":"9039_CR86","unstructured":"Whitely D. The GENITOR algorithm and selection pressure: why rank based allocation of reproductive trials is best. In: Schaffer JD, editor. Proceedings of the third international conference on genetic algorithms. San Francisco: Morgan Kaufmann; 1989. p. 116\u201323."},{"key":"9039_CR87","doi-asserted-by":"crossref","unstructured":"Hinterding R, Michalewicz Z, Eiben AE. Adaptation in evolutionary computation: a survey. In: Proceedings of the 4th IEEE conference on evolutionary computation, Piscataway; 1997. p. 65\u20139.","DOI":"10.1109\/ICEC.1997.592270"},{"issue":"2","key":"9039_CR88","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1109\/4235.771166","volume":"3","author":"AE Eiben","year":"1999","unstructured":"Eiben AE, Hinterding R, Michalewicz Z. Parameter control in evolutionary algorithms. IEEE Trans Evol Comput. 1999;3(2):124\u201341.","journal-title":"IEEE Trans Evol Comput"},{"key":"9039_CR89","unstructured":"Fogarty TC. Varying the probability of mutation in the genetic algorithm. In: Proceedings of the 3rd international conference on genetic algorithms. 1991. p. 104\u20139."},{"key":"9039_CR90","doi-asserted-by":"crossref","unstructured":"Hesser J, Manner R. Towards an optimal mutation probability or genetic algorithms, chapter. In: Schwefel HP, Manner R, editors. Proceedings of the 1st conference on parallel problem solving from nature. Number 496 lecture notes in computer science. Berlin: Springer; 1990. p. 23\u201332.","DOI":"10.1007\/BFb0029727"},{"key":"9039_CR91","unstructured":"Davis L. Job shop scheduling with genetic algorithms. In: Proceedings of the 1st international conference on genetic algorithms. 1985. p. 136\u201340."},{"key":"9039_CR92","unstructured":"Ackley DH. Chapter 13: an empirical study of bit vector function optimization. In: Genetic algorithms and simulated annealing. Pitman; 1987. p. 170\u2013204."},{"key":"9039_CR93","unstructured":"Bramletter MF. Initialization mutation and selection methods in genetic algorithms for function optimization. In: Proceedings of the 4th international conference on genetic algorithms. 1991. p. 100\u20137."},{"key":"9039_CR94","unstructured":"Michalewicz Z, Janikow CZ. Handling constraints in genetic algorithms. In: Proceedings of the 4th international conference on genetic algorithms. 1991. p. 151\u20137."},{"key":"9039_CR95","doi-asserted-by":"crossref","unstructured":"Smith J, Fogarty TC. Self-adaptation of mutation rates in a steady state genetic algorithm. In: Proceedings of the 3rd IEEE conference on evolutionary computation. 1996. p. 318\u201323.","DOI":"10.1109\/ICEC.1996.542382"},{"key":"9039_CR96","doi-asserted-by":"crossref","unstructured":"Fogel DB, Fogel LJ, Atmar JW. Meta-evolutionary programming approach. In: Proceedings of the 25th Aslimar conference on signals, systems, and computers. 1991. p. 540\u20135.","DOI":"10.1109\/ACSSC.1991.186507"},{"key":"9039_CR97","unstructured":"Back T. Self-adaptation in genetic algorithms. In: Proceedings of the 1st European conference on artificial life. 1992."},{"issue":"1","key":"9039_CR98","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1109\/4235.585888","volume":"1","author":"T Back","year":"1997","unstructured":"Back T, Hammel U, Schwefel HP. Evolutionary computation: comments on the history and current state. IEEE Trans Evol Comput. 1997;1(1):3\u201317.","journal-title":"IEEE Trans Evol Comput"},{"key":"9039_CR99","doi-asserted-by":"crossref","unstructured":"Ostermeier A, Gawelczyk A, Hansen N. Step-size adaptation based on non-local use of selection information. PPSN3. 1994. p. 189\u201398.","DOI":"10.1007\/3-540-58484-6_263"},{"key":"9039_CR100","unstructured":"Hansen N, Ostemeier A. Adapting arbitrary normal mutation distributions in evolution strategies: the covariance matrix adaptation. In: Proceedings of the 1996 IEEE international conference on evolutionary computation. 1996. p. 312\u20137."},{"key":"9039_CR101","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195099713.001.0001","volume-title":"Evolutionary algorithms in theory and practice","author":"T Back","year":"1996","unstructured":"Back T. Evolutionaryalgorithms in theory and practice. New York: Oxford University Press; 1996."},{"key":"9039_CR102","unstructured":"Yao X, Liu Y. Fast evolutionary programming. In: Fogel LJ, Angeline PJ, Back T, editors. Proceedings of the 5th annual conference on evolutionary programming. Cambridge: MIT Press; 1996. p. 451\u201360."},{"key":"9039_CR103","unstructured":"Schwefel HP. Problems of constancy and change\u2014the complementarity of systems approaches to complexity In: Checkland P, Kiss I, editors. 31st Annual meeting of the international society for general system research, vol. 2. International Society for General System Research. 1987. p. 1025\u201333."},{"key":"9039_CR104","unstructured":"Hesser J, Manner R. Self-adaptation. In: Back T, Fogel D, Michalewicz Z, editors. Handbook of evolutionary computation. New York: Oxford University Press; 1997. p. C7.1:1\u20131:15."},{"issue":"3","key":"9039_CR105","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1162\/evco.1995.3.3.311","volume":"3","author":"HG Beyer","year":"1996","unstructured":"Beyer HG. Toward a theory of evolution strategies: self-adaptation. Evol Comput. 1996;3(3):311\u201347.","journal-title":"Evol Comput"},{"key":"9039_CR106","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/j.tcs.2004.11.017","volume":"334","author":"A Auger","year":"2005","unstructured":"Auger A. Convergence results for (1,\u03bb)-sa-es using the theory of \u03c6-irreducible markov chains. Theor Comput Sci. 2005;334:35\u201369.","journal-title":"Theor Comput Sci"},{"issue":"2","key":"9039_CR107","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1162\/106365601750190406","volume":"9","author":"K Deb","year":"2001","unstructured":"Deb K, Beyer HG. Self-adaptive genetic algorithms with simulated binary crossover. Evol Comput. 2001;9(2):197\u2013221.","journal-title":"Evol Comput"},{"issue":"4","key":"9039_CR108","first-page":"378","volume":"26","author":"L Lin","year":"1995","unstructured":"Lin L, Delgado-Frias JG, Gause DC, Vassiliadis S. Hybrid newton-raphson genetic algorithm for the traveling salesman problem. J Cybern. 1995;26(4):378\u2013412.","journal-title":"J Cybern"},{"key":"9039_CR109","doi-asserted-by":"crossref","unstructured":"Fujita K, Akagi S, Hirokawa N. Hybrid approach for optimal nesting using a genetic algorithm and a local minimization algorithm. In: Proceedings of the ASME design automation conference. 2003. p. 477\u201384.","DOI":"10.1115\/DETC1993-0337"},{"key":"9039_CR110","first-page":"1899","volume":"24","author":"WD Li","year":"2002","unstructured":"Li WD, Ong SK, Nee AYC. Hybrid genetic algorithm and simulated annealing approach for the optimization of process plans for prismatic parts. Int J Prod Res. 2002;24:1899\u2013922.","journal-title":"Int J Prod Res"},{"issue":"1","key":"9039_CR111","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-8191(94)00071-H","volume":"21","author":"SW Mahfoud","year":"1995","unstructured":"Mahfoud SW, Goldberg DE. Parallel recombinative simulated annealing: a genetic algorithm. Parallel Comput. 1995;21(1):1\u201328.","journal-title":"Parallel Comput"},{"key":"9039_CR112","unstructured":"Thangiah SR, Osman IH, Sun T. Hybrid genetic algorithms, simulated annealing and tabu search methods for vehicle routing problems with time windows. Technical report UKC\/OR94\/4, Institue of Mathematic and Statistics, University of Kent, Canterbury; 1994."},{"issue":"1","key":"9039_CR113","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0305-0548(93)E0023-M","volume":"22","author":"F Glover","year":"1995","unstructured":"Glover F, Kelly JP, Laguna M. Genetic algorithms and tabu search: hybrids for optimization. Comput Oper Res. 1995;22(1):111\u201334.","journal-title":"Comput Oper Res"},{"issue":"5","key":"9039_CR114","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/j.ipl.2004.11.003","volume":"93","author":"XH Shi","year":"2005","unstructured":"Shi XH, Liang YC, Lee HP, Lu C, Wang LM. An improved ga and a novel pso-ga-based hybrid algorithm. Inf Process Lett. 2005;93(5):255\u201361.","journal-title":"Inf Process Lett"},{"issue":"2","key":"9039_CR115","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1016\/j.asoc.2007.07.002","volume":"8","author":"YT Kao","year":"2008","unstructured":"Kao YT, Zahara E. A hybrid genetic algorithm and particle swarm optimization for multi-modal functions. Appl Soft Comput. 2008;8(2):849\u201357.","journal-title":"Appl Soft Comput"},{"issue":"2","key":"9039_CR116","doi-asserted-by":"crossref","first-page":"1329","DOI":"10.1016\/j.amc.2005.01.024","volume":"170","author":"L Wang","year":"2005","unstructured":"Wang L. A hybrid genetic algorithm\u2014neural network strategy for simulation optimization. Appl Math Comput. 2005;170(2):1329\u201343.","journal-title":"Appl Math Comput"},{"issue":"1","key":"9039_CR117","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/S0009-2509(02)00432-3","volume":"58","author":"K Huang","year":"2003","unstructured":"Huang K, Zhan XL, Chen FQ, Lu DW. Catalyst design for methane oxidative coupling by using artificial neural network and hybrid genetic algorithm. Chem Eng Sci. 2003;58(1):81\u20137.","journal-title":"Chem Eng Sci"},{"issue":"1","key":"9039_CR118","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/S0165-0114(03)00111-8","volume":"141","author":"O Cord\u00f3n","year":"2004","unstructured":"Cord\u00f3n O, Gomide F, Herrera F, Hoffmann F, Magdalena L. Ten years of genetic fuzzy systems: current framework and new trends. Fuzzy Sets Syst. 2004;141(1):5\u201331.","journal-title":"Fuzzy Sets Syst"},{"key":"9039_CR119","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn R, Price K. A simple and efficient heuristic for global optimization over continuous spaces. J Global Optim. 1997;11:341\u201359.","journal-title":"J Global Optim"},{"key":"9039_CR120","unstructured":"Lampinen J, Zelinka I. On stagnation of the differential evolution algorithm. In: Proceedings of MENDEL. 2000."},{"key":"9039_CR121","unstructured":"Storn R. Designing digital filters with differential evolution. In: Corne D, Dorigo M, Glover F, editors. New ideas in optimization. London: McGraw-Hill; 1999. p. 109\u201325."},{"key":"9039_CR122","volume-title":"Numerical recipes in C","author":"WH Press","year":"1992","unstructured":"Press WH, Teukolsky SA, Vetterling WT, Flannery BP. Numerical recipes in C. Cambridge: Cambridge University Press; 1992."},{"key":"9039_CR123","unstructured":"Babu BV, Angira R. A differential evolution approach for global optimization of MINLP problems. In: Proceedings of 4th Asia Pacific conference on simulated evolution and learning. 2002."},{"issue":"12","key":"9039_CR124","doi-asserted-by":"crossref","first-page":"1349","DOI":"10.1016\/S0098-1354(97)00015-X","volume":"21","author":"MF Cardoso","year":"1997","unstructured":"Cardoso MF, Salcedo RL, Azevedo SF, Barbosa D. A simulated annealing approach to the solution of MINLP problems. Comput Chem Eng. 1997;21(12):1349\u201364.","journal-title":"Comput Chem Eng"},{"key":"9039_CR125","first-page":"1","volume":"00","author":"YC Lin","year":"2001","unstructured":"Lin YC, Hwang KS, Wang FS. Co-evolutionary hybrid differential evolution for mixed-integer optimization problems. Eng Opt. 2001;00:1\u201320.","journal-title":"Eng Opt"},{"key":"9039_CR126","unstructured":"Gupta K. Branch and bound experiments in nonlinear integer programming. PhD thesis, Purdue University; 1980."},{"key":"9039_CR127","doi-asserted-by":"crossref","unstructured":"Loh HT. A Sequential linearisation approach for mixed-discrete nonlinear design optimization. PhD thesis, University of Michigan, Department of Mechanical Engineering and Applied Mechanics; 1989.","DOI":"10.1115\/DETC1990-0043"},{"key":"9039_CR128","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1080\/03052159308940980","volume":"21","author":"C Zhang","year":"1993","unstructured":"Zhang C, Wang HP. Mixed-discrete nonlinear optimization with simulated annealing. Eng Optim. 1993;21:277\u201391.","journal-title":"Eng Optim"},{"key":"9039_CR129","unstructured":"Lampinen J, Zelinka I. Mixed variable non-linear optimization by differential evolution. In: Proceedings of Nostradamus. 1999."},{"key":"9039_CR130","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1115\/1.2912596","volume":"112","author":"E Sandgren","year":"1990","unstructured":"Sandgren E. Nonlinear integer and discrete programming in mechanical design optimization. Trans ASME J Mech Des. 1990;112:223\u20139.","journal-title":"Trans ASME J Mech Des"},{"key":"9039_CR131","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/S1568-4946(03)00007-3","volume":"3","author":"IL Lopez Cruz","year":"2003","unstructured":"Lopez Cruz IL, Van Willigenburg LG, Van Straten G. Efficient differential evolution algorithms for multimodal optimal control problems. Appl Soft Comput. 2003;3:97\u2013122.","journal-title":"Appl Soft Comput"},{"issue":"5","key":"9039_CR132","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/41.538616","volume":"43","author":"A Chipperfield","year":"1996","unstructured":"Chipperfield A, Fleming P. Multiobjective gas turbine engine controller design using genetic algorithms. IEEE Trans Ind Electron. 1996;43(5):1\u20135.","journal-title":"IEEE Trans Ind Electron"},{"key":"9039_CR133","unstructured":"Horn J, Nafpliotis N. Multiobjective optimisation using the niched pareto genetic algorithm. Technical report IlliGAL Report 93005, Illinois Genetic Algorithms Lab, University of Illinois; 1993."},{"key":"9039_CR134","unstructured":"Booker L. Improving the performance of genetic algorithms in classifier systems. In: Proceedings of the 1st international conference on genetic algorithms. 1985. p. 80\u201392."},{"key":"9039_CR135","unstructured":"Davidor Y. A naturally occurring niche and species phenomenon: the model and first results. In: Proceedings of the 4th international conference on genetic algorithms. 1991. p. 257\u201363"},{"key":"9039_CR136","unstructured":"Davis L, Coombs S Genetic algorithms and communication link speed design: theoretical considerations. In: Proceedings of the 2nd international conference on genetic algorithms. 1987. p. 252\u20136."},{"key":"9039_CR137","first-page":"369","volume":"4","author":"Y Davidor","year":"1990","unstructured":"Davidor Y. Epistasis variance: suitability of a representation to genetic algorithms. Complex Syst. 1990;4:369\u201383.","journal-title":"Complex Syst"},{"key":"9039_CR138","unstructured":"Beasley D, Bull DR, Martin RR. Reducing epistasis in combinatorial problems by expansive coding. In: Proceedings of the 5th international conference on genetic algorithms. 1993. p. 400\u20137."},{"key":"9039_CR139","unstructured":"Davis L. Applying adaptive algorithms to epistasis domains. In: 9th International joint conference on artificial intelligence. 1985. p. 162\u20134."}],"container-title":["Cognitive Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12559-010-9039-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12559-010-9039-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12559-010-9039-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T03:17:26Z","timestamp":1740021446000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12559-010-9039-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4,22]]},"references-count":139,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["9039"],"URL":"https:\/\/doi.org\/10.1007\/s12559-010-9039-2","relation":{},"ISSN":["1866-9956","1866-9964"],"issn-type":[{"type":"print","value":"1866-9956"},{"type":"electronic","value":"1866-9964"}],"subject":[],"published":{"date-parts":[[2010,4,22]]}}}