The algorithm, called GSCMO, was developed by Junhua Liu, Lei Fan, Wei Zhang, Yuelin Gao, Mengnan Tian, Meng Wang, and Xueqing Yan, with affiliations spanning Xi’an Polytechnic University, Northeastern University, and North Minzu University. Their work, published in the journal Cluster Computing, introduces a dual-population framework in which two separate pools of candidate solutions evolve in parallel, each guided by a different kind of information extracted from the population itself. The key insight is that the process of generating new solutions, often treated as a mechanical afterthought in algorithm design, can dramatically shape whether the search succeeds or stalls.

To understand why this matters, it helps to picture how evolutionary algorithms work. Inspired by biological evolution, these methods maintain a population of candidate solutions, evaluate how well each one performs, and then repeatedly select the fittest individuals, mix their traits, and introduce random mutations to produce offspring. Over many generations, the population converges toward a set of trade-off solutions known as the Pareto front, which represents the best possible compromises among competing objectives. When constraints enter the picture, the search space becomes littered with infeasible regions where solutions violate one or more limits, and the algorithm must somehow navigate toward the narrow corridors where feasibility and optimality intersect.

Most existing constrained multi-objective evolutionary algorithms concentrate their cleverness on selection, deciding which solutions survive to the next generation based on objective values and constraint violations. The GSCMO team argues that this focus leaves a critical lever untouched. If the offspring are generated poorly, no amount of sophisticated selection can rescue the search. A population that clusters prematurely in one corner of the decision space, the high-dimensional region where the actual decision variables live, may never discover the feasible pockets that hold the best answers. Conversely, a population that wanders too widely may never refine promising solutions to the precision that real engineering demands.

GSCMO addresses this by splitting its labor between a main population and an auxiliary population, each equipped with its own information-assisted generation strategy. The main population’s strategy draws on entropy information, a statistical measure borrowed from information theory that reflects how the population is distributed across the decision space. When entropy indicates that the population is becoming too concentrated, the algorithm dynamically adjusts its mutation strength to push individuals apart, enhancing diversity and maintaining broad exploration. This adaptive tuning gives the algorithm a better shot at locating potential feasible regions that a rigid, fixed-strength mutation scheme would simply walk past.

The auxiliary population takes the opposite approach, exploiting neighborhood information that captures the proximity relationships between individual solutions. Using Manhattan distance, the grid-like distance measure that sums absolute differences along each dimension, the algorithm identifies the closest neighbors of each individual. It then selects parents from within these tight local neighborhoods to breed high-quality offspring, sharpening the algorithm’s ability to conduct fine-grained local search. In effect, the two populations form a division of labor: one casts a wide net across the decision space while the other drills down into the most promising areas, and the interplay between them balances exploration against exploitation, the classic tension at the heart of all search algorithms.

The technical elegance of this design lies in how the information is gathered. Neither entropy nor neighborhood structure requires extra evaluations of the objective functions, which are often expensive in real applications such as aerodynamic shape optimization or optimal power flow analysis. Instead, both measures are computed from the population’s existing coordinates and performance records, making the assistance essentially free. This matters because evaluation budgets in industrial optimization are frequently so tight that even a handful of additional function calls per generation can double the computational cost of a run.

The team put GSCMO through extensive experiments against a battery of state-of-the-art constrained multi-objective evolutionary algorithms, testing on benchmark suites that include the well-known CEC 2009 test instances and the difficulty-adjustable constrained multiobjective test problem toolkit developed by Fan and colleagues. Performance was assessed using standard quality indicators and validated statistically with the Wilcoxon rank-sum test, the field’s conventional tool for determining whether one algorithm’s advantage over another is genuine or merely noise. The reported results show that GSCMO achieves high competitiveness across the comparison set, performing particularly well on problems where the feasible regions are hard to reach and where maintaining decision-space diversity determines whether those regions are found at all.

The significance of the work extends beyond a single algorithm’s benchmark scores. Constrained multi-objective optimization underpins applications from collaborative path planning of multi-unmanned surface vehicles to constrained aerodynamic design, and the field has seen a wave of innovation in recent years, including two-archive strategies, push-and-pull search frameworks, coevolutionary schemes, and evolutionary multitasking approaches that borrow knowledge from auxiliary problems. By shifting attention to the solution generation process itself and showing that population statistics like entropy can steer mutation adaptively, GSCMO adds a new dimension to this design space that other researchers can build upon.

