13 November 2023 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
The constrained-domination principle (CDP) is one of the most popular constraint-handling techniques (CHTs), since it is simple, nonparametric, and easily embedded in unconstrained multiobjective evolutionary algorithms (MOEAs). However, the CDP overly emphasizes the importance of feasibility, which may lead to the search getting stuck in some locally feasible regions or locally optimal, especially when encountering problems with discontinuous and/or narrow feasible regions. This article seeks to capitalize on the strengths of the CDP while overcoming its weaknesses. Accordingly, we propose a novel constrained MOEA (called MOEA/D-LCDP), in which the CDP is applied in a local manner. Unlike most CHTs that emphasize feasibility, which use the feasibility rule in the whole search space, the proposed localized CDP only adopts the CDP within the niche. That is, to maintain the diversity of the population, only solutions within the niche are compared based on the localized CDP. The niche radius is determined a priori by the acute angle between the current subproblem and its nearest subproblem. Additionally, a population-based status detection strategy is developed to allocate computing resources more rationally, and a diversity-enhanced CDP is designed to enhance the exploitation of the search. Comprehensive experiments conducted on four benchmark test suites with a total of 34 problems and three real-world applications demonstrate that MOEA/D-LCDP is very competitive with representative algorithms.
12 July 2022 in IEEE Transactions on Evolutionary Computation
Balancing constraints and objective functions in constrained evolutionary multiobjective optimization is not an easy task. Over-emphasis on constraints satisfaction may easily lead to the search to get stuck in local optimal regions, and over-emphasis on objectives optimization may lead to substantial search resources wasted on infeasible regions. This paper proposes a constrained multiobjective optimization algorithm, called CMOEA-SDE, aiming to achieve a good balance between the above two issues. To do so, CMOEA-SDE presents a strictly constrained dominance relation and a constrained shift-based density estimation strategy. Specifically, the former defines a new dominance relation that considers both constraint satisfaction and the objective functions. It favors good feasible solutions but still leaves room for infeasible solutions to be selected. Unlike most density estimation methods, which only consider the diversity of solutions, our shift-based density estimator covers both the feasibility and the diversity of solutions. That is, our estimator shifts the solutions’ positions based on the extent of the constraints they violate so that solutions violating constraints more severely are shifted to crowded areas, thus being eliminated early. Systematic experiments were conducted on four benchmark test suites and six real-world constrained multiobjective optimization problems. The experimental results suggest that the proposed algorithm can achieve very competitive performance against state-of-the-art constrained multiobjective evolutionary algorithms.
5 October 2024 in Applied Soft Computing
PSPonnuthurai Nagaratnam Suganthan
Ponnuthurai Nagaratnam Suganthan
3 June 2025 in Swarm and Evolutionary Computation
25 June 2024 in Information Sciences
26 January 2026 in IEEE Transactions on Intelligent Transportation Systems
Multimodal freight transportation is essential for enhancing logistics efficiency and reducing costs, with route optimization as its core component. However, uncertainties are prevalent in multimodal systems, posing challenges for the construction and validation of simulation models. Furthermore, the involvement of multiple stakeholders introduces conflicting optimization objectives. Effectively balancing these objectives to maximize overall benefits has become a critical issue that requires resolution. For the multimodal transport route optimization problem in hybrid uncertainty environments (e.g., there are uncertainties in transportation demand, transportation time, and transfer time), this study constructs a multiobjective optimization model based on fuzzy numbers. The complexity of the model is reduced by introducing the chance-constrained programming theory. To solve the model, a data-driven multi-objective evolutionary algorithm is designed, integrating Monte Carlo simulation with surrogate models to effectively reduce the computational cost of uncertainty estimation. Furthermore, a constraint prioritization strategy is developed to handle multiple conflict objectives, and complex constraints efficiently. Simulation results demonstrate that the proposed algorithm exhibits excellent performance across networks of varying scales, providing robust decision support for multimodal transportation decision-making.