An artificial bee colony algorithm for multi-objective optimisation
Graphical abstract
Introduction
Problems composed of two or three conflicting objectives that must be satisfied simultaneously are called multi-objective optimisation problems (MOPs) [1], and problems with more than three conflicting objectives are called many-objective optimisation problems (MaOPs). MaOPs are common in the real world [2], [3]. As for MOPs, their solution is quite different from that of single-objective problems. When solving MOPs, the goal is to find the best possible trade-off among all the objectives. However, a single-objective problem always has a single solution. Pareto optimality is commonly used to deal with MOPs. The decision variables corresponding to all the solutions in the Pareto front are called the Pareto optimal set. The representative algorithms are Pareto-based algorithms, such as NSGA-II [4] and SPEA2 [5]. Pareto-based multi-objective evolutionary algorithms (MOEAs) are very effective when solving low dimension MOPs because they achieve an approximate set in a single run through their population-based property. However, MOEAs do not perform properly when handling MaOPs because the percentage of non-dominated solutions tends to reach 100% as the number of objectives increases. Thus, identifying the differences between solutions is difficult [6]. Furthermore, maintaining diversity for a high dimensional space is difficult because the similarity in such a space cannot be easily estimated. As a response to these challenges, new algorithms have been developed in recent years.
Given the disadvantages of Pareto-based algorithms in dealing with MaOPs, the intuitive idea is to modify the Pareto concept to augment the selection pressure in a high dimensional space. Some relaxed forms of Pareto dominance, such as [7] and [8], are better approaches than the original Pareto dominance in terms of adding selection pressure towards the true Pareto front. Thus, MOEA ( [9]) is proposed; it shows good performance in solving MaOPs. Other strategies of modified dominance definitions include [10], fuzzy dominance [11] and preference order ranking [12]. In [13], a grid-based EA was proposed; a new grid dominance strategy ensures simultaneous convergence and distribution. Another idea is to enhance Pareto dominance by combining it with other convergence-metric approaches. In [14], the crowding distance assignment used in NSGA-II was replaced with substitute distance assignment; the new assignment could measure the degree to which a solution is nearly Pareto-dominated by another solution. In [15], the selection pressure for the solutions far from the Pareto front was increased by using an achievement function to compare the solutions that are close to the Pareto front.
The second type is decomposition-based algorithms; its representative algorithm is MOEA/D [16]. In MOEA/D, each solution in its population is associated with a different subproblem, which works in a collaborative way. Although a number of MOEA/D variants have recently been proposed [17], [18], [19], [20], [21], [22], the study of MOEA/D is still in its infancy. MOEA/D is not specially designed to solve MaOPs, but it is proved to be a good alternative to MaOPs.
The third class is performance indicator-based designs. The individual in the population is compared with other individuals in terms of fitness, which is determined by the indicator values between individuals. Indicator-based algorithms account for not only the convergence but also the diversity of the population. The representative algorithms are the indicator-based evolutionary algorithm (IBEA) [23], the S-metric selection-based multi-objective evolutionary algorithm (SMS-MOEA) [24], the many-objective metaheuristic algorithm based on R2 indicator (MOMBI) [25] and the hypervolume-based evolutionary algorithm (HyPE) [26]. These algorithms effectively handle convergence and diversity simultaneously when used to deal with MaOPs. However, their computational costs are huge, especially for HyPE.
A few approaches that do not belong to the above three categories exist. First proposed in 2014, NSGA-III [27] utilises a set of predefined, evenly distributed reference points to manage the diversity of candidate solutions. A reference vector-guided evolutionary algorithm [28] also adopts reference points that are used to generate a subset of preferred Pareto optimal solutions. In [29], the two-archive algorithm was presented with the following framework: two archives are developed with indicator and decomposition as bases, and a new diversity maintaining strategy is proposed. Other algorithms based on objective space reduction have been found to perform well in solving MaOPs [30], [31], [32], [33].
The above studies provide a variety of alternatives to address MaOPs, and many of them significantly contribute to the development of this domain. Inspired by the indicator-based algorithms for dealing with MaOPs, the present study proposes an indicator-based artificial bee colony (ABC) algorithm. As mentioned previously, balancing convergence and diversity to solve MaOPs is not an easy task. Most MOEAs share two common but conflicting goals: to minimise the distance to the Pareto-optimal set and to maximise the diversity within the approximation of the Pareto-optimal [34]. Two main performance assessment metrics measure convergence and diversity simultaneously for a high dimensional space: hypervolume (HV) [34] and quality indicator [35]. The quality indicator is adopted in the proposed approach because of the high computational cost of HV.
The ABC algorithm is an evolutionary algorithm introduced in 2005 [36]. It involves three types of bees that perform different tasks by cooperating with one another. Employed bees generate new food sources by exchanging information with its neighbours. If a new food source is better than the old one, then the new food source replace the old food source. Onlooker bees choose one of these food sources on the basis of the quality of the food sources shared by employed bees. The onlookers then try to improve the quality of such food sources. Scout bees find the poorest food sources which have not been optimised in a limited number of cycles and reinitialise them.
The standard ABC performs well when dealing with single-objective optimisation and achieves good solution quality and high convergence speed. In the present study, the ABC algorithm is combined with a quality indicator to solve MOPs and MaOPs. The proposed algorithm called is based on the ABC algorithm; its basic colony is composed of three types of bees: employed bees, onlooker bees and scout bees. The main contributions of the present study are summarised as follows:
- 1)
The basic artificial bee mutation operator is easy to trap into local Pareto fronts. Thus, a combined mutation operator is suggested.
- 2)
The preference information based on a quality indicator is used. Within , the updating methods of individuals in the population and archive are both based on the indicator. A fixed-size archive is used to maintain the non-dominated solutions produced in each generation. The fitness assignment based on the quality indicator attempts to rank population members according to their usefulness in relation to the optimisation goal.
- 3)
As to the uncertainty of the true Pareto front, the contributions of each individual to the population are different; hence, more computational resources should be allocated to outstanding individuals. In this study, the selection mechanism of individuals is based on their quality indicators combined with a power law probability when onlooker bees select food sources.
The rest of the paper is organised as follows. Section 2 introduces the basic concept of MOPs and the survey of related works about multi-objective ABC algorithms. Section 3 presents the details of the proposed multi-objective ABC algorithm called for handling MOPs and MaOPs. Section 4 analyses and discusses the experimental results to solve DTLZ [37], LZ09 [50], and CEC09 [38] test instances. In this section, is compared with several other state-of-the-art algorithms. Section 5 concludes the paper.
Section snippets
Description of multi-objective problems
An unconstrained k-objective optimisation problem can be described by the following equation:
where Ω is the decision (variable) space, x is a decision vector, consists of m real-valued objective functions, and is the objective space. Thus, the goal is to determine the points that yield the optimum values for all m objective functions simultaneously. Pareto dominance is formally defined as follows:
A vector is said to dominate if
Proposed approach
Unlike the abovementioned studies on multi-objective ABC algorithms, which are mainly based on Pareto dominance, the proposed approach in the present study is designed by evaluating the solution on the basis of the quality indicator . The proposed algorithm uses an external archive to store non-dominated solutions. Given the fixed archive size, an indicator-based archive management strategy is adopted to ensure that high quality non-dominated solutions can be placed in the archive and that
Experimental: results
In this section, the algorithm is compared with several other popular state-of-the-art algorithms, namely, NSGA-II [4], MOEA/D [16], MOMBI [25], SPEA2 [5], and MOABC [49]. MOABC is a multi-objective optimization method based on the artificial bee colony, and its qualities of the food sources are computed based on the Pareto dominance notion.The experiments are conducted on widely used test suits: the CEC09 test instances (including UF instances and CF instances) [18], LZ09 instances [50]
Experiments on power law parameter a
Selecting the food source to exploit, that is, the computational resource assignment for different food sources, is an important task in . In this study, the bees select food sources to update their positions according to a power law probability, with which the food sources with high quality have a high probability to be selected for exploration. The power law parameter a is an important adjustable parameter. In this section, we conduct experiments to test the sensitivity of the
Conclusion
In this study, a novel ABC algorithm called based on performance indicators is presented. In multi-objective optimisation, no sufficient preference information is available to guide the evolution process. Hence, determining whether one non-dominated solution is better than other solutions is difficult. In the proposed approach, an archive based on a binary quality indicator and Pareto dominance is used to preserve the diversity of the non-dominated solutions found in the search process.
Acknowledgments
The authors would like to thank the editors and anonymous referees for their helpful comments and suggestions on improving the presentation of this paper. This work is supported by the the National Natural Science Foundation of China under Grant Nos. 61301298, 61401283 and 61373158, and Science and Technology Project of Guangdong Province under Grant No. 2016B090918084.
References (56)
- et al.
A study of two penalty-parameterless constraint handling techniques in the framework of MOEA/D
Appl. Soft Comput.
(2013) - et al.
SMS-EMOA. Multiobjective selection based on dominated hypervolume
Eur. J. Oper. Res.
(2007) - et al.
A hybrid multi-objective artificial bee colony algorithm for burdening optimization of copper strip production
Appl. Math. Model.
(2012) - et al.
Artificial Bee Colony (ABC) for multi-objective design optimization of composite structures
Appl. Soft Comput.
(2011) - et al.
An elitism based multi-objective artificial bee colony algorithm
Eur. J. Oper. Res.
(2015) - et al.
Elite-guided multi-objective artificial bee colony algorithm
Appl. Soft Comput.
(2015) - et al.
A multi-objective artificial bee colony algorithm
Swarm Evol. Comput.
(2012) - et al.
A dynamic multi-colony artificial bee colony algorithm for multi-objective optimization
Appl. Soft Comput.
(2015) - (2012)
- et al.
Many-objective Optimization: An Engineering Design Perspective. Evolutionary Multi-criterion Optimization
(2005)
A fast and elitist multiobjective genetic algorithm: NSGA-II
IEEE Trans. Evol. Comput.
SPEA2: improving the strength Pareto evolutionary algorithm
Evol. Methods Des. Optim. Control Appl. Ind. Probl.
Evolutionary many-objective optimization: a short review
IEEE Congr. Evol. Comput.
Combining convergence and diversity in evolutionary multiobjective optimization
Evol. Comput.
Failure of Pareto-based MOEAs: does non-dominated really mean near to optimal
Evolutionary Computation, 2001. Proceedings of the 2001 Congress On. IEEE
Evaluating the epsilon-domination based multi-objective evolutionary algorithm for a quick computation of Pareto-optimal solutions
Evol. Comput.
A new evolutionary algorithm for solving many-objective optimization problems
IEEE Trans. Syst. Man Cybern. B: Cybern.
Fuzzy-dominance and its application in evolutionary many objective optimization
Computational Intelligence and Security Workshops, International Conference On. IEEE Computer Society
An investigation on preference order ranking scheme for multiobjective evolutionary optimization
IEEE Trans. Evol. Comput.
A grid-based evolutionary algorithm for many-objective optimization
IEEE Trans. Evol. Comput.
An Alternative Preference Relation to Deal with Many-Objective Optimization Problems. Evolutionary Multi-Criterion Optimization
MOEA/D. A multiobjective evolutionary algorithm based on decomposition
IEEE Trans. Evol. Comput.
An evolutionary many-objective optimization algorithm based on dominance and decomposition
IEEE Trans. Evol. Comput.
The performance of a new version of MOEA/D on CEC09 unconstrained MOP test instances
Evolutionary Computation, 2009. CEC ‘09. IEEE Congress On. IEEE
An adaptive evolutionary multi-objective approach based on simulated annealing
Evol. Comput.
Decomposition-based multiobjective evolutionary algorithm with an ensemble of neighborhood sizes
IEEE Trans. Evol. Comput.
Cited by (85)
An improved two-archive artificial bee colony algorithm for many-objective optimization
2024, Expert Systems with ApplicationsPerformance indicator-based multi-objective reliability optimization for multi-type production systems with heterogeneous machines
2023, Reliability Engineering and System SafetyCitation Excerpt :For performance indicator-based designs, the individual in the population is compared with other individuals in terms of fitness, which is determined by the indicator values between individuals. Moreover, indicator-based algorithms account not only for convergence but also for the diversity of the population [16,21,22]. In RAPs/RRAPs, the issue of MOPs has been popular both in the past and in recent years [23–32].
A task allocation algorithm for a swarm of unmanned aerial vehicles based on bionic wolf pack method
2022, Knowledge-Based SystemsTask package division method for the integrated scheduling framework of mixed model car-sequencing problem
2022, Computers and Industrial EngineeringOn the cooperation of meta-heuristics for solving many-objective problems: An empirical analysis including benchmark and real-world problems
2022, Expert Systems with ApplicationsA two-archive model based evolutionary algorithm for multimodal multi-objective optimization problems
2022, Applied Soft Computing