面向路径规划问题的虚拟多任务共生生物搜索算法

针对现有共生生物搜索(SOS)算法在求解路径规划等离散型优化问题时存在性能较差、收敛速度慢等问题,提出虚拟多任务共生生物搜索(VMTSOS)算法。首先根据双向映射解码策略,实现个体连续空间位置和离散城市序列转换;然后引入多任务优化思想构建虚拟多任务环境,设计多种群同时优化同一任务,并通过停滞阈值控制种群间信息迁移频率,当主种群达到停滞阈值时,将辅助种群中部分优秀个体替换为主种群劣质个体;最后对VMTSOS算法时间和空间复杂度进行分析。仿真实验表明,VMTSOS算法在求解多数TSP时均能快速收敛至各测试实例目前的最优解,而在求解冷链物流配送问题时,具有多种群辅助机制的VMTSOS算法能较大程度地降低最优总成本。     

基于分散微粒群算法的二维模糊最大熵图像分割

该文研究了基于二维模糊信息熵的图像分割方法,针对二维模糊信息熵图像分割方法求取阈值时存在的计算复杂、时间长、实用性差等问题,提出了基于优化微粒群算法的二维最大熵图像分割方法。DPSO算法对图像的二维阈值空间进行全局搜索,并将搜索得到的二维熵最大值所对应的点灰度-区域灰度均值作为阈值进行图像分割。同时,为了避免该算法收敛到局部最优解的问题,在算法中引入了变异策略。通过实验显示了该算法在收敛性和计算效率上较QPSO在内其它优化算法具有更好的优越性。     

动态权重的蝙蝠算法在图像分割中的应用研究

传统的最小交叉熵阈值分割法（MCET）采用穷举的搜索形式，存在计算复杂度大、分割效率低的缺点，在很大程度上限制了该方法的应用。针对最小交叉熵分割法存在的不足，提出采用改进蝙蝠算法（BA）来搜索阈值的最优解。对BA算法中的权重参数做自适应调整，将随着迭代次数变化而变化的时变惯性权重策略应用于BA算法更新公式，给出三种不同的改进策略解决原始BA算法在靠近最优解时收敛速度下降的问题。将改进后的最优BA算法（IBA）应用于最小交叉熵多阈值图像分割中，与基本BA算法、改进的粒子群优化算法（IPSO）、模糊聚类方法（FC）三种方法进行对比性实验。实验结果表明，提出的IBA算法运算速度和分割精度效果明显提升。     

基于改进飞蛾扑火算法的多阈值彩色图像分割

针对彩色图像多阈值分割存在计算量大、运行时间长等问题,在飞蛾扑火算法(Moth-Flame Optimization,MFO)的基础上,引入莱维飞行策略和自适应权重变化策略,提出LSMFO算法(Levy Self-adaptive Moth Flame Optimization)对最佳分割阈值进行优化搜索。为了验证该算法的有效性,选取4幅伯克利大学经典图像,将LSMFO算法与另外5种元启发式算法进行对比。应用Otsu方法进行多阈值图像分割实验,并用SSIM、PSNR、EPI三个指标评估分割后的图像效果。实验结果显示,LSMFO算法在指标衡量比较上整体水平优于其他算法,表明该算法运行时间短、分割精度高,能够有效解决彩色图像多阈值分割问题。     

基于遗传算法的灰度-梯度熵多阈值图像分割

一些基于熵的阈值图像分割技术考虑了空间信息,从而能够提高阈值分割的性能,但是仍然不能较好地区分边缘和噪声。尽管灰度-梯度（gray-level & gradient-magnitude,GLGM）熵算法能有效地解决以上问题,但是针对多目标和复杂图像却不能有效地分割。为此,提出了一种基于遗传算法（genetic algorithm,GA）的GLGM熵多阈值快速分割方法。该方法应用积分图思想将GLGM熵算法阈值搜索空间从O(9′ L)降到O(L),并将GLGM熵算法从单阈值拓展到多阈值。最后应用基于实数编码的遗传算法搜索GLGM熵多阈值的最佳阈值。仿真结果表明,该方法能够实现图像的快速多阈值分割,适合复杂图像分割。     

基于混沌粒子群算法的多阈值图像分割