The research, supported by the National Natural Science Foundation of China and the Scientific and Technological Program of Xi’an, arrives at a moment when the demands on optimization algorithms are growing faster than classical methods can handle. As systems become more interconnected and design spaces more tangled with constraints, the difference between a mediocre and an excellent search algorithm translates directly into cheaper designs, safer operations, and better use of computational resources. The GSCMO team’s message is deceptively simple: look at how your solutions are born, not just how they are judged, and the search will thank you. For a discipline that has spent decades perfecting the art of selection, that shift in perspective may prove to be one of the most consequential ideas in constrained evolutionary computation.

Subject of Research: A dual-population constrained multi-objective evolutionary algorithm using entropy and neighborhood information for solution generation

Article Title: Information-assisted solution generation based dual population constrained multi-objective evolutionary algorithm

Article References: Liu, J., Fan, L., Zhang, W., Gao, Y., Tian, M., Wang, M., & Yan, X. (2026). Information-assisted solution generation based dual population constrained multi-objective evolutionary algorithm. Cluster Computing, 29(12), Article 712. https://doi.org/10.1007/s10586-026-06492-0

Image Credits: AI Generated

DOI: 10.1007/s10586-026-06492-0

Keywords: constrained multi-objective optimization, evolutionary algorithm, entropy information, neighborhood information, dual population, decision space, Pareto front, mutation strength, Manhattan distance, local search, solution generation, Cluster Computing

The core difficulty that CMOEA-TSD targets is deceptively simple to state: in many constrained problems, the set of solutions that satisfy all constraints — the feasible region — is tiny, fragmented, or shaped like a narrow winding corridor through a vast infeasible expanse. Classical multi-objective evolutionary algorithms, which mimic natural selection by evolving a population of candidate solutions toward a set of optimal trade-offs known as the Pareto front, tend to stumble in such terrain. Populations converge prematurely onto whatever small pocket of decent solutions they first encounter, losing the genetic diversity needed to explore elsewhere. Worse, when the feasible region is sparse, a single population must simultaneously explore the broader landscape, satisfy constraints, and maintain a well-spread approximation of the Pareto front — three demands that pull the search in incompatible directions and often lead to stagnation.

The new algorithm, developed by Weiye Bai, Cunyan Liu, and Wei Wang, attacks this problem by refusing to make one population do everything. Instead, CMOEA-TSD runs three cooperating subpopulations in parallel, each with a distinct mandate. The first is a global search component that approximates the unconstrained Pareto front — the optimal trade-off surface one would obtain if constraints were ignored entirely. This may seem like a detour, but the unconstrained front provides a valuable map of where the best objective values lie, even if those points violate constraints. The second subpopulation performs a diversity-enhanced search: it reformulates the original problem into a relaxed multi-objective form using reference vectors and a dynamically shrinking constraint threshold, effectively treating constraint violation as an additional objective that is gradually tightened over time. The third subpopulation is feasibility-oriented, focusing squarely on driving solutions into the constraint-satisfying region.

This division of labor is orchestrated through a two-stage structure. In the early stage of the search, the algorithm emphasizes exploration: the diversity-enhanced and unconstrained-front populations roam widely, gathering information about the landscape’s structure and locating promising regions that a purely feasibility-driven search would never visit. As the run progresses, a stage-switching mechanism — driven by the overall population’s convergence rate — adaptively adjusts mating strategies, shifting the emphasis toward exploitation. In practical terms, the algorithm first learns where the interesting parts of the search space are, then concentrates its reproductive effort on refining solutions within and near the feasible region. The convergence-rate trigger is crucial: rather than switching stages at a fixed generation count, the algorithm monitors how quickly the population is actually improving, allowing the transition to happen at the right moment for each individual problem.

