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