IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v271y2015icp269-287.html
   My bibliography  Save this article

Artificial bee colony algorithm with multiple search strategies

Author

Listed:
  • Gao, Wei-feng
  • Huang, Ling-ling
  • Liu, San-yang
  • Chan, Felix T.S.
  • Dai, Cai
  • Shan, Xian

Abstract

Considering that the solution search equation of artificial bee colony (ABC) algorithm does well in exploration but badly in exploitation which results in slow convergence, this paper studies whether the performance of ABC can be improved by combining different search strategies, which have distinct advantages. Based on this consideration, we develop a novel ABC with multiple search strategies, named MuABC. MuABC uses three search strategies to constitute a strategy candidate pool. In order to further improve the performance of the algorithm, an adaptive selection mechanism is used to choose suitable search strategies to generate candidate solutions based on the previous search experience. In addition, a candidate solution is generated based on a Gaussian distribution to exploit the search ability. MuABC is tested on a set of 22 benchmark functions, and is compared with some other ABCs and several state-of-the-art algorithms. The comparison results show that the proposed algorithm offers the highest solution quality, the fastest global convergence, and the strongest robustness among all the contenders on almost all the cases.

Suggested Citation

  • Gao, Wei-feng & Huang, Ling-ling & Liu, San-yang & Chan, Felix T.S. & Dai, Cai & Shan, Xian, 2015. "Artificial bee colony algorithm with multiple search strategies," Applied Mathematics and Computation, Elsevier, vol. 271(C), pages 269-287.
    • Handle: RePEc:eee:apmaco:v:271:y:2015:i:c:p:269-287
    DOI: 10.1016/j.amc.2015.09.019
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300315012370
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2015.09.019?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Socha, Krzysztof & Dorigo, Marco, 2008. "Ant colony optimization for continuous domains," European Journal of Operational Research, Elsevier, vol. 185(3), pages 1155-1173, March.
    2. Szeto, W.Y. & Wu, Yongzhong & Ho, Sin C., 2011. "An artificial bee colony algorithm for the capacitated vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 215(1), pages 126-135, November.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Yetgin, Zeki & Abaci, Hüseyin, 2021. "Honey formation optimization framework for design problems," Applied Mathematics and Computation, Elsevier, vol. 394(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Amjad Hudaib & Mohammad Khanafseh & Ola Surakhi, 2018. "An Improved Version of K-medoid Algorithm using CRO," Modern Applied Science, Canadian Center of Science and Education, vol. 12(2), pages 116-116, February.
    2. Liao, Tianjun & Stützle, Thomas & Montes de Oca, Marco A. & Dorigo, Marco, 2014. "A unified ant colony optimization algorithm for continuous optimization," European Journal of Operational Research, Elsevier, vol. 234(3), pages 597-609.
    3. Qi Liu & Gengzhong Feng & Giri Kumar Tayi & Jun Tian, 2021. "Managing Data Quality of the Data Warehouse: A Chance-Constrained Programming Approach," Information Systems Frontiers, Springer, vol. 23(2), pages 375-389, April.
    4. Luo, Qifang & Yang, Xiao & Zhou, Yongquan, 2019. "Nature-inspired approach: An enhanced moth swarm algorithm for global optimization," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 159(C), pages 57-92.
    5. Qiang Yang & Xu Guo & Xu-Dong Gao & Dong-Dong Xu & Zhen-Yu Lu, 2022. "Differential Elite Learning Particle Swarm Optimization for Global Numerical Optimization," Mathematics, MDPI, vol. 10(8), pages 1-32, April.
    6. Guo, Jiaqi & Long, Jiancheng & Xu, Xiaoming & Yu, Miao & Yuan, Kai, 2022. "The vehicle routing problem of intercity ride-sharing between two cities," Transportation Research Part B: Methodological, Elsevier, vol. 158(C), pages 113-139.
    7. Min-Xia Zhang & Hong-Fan Yan & Jia-Yu Wu & Yu-Jun Zheng, 2020. "Quarantine Vehicle Scheduling for Transferring High-Risk Individuals in Epidemic Areas," IJERPH, MDPI, vol. 17(7), pages 1-17, March.
    8. Baozhen Yao & Qianqian Yan & Mengjie Zhang & Yunong Yang, 2017. "Improved artificial bee colony algorithm for vehicle routing problem with time windows," PLOS ONE, Public Library of Science, vol. 12(9), pages 1-18, September.
    9. Xiang, Yi & Zhou, Yuren & Liu, Hailin, 2015. "An elitism based multi-objective artificial bee colony algorithm," European Journal of Operational Research, Elsevier, vol. 245(1), pages 168-193.
    10. Hong, Wei-Chiang, 2010. "Application of chaotic ant swarm optimization in electric load forecasting," Energy Policy, Elsevier, vol. 38(10), pages 5830-5839, October.
    11. Ana Maria A. C. Rocha & M. Fernanda P. Costa & Edite M. G. P. Fernandes, 2017. "On a smoothed penalty-based algorithm for global optimization," Journal of Global Optimization, Springer, vol. 69(3), pages 561-585, November.
    12. Fu, Hao & Lam, William H.K. & Shao, Hu & Ma, Wei & Chen, Bi Yu & Ho, H.W., 2022. "Optimization of multi-type sensor locations for simultaneous estimation of origin-destination demands and link travel times with covariance effects," Transportation Research Part B: Methodological, Elsevier, vol. 166(C), pages 19-47.
    13. Chen, Jingxu & Liu, Zhiyuan & Zhu, Senlai & Wang, Wei, 2015. "Design of limited-stop bus service with capacity constraint and stochastic travel time," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 83(C), pages 1-15.
    14. Long, Jiancheng & Szeto, W.Y. & Huang, Hai-Jun, 2014. "A bi-objective turning restriction design problem in urban road networks," European Journal of Operational Research, Elsevier, vol. 237(2), pages 426-439.
    15. Tingxi Wen & Zhongnan Zhang & Kelvin K L Wong, 2016. "Multi-Objective Algorithm for Blood Supply via Unmanned Aerial Vehicles to the Wounded in an Emergency Situation," PLOS ONE, Public Library of Science, vol. 11(5), pages 1-22, May.
    16. Behzad Ataie-Ashtiani & Hamed Ketabchi, 2011. "Elitist Continuous Ant Colony Optimization Algorithm for Optimal Management of Coastal Aquifers," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 25(1), pages 165-190, January.
    17. Md. Hossain & A. El-shafie, 2013. "Intelligent Systems in Optimizing Reservoir Operation Policy: A Review," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 27(9), pages 3387-3407, July.
    18. Ines Sbai & Saoussen Krichen & Olfa Limam, 2022. "Two meta-heuristics for solving the capacitated vehicle routing problem: the case of the Tunisian Post Office," Operational Research, Springer, vol. 22(1), pages 507-549, March.
    19. Warren Liao, T. & Chang, P.C., 2010. "Impacts of forecast, inventory policy, and lead time on supply chain inventory--A numerical study," International Journal of Production Economics, Elsevier, vol. 128(2), pages 527-537, December.
    20. Aderemi Oluyinka Adewumi & Olawale Joshua Adeleke, 2018. "A survey of recent advances in vehicle routing problems," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 9(1), pages 155-172, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:271:y:2015:i:c:p:269-287. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.