An efficient constraint handling method for genetic algorithms
- Author
- DEB, K1
[1] Kanpur Genetic Algorithms Laboratory (KanGAL), Department of Mechanical Engineering, Indian Institute of Technology Kanpur, Kanpur 208 016, India - Issue title
- Genetic and evolutionary computation
- Author (monograph)
- GOLDBERG, David E (Editor)1 ; DEB, Kalyanmoy (Editor)2
[1] Department of General Engineering, University of Illinois at Urnana-Champaign, 117 Transportation, Mc 238, 104S Mathews, Urbana, IL 61801, United States
[2] Department of Mechanical Engineering, Indian Institute of Technology, Kanpur, India - Source
Computer methods in applied mechanics and engineering. 2000, Vol 186, Num 2-4, pp 311-338 ; ref : 24 ref
- CODEN
- CMMECC
- ISSN
- 0045-7825
- Scientific domain
- Computer science; Mechanics acoustics
- Publisher
- Elsevier, Amsterdam
- Publication country
- Netherlands
- Document type
- Article
- Language
- English
- Keyword (fr)
- Algorithme génétique Algorithme recherche Conception ingénierie Contrainte inégalité Contrainte égalité Evaluation performance Fonction pénalité Implémentation Manutention Méthode optimisation Méthode pénalité Optimisation sous contrainte Solution optimale
- Keyword (en)
- Genetic algorithms Search algorithm Engineering design Inequality constraint Equality constraint Performance evaluation Penalty function Implementation Handling Optimization method Penalty method Constrained optimization Optimal solution
- Keyword (es)
- Algoritmo búsqueda Concepción ingeniería Constreñimiento desigualdad Constreñimiento igualdad Función penalidad Manutención Método optimización Método penalidad Optimización con restricción Solución óptima
- Classification
- Pascal
- 001 Exact sciences and technology / 001B Physics / 001B00 General / 001B00G Instruments, apparatus, components and techniques common to several branches of physics and astronomy / 001B00G05 Computers in experimental physics / 001B00G05K Data analysis: algorithms and implementation; data management
- Discipline
- Metrology
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 1389960
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.1016/S0045-7825(99)00389-8 
https://dx.doi.org/10.1016/S0045-7825(99)00389-8
"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:29:\"10.1016\/S0045-7825(99)00389-8\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:62:\"An efficient constraint handling method for genetic algorithms\";s:9:\"\u0000*\u0000jtitle\";s:53:\"Computer methods in applied mechanics and engineering\";s:9:\"\u0000*\u0000stitle\";s:31:\"Comput. methods appl. mech. eng\";s:7:\"\u0000*\u0000date\";s:4:\"2000\";s:9:\"\u0000*\u0000volume\";s:3:\"186\";s:8:\"\u0000*\u0000issue\";s:3:\"2-4\";s:8:\"\u0000*\u0000spage\";s:3:\"311\";s:8:\"\u0000*\u0000epage\";s:3:\"338\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0045-7825\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:3:\"DEB\";s:10:\"\u0000*\u0000aufirst\";s:1:\"K\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:0:{}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"CMMECC\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:36:\"Genetic and evolutionary computation\";s:8:\"\u0000*\u0000title\";s:62:\"An efficient constraint handling method for genetic algorithms\";s:8:\"\u0000*\u0000place\";s:9:\"Amsterdam\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";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:29:\"10.1016\/S0045-7825(99)00389-8\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:62:\"An efficient constraint handling method for genetic algorithms\";s:9:\"\u0000*\u0000jtitle\";s:53:\"Computer methods in applied mechanics and engineering\";s:9:\"\u0000*\u0000stitle\";s:31:\"Comput. methods appl. mech. eng\";s:7:\"\u0000*\u0000date\";s:4:\"2000\";s:9:\"\u0000*\u0000volume\";s:3:\"186\";s:8:\"\u0000*\u0000issue\";s:3:\"2-4\";s:8:\"\u0000*\u0000spage\";s:3:\"311\";s:8:\"\u0000*\u0000epage\";s:3:\"338\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0045-7825\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:3:\"DEB\";s:10:\"\u0000*\u0000aufirst\";s:1:\"K\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:0:{}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"CMMECC\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:36:\"Genetic and evolutionary computation\";s:8:\"\u0000*\u0000title\";s:62:\"An efficient constraint handling method for genetic algorithms\";s:8:\"\u0000*\u0000place\";s:9:\"Amsterdam\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";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:29:\"10.1016\/S0045-7825(99)00389-8\";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:29:\"10.1016\/S0045-7825(99)00389-8\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:62:\"An efficient constraint handling method for genetic algorithms\";s:9:\"\u0000*\u0000jtitle\";s:53:\"Computer methods in applied mechanics and engineering\";s:9:\"\u0000*\u0000stitle\";s:31:\"Comput. methods appl. mech. eng\";s:7:\"\u0000*\u0000date\";s:4:\"2000\";s:9:\"\u0000*\u0000volume\";s:3:\"186\";s:8:\"\u0000*\u0000issue\";s:3:\"2-4\";s:8:\"\u0000*\u0000spage\";s:3:\"311\";s:8:\"\u0000*\u0000epage\";s:3:\"338\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0045-7825\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:3:\"DEB\";s:10:\"\u0000*\u0000aufirst\";s:1:\"K\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:0:{}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"CMMECC\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:36:\"Genetic and evolutionary computation\";s:8:\"\u0000*\u0000title\";s:62:\"An efficient constraint handling method for genetic algorithms\";s:8:\"\u0000*\u0000place\";s:9:\"Amsterdam\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";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:29:\"10.1016\/S0045-7825(99)00389-8\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:62:\"An efficient constraint handling method for genetic algorithms\";s:9:\"\u0000*\u0000jtitle\";s:53:\"Computer methods in applied mechanics and engineering\";s:9:\"\u0000*\u0000stitle\";s:31:\"Comput. methods appl. mech. eng\";s:7:\"\u0000*\u0000date\";s:4:\"2000\";s:9:\"\u0000*\u0000volume\";s:3:\"186\";s:8:\"\u0000*\u0000issue\";s:3:\"2-4\";s:8:\"\u0000*\u0000spage\";s:3:\"311\";s:8:\"\u0000*\u0000epage\";s:3:\"338\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0045-7825\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:3:\"DEB\";s:10:\"\u0000*\u0000aufirst\";s:1:\"K\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:0:{}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"CMMECC\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:36:\"Genetic and evolutionary computation\";s:8:\"\u0000*\u0000title\";s:62:\"An efficient constraint handling method for genetic algorithms\";s:8:\"\u0000*\u0000place\";s:9:\"Amsterdam\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";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
