On benchmarking functions for genetic algorithms
- Author
- DIGALAKIS, J. G1 ; MARGARITIS, K. G1
[1] University of Macedonia, 54046, Thessaloniki, Greece - Source
International journal of computer mathematics. 2001, Vol 77, Num 4, pp 481-506 ; ref : 22 ref
- CODEN
- IJCMAT
- ISSN
- 0020-7160
- Scientific domain
- Computer science; Mathematics
- Publisher
- Taylor and Francis, Abingdon
- Publication country
- United Kingdom
- Document type
- Article
- Language
- English
- Keyword (fr)
- Algorithme génétique Calcul repère Dynamique population Génération nombre aléatoire Loi probabilité Mutation Nombre pseudoaléatoire Optimisation Processus stochastique Fonction optimisation Fonction test Loi unimodale Taille population
- Keyword (en)
- Genetic algorithm Benchmark calculation Population dynamics Random number generation Probability distribution Mutation Pseudorandom number Optimization Stochastic process Optimization function Test function Unimodal distribution Population size
- Keyword (es)
- Algoritmo genético Cálculo de referencia Dinámica población Generación número aleatorio Ley probabilidad Mutación Número seudo aleatorio Optimización Proceso estocástico
- Classification
- Pascal
- 002 Biological and medical sciences / 002A Fundamental and applied biological sciences. Psychology / 002A14 Animal, plant and microbial ecology / 002A14B Animal and plant ecology / 002A14B03 Demecology / 002A14B03A General aspects
- Discipline
- Animal, vegetal and microbial ecology
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 14062311
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Access to the document
Install on your browser
DOI
10.1080/00207160108805080 
https://dx.doi.org/10.1080/00207160108805080
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1080\/00207160108805080\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:48:\"On benchmarking functions for genetic algorithms\";s:9:\"\u0000*\u0000jtitle\";s:45:\"International journal of computer mathematics\";s:9:\"\u0000*\u0000stitle\";s:20:\"Int. j. comput. math\";s:7:\"\u0000*\u0000date\";s:4:\"2001\";s:9:\"\u0000*\u0000volume\";s:2:\"77\";s:8:\"\u0000*\u0000issue\";s:1:\"4\";s:8:\"\u0000*\u0000spage\";s:3:\"481\";s:8:\"\u0000*\u0000epage\";s:3:\"506\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0020-7160\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:9:\"DIGALAKIS\";s:10:\"\u0000*\u0000aufirst\";s:4:\"J. G\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:16:\"MARGARITIS, K. G\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"IJCMAT\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:48:\"On benchmarking functions for genetic algorithms\";s:8:\"\u0000*\u0000place\";s:8:\"Abingdon\";s:6:\"\u0000*\u0000pub\";s:18:\"Taylor and Francis\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Panist access
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1080\/00207160108805080\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:48:\"On benchmarking functions for genetic algorithms\";s:9:\"\u0000*\u0000jtitle\";s:45:\"International journal of computer mathematics\";s:9:\"\u0000*\u0000stitle\";s:20:\"Int. j. comput. math\";s:7:\"\u0000*\u0000date\";s:4:\"2001\";s:9:\"\u0000*\u0000volume\";s:2:\"77\";s:8:\"\u0000*\u0000issue\";s:1:\"4\";s:8:\"\u0000*\u0000spage\";s:3:\"481\";s:8:\"\u0000*\u0000epage\";s:3:\"506\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0020-7160\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:9:\"DIGALAKIS\";s:10:\"\u0000*\u0000aufirst\";s:4:\"J. G\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:16:\"MARGARITIS, K. G\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"IJCMAT\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:48:\"On benchmarking functions for genetic algorithms\";s:8:\"\u0000*\u0000place\";s:8:\"Abingdon\";s:6:\"\u0000*\u0000pub\";s:18:\"Taylor and Francis\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Istex access
"O:16:\"UnpaywallOpenUrl\":35:{s:8:\"\u0000*\u0000email\";s:27:\"assistance-portail@inist.fr\";s:6:\"\u0000*\u0000fmt\";N;s:6:\"\u0000*\u0000doi\";s:25:\"10.1080\/00207160108805080\";s:6:\"\u0000*\u0000pii\";N;s:7:\"\u0000*\u0000pmid\";N;s:9:\"\u0000*\u0000atitle\";N;s:9:\"\u0000*\u0000jtitle\";N;s:9:\"\u0000*\u0000stitle\";N;s:7:\"\u0000*\u0000date\";N;s:9:\"\u0000*\u0000volume\";N;s:8:\"\u0000*\u0000issue\";N;s:8:\"\u0000*\u0000spage\";N;s:8:\"\u0000*\u0000epage\";N;s:8:\"\u0000*\u0000pages\";N;s:7:\"\u0000*\u0000issn\";N;s:8:\"\u0000*\u0000eissn\";N;s:9:\"\u0000*\u0000aulast\";N;s:10:\"\u0000*\u0000aufirst\";N;s:9:\"\u0000*\u0000auinit\";N;s:10:\"\u0000*\u0000auinitm\";N;s:5:\"\u0000*\u0000au\";N;s:9:\"\u0000*\u0000aucorp\";N;s:7:\"\u0000*\u0000isbn\";N;s:8:\"\u0000*\u0000coden\";N;s:8:\"\u0000*\u0000genre\";N;s:7:\"\u0000*\u0000part\";N;s:9:\"\u0000*\u0000btitle\";N;s:8:\"\u0000*\u0000title\";N;s:8:\"\u0000*\u0000place\";N;s:6:\"\u0000*\u0000pub\";N;s:10:\"\u0000*\u0000edition\";N;s:9:\"\u0000*\u0000tpages\";N;s:9:\"\u0000*\u0000series\";N;s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";N;}"
Unpaywall access
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1080\/00207160108805080\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:48:\"On benchmarking functions for genetic algorithms\";s:9:\"\u0000*\u0000jtitle\";s:45:\"International journal of computer mathematics\";s:9:\"\u0000*\u0000stitle\";s:20:\"Int. j. comput. math\";s:7:\"\u0000*\u0000date\";s:4:\"2001\";s:9:\"\u0000*\u0000volume\";s:2:\"77\";s:8:\"\u0000*\u0000issue\";s:1:\"4\";s:8:\"\u0000*\u0000spage\";s:3:\"481\";s:8:\"\u0000*\u0000epage\";s:3:\"506\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0020-7160\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:9:\"DIGALAKIS\";s:10:\"\u0000*\u0000aufirst\";s:4:\"J. G\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:16:\"MARGARITIS, K. G\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"IJCMAT\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:48:\"On benchmarking functions for genetic algorithms\";s:8:\"\u0000*\u0000place\";s:8:\"Abingdon\";s:6:\"\u0000*\u0000pub\";s:18:\"Taylor and Francis\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Europe PubMed Central access
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1080\/00207160108805080\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:48:\"On benchmarking functions for genetic algorithms\";s:9:\"\u0000*\u0000jtitle\";s:45:\"International journal of computer mathematics\";s:9:\"\u0000*\u0000stitle\";s:20:\"Int. j. comput. math\";s:7:\"\u0000*\u0000date\";s:4:\"2001\";s:9:\"\u0000*\u0000volume\";s:2:\"77\";s:8:\"\u0000*\u0000issue\";s:1:\"4\";s:8:\"\u0000*\u0000spage\";s:3:\"481\";s:8:\"\u0000*\u0000epage\";s:3:\"506\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0020-7160\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:9:\"DIGALAKIS\";s:10:\"\u0000*\u0000aufirst\";s:4:\"J. G\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:16:\"MARGARITIS, K. G\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"IJCMAT\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:48:\"On benchmarking functions for genetic algorithms\";s:8:\"\u0000*\u0000place\";s:8:\"Abingdon\";s:6:\"\u0000*\u0000pub\";s:18:\"Taylor and Francis\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
arXiv access
