Search

Nature- and society-inspired metaheuristic algorithms have recently become the most promising technological model. To solve more complex optimization problems and complicated engineering applications, this paper proposes a new people duality psychological tendency and feedback mechanism-based Inherited Optimization Algorithm(IOA), which is inspired by people showing positive-negative duality cognitive tendency and adaptive feedback behavior when selecting information resources with different identity attributes. The IOA algorithm contains the symmetric two exploration phases. The exploitation phase adaptively regulates the dualistic psychological balance of people in inheriting the information resources with better existence value through a feedback regulation mechanism controlled by the profitability awareness to increase population diversity. This paper qualitatively and quantitatively evaluates the optimization performance of IOA on 84 benchmarks, including swarm convergence behavior, effectiveness, convergence, robustness, and significance. The scalability of the IOA is investigated using the CEC2017 suites. The algorithm performance in solving constrained optimization is verified on 8 engineering problems. All statistical results of the IOA are compared with the most promising 12 metaheuristics, which shows that the absolute computational efficiency of IOA on four types of functions is 95%, 96.67%, 80.95%, and 76.92%, respectively, the average rank (rank sum ratio) of IOA is 1.08 (1.19%) among the 13 algorithms, ranking first. The Wilcoxon signed rank test results on the CEC2017 suites show that IOA contains 1437 significance indicators out of 1440 comparisons, with the proportion of significant differences 99.79%, which suggests the proposed IOA maintains efficient search efficiency. [ABSTRACT FROM AUTHOR]

When dealing with Constrained Multi-objective Optimization Problems (CMOPs) and struggling to enhance feasibility, convergence and diversity, the researchers of Constrained Multi-objective Optimization Evolutionary Algorithms (CMOEAs) gravitate toward feasibility or take precedence to preserve well-converged solutions ignoring diversity in the past. To compensate for the defects, the paper proposes CMOEA-MSWA to guide the search of infeasible regions by coordinated strategy of archive and weight vectors. Firstly, the archive carrying the information of population diversity updates the weight vectors. Secondly, the updated weight vectors perpetuate the diversity information to the search of infeasible regions. The circular effects between strategies promote the detection of infeasible solutions with good objectives and exhibit competitive performance in terms of spread and evenness. To testify the versatility the CMOEA-MSWA in enhancing diversity, the comprehensive performance is evaluated firstly and the diversity analysis of the CMOEA-MSWA is carried out on four benchmark suites with 34 test instances, where the number of objectives for some of test problems is scaled from three to five. In comparison with five state-of-the-art CMOEAs, the proposed algorithm yields highly competitive performance in diversity on different types of CMOPs. In addition, the effectiveness of collaboration between archive and weight vectors on handling infeasible solutions is also verified. [ABSTRACT FROM AUTHOR]

This paper introduces the Human Evolutionary Optimization Algorithm (HEOA), a metaheuristic algorithm inspired by human evolution. HEOA divides the global search process into two distinct phases: human exploration and human development. Logistic Chaos Mapping is employed for initialization. In the human exploration phase, an initial global search is conducted, followed by the human development phase, in which the population is categorized into leaders, explorers, followers, and losers, each utilizing distinct search strategies. The convergence speed and search accuracy of HEOA are evaluated using 23 well-established test functions. Furthermore, the algorithm's applicability in engineering optimization is assessed with four engineering problems. A comparative analysis with ten other algorithms highlights HEOA's effectiveness, as evidenced by various performance metrics and statistical measures. Consistently, the results demonstrate that HEOA surpasses most current state-of-the-art algorithms in approximating optimal solutions for complex global optimization problems. The MATLAB code for HEOA is available at https://github.com/junbolian/HEOA.git. [ABSTRACT FROM AUTHOR]

