IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v206y2023icp470-486.html
   My bibliography  Save this article

Birefringence learning: A new global optimization technology model based on birefringence principle in application on artificial bee colony

Author

Listed:
  • Shao, Peng
  • Liang, Ying
  • Li, Guangquan
  • Li, Xing
  • Yang, Le

Abstract

Optimization technologies play a key role in addressing sophisticated optimization problems. However, with the increasing scale and dimension of problems, the performance of optimization technologies has been greatly challenged. To better address them, a new global optimization model is proposed inspired by the birefringence phenomenon, namely a birefringence learning (BRL) model which simulates the birefringence phenomenon of two refracted beams formed by the incident beam in the nature when the natural light enters some certain mediums. To substantiate the optimization performance of the model, it is applied to the artificial bee colony algorithm (ABC) to enhance its global optimization performance further and make its local optimization (exploitation) and global optimization (exploration) balance to some extent. In ABC, the BRL model as a mutation operator is employed in the phase of the scout bee to decrease the probability of ABC trapping into the local extreme region and then a novel ABC algorithm using the birefringence learning (NABC-BRL) is proposed. Via conducting abundant numerical experiments on some universally known benchmark functions, the experimental results and analysis indicate that it can obtain higher accuracy of solutions and faster convergence on majority of benchmark functions compared with some well-acknowledged algorithms, which also proves the effectiveness of global optimization of the BRL model.

Suggested Citation

  • Shao, Peng & Liang, Ying & Li, Guangquan & Li, Xing & Yang, Le, 2023. "Birefringence learning: A new global optimization technology model based on birefringence principle in application on artificial bee colony," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 206(C), pages 470-486.
  • Handle: RePEc:eee:matcom:v:206:y:2023:i:c:p:470-486
    DOI: 10.1016/j.matcom.2022.11.021
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475422004700
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.matcom.2022.11.021?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. Lei Liu & Guangda Song & Lele Qin, 2022. "The Prediction of Sports Economic Development Prospect in Different Regions by Improved Artificial Bee Colony Algorithm," Discrete Dynamics in Nature and Society, Hindawi, vol. 2022, pages 1-8, March.
    2. Socha, Krzysztof & Dorigo, Marco, 2008. "Ant colony optimization for continuous domains," European Journal of Operational Research, Elsevier, vol. 185(3), pages 1155-1173, March.
    3. Zhengguang Xian & Jun Xie & Yanfei Wang, 2013. "Representative Artificial Bee Colony Algorithms: A Survey," Springer Books, in: Zhenji Zhang & Runtong Zhang & Juliang Zhang (ed.), Liss 2012, edition 127, pages 1419-1424, Springer.
    Full references (including those not matched with items on IDEAS)

    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. 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.
    4. 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.
    5. Hong, Wei-Chiang, 2010. "Application of chaotic ant swarm optimization in electric load forecasting," Energy Policy, Elsevier, vol. 38(10), pages 5830-5839, October.
    6. 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.
    7. 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.
    8. 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.
    9. 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.
    10. 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.
    11. Broderick Crawford & Ricardo Soto & Gino Astorga & José García & Carlos Castro & Fernando Paredes, 2017. "Putting Continuous Metaheuristics to Work in Binary Search Spaces," Complexity, Hindawi, vol. 2017, pages 1-19, May.
    12. Asghar Mahdavi & Mohammad Shiri, 2015. "An augmented Lagrangian ant colony based method for constrained optimization," Computational Optimization and Applications, Springer, vol. 60(1), pages 263-276, January.
    13. Stefano Bromuri, 2019. "Dynamic heuristic acceleration of linearly approximated SARSA( $$\lambda $$ λ ): using ant colony optimization to learn heuristics dynamically," Journal of Heuristics, Springer, vol. 25(6), pages 901-932, December.
    14. Ahmad Wedyan & Jacqueline Whalley & Ajit Narayanan, 2017. "Hydrological Cycle Algorithm for Continuous Optimization Problems," Journal of Optimization, Hindawi, vol. 2017, pages 1-25, December.
    15. Peter Korošec & Jurij Šilc, 2013. "The continuous differential ant-stigmergy algorithm for numerical optimization," Computational Optimization and Applications, Springer, vol. 56(2), pages 481-502, October.
    16. Khaled Loukhaoukha, 2013. "Image Watermarking Algorithm Based on Multiobjective Ant Colony Optimization and Singular Value Decomposition in Wavelet Domain," Journal of Optimization, Hindawi, vol. 2013, pages 1-10, June.
    17. Bera, Sasadhar & Mukherjee, Indrajit, 2016. "A multistage and multiple response optimization approach for serial manufacturing system," European Journal of Operational Research, Elsevier, vol. 248(2), pages 444-452.
    18. Anand Kumar & Manoj Thakur & Garima Mittal, 2018. "A new ants interaction scheme for continuous optimization 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(4), pages 784-801, August.
    19. Nikolaos Ploskas & Nikolaos V. Sahinidis, 2022. "Review and comparison of algorithms and software for mixed-integer derivative-free optimization," Journal of Global Optimization, Springer, vol. 82(3), pages 433-462, March.
    20. Ozgur Kisi & Armin Azad & Hamed Kashi & Amir Saeedian & Seyed Ali Asghar Hashemi & Salar Ghorbani, 2019. "Modeling Groundwater Quality Parameters Using Hybrid Neuro-Fuzzy Methods," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 33(2), pages 847-861, January.

    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:matcom:v:206:y:2023:i:c:p:470-486. 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: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.