• 【智能优化算法-晶体结构算法】基于晶体结构算法求解多目标优化问题附Matlab代码


    1 内容介绍

    Metaheuristics are computational procedures that intelligently lead the search process through the efficient exploration of the search space associated with an optimization problem. With the progressive outburst of problems with large data sets in various fields, there is an ongoing quest for enhancing existing metaheuristic algorithms as well as developing new ones with greater accuracy and efficiency. In general, a powerful and efficient metaheuristic algorithm is based on a rich inspiration source, implemented effectively through a precise mathematical model. Aiming to develop a highly efficient, nature-inspired optimization algorithm, here we propose a novel metaheuristic called Crystal Structure Algorithm (CryStAl). This method is chiefly inspired by the principles underlying the formation of crystal structures from the addition of the basis to the lattice points, which is a natural phenomenon that can be seen in the symmetric arrangement of constituents (i.e. atoms, molecules, or ions) in crystalline minerals such as quartz. A total number of 239 mathematical functions which are categorized into four different groups are utilized to evaluate the overall performance of the proposed method. To validate the results of this novel algorithm, 12 different classical and modern metaheuristic algorithms are selected from the literature. The minimum, mean, and standard deviation values alongside the number of function evaluations for CryStAl and the other metaheuristics for a specific tolerance are calculated and presented accordingly. The obtained results, further supported by a complete statistical analysis, demonstrated that the proposed algorithm is capable of providing very competitive results, outperforming the other metaheuristics in most cases.

    2 仿真代码

    %__________________________________________________________________ %

    %

    % ----------------------------------------------------------------------- %

    function [occ_cell_index occ_cell_member_count]=GetOccupiedCells(pop)

        GridIndices=[pop.GridIndex];

        

        occ_cell_index=unique(GridIndices);

        

        occ_cell_member_count=zeros(size(occ_cell_index));

        m=numel(occ_cell_index);

        for k=1:m

            occ_cell_member_count(k)=sum(GridIndices==occ_cell_index(k));

        end

        

    end

    3 运行结果

    4 参考文献

    [1] Talatahari, S. , et al. "Crystal Structure Algorithm (CryStAl): A Metaheuristic Optimization Method." IEEE Access PP.99(2021):1-1.​

    博主简介:擅长智能优化算法、神经网络预测、信号处理、元胞自动机、图像处理、路径规划、无人机等多种领域的Matlab仿真,相关matlab代码问题可私信交流。

    部分理论引用网络文献,若有侵权联系博主删除。

     

  • 相关阅读:
    【Vue】VueX 的语法详解(2)
    智能优化与机器学习结合算法实现数据分类matlab代码清单
    【数据结构】队列(C语言实现)
    记一次SQL优化
    树莓派简单驱动编写以及代码测试
    Vue封装一个按钮组件(不使用框架)
    Uniapp零基础开发学习笔记(1) - 项目初步创建
    仅靠阿里 P9 分享的 Redis 工作手册,拿到 60W 年薪 Offer
    懒人福音:Java版Webhook机器人,一键开启‘躺赢’模式
    英译汉文章在线翻译器:批量翻译、素材收集、图片处理
  • 原文地址:https://blog.csdn.net/qq_59747472/article/details/126122841