5 August 2022 in IEEE Transactions on Evolutionary Computation
Multiobjective-based constraint-handling techniques are popular in evolutionary constrained single-objective optimization. However, most of these techniques run into troubles when dealing with constrained multiobjective optimization problems (CMOPs). That is, they have difficulty optimizing too many objective functions, are ineffective in maintaining population diversity, or are challenged in establishing appropriate additional objective functions. As a remedy to these limitations, we propose a novel technique called NRC for handling CMOPs. The novelty of NRC lies in its three sorting procedures: nondominated sorting, reversed nondominated sorting, and constrained crowding distance sorting, which are performed in sequence to provide driving forces toward the Pareto front (PF) of a transformed unconstrained multiobjective optimization problem (treating the overall constraint violation as an additional objective function), the boundary front, and the constrained PF, respectively. With the combination of these three different forces, NRC can conveniently approach the desired PF from diverse search directions. The effectiveness of NRC is experimentally verified. Also, we incorporate NRC into a two-archive mechanism and develop a novel constrained multiobjective evolutionary algorithm, called NRC2. Comprehensive experiments on 49 benchmark CMOPs and 21 real-world ones demonstrate that NRC2 is significantly superior or comparable to six state-of-the-art constrained evolutionary multiobjective optimizers on most test instances.
31 August 2020 in IEEE Access
For the split delivery vehicle routing problem in the distribution link of logistics where the optimization objective is to minimize the total distance of the transportation path, a hybrid discrete differential evolution (HDDE) algorithm is adopted in this study. The algorithm applies the encoding and decoding method based on the remaining vehicle capacity to split the demand of customer point and adjust the splitting node to the optimal position of its path. In order to avoid the prematurity of the algorithm, the perturbation mechanism is added, i.e., the three-point insertion method is used in the crossover stage. To ensure the higher quality of the solution, the idea of tabu search is introduced in three cases: initial population generation, selection operation and local optimal situation. Finally, through the numerical experiments based on benchmark data, the HDDE algorithm is compared with other competitive algorithms to demonstrate its domination.
21 November 2025 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
When employing evolutionary algorithms (EAs) to solve multimodal optimization problems (MMOPs), effectively utilizing diversity information is crucial to prevent the population from converging to a single peak. This requires balancing diversity and objective value—a challenge that inherently constitutes a penalty problem. Although some implicit penalty methods have been proposed to address this issue, most lack flexibility in penalty formulation. In this study, we present a novel explicit penalty method (EPM) designed to effectively leverage diversity information for multimodal optimization. First, the diversity of a solution is quantified by its distance to the nearest neighbor with a better objective value. Then, an explicit penalty function is formulated by integrating diversity and objective value. This function facilitates the capture of multiple peaks and balances the search among them. If a reasonable number of peaks are identified, a local search is applied to each for refinement; otherwise, a global search is conducted across the decision space. Through this adaptive process, EPM locates multiple optima both efficiently and accurately. Extensive experiments demonstrate that EPM outperforms several multimodal optimization methods, including 11 popular approaches, eight recent state-of-the-art algorithms, and an IEEE CEC competition winner. Moreover, even when integrated with classic differential evolution (DE), EPM exhibits highly competitive performance.
1 April 2021 in Computational Mathematics and Mathematical Physics
A modified Trapezoidal Broyden’s method for nonlinear equations is presented. We design and implement an alternative approximation to Jacobian matrix of Trapezoidal Broyden’s method. This method improve the efficiency by reducing the number of iterations required by the Broyden’s method, and solve the problem that the approximate matrix almost singular or singular at some points. The local convergence properties of the new method is presented. Numerical results illustrate that the proposedmethod is efficient and robust.