The technical machinery behind the diversity-enhanced subpopulation deserves particular attention. Reference vectors, a concept popularized by decomposition-based evolutionary algorithms, partition the objective space into directional cones, ensuring that the search maintains coverage across the entire Pareto front rather than clustering on a few segments. By pairing these vectors with a constraint threshold that shrinks dynamically, the algorithm implements a gradual tightening strategy: solutions with moderate constraint violations are tolerated early on because they may carry useful genetic material that points toward the feasible region, but the tolerance is progressively reduced until only fully feasible, well-distributed solutions remain. This approach echoes a growing body of evidence in the evolutionary computation literature that infeasible solutions are not merely waste — they can be essential stepping stones, particularly when the feasible ratio of a problem is vanishingly small.

To validate the design, the authors subjected CMOEA-TSD to an unusually thorough experimental regimen. The algorithm was tested on four benchmark test suites — standardized collections of constrained multi-objective problems engineered to expose specific weaknesses, such as large infeasible regions, deceptive landscapes, and low feasible ratios. It was then applied to nine real-world engineering problems, the acid test for any optimization method, since industrial problems bring irregular constraint structures and noisy objective landscapes that synthetic benchmarks often fail to capture. Across these evaluations, CMOEA-TSD was compared against seven state-of-the-art algorithms, and the results showed significant performance advantages for the new method, both in converging toward the true Pareto front and in maintaining a well-spread set of solutions along it.

Just as important as the headline results are the ablation studies, in which the authors systematically removed components of their algorithm to verify that each part earns its place. These experiments confirmed that both the three-population co-evolutionary structure and the diversity enhancement mechanisms contribute measurably to performance. This kind of component-level validation matters in a field where new algorithms sometimes owe their wins to a handful of clever tricks whose individual contributions are unclear. By demonstrating that the multi-population architecture and the relaxed-search strategy each pull their weight, the study offers a clearer picture of why the method works, not just that it works — a distinction that matters for researchers hoping to build on the approach.

The significance of this work extends beyond the evolutionary computation community. Constrained multi-objective optimization sits at the heart of countless practical applications: flow-shop scheduling for energy savings, industrial copper burdening, optimal power flow in electrical grids, and cleaner production planning have all been framed in these terms in recent literature. When an algorithm fails to find feasible, well-distributed trade-off solutions, engineers are left either violating constraints or accepting inferior designs. A method that reliably handles sparse feasible regions could therefore translate into tangible gains — lower energy consumption, better resource allocation, and more robust engineering designs — across sectors where multiple objectives and hard constraints collide.

The study also reflects a broader trend in the field: the move from single-population, single-phase algorithms toward co-evolutionary frameworks in which specialized populations exchange information and adapt their roles over time. Earlier work explored two-population and dual-archive designs, push-and-pull search strategies, epsilon-constraint handling, and helper-problem-assisted multitasking. CMOEA-TSD pushes this line of thinking further with its tri-population structure and convergence-based stage switching, suggesting that the future of constrained optimization may lie less in any single clever operator and more in architectures that coordinate multiple search behaviors intelligently. The authors, who received no external funding for the study, report no conflicts of interest, and the algorithm’s components — reference vectors, shrinking thresholds, and adaptive mating — are all implementable within standard evolutionary computation platforms.

For practitioners, the message is that the hardest constrained problems — those with narrow, disconnected feasible regions and strongly conflicting objectives — are becoming tractable with the right architectural choices. For researchers, the paper offers a template: divide the search burden, protect diversity as a first-class citizen rather than an afterthought, and let measured convergence rather than arbitrary schedules dictate when to shift from exploring to exploiting. As computational optimization continues to permeate engineering, logistics, and machine learning system design, algorithms like CMOEA-TSD illustrate how a deeper understanding of search dynamics — when to spread out, when to converge, and how to let specialized populations cooperate — can turn previously intractable problems into solvable ones. The full study is available in Cluster Computing, and its benchmark code and experimental protocols provide a foundation for the next generation of constrained multi-objective solvers.

Subject of Research: A multi-population evolutionary algorithm for constrained multi-objective optimization

Article Title: A novel multi-population evolutionary algorithm based on two-stage division and diversity enhancement for constrained multi-objective optimization