针对单阈值图像分割方法在求取比较复杂的图像时效果不理想及粒子群算法容易陷入局部最优且速度较慢等等问题,提出了基于混沌粒子群优化算法的多阈值图像分割方法。该方法利用混沌运动随机性、遍历性和初值敏感性,将混沌粒子群优化算法与多阈值法相结合作全局搜索,实验结果表明了基于混沌粒子群优化算法的多阈值图像分割法用于阈值寻优减少了搜索时间,并且运行时间不随阈值数目的增加而显著增加。     

信息迁移多任务优化共生生物搜索算法

针对现有共生生物搜索（SOS）算法只能求解单个任务，以及信息负迁移影响多任务优化（MTO）性能这两个难题，提出一个信息迁移多任务优化共生生物搜索（ITMTSOS）算法。首先基于多种群演化MTO框架，根据任务个数设置相应数量种群；然后各种群独立运行基本SOS算法，当某一种群连续若干代停滞进化时，引入个体自身最优经验和邻域最优个体以形成知识模块并将该模块迁移至该种群个体进化过程中；最后对ITMTSOS算法时间和空间复杂度进行分析。仿真实验结果表明，ITMTSOS算法同时求解多个不同形态高维函数时均能快速收敛至全局极值解0，与单任务SOS算法相比，平均运行时间最多缩短约25.25%；而在同时求解多维0/1背包问题和师生匹配问题时，所提算法在测试集weing1和weing7上的最优适应值与目前测试集公布的最优结果相比分别提高了22 767和22 602，师生最优匹配差和平均匹配差的绝对值分别下降了26和33，平均运行时间约缩短了7.69%。     

回溯搜索优化算法辅助的多阈值图像分割

阈值法是一种简单且有效的图像分割技术。然而阈值求解的计算量随阈值的增加而呈指数级别增长,这给多阈值图像分割带来巨大挑战。为了克服计算量过大问题,视多阈值分割模型为优化问题,分别将Otsu法和Kapur法作为目标函数,采用回溯搜索优化算法求解目标函数,实现多阈值图像分割。将提出的多阈值分割算法应用于自然图像分割,并与其他算法比较,实验结果说明基于回溯搜索优化算法的多阈值图像分割技术是可行的,而且具有较好的分割效果。     

基于改进探路者算法的多阈值图像分割

针对多阈值图像分割方法中存在的计算量大、运行时间长等问题,在标准探路者算法的基础上,引入Tent混沌映射初始化和自适应t分布策略,提出一种基于改进探路者算法的多阈值图像分割方法,该方法以Kapur熵为目标函数对最优分割阈值进行搜索。为了验证算法的有效性,首先通过标准测试函数验证改进探路者算法的收敛精度和收敛速度,然后将改进探路者算法与Kapur熵结合后应用于Berkeley图像数据集进行多阈值分割,并与标准探路者算法、飞蛾扑火算法、灰狼优化算法和粒子群算法进行比较和分析。实验结果表明,提出的改进探路者算法收敛速度更快、求解精度更高,较其他对比算法有着更好的分割效果,且PSNR与SSIM都有更好的表现,能有效解决多阈值图像分割问题。     

增强蒲公英算法优化乳腺癌图像多阈值分割

针对显微镜下乳腺癌病理组织图像结构复杂,细胞边界模糊等情况,基于传统的阈值分割在乳腺癌图像的分割应用中不能很好地实现把病灶区准确分离开来的问题,提出一种基于增强蒲公英优化算法(IDO)的乳腺癌图像多阈值分割方法.该方法引入IDO计算类间方差的最大值(Otsu)作为目标函数寻找最佳阈值, IDO建立回守策略解决传统蒲公英算法(DO)无限制搜索,超出像素范围的问题;引入对立式学习(OBL)避免算法陷入局部最优.实验结果表明,与哈里斯鹰算法(HHO)、人工猩猩部队优化算法(GTO)、传统蒲公英优化算法(DO)、海洋捕食者算法(MPA)相比,在相同阈值个数情况下IDO算法适应度值最大、收敛最快,并且在峰值信噪比(PSNR)、结构相似度(FSIM)、特征相似度(SSIM)这3个性能指标上也比其他对比算法更具有优势.     

Modified symbiotic organisms search for structural optimization

