A self-adaptive global best harmony search algorithm for continuous optimization problems
- Author
- PAN, Quan-Ke1 ; SUGANTHAN, P. N2 ; TASGETIREN, M. Fatih3 ; LIANG, J. J4
[1] College of Computer Science, Liaocheng University, Liaocheng 252059, China
[2] School of Electrical and Electronic Engineering, Nanyang Technological University, 50 Nanyang Ave., 639798 Singapore, Singapore
[3] Department of Industrial Engineering, Yasar University, Bornova, Izmir, Turkey
[4] School of Electrical Engineering, Zhengzhou University, Zhengzhou 450001, China - Source
Applied mathematics and computation. 2010, Vol 216, Num 3, pp 830-848, 19 p ; ref : 23 ref
- CODEN
- AMHCBQ
- ISSN
- 0096-3003
- Scientific domain
- Control theory, operational research; Computer science; Mathematics
- Publisher
- Elsevier, Amsterdam
- Publication country
- Netherlands
- Document type
- Article
- Language
- English
- Author keyword
- Continuous optimization Evolutionary algorithms Harmony search Meta-heuristics
- Keyword (fr)
- Algorithme adaptatif Algorithme recherche Analyse numérique Apprentissage Calcul variationnel Mathématiques appliquées Méthode optimisation Performance algorithme Problème recherche Programmation mathématique Résolution problème Solution globale 05C78 49XX 58A25 65K10 65Kxx
- Keyword (en)
- Adaptive algorithm Search algorithm Numerical analysis Learning Variational calculus Applied mathematics Optimization method Algorithm performance Search problem Mathematical programming Problem solving Global solution
- Keyword (es)
- Algoritmo adaptativo Algoritmo búsqueda Análisis numérico Aprendizaje Cálculo de variaciones Matemáticas aplicadas Método optimización Resultado algoritmo Problema investigación Programación matemática Resolución problema Solución global
- Classification
- Pascal
- 001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics / 001A02B Combinatorics. Ordered structures / 001A02B01 Combinatorics / 001A02B01C Graph theory
- Pascal
- 001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics / 001A02E Mathematical analysis / 001A02E18 Calculus of variations and optimal control
- Pascal
- 001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics / 001A02G Topology. Manifolds and cell complexes. Global analysis and analysis on manifolds / 001A02G04 Global analysis, analysis on manifolds
- Pascal
- 001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics / 001A02I Numerical analysis. Scientific computation / 001A02I01 Numerical analysis / 001A02I01P Numerical methods in mathematical programming, optimization and calculus of variations / 001A02I01P2 Numerical methods in optimization and calculus of variations
- Discipline
- Mathematics
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 22590787
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/j.amc.2010.01.088 
https://dx.doi.org/10.1016/j.amc.2010.01.088
"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.1016\/j.amc.2010.01.088\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:89:\"A self-adaptive global best harmony search algorithm for continuous optimization problems\";s:9:\"\u0000*\u0000jtitle\";s:35:\"Applied mathematics and computation\";s:9:\"\u0000*\u0000stitle\";s:18:\"Appl. math. comput\";s:7:\"\u0000*\u0000date\";s:4:\"2010\";s:9:\"\u0000*\u0000volume\";s:3:\"216\";s:8:\"\u0000*\u0000issue\";s:1:\"3\";s:8:\"\u0000*\u0000spage\";s:3:\"830\";s:8:\"\u0000*\u0000epage\";s:3:\"848\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0096-3003\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:3:\"PAN\";s:10:\"\u0000*\u0000aufirst\";s:7:\"Quan-Ke\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:15:\"SUGANTHAN, P. N\";i:1;s:20:\"TASGETIREN, M. Fatih\";i:2;s:11:\"LIANG, J. J\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"AMHCBQ\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:89:\"A self-adaptive global best harmony search algorithm for continuous optimization problems\";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:2:\"19\";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.1016\/j.amc.2010.01.088\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:89:\"A self-adaptive global best harmony search algorithm for continuous optimization problems\";s:9:\"\u0000*\u0000jtitle\";s:35:\"Applied mathematics and computation\";s:9:\"\u0000*\u0000stitle\";s:18:\"Appl. math. comput\";s:7:\"\u0000*\u0000date\";s:4:\"2010\";s:9:\"\u0000*\u0000volume\";s:3:\"216\";s:8:\"\u0000*\u0000issue\";s:1:\"3\";s:8:\"\u0000*\u0000spage\";s:3:\"830\";s:8:\"\u0000*\u0000epage\";s:3:\"848\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0096-3003\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:3:\"PAN\";s:10:\"\u0000*\u0000aufirst\";s:7:\"Quan-Ke\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:15:\"SUGANTHAN, P. N\";i:1;s:20:\"TASGETIREN, M. Fatih\";i:2;s:11:\"LIANG, J. J\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"AMHCBQ\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:89:\"A self-adaptive global best harmony search algorithm for continuous optimization problems\";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:2:\"19\";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.1016\/j.amc.2010.01.088\";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.1016\/j.amc.2010.01.088\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:89:\"A self-adaptive global best harmony search algorithm for continuous optimization problems\";s:9:\"\u0000*\u0000jtitle\";s:35:\"Applied mathematics and computation\";s:9:\"\u0000*\u0000stitle\";s:18:\"Appl. math. comput\";s:7:\"\u0000*\u0000date\";s:4:\"2010\";s:9:\"\u0000*\u0000volume\";s:3:\"216\";s:8:\"\u0000*\u0000issue\";s:1:\"3\";s:8:\"\u0000*\u0000spage\";s:3:\"830\";s:8:\"\u0000*\u0000epage\";s:3:\"848\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0096-3003\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:3:\"PAN\";s:10:\"\u0000*\u0000aufirst\";s:7:\"Quan-Ke\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:15:\"SUGANTHAN, P. N\";i:1;s:20:\"TASGETIREN, M. Fatih\";i:2;s:11:\"LIANG, J. J\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"AMHCBQ\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:89:\"A self-adaptive global best harmony search algorithm for continuous optimization problems\";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:2:\"19\";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:11:\"BaseOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1016\/j.amc.2010.01.088\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:89:\"A self-adaptive global best harmony search algorithm for continuous optimization problems\";s:9:\"\u0000*\u0000jtitle\";s:35:\"Applied mathematics and computation\";s:9:\"\u0000*\u0000stitle\";s:18:\"Appl. math. comput\";s:7:\"\u0000*\u0000date\";s:4:\"2010\";s:9:\"\u0000*\u0000volume\";s:3:\"216\";s:8:\"\u0000*\u0000issue\";s:1:\"3\";s:8:\"\u0000*\u0000spage\";s:3:\"830\";s:8:\"\u0000*\u0000epage\";s:3:\"848\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0096-3003\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:3:\"PAN\";s:10:\"\u0000*\u0000aufirst\";s:7:\"Quan-Ke\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:15:\"SUGANTHAN, P. N\";i:1;s:20:\"TASGETIREN, M. Fatih\";i:2;s:11:\"LIANG, J. J\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"AMHCBQ\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:89:\"A self-adaptive global best harmony search algorithm for continuous optimization problems\";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:2:\"19\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Base Search access
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1016\/j.amc.2010.01.088\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:89:\"A self-adaptive global best harmony search algorithm for continuous optimization problems\";s:9:\"\u0000*\u0000jtitle\";s:35:\"Applied mathematics and computation\";s:9:\"\u0000*\u0000stitle\";s:18:\"Appl. math. comput\";s:7:\"\u0000*\u0000date\";s:4:\"2010\";s:9:\"\u0000*\u0000volume\";s:3:\"216\";s:8:\"\u0000*\u0000issue\";s:1:\"3\";s:8:\"\u0000*\u0000spage\";s:3:\"830\";s:8:\"\u0000*\u0000epage\";s:3:\"848\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0096-3003\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:3:\"PAN\";s:10:\"\u0000*\u0000aufirst\";s:7:\"Quan-Ke\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:15:\"SUGANTHAN, P. N\";i:1;s:20:\"TASGETIREN, M. Fatih\";i:2;s:11:\"LIANG, J. J\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"AMHCBQ\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:89:\"A self-adaptive global best harmony search algorithm for continuous optimization problems\";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:2:\"19\";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