Article References: Bai, W., Liu, C., & Wang, W. (2026). A novel multi-population evolutionary algorithm based on two-stage division and diversity enhancement for constrained multi-objective optimization. Cluster Computing, 29(12), Article 732. https://doi.org/10.1007/s10586-026-06515-w

Image Credits: AI Generated

DOI: 10.1007/s10586-026-06515-w

Keywords: evolutionary algorithms, constrained multi-objective optimization, Pareto front, diversity enhancement, co-evolution, constraint handling, reference vectors, stage switching, benchmark test suites, engineering optimization, Cluster Computing, Xi'an Polytechnic University

The mathematical skeleton of such a problem is deceptively simple. There is a vector of decision variables, a set of objective functions to be minimized simultaneously, and two families of constraints: inequality constraints that must not be exceeded and equality constraints that must be met exactly. A solution is called feasible if it violates none of the constraints, and the total constraint violation is measured as the sum of the individual violations across every rule. What makes these problems treacherous is that the objectives usually conflict, so no single solution can be best at everything. Instead, the goal is to find a whole set of solutions that are mutually non-dominated, meaning no member of the set is better than another in every objective. This collection of trade-off points, projected into objective space, forms the Pareto front, and when constraints are added, the algorithm must chase the constrained Pareto front, a potentially very different target.

The review highlights a crucial subtlety that often surprises newcomers: the unconstrained Pareto front and the constrained Pareto front can relate to each other in four distinct ways. In the easiest case, the two fronts completely overlap, so every optimal trade-off point is already feasible. In harder cases, the constrained front is a subset of the unconstrained one, or the two only partially overlap, or, most brutally, they are entirely separate, with the unconstrained front lying wholly in infeasible territory. This taxonomy matters because many algorithms work by first pushing a population toward the unconstrained front and then pulling it back toward feasibility. That strategy shines when the two fronts are close, but it can fail badly when they point in different directions, a lesson the authors demonstrate with new experimental comparisons.

At the heart of every constrained multi-objective evolutionary algorithm sit two components: a multi-objective evolutionary engine, which may be dominance-based, decomposition-based, or indicator-based, and a constraint handling technique that decides how to weigh feasible against infeasible solutions during selection. The review walks through the classic techniques with unusual clarity. Penalty function methods fold constraint violation into the fitness value, and the entire art lies in choosing the penalty coefficient: too small and the population never finds feasible solutions, too large and it gets trapped in the first feasible pocket it stumbles into. Static, dynamic, and adaptive variants each try to thread this needle differently.

The constrained domination principle, introduced by Deb and colleagues in the landmark NSGA-II algorithm, takes a more direct route: any feasible solution beats any infeasible one, two infeasible solutions are compared by their degree of violation, and two feasible solutions are compared by ordinary Pareto dominance. It is simple, easy to embed, and converges fast, but its bias toward feasibility makes it hard for a population to cross large infeasible barriers that may separate it from the true constrained front. The epsilon constrained method, due to Takahama and Sakai, softens this by relaxing the constraint boundary with a tolerance parameter, treating mildly infeasible solutions as if they were feasible. As epsilon shrinks toward zero over the run, the method gradually recovers the strict rules while harvesting useful information from high-quality infeasible solutions along the way. Stochastic ranking adds a probabilistic twist, occasionally ignoring constraints entirely with a tunable probability, while multi-objective methods go further and promote constraint violation itself to the status of an extra objective, though this risks inflating the problem into a many-objective one where selection pressure evaporates.

Beyond these foundational techniques, the review organizes the modern algorithm zoo into six families, and this classification is arguably its most useful contribution. Some methods design new fitness functions that blend objectives and constraint violations with adaptive or dynamic weights, often using the proportion of feasible solutions in the population as a feedback signal. Others enhance the classical constraint handling techniques themselves, for example by folding angle information into the constrained domination principle so that high-quality infeasible solutions survive selection and help the population leap across infeasible regions. Constraint relaxation methods tune the epsilon boundary dynamically, sometimes using the maximum and minimum violation values observed among infeasible individuals, and even deploy detect-and-escape mechanisms that relax constraints when the population shows signs of evolutionary stagnation.