The structural dynamic response predominantly depends upon natural frequencies which fabricate these as a controlling parameter for dynamic response of the truss. However, truss optimization problems subjected to multiple fundamental frequency constraints with shape and size variables are more arduous due to its characteristics like non-convexity, non-linearity, and implicit with respect to design variables. In addition, mass minimization with frequency constraints are conflicting in nature which intricate optimization problem. Using meta-heuristic for such kind of problem requires harmony between exploration and exploitation to regulate the performance of the algorithm. This paper proposes a modification of a nature inspired Symbiotic Organisms Search (SOS) algorithm called a Modified SOS (MSOS) algorithm to enhance its efficacy of accuracy in search (exploitation) together with exploration by introducing an adaptive benefit factor and modified parasitism vector. These modifications improved search efficiency of the algorithm with a good balance between exploration and exploitation, which has been partially investigated so far. The feasibility and effectiveness of proposed algorithm is studied with six truss design problems. The results of benchmark planar/space trusses are compared with other meta-heuristics. Complementarily the feasibility and effectiveness of the proposed algorithms are investigated by three unimodal functions, thirteen multimodal functions, and six hybrid functions of the CEC2014 test suit. The experimental results show that MSOS is more reliable and efficient as compared to the basis SOS algorithm and other state-of-the-art algorithms. Moreover, the MSOS algorithm provides competitive results compared to the existing meta-heuristics in the literature.

     

Oppositional symbiotic organisms search optimization for multilevel thresholding of color image

Selection of optimal threshold is the most crucial issue in threshold-based segmentation. In case of color image, this task is become challenging, because conventional color image segmentation has computational complexity and also it suffers from lack of accuracy. Various techniques such as threshold based, region growing, edge detection, graph cut, pixel classification, neural network, active contour, gray level co-occurrence matrix are proposed so far for image segmentation in the literature. Out of them, threshold-based segmentation is popular for its simplicity. To address the problem of color image segmentation, we propose an enhanced version of metaheuristic optimization algorithm called Opposition based Symbiotic Organisms Search (OSOS) to solve multilevel image thresholding technique for color image segmentation by introducing opposition based learning concepts to accelerate the convergence rate and enhance the performance of standard symbiotic organisms search (SOS). The performance of the proposed OSOS based algorithm is investigated thoroughly and compared with some existing techniques like Cuckoo Search (CS), BAT algorithm (BAT), artificial bee colony (ABC) and particle swarm optimization (PSO). The comparison is made by applying the algorithm to a set of color images taken from a well-known benchmark dataset (Berkeley Segmentation Dataset (BSDS)) and some of the color images collected for the COCO dataset. It is observed from the results that the performance of the OSOS based algorithm is promising with respect to standards SOS and others in terms of the values of objective functions as well as the values of some well-defined quality metrics such as peak signal-to-noise ratio (PSNR), structure similarity index (SSIM) and feature similarity index (FSIM). The results of the proposed algorithm may encourage the scientists and engineers to apply it into pattern recognition problems.     

A Quasi-Oppositional-Chaotic Symbiotic Organisms Search algorithm for global optimization problems

This study proposes an improved version of the Symbiotic Organisms Search (SOS) algorithm called Quasi-Oppositional Chaotic Symbiotic Organisms Search (QOCSOS). This improved algorithm integrated Quasi-Opposition-Based Learning (QOBL) and Chaotic Local Search (CLS) strategies with SOS for a better quality solution and faster convergence. To demonstrate and validate the new algorithm’s effectiveness, the authors tested QOCSOS with twenty-six mathematical benchmark functions of different types and dimensions. In addition, QOCSOS optimized placements for distributed generation (DG) units in radial distribution networks and solved five structural design optimization problems, as practical optimization problems challenges. Comparative results showed that QOCSOS provided more accurate solutions than SOS and other methods, suggesting viability in dealing with global optimization problems.     

基于聚类和改进共生演算法的云任务调度策略

针对云计算环境中一些基于服务质量（QoS）调度算法存在寻优速度慢、调度成本与用户满意度不均衡的问题,提出了一种基于聚类和改进共生演算法的云任务调度策略。首先将任务和资源进行模糊聚类并对资源进行重排序放置,依据属性相似度对任务进行指导分配,减小对资源的选择范围;然后依据交叉和旋转学习机制改进共生演算法,提升算法的搜索能力;最后通过加权求和方式构造驱动模型,均衡调度代价与系统性能间关系。通过不同任务量的云任务调度仿真实验,表明该算法相比改进遗传算法、混合粒子群遗传算法和离散共生演算法,有效减少了进化代数,降低了调度成本并提升了用户满意度,是一种可行有效的任务调度算法。     

MPBOA - A novel hybrid butterfly optimization algorithm with symbiosis organisms search for global optimization and image segmentation