How to balance the satisfaction of constraints and the optimization of objective functions is one of the key issues to solve constrained multi-objective optimization problems (CMOPs), especially when the constraints are complex. Although many algorithms have been designed to handle this, most of them are still unable to effectively handle CMOPs with complex constraints. Based on the above issue, this paper proposes a framework for bi-directional search, which evolves two populations (P 1 and P 2). P 1 aims to search the constrained Pareto front (CPF) from the infeasible side of the objective space, and P 2 from the feasible side, aiming to achieve a more efficient and comprehensive bi-directional search for the CPF. To ensure the diversity, we adopt a preferred weight vector selection strategy to choose potential mating parents, which improves the search capability for the marginal CPF. Furthermore, to coordinate the interaction between the two populations, we propose an environmental selection strategy to select the offspring generated by P 1 and P 2 under the same weight vector with the better fitness to update the populations respectively, and the fitness is evaluated based on the different constraint relaxations of the two populations, to update them respectively. Extensive experiments indicate that our proposed algorithm has significantly better results or was at least competitive when compared to eight state-of-the-art methods. [ABSTRACT FROM AUTHOR]

Most multiple unmanned aerial vehicle (UAV) path planning problems are often treated as constrained single-objective optimization problems. How to consider them as constrained multi-objective optimization problems (CMOPs) have seldom been explored in this field. To fill this gap, this paper firstly constructs multiple UAV path planning problem as a CMOP with two objectives and five constraints. Then a novel multi-objective evolutionary algorithm with a two-fold constraint-handling mechanism is proposed for multiple UAV path planning. To cope with constraints effectively, a constraint-handling technique based on a progressive weight vector strategy is proposed. Besides, a constraint repair technique that considers the flying environment is designed to further guide the algorithm to find feasible promising regions. Eight multiple UAV path planning test instances with different solving difficulties are constructed. Subsequently, they are used to validate the performance of the proposed algorithm. The experimental results demonstrate that the proposed algorithm is superior over four compared algorithms in terms of obtaining a set of better-distributed Pareto optimal solutions. [ABSTRACT FROM AUTHOR]

Despite the inherent stability of Quadratic Approximation based Jaya (JaQA) in solving constrained optimization problems, its effectiveness in exploring the search space is limited. Furthermore, the user-defined penalty parameter utilized to mitigate constraint violation poses another impediment to the efficiency of JaQA. In light of these drawbacks, this paper introduces a new meta-heuristic algorithm, namely Self-adaptive Multi-population Quadratic Approximation guided Jaya (SMP-JaQA). The three additional key features of the SMP-JaQA over JaQA are (i) the inclusion of a multi-population technique to ensure sufficient diversity in the search process (to address the exploration), (ii) a self-adaptation strategy to make it more user-friendly for complex problems in various domains (to address the exploration further), and (iii) a dynamic penalty factor (to automate the penalty parameter). These novel changes help strike a balance between exploration and exploitation too by identifying potential areas in the search space and reduces the likelihood of getting stuck in a local optima. The validity of SMP-JaQA is tested over 18 and 28 benchmark functions of varying dimensions from the CEC-2010 and CEC-2017 test suites, respectively. In order to justify the wide applicability of the proposed algorithm, a set of four real-life constrained problems (includes two mechanical design problems, an electronics design problem and an agricultural problem) are being solved through SMP-JaQA. A thorough analysis of computational outcomes, exploration–exploitation phases, and scalability are presented to shed light on the efficacy and stability levels of SMP-JaQA. The results are compared with those of other state-of-the-art meta-heuristics using Friedman's and Wilcoxon Signed-Rank tests. The outcomes indicate that SMP-JaQA produces reasonable solutions in terms of global optimality and solution quality. [ABSTRACT FROM AUTHOR]

