Ant colony optimization for continuous domains : Adaptation of discrete metaheuristics to continuous optimization
- Auteur
- SOCHA, Krzysztof1 ; DORIGO, Marco1
[1] IRIDIA, Université Libre de Bruxelles, CP 19416. Ave. Franklin D. Roosevelt 50, 1050 Brussels, Belgium - Source
European journal of operational research. 2008, Vol 185, Num 3, pp 1155-1173, 19 p ; ref : 1 p.1/2
- CODEN
- EJORDT
- ISSN
- 0377-2217
- Domaine scientifique
- Control theory, operational research
- Editeur
- Elsevier, Amsterdam
- Pays de publication
- Netherlands
- Type de document
- Article
- Langue
- English
- Mot clé auteur
- Ant colony optimization Continuous optimization Metaheuristics
- Mot clé (fr)
- Insecte social Intelligence en essaim Méthode heuristique Optimisation combinatoire Robustesse
- Mot clé (en)
- Social insect Swarm intelligence Heuristic method Combinatorial optimization Robustness
- Mot clé (es)
- Insecto social Inteligencia de enjambre Método heurístico Optimización combinatoria Robustez
- Classification
- Pascal
- 001 Sciences exactes et technologie / 001D Sciences appliquees / 001D01 Recherche operationnelle. Gestion / 001D01A Recherche opérationnelle et modèles formalisés de gestion / 001D01A04 Flots dans les réseaux. Problèmes combinatoires
- Discipline
- Operational research. Management
- Provenance
- Inist-CNRS
- Base de données
- PASCAL
- Identifiant INIST
- 20002114
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
Accès au Document
Installer sur votre navigateur
DOI
10.1016/j.ejor.2006.06.046 
https://dx.doi.org/10.1016/j.ejor.2006.06.046
"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:26:\"10.1016\/j.ejor.2006.06.046\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:113:\"Ant colony optimization for continuous domains : Adaptation of discrete metaheuristics to continuous optimization\";s:9:\"\u0000*\u0000jtitle\";s:40:\"European journal of operational research\";s:9:\"\u0000*\u0000stitle\";s:17:\"Eur. j. oper. res\";s:7:\"\u0000*\u0000date\";s:4:\"2008\";s:9:\"\u0000*\u0000volume\";s:3:\"185\";s:8:\"\u0000*\u0000issue\";s:1:\"3\";s:8:\"\u0000*\u0000spage\";s:4:\"1155\";s:8:\"\u0000*\u0000epage\";s:4:\"1173\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0377-2217\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:5:\"SOCHA\";s:10:\"\u0000*\u0000aufirst\";s:9:\"Krzysztof\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:13:\"DORIGO, Marco\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"EJORDT\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:113:\"Ant colony optimization for continuous domains : Adaptation of discrete metaheuristics to continuous optimization\";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;}"
Accès par Panist
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:26:\"10.1016\/j.ejor.2006.06.046\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:113:\"Ant colony optimization for continuous domains : Adaptation of discrete metaheuristics to continuous optimization\";s:9:\"\u0000*\u0000jtitle\";s:40:\"European journal of operational research\";s:9:\"\u0000*\u0000stitle\";s:17:\"Eur. j. oper. res\";s:7:\"\u0000*\u0000date\";s:4:\"2008\";s:9:\"\u0000*\u0000volume\";s:3:\"185\";s:8:\"\u0000*\u0000issue\";s:1:\"3\";s:8:\"\u0000*\u0000spage\";s:4:\"1155\";s:8:\"\u0000*\u0000epage\";s:4:\"1173\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0377-2217\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:5:\"SOCHA\";s:10:\"\u0000*\u0000aufirst\";s:9:\"Krzysztof\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:13:\"DORIGO, Marco\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"EJORDT\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:113:\"Ant colony optimization for continuous domains : Adaptation of discrete metaheuristics to continuous optimization\";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;}"
Accès par Istex
"O:16:\"UnpaywallOpenUrl\":35:{s:8:\"\u0000*\u0000email\";s:27:\"assistance-portail@inist.fr\";s:6:\"\u0000*\u0000fmt\";N;s:6:\"\u0000*\u0000doi\";s:26:\"10.1016\/j.ejor.2006.06.046\";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;}"
Accès par Unpaywall
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:26:\"10.1016\/j.ejor.2006.06.046\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:113:\"Ant colony optimization for continuous domains : Adaptation of discrete metaheuristics to continuous optimization\";s:9:\"\u0000*\u0000jtitle\";s:40:\"European journal of operational research\";s:9:\"\u0000*\u0000stitle\";s:17:\"Eur. j. oper. res\";s:7:\"\u0000*\u0000date\";s:4:\"2008\";s:9:\"\u0000*\u0000volume\";s:3:\"185\";s:8:\"\u0000*\u0000issue\";s:1:\"3\";s:8:\"\u0000*\u0000spage\";s:4:\"1155\";s:8:\"\u0000*\u0000epage\";s:4:\"1173\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0377-2217\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:5:\"SOCHA\";s:10:\"\u0000*\u0000aufirst\";s:9:\"Krzysztof\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:13:\"DORIGO, Marco\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"EJORDT\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:113:\"Ant colony optimization for continuous domains : Adaptation of discrete metaheuristics to continuous optimization\";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;}"
Accès par Europe PubMed Central
"O:11:\"BaseOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:26:\"10.1016\/j.ejor.2006.06.046\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:113:\"Ant colony optimization for continuous domains : Adaptation of discrete metaheuristics to continuous optimization\";s:9:\"\u0000*\u0000jtitle\";s:40:\"European journal of operational research\";s:9:\"\u0000*\u0000stitle\";s:17:\"Eur. j. oper. res\";s:7:\"\u0000*\u0000date\";s:4:\"2008\";s:9:\"\u0000*\u0000volume\";s:3:\"185\";s:8:\"\u0000*\u0000issue\";s:1:\"3\";s:8:\"\u0000*\u0000spage\";s:4:\"1155\";s:8:\"\u0000*\u0000epage\";s:4:\"1173\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0377-2217\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:5:\"SOCHA\";s:10:\"\u0000*\u0000aufirst\";s:9:\"Krzysztof\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:13:\"DORIGO, Marco\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"EJORDT\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:113:\"Ant colony optimization for continuous domains : Adaptation of discrete metaheuristics to continuous optimization\";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;}"
Accès par Base Search
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:26:\"10.1016\/j.ejor.2006.06.046\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:113:\"Ant colony optimization for continuous domains : Adaptation of discrete metaheuristics to continuous optimization\";s:9:\"\u0000*\u0000jtitle\";s:40:\"European journal of operational research\";s:9:\"\u0000*\u0000stitle\";s:17:\"Eur. j. oper. res\";s:7:\"\u0000*\u0000date\";s:4:\"2008\";s:9:\"\u0000*\u0000volume\";s:3:\"185\";s:8:\"\u0000*\u0000issue\";s:1:\"3\";s:8:\"\u0000*\u0000spage\";s:4:\"1155\";s:8:\"\u0000*\u0000epage\";s:4:\"1173\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0377-2217\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:5:\"SOCHA\";s:10:\"\u0000*\u0000aufirst\";s:9:\"Krzysztof\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:13:\"DORIGO, Marco\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"EJORDT\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:113:\"Ant colony optimization for continuous domains : Adaptation of discrete metaheuristics to continuous optimization\";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;}"
Accès par arXiv
