Loading…
Micro Bat Algorithm for High Dimensional Optimization Problems
Very recently bat inspired algorithms have gained increasing attention as a powerful technique for solving optimization problems. Bat algorithm (BA) is the first one in this group. It is based on the echolocation behavior of bats. BA is very good at exploitation however it is generally poor at explo...
Saved in:
Published in: | International journal of computer applications 2015-01, Vol.122 (12), p.1-10 |
---|---|
Main Authors: | , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | cdi_FETCH-LOGICAL-c1735-99104f04d65c19c4d359de8b22c6bb6fb14384c5cb97b07659054024cb95292c3 |
---|---|
cites | |
container_end_page | 10 |
container_issue | 12 |
container_start_page | 1 |
container_title | International journal of computer applications |
container_volume | 122 |
creator | Topal, Ali Osman Altun, Oguz Yildiz, Yunus Emre |
description | Very recently bat inspired algorithms have gained increasing attention as a powerful technique for solving optimization problems. Bat algorithm (BA) is the first one in this group. It is based on the echolocation behavior of bats. BA is very good at exploitation however it is generally poor at exploration. Dynamic Virtual Bats Algorithm (DVBA) is another bat inspired algorithm, which is proposed lately. Although the algorithm is fundamentally inspired from BA, it is conceptually very different. DVBA employs just two bats and uses role based search mechanism. It is very efficient in exploration but relatively poor in exploitation, when it comes to high dimensional problems. In this paper, a novel micro-bat algorithm ( BA) is proposed which possess the advantages of both algorithms. BA employs a very small population compared to its classical version. It combines the swarming technique of bats in Bat Algorithm with the role based search in Dynamic Virtual Bats Algorithm. Our empirical results demonstrate that the proposed BA achieves a good balance between exploration and exploitation. And it exhibits a better overall performance than the standard BA with larger and smaller populations on high dimensional problems. |
doi_str_mv | 10.5120/21749-5015 |
format | article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1718957717</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1718957717</sourcerecordid><originalsourceid>FETCH-LOGICAL-c1735-99104f04d65c19c4d359de8b22c6bb6fb14384c5cb97b07659054024cb95292c3</originalsourceid><addsrcrecordid>eNpdkEtLAzEUhYMoWGo3_oKAGxFG85zM3Qi1PipU6kLXYZJm2pSZpibThf56U-tCvJtzD3zcyzkInVNyLSkjN4wqAYUkVB6hAQEli6qq1PGf_RSNUlqTPBxYCWKAbl-8jQHf1T0et8sQfb_qcBMinvrlCt_7zm2SD5u6xfNt7zv_VffZ4tcYTOu6dIZOmrpNbvSrQ_T--PA2mRaz-dPzZDwrLFVcFgCUiIaIRSktBSsWXMLCVYYxWxpTNoYKXgkrrQFliColECkIE9lLBszyIbo83N3G8LFzqdedT9a1bb1xYZc0VbQCqVT-NkQX_9B12MWcIFMlVIJzyiBTVwcqp08pukZvo-_q-Kkp0fs29U-bet8m_wYCJmOu</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1698433129</pqid></control><display><type>article</type><title>Micro Bat Algorithm for High Dimensional Optimization Problems</title><source>Freely Accessible Science Journals</source><creator>Topal, Ali Osman ; Altun, Oguz ; Yildiz, Yunus Emre</creator><creatorcontrib>Topal, Ali Osman ; Altun, Oguz ; Yildiz, Yunus Emre</creatorcontrib><description>Very recently bat inspired algorithms have gained increasing attention as a powerful technique for solving optimization problems. Bat algorithm (BA) is the first one in this group. It is based on the echolocation behavior of bats. BA is very good at exploitation however it is generally poor at exploration. Dynamic Virtual Bats Algorithm (DVBA) is another bat inspired algorithm, which is proposed lately. Although the algorithm is fundamentally inspired from BA, it is conceptually very different. DVBA employs just two bats and uses role based search mechanism. It is very efficient in exploration but relatively poor in exploitation, when it comes to high dimensional problems. In this paper, a novel micro-bat algorithm ( BA) is proposed which possess the advantages of both algorithms. BA employs a very small population compared to its classical version. It combines the swarming technique of bats in Bat Algorithm with the role based search in Dynamic Virtual Bats Algorithm. Our empirical results demonstrate that the proposed BA achieves a good balance between exploration and exploitation. And it exhibits a better overall performance than the standard BA with larger and smaller populations on high dimensional problems.</description><identifier>ISSN: 0975-8887</identifier><identifier>EISSN: 0975-8887</identifier><identifier>DOI: 10.5120/21749-5015</identifier><language>eng</language><publisher>New York: Foundation of Computer Science</publisher><subject>Algorithms ; Balancing ; Dynamics ; Exploitation ; Exploration ; Optimization ; Searching ; Swarming</subject><ispartof>International journal of computer applications, 2015-01, Vol.122 (12), p.1-10</ispartof><rights>Copyright Foundation of Computer Science 2015</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c1735-99104f04d65c19c4d359de8b22c6bb6fb14384c5cb97b07659054024cb95292c3</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Topal, Ali Osman</creatorcontrib><creatorcontrib>Altun, Oguz</creatorcontrib><creatorcontrib>Yildiz, Yunus Emre</creatorcontrib><title>Micro Bat Algorithm for High Dimensional Optimization Problems</title><title>International journal of computer applications</title><description>Very recently bat inspired algorithms have gained increasing attention as a powerful technique for solving optimization problems. Bat algorithm (BA) is the first one in this group. It is based on the echolocation behavior of bats. BA is very good at exploitation however it is generally poor at exploration. Dynamic Virtual Bats Algorithm (DVBA) is another bat inspired algorithm, which is proposed lately. Although the algorithm is fundamentally inspired from BA, it is conceptually very different. DVBA employs just two bats and uses role based search mechanism. It is very efficient in exploration but relatively poor in exploitation, when it comes to high dimensional problems. In this paper, a novel micro-bat algorithm ( BA) is proposed which possess the advantages of both algorithms. BA employs a very small population compared to its classical version. It combines the swarming technique of bats in Bat Algorithm with the role based search in Dynamic Virtual Bats Algorithm. Our empirical results demonstrate that the proposed BA achieves a good balance between exploration and exploitation. And it exhibits a better overall performance than the standard BA with larger and smaller populations on high dimensional problems.</description><subject>Algorithms</subject><subject>Balancing</subject><subject>Dynamics</subject><subject>Exploitation</subject><subject>Exploration</subject><subject>Optimization</subject><subject>Searching</subject><subject>Swarming</subject><issn>0975-8887</issn><issn>0975-8887</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2015</creationdate><recordtype>article</recordtype><recordid>eNpdkEtLAzEUhYMoWGo3_oKAGxFG85zM3Qi1PipU6kLXYZJm2pSZpibThf56U-tCvJtzD3zcyzkInVNyLSkjN4wqAYUkVB6hAQEli6qq1PGf_RSNUlqTPBxYCWKAbl-8jQHf1T0et8sQfb_qcBMinvrlCt_7zm2SD5u6xfNt7zv_VffZ4tcYTOu6dIZOmrpNbvSrQ_T--PA2mRaz-dPzZDwrLFVcFgCUiIaIRSktBSsWXMLCVYYxWxpTNoYKXgkrrQFliColECkIE9lLBszyIbo83N3G8LFzqdedT9a1bb1xYZc0VbQCqVT-NkQX_9B12MWcIFMlVIJzyiBTVwcqp08pukZvo-_q-Kkp0fs29U-bet8m_wYCJmOu</recordid><startdate>20150101</startdate><enddate>20150101</enddate><creator>Topal, Ali Osman</creator><creator>Altun, Oguz</creator><creator>Yildiz, Yunus Emre</creator><general>Foundation of Computer Science</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20150101</creationdate><title>Micro Bat Algorithm for High Dimensional Optimization Problems</title><author>Topal, Ali Osman ; Altun, Oguz ; Yildiz, Yunus Emre</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c1735-99104f04d65c19c4d359de8b22c6bb6fb14384c5cb97b07659054024cb95292c3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2015</creationdate><topic>Algorithms</topic><topic>Balancing</topic><topic>Dynamics</topic><topic>Exploitation</topic><topic>Exploration</topic><topic>Optimization</topic><topic>Searching</topic><topic>Swarming</topic><toplevel>online_resources</toplevel><creatorcontrib>Topal, Ali Osman</creatorcontrib><creatorcontrib>Altun, Oguz</creatorcontrib><creatorcontrib>Yildiz, Yunus Emre</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>International journal of computer applications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Topal, Ali Osman</au><au>Altun, Oguz</au><au>Yildiz, Yunus Emre</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Micro Bat Algorithm for High Dimensional Optimization Problems</atitle><jtitle>International journal of computer applications</jtitle><date>2015-01-01</date><risdate>2015</risdate><volume>122</volume><issue>12</issue><spage>1</spage><epage>10</epage><pages>1-10</pages><issn>0975-8887</issn><eissn>0975-8887</eissn><abstract>Very recently bat inspired algorithms have gained increasing attention as a powerful technique for solving optimization problems. Bat algorithm (BA) is the first one in this group. It is based on the echolocation behavior of bats. BA is very good at exploitation however it is generally poor at exploration. Dynamic Virtual Bats Algorithm (DVBA) is another bat inspired algorithm, which is proposed lately. Although the algorithm is fundamentally inspired from BA, it is conceptually very different. DVBA employs just two bats and uses role based search mechanism. It is very efficient in exploration but relatively poor in exploitation, when it comes to high dimensional problems. In this paper, a novel micro-bat algorithm ( BA) is proposed which possess the advantages of both algorithms. BA employs a very small population compared to its classical version. It combines the swarming technique of bats in Bat Algorithm with the role based search in Dynamic Virtual Bats Algorithm. Our empirical results demonstrate that the proposed BA achieves a good balance between exploration and exploitation. And it exhibits a better overall performance than the standard BA with larger and smaller populations on high dimensional problems.</abstract><cop>New York</cop><pub>Foundation of Computer Science</pub><doi>10.5120/21749-5015</doi><tpages>10</tpages><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0975-8887 |
ispartof | International journal of computer applications, 2015-01, Vol.122 (12), p.1-10 |
issn | 0975-8887 0975-8887 |
language | eng |
recordid | cdi_proquest_miscellaneous_1718957717 |
source | Freely Accessible Science Journals |
subjects | Algorithms Balancing Dynamics Exploitation Exploration Optimization Searching Swarming |
title | Micro Bat Algorithm for High Dimensional Optimization Problems |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T01%3A45%3A02IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Micro%20Bat%20Algorithm%20for%20High%20Dimensional%20Optimization%20Problems&rft.jtitle=International%20journal%20of%20computer%20applications&rft.au=Topal,%20Ali%20Osman&rft.date=2015-01-01&rft.volume=122&rft.issue=12&rft.spage=1&rft.epage=10&rft.pages=1-10&rft.issn=0975-8887&rft.eissn=0975-8887&rft_id=info:doi/10.5120/21749-5015&rft_dat=%3Cproquest_cross%3E1718957717%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c1735-99104f04d65c19c4d359de8b22c6bb6fb14384c5cb97b07659054024cb95292c3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1698433129&rft_id=info:pmid/&rfr_iscdi=true |