{"id":7687,"date":"2018-05-17T10:11:41","date_gmt":"2018-05-17T09:11:41","guid":{"rendered":"http:\/\/dpubma.univ-annaba.dz\/?p=7687"},"modified":"2018-05-20T10:14:37","modified_gmt":"2018-05-20T09:14:37","slug":"amelioration-de-lalgorithme-de-chauve-souris-par-modification-de-regles-devolution-et-introduction-de-mecanisme-de-croisement","status":"publish","type":"post","link":"https:\/\/synthese.univ-annaba.dz\/?p=7687","title":{"rendered":"Am\u00e9lioration de l&rsquo;algorithme de chauve-souris par modification de r\u00e8gles d\u2019\u00e9volution et introduction de m\u00e9canisme de croisement"},"content":{"rendered":"<p style=\"text-align: justify;\" align=\"center\"><strong>Num\u00e9ro de la revue<\/strong>:\u00a036<br \/>\n<strong>Auteurs<\/strong>: Amina Bedboudi<sup>1\u00a0<\/sup>&amp; Mohamed Cherif Bouras<sup>2 <\/sup><\/p>\n<p><em><sup>1 <\/sup><\/em><em>Laboratoire de recherch\u00e9 en informatique LRI Universit\u00e9 Badji Mokhtar-Annaba, BP 12, Annaba 23000, Alg\u00e9rie.<\/em><\/p>\n<p><em><sup>2<\/sup><\/em><em>D\u00e9partement de Math\u00e9matique Universit\u00e9 Badji Mokhtar-Annaba, BP 12, Annaba 23000, Alg\u00e9rie<\/em><\/p>\n<p><span style=\"font-size: 10pt;\"><em>Soumis le\u00a0: 26\/09\/2017\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 R\u00e9vis\u00e9 le\u00a0: 09\/02\/2018\u00a0 \u00a0 \u00a0 \u00a0 Accept\u00e9 le\u00a0: 25\/02\/2018<\/em><\/span><\/p>\n<p>&nbsp;<\/p>\n<p style=\"text-align: right;\"><a href=\"http:\/\/dpubma.univ-annaba.dz\/wp-content\/uploads\/2018\/05\/1-36.17.pdf\"><strong>T\u00e9l\u00e9charger l&rsquo;article<img loading=\"lazy\" decoding=\"async\" class=\" wp-image-709 alignright\" style=\"margin-top: -10px; margin-bottom: -10px;\" src=\"\/wp-content\/uploads\/2014\/04\/p2.jpg\" alt=\"p2\" width=\"37\" height=\"35\" srcset=\"https:\/\/synthese.univ-annaba.dz\/wp-content\/uploads\/2014\/04\/p2.jpg 113w, https:\/\/synthese.univ-annaba.dz\/wp-content\/uploads\/2014\/04\/p2-24x24.jpg 24w, https:\/\/synthese.univ-annaba.dz\/wp-content\/uploads\/2014\/04\/p2-48x46.jpg 48w\" sizes=\"auto, (max-width: 37px) 100vw, 37px\" \/><\/strong><\/a><\/p>\n<p><strong>R\u00e9sum\u00e9<\/strong><\/p>\n<p style=\"text-align: justify;\">L&rsquo;algorithme de chauve-souris est l&rsquo;une des m\u00e9ta-heuristiques prometteuses, r\u00e9cemment propos\u00e9 pour la r\u00e9solution de probl\u00e8mes d&rsquo;optimisation. Il se base sur la simulation du comportement d&rsquo;\u00e9cholocation des chauves-souris. Dans cet article, nous pr\u00e9sentons une am\u00e9lioration de cet algorithme par une \u00a0modification appropri\u00e9e des r\u00e8gles d\u2019\u00e9volution et l\u2019introduction de m\u00e9canisme de croisement. Nous montrons que ce nouvel \u00a0algorithme am\u00e9liore les r\u00e9sultats r\u00e9alis\u00e9s par l\u2019algorithme de chauve-souris standard et les autres algorithmes le modifiant, publi\u00e9s r\u00e9cemment. Son application sur cinq fonctions benchmarks largement utilis\u00e9es dans la litt\u00e9rature, montre de fa\u00e7on claire et pr\u00e9cise que les r\u00e9sultats r\u00e9alis\u00e9s sont nettement meilleurs.<\/p>\n<p style=\"text-align: justify;\"><strong>Mots cl\u00e9s :<\/strong><em> M\u00e9ta-heuristiques, algorithme de chauve-souris, optimisation, fonction objectif.<\/em><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Num\u00e9ro de la revue:\u00a036 Auteurs: Amina Bedboudi1\u00a0&amp; Mohamed Cherif Bouras2 1 Laboratoire de recherch\u00e9 en informatique LRI Universit\u00e9 Badji Mokhtar-Annaba, BP 12, Annaba 23000, Alg\u00e9rie. 2D\u00e9partement de Math\u00e9matique Universit\u00e9 Badji Mokhtar-Annaba, BP 12, Annaba 23000, Alg\u00e9rie Soumis le\u00a0: 26\/09\/2017\u00a0 \u00a0 &hellip; <a href=\"https:\/\/synthese.univ-annaba.dz\/?p=7687\">Lire la suite <span class=\"meta-nav\">&raquo;<\/span><\/a><\/p>\n","protected":false},"author":5,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1248],"tags":[1250,1251,1249,54],"class_list":["post-7687","post","type-post","status-publish","format-standard","hentry","category-synthese-n-36","tag-algorithme-de-chauve-souris","tag-fonction-objectif","tag-meta-heuristiques","tag-optimisation"],"_links":{"self":[{"href":"https:\/\/synthese.univ-annaba.dz\/index.php?rest_route=\/wp\/v2\/posts\/7687","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/synthese.univ-annaba.dz\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/synthese.univ-annaba.dz\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/synthese.univ-annaba.dz\/index.php?rest_route=\/wp\/v2\/users\/5"}],"replies":[{"embeddable":true,"href":"https:\/\/synthese.univ-annaba.dz\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=7687"}],"version-history":[{"count":3,"href":"https:\/\/synthese.univ-annaba.dz\/index.php?rest_route=\/wp\/v2\/posts\/7687\/revisions"}],"predecessor-version":[{"id":7733,"href":"https:\/\/synthese.univ-annaba.dz\/index.php?rest_route=\/wp\/v2\/posts\/7687\/revisions\/7733"}],"wp:attachment":[{"href":"https:\/\/synthese.univ-annaba.dz\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=7687"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/synthese.univ-annaba.dz\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=7687"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/synthese.univ-annaba.dz\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=7687"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}