Two of the six families have produced some of the field’s most striking recent successes. Two-stage optimization methods split the run into phases: the push-and-pull search framework, for instance, ignores all constraints in the first phase so the population can race to the unconstrained front unimpeded, then uses an improved epsilon method to pull it back toward the constrained front. Auxiliary population methods run a second population alongside the main one, often letting the helper ignore constraints entirely so it can scout the unconstrained front and transfer that knowledge back. The coevolutionary framework CCMO, which pairs a feasibility-focused main population with a constraint-free helper, and the multitasking approach MTCMO, which treats the helper as a separate optimization task with an improved epsilon mechanism, both exemplify this cooperative philosophy. A sixth family rewrites the reproduction operators themselves, using differential evolution mutation strategies that explicitly exploit promising infeasible solutions to generate offspring with better convergence and diversity.

The review does not stop at taxonomy; it also runs head-to-head experiments. Six representative algorithms, including DSPCMDE, MOEADDAE, PPS, CCMO, MTCMO, and CMOCSO, were tested on three benchmark suites with contrasting personalities: LIR-CMOP, whose narrow feasible regions are riddled with infeasible blocks; MW, with tiny, discontinuous feasible regions defined in objective space; and SDC, a newer suite where constraints and objectives share a chaotic, non-monotonic relationship. Each algorithm ran twenty times per problem with a population of one hundred and one hundred thousand evaluations, scored by the inverted generational distance metric on the PlatEMO platform. The results are instructive rather than triumphant for any single method. CMOCSO, with its competitive-and-cooperative swarm operators, dominated LIR-CMOP, taking best or second-best on thirteen of fourteen problems. CCMO and MTCMO led on MW, confirming that mining unconstrained-front information pays off there. But on SDC, where chasing the unconstrained front can actually move the population away from the constrained one, DSPCMDE’s redesigned fitness function proved superior. Friedman’s test ranked CMOCSO first overall and MTCMO second, yet the differences were modest, underscoring the review’s central message that no algorithm wins everywhere and that matching strategy to problem structure is the real game.

The benchmark section itself doubles as a history of the field’s growing rigor, from the pioneering SRN, TNK, and OSY problems of the 1990s through the adjustable-difficulty CTP and DAS-CMOP suites to recent constructions like ZXH_CF, DCMOP with its deceptive constraints that punish solutions precisely where they seem closest to the front, and the real-world RWCMOP collection of fifty engineering problems spanning mechanical design, chemical engineering, power electronics, and power systems. This progression reflects a deliberate effort to expose algorithms to narrow feasible regions, disconnected fronts, multimodality, and deception, features that older, gentler benchmarks simply never tested.

Looking forward, the authors identify five frontiers where current methods strain. Computationally expensive problems, such as those involving computational fluid dynamics, allow only a few thousand real evaluations, making surrogate models that mimic the fitness landscape essential. Multimodal problems hide multiple distinct sets of Pareto-optimal solutions mapping to the same front, demanding strong diversity preservation and mode recognition. Large-scale problems, with hundreds or thousands of decision variables, require dimension reduction and variable grouping to avoid drowning in the search space. Multi-task optimization, which could let experience transfer between related constrained problems, still needs principled knowledge-transfer mechanisms. And dynamic problems, where objectives or constraints shift over time as in fluid catalytic cracking or mineral beneficiation, force algorithms to detect environmental change in real time and decide whether yesterday’s population is worth keeping. With the field already logging thousands of accesses and dozens of citations for this review, its map of what works, what fails, and what remains unsolved is likely to steer the next generation of algorithms toward exactly these open problems.

Subject of Research: Evolutionary algorithms for constrained multi-objective optimization problems

Article Title: Evolutionary constrained multi-objective optimization: a review

Article References: Liang, J., Lin, H., Yue, C., Ban, X., & Yu, K. (2024). Evolutionary constrained multi-objective optimization: a review. Vicinagearth, 1(1), Article 5. https://doi.org/10.1007/s44336-024-00006-5

Image Credits: AI Generated

DOI: 10.1007/s44336-024-00006-5

Keywords: constrained multi-objective optimization, evolutionary algorithms, constraint handling, Pareto front, NSGA-II, epsilon constrained method, benchmark test problems, push and pull search, auxiliary populations, differential evolution, surrogate models, multi-task optimization