The conventional Butterfly Optimization Algorithm (BOA) does not appropriately balance the exploration and exploitation characteristics of an algorithm to solve present-day challenging optimization problems. For the same, in this paper, a novel hybrid BOA (MPBOA, in short) is suggested, where the BOA is combined with mutualism and parasitism phases of the Symbiosis Organisms Search (SOS) algorithm to enhance the search behaviour (both global and local) of BOA. The mutualism phase is applied with the global phase of BOA, and the parasitism phase is added with the local phase of BOA to ensure a better trade-off between the global and local search of the proposed algorithm. A suit of twenty-five benchmark functions is employed to investigate its performance with several other state-of-the-art algorithms available in the literature. Also, to check its performance statistically, the Friedman rank test and t-test are carried out. The consistency of the proposed algorithm is tested with a boxplot diagram. Also, four real-world problems are solved to check the efficiency of the algorithm in solving industrial problems. Finally, the proposed MPBOA is utilized to obtain the optimal threshold in the multilevel thresholding problem of the segmentation of individual images. From the obtained results, it is found that the overall performance of the newly introduced MPBOA is satisfactory in terms of its search behaviour and convergence time to obtain global optima.

     

A survey of symbiotic organisms search algorithms and applications

Nature-inspired algorithms take inspiration from living things and imitate their behaviours to accomplish robust systems in engineering and computer science discipline. Symbiotic organisms search (SOS) algorithm is a recent metaheuristic algorithm inspired by symbiotic interaction between organisms in an ecosystem. Organisms develop symbiotic relationships such as mutualism, commensalism, and parasitism for their survival in ecosystem. SOS was introduced to solve continuous benchmark and engineering problems. The SOS has been shown to be robust and has faster convergence speed when compared with genetic algorithm, particle swarm optimization, differential evolution, and artificial bee colony which are the traditional metaheuristic algorithms. The interests of researchers in using SOS for handling optimization problems are increasing day by day, due to its successful application in solving optimization problems in science and engineering fields. Therefore, this paper presents a comprehensive survey of SOS advances and its applications, and this will be of benefit to the researchers engaged in the study of SOS algorithm.

     

Discrete symbiotic organisms search algorithm for travelling salesman problem

A Discrete Symbiotic Organisms Search (DSOS) algorithm for finding a near optimal solution for the Travelling Salesman Problem (TSP) is proposed. The SOS is a metaheuristic search optimization algorithm, inspired by the symbiotic interaction strategies often adopted by organisms in the ecosystem for survival and propagation. This new optimization algorithm has been proven to be very effective and robust in solving numerical optimization and engineering design problems. In this paper, the SOS is improved and extended by using three mutation-based local search operators to reconstruct its population, improve its exploration and exploitation capability, and accelerate the convergence speed. To prove that the proposed solution approach of the DSOS is a promising technique for solving combinatorial problems like the TSPs, a set of benchmarks of symmetric TSP instances selected from the TSPLIB library are used to evaluate its performance against other heuristic algorithms. Numerical results obtained show that the proposed optimization method can achieve results close to the theoretical best known solutions within a reasonable time frame.     

基于混沌电磁场优化算法的多阈值彩色图像分割

为了解决彩色图像多阈值分割中计算时间长、分割精度低的问题,在电磁场优化算法(Electromagnetic Field Optimization,EFO)的基础上引入一种混沌策略用于算法初始化中,提出混沌电磁场优化算法(Chaotic Electromagnetic Field Optimization,CEFO)对图像的最佳阈值向量进行搜索。将其与另外5种优化算法进行对比,采用PSNR、MSSIM和FSIM 3个图像质量评价指标和算法运行时间(CPU Time)对6种分割算法进行分析比较。结果表明,CEFO具有收敛速度快、分割精度高的优势,能够胜任多阈值彩色图像分割的工程任务。     

基于旋转学习策略的共生生物搜索算法

为提高共生生物搜索算法(Symbiotic Organisms Search, SOS)的性能,提出一种基于旋转学习策略的共生生物搜索算法(Symbiotic Organisms Search Using Rotation-Based Learning, RSOS)。该算法将串行个体更新方式改为并行种群更新方式,提高算法收敛速度;引入遍历保优的旋转学习策略,代替寄生机制的盲目随机搜索,增大保留新个体的概率,补充种群多样性,提高算法跳出局部最优的能力。对于8个标准测试函数仿真表明,RSOS算法较基本SOS算法在收敛速度、收敛精度及稳定性上得到了明显提升。