A Multi-Strategy Secretary Bird Optimization Algorithm for Aesthetic Color and Layout Optimization in Visual Art Design Authors: Lin Zhou, Xinyu Cai Published: 2026 ABSTRACT Visual art and graphic design tasks, such as generating a harmonious color palette or arranging the elements of a page, can be naturally formulated as mathematical optimization problems whose objective functions are non-convex, multimodal, and non-differentiable. Metaheuristic algorithms are well-suited to such problems. The secretary bird optimization algorithm (SBOA) is a recently proposed bio-inspired metaheuristic that mimics the hunting and predator-escaping behaviors of secretary birds, and it has shown competitive performance. However, SBOA still suffers from insufficient population diversity, premature convergence, and an unbalanced transition between exploration and exploitation, which limits its accuracy on complex design problems. To overcome these limitations, this paper proposes a multi-strategy secretary bird optimization algorithm (MSSBOA) that integrates three improvement strategies. First, a good point set initialization is employed to generate a low-discrepancy initial population that covers the search space more uniformly and enriches population diversity. Second, a lens opposition-based learning strategy is applied to the inferior individuals to help the population escape local optima while preserving the elite. Third, an adaptive Cauchy–Gaussian mutation is imposed on the best individual to balance global exploration and local exploitation throughout the search. The performance of MSSBOA is comprehensively examined on the CEC2017 benchmark suite in 10, 30, 50, and 100 dimensions and compared with the basic SBOA and nine state-of-the-art algorithms; the results are analyzed by the Friedman test, the Nemenyi post hoc test and the Wilcoxon rank-sum test. MSSBOA is then applied to two representative visual-design optimization problems: aesthetic color-harmony palette generation and graphic-layout aesthetics optimization. In all cases, MSSBOA outperforms the basic SBOA and the competing algorithms in terms of convergence speed, stability, and solution quality, confirming its effectiveness for computational-aesthetics applications in art design. 1. Introduction With the rapid development of the digital creative industry, art and design activities increasingly rely on computational tools to improve both efficiency and quality [1,2]. Many tasks in visual art and graphic design—such as selecting a harmonious color palette, arranging the elements of a poster, or tuning the form parameters of a product—can be abstracted as the search for an optimal solution within a large feasible space [3]. Such design optimization problems aim to maximize or minimize one or more aesthetic objective functions while satisfying perceptual and functional constraints, and they are widespread in fields ranging from visual communication and packaging to interface and environmental design [4]. Unfortunately, these objectives are usually nonlinear, multimodal, non-differentiable, and strongly coupled with human perception, which makes them extremely difficult for classical optimization techniques [5]. Mathematically, many of them belong to the class of NP-hard problems, for which an exact optimum cannot be obtained in polynomial time [6,7]. Optimization methods are generally divided into deterministic and stochastic categories. Deterministic algorithms, such as linear, branch-and-bound, and dynamic programming, rely on rigorous mathematical properties, such as continuity, convexity, and differentiability [8]. When confronted with non-differentiable objectives or numerous local optima, they easily fall into local optimality and exhibit limited adaptability [9]. Consequently, there is an urgent need for more efficient, stable, and broadly applicable algorithms to cope with the increasingly complex design solution space. Metaheuristic algorithms are stochastic optimization techniques that require no gradient information and instead use probabilistic strategies to iteratively explore and exploit the problem space [10]. By balancing global exploration with local exploitation, they effectively mitigate premature convergence and can obtain near-optimal solutions at an acceptable computational cost [11,12]. Because they are flexible, metaheuristics have been successfully applied to path planning [13,14], parameter extraction [15], wireless sensor network coverage [16], image segmentation [17,18], and feature selection [19,20]. Drawing inspiration from nature and social systems, metaheuristic algorithms can be grouped into four primary categories according to their source of inspiration, as shown in Figure 1. Evolution-based algorithms imitate natural selection, mutation, and crossover, including the genetic algorithm (GA) [21], evolution strategy (ES) [22], differential evolution (DE) [23], the covariance matrix adaptation evolution strategy (CMA-ES) [24], the human evolutionary optimization algorithm (HEOA) [25], and chaotic evolution optimization (CEO) [26]. Physics-based algorithms draw on physical laws, such as the multi-verse optimizer (MVO) [27], Fick’s law algorithm (FLA) [28], snow ablation optimization (SAO) [29], the polar lights optimizer (PLO) [30], special relativity search (SRS) [31], mirage search optimization (MSO) [32], and the Kepler optimization algorithm (KOA) [33]. Mathematics-based algorithms are inspired by mathematical functions and theories, such as the sine cosine algorithm (SCA) [34], the arithmetic optimization algorithm (AOA) [35], quasi-random fractal search (QRFS) [36], the weighted average algorithm (WAA) [37], the triangulation topology aggregation optimizer (TTAO) [38], and the exponential-trigonometric optimization algorithm (ETOA) [39]. Swarm-based algorithms simulate the collective behavior of groups of organisms, including particle swarm optimization (PSO) [40], ant colony optimization (ACO) [41], the grey wolf optimizer (GWO) [42], the artificial lemming algorithm (ALA) [43], the crayfish optimization algorithm (COA) [44], dwarf mongoose optimization (DMO) [45], the sled dog optimizer (SDO) [46], the slime mold algorithm (SMA) [47], Arctic puffin optimization (APO) [48], the Genghis Khan shark optimizer (GKSO) [49], the prairie dog optimization algorithm (PDOA) [50], and the secretary bird optimization algorithm (SBOA) [51]. Despite their success, metaheuristic algorithms still face challenges. They can readily obtain good solutions but rarely guarantee the global optimum, and they often struggle to balance exploration and exploitation, so that the population may homogenize and become trapped in local optima. More importantly, the no free lunch theorem proves that no single algorithm can outperform all others on every possible problem [52]. This motivates researchers to design or improve algorithms tailored to specific problem classes—here, the aesthetic optimization problems that arise in visual art and graphic design. The secretary bird optimization algorithm (SBOA) is a bio-inspired metaheuristic proposed by Fu et al. in 2024 [51]. It models the survival behavior of secretary birds, using a three-stage strategy for hunting snakes during the exploration phase and two strategies for escaping predators during the exploitation phase. Owing to its simple structure and strong search ability, SBOA has attracted considerable attention, and several improved variants have been developed. Qin et al. proposed a multi-strategy improvement SBOA that incorporates incremental-PID feedback regulation and cooperative camouflage to solve engineering problems [53]. Wang et al. enhanced SBOA with multi-strategy fusion and a Cauchy–Gaussian crossover to improve convergence accuracy [54]. Mai et al. integrated logistic-tent chaotic initialization and a crossover strategy into SBOA for engineering design [55], and Seyyedabbasi developed a multi-strategy variable SBOA for global optimization and UAV path planning [56]. These studies enhance SBOA from different angles, yet the inability of the basic SBOA to maintain population diversity and to balance exploration and exploitation in complex, perception-driven design problems remains an objective limitation. Guided again by the no free lunch theorem, this paper proposes a new SBOA variant, the multi-strategy secretary bird optimization algorithm (MSSBOA), and applies it to aesthetic optimization in visual art design. The choice of SBOA as the basis of this work deserves explicit justification, since many metaheuristic algorithms could, in principle, have been improved instead. Three reasons motivated this choice. First, and most importantly, the structure of SBOA matches the structure of the design problems studied here. Aesthetic objectives, such as Equations (19) and (22), are sums of competing terms whose trade-off surface has many broad, shallow optima rather than one sharp optimum, so an algorithm must survey widely before committing. SBOA is one of the few recent metaheuristics that splits its exploration phase into three explicitly time-gated stages with qualitatively different step distributions—a differential perturbation, a Brownian move towards the elite, and a Levy flight—which gives a scheduled and inspectable progression from survey to commitment, and which provides well-defined points at which further operators can be inserted. Second, SBOA is economical: it has a single control parameter beyond the population size, so a study of added operators is not confounded by the tuning of the base algorithm. Third, SBOA is recent enough that its weaknesses are documented but not yet addressed for this problem class, and it has been shown competitive on standard suites [51], which makes it a meaningful baseline rather than a strawman. MSSBOA combines three improvement techniques. First, a good point set initialization replaces the random initialization of SBOA, generating a low-discrepancy population that uniformly covers the search domain and enhances population diversity from the outset. Second, a lens opposition-based learning strategy is applied to the inferior individuals to generate refracted candidate solutions, which strengthens the ability of the algorithm to escape local optima while protecting the elite individuals. Third, an adaptive Cauchy–Gaussian mutation is imposed on the best individual, where a Cauchy-dominated perturbation promotes global exploration in the early stage and a Gaussian-dominated perturbation refines the solution in the later stage, thereby balancing exploration and exploitation. MSSBOA was comprehensively examined on the CEC2017 benchmark functions and compared with the basic SBOA and several advanced algorithms, with the differences analyzed by the Friedman test, the Nemenyi post hoc test and the Wilcoxon rank-sum test. Finally, MSSBOA was applied to color-harmony palette optimization and graphic-layout aesthetics optimization to confirm its ability to solve realistic art-design problems. The main contributions of this paper are as follows:(1)An improved SBOA variant, namely MSSBOA, is proposed by integrating good point set initialization, lens opposition-based learning, and adaptive Cauchy–Gaussian mutation.(2)The performance of MSSBOA was comprehensively examined on the CEC2017 test suite in four dimensions and confirmed by the Friedman test, the Nemenyi test and the Wilcoxon rank-sum test.(3)MSSBOA was successfully applied to aesthetic color-harmony palette optimization and graphic-layout aesthetics optimization, demonstrating its adaptability to real-world visual art and graphic design problems. (1)An improved SBOA variant, namely MSSBOA, is proposed by integrating good point set initialization, lens opposition-based learning, and adaptive Cauchy–Gaussian mutation. An improved SBOA variant, namely MSSBOA, is proposed by integrating good point set initialization, lens opposition-based learning, and adaptive Cauchy–Gaussian mutation. (2)The performance of MSSBOA was comprehensively examined on the CEC2017 test suite in four dimensions and confirmed by the Friedman test, the Nemenyi test and the Wilcoxon rank-sum test. The performance of MSSBOA was comprehensively examined on the CEC2017 test suite in four dimensions and confirmed by the Friedman test, the Nemenyi test and the Wilcoxon rank-sum test. (3)MSSBOA was successfully applied to aesthetic color-harmony palette optimization and graphic-layout aesthetics optimization, demonstrating its adaptability to real-world visual art and graphic design problems. MSSBOA was successfully applied to aesthetic color-harmony palette optimization and graphic-layout aesthetics optimization, demonstrating its adaptability to real-world visual art and graphic design problems. The remainder of this paper is organized as follows. Section 2 describes the structure and details of the basic SBOA. Section 3 presents the proposed MSSBOA, including the three improvement strategies, the overall framework with pseudo-code and flowchart, and the complexity analysis. Section 4 reports the parameter sensitivity analysis, ablation experiments, and a comprehensive comparison on the CEC2017 benchmark functions. Section 5 applies MSSBOA to two visual-design optimization problems. Finally, Section 6 concludes the paper, discusses the limitations of MSSBOA, and outlines future research directions. 2. Secretary Bird Optimization Algorithm SBOA is a population-based metaheuristic inspired by the survival behavior of secretary birds in the African savanna [51]. The algorithm starts from a randomly generated population and improves the candidate solutions through an exploration phase that mimics the three-stage strategy of hunting snakes and an exploitation phase that mimics two strategies of escaping predators. When the stopping criterion is met, SBOA outputs the best solution. The detailed formulation is described as follows. 2.1. Initialization Like most metaheuristics, SBOA initializes a population of N candidate solutions that are uniformly distributed within the search space. Each individual is generated by the following equation.(1)xi,j=lbj+r⋅ubj−lbj, i=1,2,…,N, j=1,2,…,D where xi,j denotes the j-th dimension of the i-th individual, r is a random number in 0,1, lbj and ubj are the lower and upper bounds of the j-th dimension, N is the population size, and D is the dimension of the problem. After initialization, all individuals are evaluated and sorted according to their fitness; a minimization problem is considered in this paper, so individuals with smaller fitness are ranked higher. 2.2. Exploration Phase: Hunting Strategy In the wild, a secretary bird spends a long time searching for prey, such as snakes, before launching a rapid attack. SBOA divides the exploration phase into three successive stages according to the iteration counter. In the first stage (searching for prey), the individual is updated by a differential perturbation of two randomly selected individuals, as in Equation (2).(2)xi,jnew,P1=xi,j+xrand1,j−xrand2,j⋅R1 where xrand1,j and xrand2,j are the positions of two randomly selected individuals, and R1 is a random number in 0,1. In the second stage (consuming prey), the individual approaches the best individual under a Brownian-motion perturbation, as in Equation (3).(3)xi,jnew,P1=Xbest,j+exp t/T4⋅RB−0.5⋅Xbest,j−xi,j where Xbest,j is the j-th dimension of the best individual, t and T are the current and maximum numbers of iterations, and RB is a Brownian-motion random vector drawn from the standard normal distribution. In the third stage (attacking prey), the individual performs a Levy flight around the best individual, as in Equation (4).(4)xi,jnew,P1=Xbest,j+1−t/T2t/T⋅xi,j⋅RL where RL=0.5⋅LevyD is a Levy-flight step vector. The three stages are selected by the iteration counter: the first stage is used when t QIO > LSHADE > RIME > GKSO > COA > MRFO > SMA > SBOA > GWO > SCA. This clearly reflects the substantial improvement of MSSBOA over the basic SBOA. To further quantify the pairwise differences, the Nemenyi post hoc test was applied, as shown in Figure 10, where algorithms connected by a line are not significantly different. MSSBOA is located at the leftmost position and is significantly superior to most comparison algorithms. Finally, the Wilcoxon rank-sum test was conducted to compare MSSBOA with each algorithm on every function. Table 12 reports the statistics, where ‘+’, ‘=’, and ‘−’ denote the numbers of functions on which MSSBOA is significantly better than, similar to, and worse than the comparison algorithm, respectively. The results are visualized in Figure 11. The statistical picture deserves a more balanced reading than a count of wins. Against the weaker comparison algorithms, the outcome is unambiguous—MSSBOA wins all 116 cases against the basic SBOA, GWO, and SCA—but against the two strongest competitors, it is not. MSSBOA loses 15 of 116 cases to QIO and 15 of 116 to LSHADE, that is 12.9% of the comparisons in each case, and a further 18 and 19 cases are statistically indistinguishable. Taken together, MSSBOA is significantly better than QIO on 71.6% of the cases and LSHADE on 70.7%, so on roughly three cases in ten, these two algorithms are at least as good as the proposed method. This is a real limitation and not a rounding error. Table 13 breaks the losses down by function class, using the per-function ranks of Table A5, Table A6, Table A7 and Table A8. The losses are not distributed uniformly. Against QIO, they concentrate on the composition functions F21–F30, which account for eight of the 16 rank losses; however, composition functions supply only 40 of the 116 cases, and none occur on a unimodal function. Against LSHADE, the profile is the opposite, as 10 of the 20 rank losses fall on the unimodal and simple multimodal functions F1–F10, which is consistent with the linear population size reduction and archive of LSHADE being particularly effective on landscapes with a single dominant basin. The pattern indicates a specific weakness rather than a general one, where the elite-guided intensification of MSSBOA pays off on hybrid landscapes but is less effective when a problem has many equally deep basins whose relative depth only becomes apparent late in the run, which is precisely the structure of the CEC2017 composition functions. The dimensional trend confirms this reading. The mean rank gap between MSSBOA and QIO falls monotonically from 2.103 at 30 dimensions to 1.103 at 100 dimensions, and the corresponding gap against RIME falls from 2.379 to 1.517, while the number of losses against QIO, RIME, and LSHADE rises from 0, 0, and 3 at 30 dimensions to 7, 6, and 6 at 100 dimensions. The advantage of MSSBOA is therefore real but shrinking in dimension, and the results should be read as establishing that MSSBOA is competitive with the best available algorithms at high dimension rather than dominating them. 4.5. Comparison with Recent SBOA Variants and Multi-Strategy Algorithms Section 1 reviews several recent SBOA variants, and a proper assessment requires comparisons against them all rather than only against the basic algorithm. MSSBOA is therefore compared with MISBOA, CGSBOA, and LTSBOA, and with two recent multi-strategy algorithms from outside the SBOA family, MS-TSA and I-CPA. Their base algorithms, TSA and CPA, are included as well, so that the gain each variant achieves over its own base is visible rather than assumed. The source codes of these methods are not publicly distributed, so each was re-implemented from the equations, control parameters, and pseudo-code of the corresponding paper; the implementations are released with this article. Table 14 reports the Friedman mean ranks on the CEC2017 suite in 10 and 30 dimensions over 30 independent runs, and Table 15 compares the pairwise Wilcoxon rank-sum outcome of MSSBOA against each of the other eight algorithms at a significance level of 0.05. The overall order by average Friedman rank is LTSBOA > SBOA > CGSBOA > MSSBOA > MISBOA > I-CPA > CPA > TSA > MS-TSA, with MSSBOA ranking fourth out of nine at 3.862. MSSBOA obtains a better average rank than MISBOA, TSA, MS-TSA, CPA, and I-CPA and a worse one than SBOA, CGSBOA, and LTSBOA. MS-TSA does not improve on TSA in our re-implementation and I-CPA improves on CPA; where a variant does not reproduce the gain its authors had reported, the most likely cause is our reading of the published description rather than the method itself, and the released code is the means to check that. A note on how the comparison in this subsection was produced. Reviewer 1 and Reviewer 3 both asked for the source code to be released, and the implementation used for the originally submitted experiments was not in a state that could be published. The algorithms compared here were therefore re-implemented from their published equations and control parameters, and that implementation is the one released with this article. Because it is an independent implementation, its absolute values are not directly comparable with those of Table 10, Table 11 and Table 12, which come from the original code; what it supports is the relative comparison within this subsection, in which every algorithm runs under an identical evaluation budget and is charged for every function evaluation it performs, including those consumed by auxiliary operators. Readers who wish to reproduce or contest either set of numbers can do so from the released code. MSSBOA is more often significantly better than it is worse against MISBOA, TSA, MS-TSA, CPA, and I-CPA, and the reverse holds against SBOA, CGSBOA, and LTSBOA. Over the 58 algorithm-function cases per competitor, the great majority of comparisons are not significant at all—49 of 58 against CGSBOA, the largest of such counts—so the above rankings should be read as a tendency over the suite rather than as a series of decisive pairwise victories. 5. Application to Visual Art Design Problems In this section, MSSBOA was applied to two representative optimization problems in visual art and graphic design—aesthetic color-harmony palette generation and graphic-layout aesthetics optimization—to evaluate its ability to solve real-world design problems. Both problems were formulated as continuous optimization problems and solved by the eleven algorithms with the parameter settings of Table 2. Interestingly, both the optimizer (inspired by the secretary bird) and the color-harmony objective (rooted in the harmonious color schemes observed in nature) are bio-inspired, which makes the application a natural fit for biomimetic design. 5.1. Aesthetic Color-Harmony Palette Optimization Generating a harmonious yet expressive color palette is a fundamental task in visual design [70,71]. Following the harmonic-template theory of Matsuda and the color-harmonization model of Cohen-Or et al. [70,72], each color is represented in the HSV space as ck=Hk,Sk,Vk, where the hue Hk∈[0∘,360∘) lies on a cyclic hue wheel. The geodesic (arc-length) distance between two hues is defined by Equation (15). Colors are represented in the HSV space, and the choice is dictated by the objective rather than by convenience. Matsuda’s harmonic templates, on which the harmony term is built, are defined as angular sectors on the hue wheel, meaning the model needs hue as an explicit cyclic coordinate; RGB has no such coordinate, and CIE L*a*b* carries hue only implicitly as the argument of a*,b*, which would make the sector membership test and template rotation awkward, and would prevent the arc distance of Equation (15) from being written in closed form. HSV also supplies the two quantities that the remaining terms need directly: saturation, which weights how much hue information a color actually carries; and value, which supplies the tonal contrast. The decision variables are therefore tripled (hi, si, vi)—i = 1, …, K, with hi in [0, 360], si in [0.2, 1], and vi in [0.15, 1]—the lower bounds on saturation and value exclude the near-gray and near-black regions in which hues are perceptually meaningless. Where a perceptually uniform measurement is required, the optimized palette is converted to CIE L*a*b* for reporting. The harmonic template is not learned from the data; it is selected, per candidate palette, from the fixed catalog of Matsuda in the parameterization of Cohen-Or et al. [70,72]. Table 16 lists the seven chromatic templates, each of which consists of one or two sectors of fixed angular width whose relative offsets are fixed; the achromatic N-type template is excluded because it carries no hue information. A template may be rotated rigidly on the hue wheel by an arbitrary angle α, which is the only free parameter. For a given palette, the disharmony energy of Equation (16) is minimized over the seven templates and over α, sampled on a five-degree grid, and the best-fitting pair (template, α) is the one reported in Figure 12a. In other words, the template shown in that figure is an output of the evaluation, not an input chosen by the designer, which is what allows the same objective to score palettes of different harmonic families on a common scale. biomimetics-11-00533-t016_Table 16Table 16The seven chromatic harmonic templates of Matsuda in the parameterization of Cohen-Or et al. [70].TemplateSectors (Offset, Angular Width)Harmonic Relationi-type(0 deg, 18 deg)monochromatic; one narrow hue bandV-type(0 deg, 93.6 deg)analogous; one broad hue bandL-type(0 deg, 18 deg) and (90 deg, 79.2 deg)one narrow accent plus a broad band in quadratureI-type(0 deg, 18 deg) and (180 deg, 18 deg)complementary; two narrow opposite bandsT-type(0 deg, 180 deg)half of the hue wheelY-type(0 deg, 93.6 deg) and (180 deg, 18 deg)broad band plus an opposite narrow accentX-type(0 deg, 93.6 deg) and (180 deg, 93.6 deg)two broad opposite bands (15)dSθ1,θ2=min θ1−θ2, 360∘−θ1−θ2 A harmonic template Tm is a set of one or two sectors on the hue wheel that can be rotated by an angle α. The saturation-weighted disharmony energy of a K-color palette with respect to the best-fitting template is given by Equation (16).(16)Eharm=minm∈M minα∈[0∘,360∘)∑k=1Kρ Hk m,α⋅Sk where ρHk∣m,α is the arc distance from Hk to the nearest sector of the rotated template (zero when the hue falls inside a sector), and M is the set of seven chromatic templates. The disharmony energy is converted into a harmony term in 0,1 by Equation (17).(17)harm=1−Eharm180∘⋅∑k=1KSk A purely harmonic palette may collapse into nearly identical colors, so a hue-diversity term is introduced by Equation (18), which is the mean normalized pairwise arc distance of the hues; that is, this is zero for a monochrome palette and one when every pair of hues is complementary. A tonal-contrast term, CON=min1,maxivi−minivi0.6, rewards a usable lightness spread and saturates once the palette spans sixty per cent of the value range, which is the spread a palette needs before text set in one of its colors stays legible on another.(18)div=2KK−1∑i