Traditional differential evolution (DE) algorithms have functional limitations in effectively addressing increasingly intricate numerical optimization problems. The key to responding to this challenge is to strike a suitable balance between exploration and exploitation. Exploration is used to find the global optimal solution, and exploitation is used to improve the accuracy of the global optimal solution. Therefore, this study introduces a novel differential evolution algorithm with a stage stratification method and a dual balanced mutation strategy framework, named SbmDE. To enhance the balance between convergence and diversity, the population is stratified into exploration and exploitation layers based on the size of the fitness value and evolutionary period. In the exploitation layer, a hybridization mutation is applied as the first mutation. A novel dual improved mutation operation is proposed and applied to the exploration layer. For the first mutation, the hybridization mutation is used in the same manner as for the exploitation layer. For the secondary mutation, two improved mutation strategies are proposed to alleviate premature convergence at the early stage of evolution and to enhance the local neighborhood search at a later stage, named DE/ranking-to-rand/1 and DE/best-current-dev/1. Experiments were conducted on the CEC2017 benchmark suite, which contains 29 single-objective real-parameter numerical optimization problems, to evaluate the performance of the proposed algorithm. Compared with 11 state-of-the-art algorithms, the results demonstrate the superiority of the proposed algorithm, which does not increase the time complexity. Additionally, based on the four engineering design problems, the proposed algorithm is fully competent in solving practical constrained optimization problems. • A stage stratification method is proposed to divide population. • Dual mutation is proposed and applied to the exploration layer. • Proposed two improved mutation strategies applied to the secondary mutation. • SbmDE obtains better values than the other algorithms in the paper. • SbmDE is applied to four engineering design problems. [ABSTRACT FROM AUTHOR]

The main challenge in addressing constrained multi-objective optimization problems (CMOPs) lies in achieving a balance among convergence, diversity, and feasibility. To address this issue, this paper proposes a constrained multi-objective evolutionary algorithm with Pareto estimation via neural network named CMOEA-PeNN. In order to exploit and explore the decision space, the proposed algorithm employs a dual-population mechanism, which is trained with a self-organizing map (SOM). Firstly, the population distribution structure in decision space is mapped to objective space while preserving neighborhood information, and then the neuron weight is utilized to estimate the Pareto front (PF). Secondly, a novel approach is devised to preserve the feasibility of the population and enhance the estimation of the Pareto front by SOM. The achievement scalarizing function (ASF) is employed to choose promising solutions. This strategy could guide the population toward the optimal solution while exploring the small feasible regions. Finally, the performance of CMOEA-PeNN is compared with five state-of-the-art constrained multi-objective evolutionary algorithms (CMOEAs) on three widely used benchmark problems and a real-world problem. The experimental results show that CMOEA-PeNN could archive competitive performance in solving CMOPs. [ABSTRACT FROM AUTHOR]

The fuzzy analytic hierarchy process (FAHP) is a widely implemented approach for determining the weights of criteria and alternatives from pairwise comparison matrices. FAHP methodology uses triangular fuzzy as a tool for the decision-maker to arrange judgments expressed as the pairwise comparison matrix elements. FAHP is then modeled into a nonlinear constrained optimization problem to increase the decision maker's satisfaction. However, in some cases, this model would yield multiple optimal solutions. Logarithmic fuzzy preference programming (LFPP) is offered to overcome this unfavorable situation. Nevertheless, LFPP includes a parameter in its model for which no specific method is available to determine. Meanwhile, the differences in parameter values will affect the solution. In the worst case, the weights obtained will be inaccurate. As a result, the decision taken based on the weights will be biased and unreliable. This issue is particularly important when it requires high accuracy. It includes the decisions on the portfolio investment, economic, human capital measurements, and shipping registry. Another crucial thing is that the use of the natural logarithm function in the LFPP method has the potential for an overflow effect at the computational stage when it is implemented to derive the weights. Therefore, in the application context, it is significant to improve the shortcomings of the LFPP method in terms of parameter involvement and the use of the logarithmic function. For this purpose, this paper proposes a non-parameter transcendental fuzzy preference programming (TFPP) model for deriving the optimal weights from fuzzy pairwise comparison matrices. The TFPP is obtained by investigating different functions' effects on fuzzy preference programming (FPP). The proposed method has a more general form. One of the specific forms of the TFPP is chosen in a computational implementation. The numerical results confirm that the TFPP optimization model is reliable in obtaining the optimum global weights. The comparison with the LFPP method also shows that the TFPP is more efficient. • Logarithmic fuzzy preference programming (LFPP) includes a parameter in its model. • The parameter incorporated in LFPP affects the optimality of the solution. • Some transcendental functions employed to replace the logarithmic function in LFPP. • Transcendental fuzzy preference programming performs better than the LFPP. [ABSTRACT FROM AUTHOR]