The problem the researchers tackle, known as examination timetabling, belongs to a family of combinatorial optimization challenges that are computationally intractable at scale. The goal is to assign each exam to a timeslot without creating conflicts, meaning no student should be scheduled for two exams in the same period. Beyond hard constraints, there are soft constraints that translate into penalties: spreading exams out so students are not crammed with back-to-back tests, for example. Because the number of possible timetables grows explosively with the number of exams and students, finding the best possible schedule by brute force is out of the question for real institutions. Instead, researchers rely on metaheuristics, intelligent search strategies that explore the vast space of possible schedules in search of very good, if not provably optimal, solutions.

The core engine of the new approach is the Rat Optimization Algorithm, or ROA, a relatively recent nature-inspired method introduced in 2024 that mimics the swarming and foraging dynamics of rats. In its original form, ROA is designed for continuous optimization, where solutions are points in a smooth numerical landscape. Examination timetabling, however, is a discrete problem: an exam either sits in timeslot three or it does not, and there is no meaningful in-between. The researchers therefore reformulated ROA’s operators so that the algorithm’s search moves operate directly on discrete timeslot assignments, a necessary adaptation that preserves the spirit of the rat-inspired search while making it compatible with the structure of the problem.

Two further ingredients round out the hybrid. The first is the Lévy Flight, a mathematical description of a movement pattern observed across nature, from albatross foraging paths to human hunter-gatherer travel, in which mostly short, local steps are punctuated by occasional long jumps. In optimization terms, Lévy Flights allow an algorithm to escape the gravitational pull of a local optimum by occasionally making dramatic, far-reaching changes to a solution. The second ingredient is simulated annealing, a technique dating back to 1983 that borrows its logic from the cooling of molten metal: it accepts most improvements outright, but also tolerates some worsening moves with a probability that gradually decreases as the search matures, giving the algorithm a controlled way to explore early on and to refine later.

Crucially, the authors did not simply bolt these components together. They describe three main adaptations that coordinate the pieces. ROA’s operators were rewritten for discrete timeslots, as noted. The Lévy Flight mechanism was designed to apply selective perturbations with feasibility checking, so that a long jump does not wreck the hard constraint that no student has conflicting exams; if a perturbation breaks feasibility, it is checked and handled rather than blindly accepted. And simulated annealing’s acceptance criterion was synchronized with ROA’s search phases, so that the willingness to accept worse solutions ebbs and flows in harmony with the underlying swarm dynamics rather than running on an independent schedule. On top of this coordination layer, the team incorporated Kempe chain operators, a neighborhood structure borrowed from graph coloring in which an entire chain of interdependent exam assignments is moved at once, providing a powerful local refinement mechanism that can untangle stubborn scheduling knots.

To find out whether all this engineering actually pays off, the researchers ran a rigorous evaluation on twelve benchmark instances from the well-known Toronto dataset, a standard proving ground for examination timetabling research hosted via the University of Nottingham’s public repository. The evaluation had two prongs: ablation studies, which systematically strip away components to measure each one’s individual contribution, and comparisons against eleven state-of-the-art methods from the literature. The ablation results are striking. The full hybrid configuration improved on a basic ROA implementation by 38.4 percent, with the Lévy Flight component contributing 13.0 percent of that gain and simulated annealing contributing 10.5 percent. These numbers suggest that the hybridization is not decorative; each added mechanism earns its place in the pipeline.

In the head-to-head comparisons, the hybrid algorithm achieved a Friedman rank of 4.59, placing it third overall among the methods tested. Statistical rigor was a priority: the authors applied the Wilcoxon, Friedman, Nemenyi, and Holm tests to the results, and this analysis confirmed that there was no statistically significant difference between the top two methods in the comparison. In other words, while the new hybrid did not claim the crown, it sits firmly within the leading pack, and its performance is statistically indistinguishable from the best performers. For a newly adapted algorithm competing against mature, heavily tuned methods, that is a notable result.

Perhaps just as important as raw solution quality is consistency, and here the algorithm shines. Across all twelve instances, the method demonstrated strong repeatability, with a coefficient of variation as low as 0.01 percent between runs. Stochastic algorithms can sometimes produce wildly different schedules from one run to the next, which is a practical headache for administrators who need to trust that the tool will deliver a comparable result every time. A coefficient of variation in the hundredths of a percent range indicates that the hybrid’s search is remarkably stable, likely a benefit of the coordinated acceptance mechanism that keeps the exploration-exploitation balance steady throughout the run.

The study arrives amid a long and active research tradition. Examination timetabling has been studied algorithmically since at least the mid-1990s, when Carter, Laporte, and Lee laid out foundational strategies, and simulated annealing itself was applied to the problem as early as 1998 by Thompson and Dowsland. Since then, the field has seen tabu search, ant algorithms, artificial bee colonies, genetic algorithms, harmony search, intelligent water drops, firefly algorithms, and cellular memetic approaches, among many others. Surveys published in 2009 and again in 2024 chart the steady evolution of solution methodologies, and the persistence of the problem in the literature reflects its real-world stakes: poorly balanced exam schedules translate directly into student stress and institutional friction.

What the Ajman University team’s work illustrates is a broader lesson in modern metaheuristic design: single algorithms rarely dominate, and the most competitive systems are often carefully orchestrated hybrids in which each component compensates for the weaknesses of the others. The rat-inspired swarm provides the population-level exploration, the Lévy Flight injects the occasional bold leap out of stagnation, simulated annealing governs the tolerance for temporary setbacks, and Kempe chains perform the surgical fine-tuning. The result, published in Neural Computing and Applications as volume 38, article 735, is a system that lifts a young optimization method into contention with the state of the art, while offering a template for how discrete scheduling problems can benefit from disciplined hybridization rather than novelty for its own sake.

Subject of Research: A hybrid metaheuristic combining the rat optimization algorithm, Lévy Flights, and simulated annealing for solving the examination timetabling problem.

Article Title: Hybridizing rat optimization algorithm with Lévy Flights and simulated annealing for examination timetabling

Article References: Setteh, M. A., Al-Betar, M. A., & Nachouki, M. (2026). Hybridizing rat optimization algorithm with Lévy Flights and simulated annealing for examination timetabling. Neural Computing and Applications, 38(17), Article 735. https://doi.org/10.1007/s00521-026-12466-5

Image Credits: AI Generated

DOI: 10.1007/s00521-026-12466-5

Keywords: examination timetabling, rat optimization algorithm, Lévy Flight, simulated annealing, hybrid metaheuristic, combinatorial optimization, Kempe chains, Toronto benchmarks, scheduling, swarm intelligence, Neural Computing and Applications, discrete optimization

The core problem the team set out to solve is one of biological interpretation. Standard trajectory inference methods frequently produce trees with multifurcations, meaning nodes where three, four, or more branches radiate from a single point. Mathematically, such high-degree branching is often the cheapest way to connect all the cells in a dataset, which is why minimum spanning tree approaches favor it. Biologically, however, a node with five simultaneous outgoing branches is hard to defend. Cell fate decisions, as conceptualized in Waddington’s famous epigenetic landscape, are typically depicted as a ball rolling down a valley that splits into two channels, not five. A binary structure, where each decision point offers at most two alternatives, aligns far more naturally with this classical picture of progressive restriction of cell potential.

To impose this binary discipline, the researchers turned to integer programming, a branch of discrete optimization in which decisions are encoded as variables restricted to whole-number values. In their formulation, the choice of which edges to include in the spanning tree becomes a set of binary variables, each indicating whether a particular connection between two cell cluster representatives is selected. The objective function minimizes the total edge weight, preserving the spirit of the minimum spanning tree, while additional constraints enforce that no node in the resulting tree exceeds a degree of two in the branching sense appropriate for trajectory topology. This transforms a problem that classical greedy algorithms such as Kruskal’s or Prim’s can solve efficiently into a harder combinatorial optimization problem, but one whose solutions carry direct biological meaning.

The degree restriction is not merely cosmetic. When an unconstrained minimum spanning tree is built over cluster centroids in a high-dimensional gene expression space, the algorithm has no incentive to respect the sequential nature of cell differentiation. It may connect a mature cell type directly to a primitive progenitor population through a shortcut that skips intermediate states, or it may hang several distinct lineages off a single hub. By capping the degree, the integer programming formulation forces the tree to route connections through intermediate nodes, producing a hierarchy in which each branching event represents a discrete, interpretable fate choice. The result is a topology that reads like a family tree of cell states rather than a tangled web of shortest connections.

A key practical strength of the new method is its modularity. Rather than building a complete trajectory pipeline from scratch, the authors implemented their degree-restricted tree construction as a plug-in module that can be inserted into existing graph-based and tree-based trajectory inference frameworks. To demonstrate this flexibility, they integrated the module into Slingshot, one of the most widely used pseudotime inference tools in the single-cell genomics community. Slingshot traditionally constructs a minimum spanning tree over cluster centroids and then fits principal curves along its branches to order cells in pseudotime. By swapping the unconstrained tree for the degree-restricted one, the researchers showed that the downstream pseudotime machinery can operate on a topology that is simultaneously cost-efficient and biologically constrained.

Validation of the constrained topologies required an independent reference against which the reconstructed trees could be compared. The team turned to CoSpar, a method that infers cell fate hierarchies using lineage information, often derived from experimental lineage tracing. By evaluating the consistency of their degree-restricted trees against a CoSpar-derived reference hierarchy, the authors could assess whether the binary constraint, imposed purely on the basis of expression data and optimization, recovered relationships that an orthogonal lineage-aware approach also supports. This cross-method consistency check is important because trajectory inference is notoriously sensitive to the assumptions baked into any single algorithm, and agreement between structurally different approaches lends credibility to the inferred hierarchy.

The researchers applied their framework to three biologically rich datasets: bone marrow mononuclear cells, human fetal immune cells, and a mouse hematopoiesis dataset. Hematopoiesis, the process by which blood cells are generated, is a canonical testing ground for trajectory methods because its branching structure, from stem cells through progenitors to mature lineages, has been mapped in detail over decades of experimental work. Across these datasets, the degree-restricted trees produced trajectories whose branching patterns were more interpretable than those generated by unconstrained minimum spanning tree baselines. The comparison with the unconstrained baselines was descriptive rather than a claim of universal superiority, but it illustrated concretely how the binary constraint reshapes the inferred lineage structure into forms that match developmental expectations.

Behind the biological narrative lies a substantial computational challenge. Minimum spanning trees can be computed in near-linear time for the number of edges considered, but degree-constrained spanning tree problems belong to a family of combinatorial optimization problems that are computationally hard in general. Integer programming solvers handle such problems by exploring the space of feasible integer solutions with techniques such as branch and bound, cutting planes, and linear programming relaxations. The feasibility of the approach at the scale of single-cell datasets, where cluster-level graphs may contain dozens to hundreds of nodes after preprocessing and clustering, depends on careful formulation that keeps the integer program tractable. The authors’ decision to operate at the level of cluster representatives rather than individual cells is central to this tractability, since it dramatically reduces the number of nodes over which the constrained tree must be built.

The conceptual appeal of the method extends beyond hematopoiesis. Waddington’s epigenetic landscape, sketched in the 1950s as a metaphor for how cells navigate a landscape of developmental potential, has become a guiding intuition for the entire field of pseudotime analysis. Yet most computational implementations of trajectory inference treat topology as an emergent property of the data rather than an explicit modeling choice. By encoding the binary branching structure directly into the optimization objective and constraints, the new approach makes the Waddingtonian assumption a formal part of the inference procedure. This explicitness is a virtue: it allows users to see exactly what biological prior is being imposed, and it opens the door to future variants in which different degree restrictions or additional structural constraints could encode other hypotheses about how cell states relate.

The work, led by Jiaying Zhao and Takuma Iwaki, who contributed equally, together with Tomoya Mori, Wai-Ki Ching, and Tatsuya Akutsu, was supported by the Hong Kong Research Grants Council and released as open access, with source code publicly available on GitHub for researchers who wish to integrate the degree-restricted module into their own pipelines. As single-cell RNA sequencing continues to generate atlases of ever greater scale and complexity, the demand for trajectory inference methods that are both computationally principled and biologically legible will only grow. This study demonstrates that ideas from discrete optimization, a field seemingly distant from developmental biology, can supply exactly the kind of structural discipline that turns a tangle of gene expression similarities into a readable map of cellular destiny.

Subject of Research: Degree-restricted minimum spanning tree algorithms for binary cell trajectory inference in single-cell RNA-seq data

Article Title: Degree-restricted minimum spanning trees for binary cell trajectory inference in single-cell RNA-seq data

Article References: Zhao, J., Iwaki, T., Mori, T., Ching, W.-K., & Akutsu, T. (2026). Degree-restricted minimum spanning trees for binary cell trajectory inference in single-cell RNA-seq data. BMC Bioinformatics. https://doi.org/10.1186/s12859-026-06674-y

Image Credits: AI Generated

DOI: 10.1186/s12859-026-06674-y

Keywords: single-cell RNA-seq, trajectory inference, pseudotime, minimum spanning tree, integer programming, Waddington's epigenetic landscape, hematopoiesis, Slingshot, CoSpar, cell fate decisions, computational biology, discrete optimization

The core challenge the researchers address is what they formalize as the Physical Machine Load Balancing Problem, or PMLBP. In a modern data center, each physical machine has a fixed capacity, and each virtual machine places a demand on that capacity in terms of processing, memory, and other resources. When a handful of hosts become overloaded while others idle, operators face hotspots that degrade performance and waste energy. The remedy is migration: moving virtual machines from crowded hosts to less crowded ones. But every migration carries a cost, and deciding which virtual machines to move, and where to send them, is a combinatorial puzzle that grows explosively with the size of the data center. The team formulated PMLBP as the task of reassigning virtual machines across physical machines to minimize utilization imbalance while preserving feasibility, meaning no host may exceed its capacity at any point in the proposed solution.

To ground their design choices in evidence rather than intuition, the authors first conducted a systematic literature review of cloud scheduling and load balancing research. This review identified the dominant objectives that prior studies pursue and the evaluation practices commonly used to benchmark new algorithms. The findings directly shaped the experimental design of the new work, including which baselines to compare against and which metrics to report. This methodological discipline matters in a field crowded with proposed schedulers, because many published algorithms are evaluated under conditions that make fair comparison difficult. By anchoring their choices in a documented review, the researchers aimed to produce results that would be meaningful beyond their own test environment.

The algorithmic heart of the paper is an upgrade to the shuffled frog leaping algorithm, a memetic metaheuristic originally introduced by Eusuff, Lansey, and Pasha in 2006 for discrete optimization in water resource management. In the standard version, a population of candidate solutions, imagined as frogs, is partitioned into subgroups called memeplexes. Within each memeplex, the worst-performing solution is improved by leaping toward the best one, with the step size controlled by a coefficient that can be randomized. The memeplexes are periodically shuffled so information spreads across the whole population. The method has proven effective on discrete problems, but its generic move operators are not tailored to the structure of virtual machine placement, where a solution is essentially an assignment of many virtual machines to a limited set of physical hosts.

SM-SFLA changes the move operator in a way that respects that structure. The key innovation is a PM-wise migration operator: instead of adjusting a solution in an undifferentiated way, the algorithm works host by host, identifying overloaded physical machines and migrating selected virtual machines from them toward the least-loaded feasible destinations. Crucially, each physical machine carries its own independent step size, so the algorithm can take aggressive corrective action on badly overloaded hosts while making fine adjustments where the imbalance is mild. The moves are guided, not random, always directed toward feasible targets that reduce the utilization spread. This structured approach means that every proposed change to a solution corresponds to a physically meaningful migration plan, which the authors argue is why the method converges faster and lands on better final configurations than generic variants.

The experimental evaluation pitted SM-SFLA against a demanding lineup. The authors compared it with two discrete variants of the shuffled frog leaping algorithm, which isolate the contribution of the new migration operator, and with two widely used metaheuristics: the Artificial Bee Colony algorithm, which mimics the foraging behavior of bee swarms, and the Grey Wolf Optimizer, which models the social hunting hierarchy of wolf packs. Both competitors have been applied extensively to cloud scheduling problems and represent strong baselines from the recent literature. Across the benchmark suite, SM-SFLA converged faster, meaning it reached high-quality solutions in fewer iterations, and it achieved lower final imbalance, meaning the resulting distribution of work across physical machines was more even. The advantage held consistently across different workload distributions and across scenarios in which resource demands were scaled up, indicating that the method does not depend on a narrow set of favorable conditions.

Notably, the researchers report that these gains often came with lower execution time overhead. That detail matters operationally, because load balancing in a live data center is not a leisurely offline calculation. Migration decisions must be made quickly enough that the rebalancing plan is still relevant by the time it is computed. An optimizer that produces a marginally better solution but takes minutes longer to run may be worse in practice than a slightly less precise method that responds promptly. By keeping the computational cost of each structured migration move modest, SM-SFLA positions itself as a candidate for real deployment rather than a purely theoretical contribution.

The experimental data itself was generated programmatically from statistical distributions designed to model a variety of cloud workload scenarios, a choice that gives the authors control over the difficulty and character of the test instances. The specific parameters and code used for data generation are available from the corresponding author upon reasonable request, which supports reproducibility. The paper includes an extensive set of figures and algorithms, twenty-four figures in total, tracing convergence behavior, imbalance trajectories, and sensitivity to demand scaling. The work was published on 1 October 2026 as volume 29, article number 816 of Cluster Computing, following receipt in February 2026 and acceptance in September of the same year, and the authors declare no competing interests and no specific external funding.

The broader context makes the contribution timely. Data centers are under intensifying pressure from two directions at once: the explosive growth of artificial intelligence workloads, which the International Energy Agency has flagged as a significant and rising source of electricity demand, and corporate and regulatory commitments to energy efficiency. Load balancing through virtual machine migration is one of the few levers operators can pull without buying new hardware. By evening out utilization across existing hosts, a good balancing policy reduces the need to power extra machines, mitigates hotspots that force throttling, and extends the useful capacity of the installed fleet. The literature the authors reviewed shows a crowded field of metaheuristic schedulers, from particle swarm and ant colony methods to reinforcement learning approaches, yet the structured, problem-aware design of SM-SFLA suggests that tailoring classical algorithms to the geometry of the placement problem can still yield measurable wins.

There are, of course, limits to what any simulation-based study can establish. The workloads were synthetically generated rather than drawn from production traces, and real data centers add complications such as migration downtime, network contention, and service level agreements that the utilization-imbalance objective does not directly capture. The authors’ systematic review was used to guide baseline selection and evaluation practice, which strengthens the credibility of the comparison, but deployment at scale would require validation against live telemetry. Still, the study offers a clear and instructive lesson for the field: when a metaheuristic’s move operators mirror the actual structure of the problem, in this case host-by-host migration toward feasible, lightly loaded targets, the search becomes both faster and more reliable. As cloud providers grapple with volatile demand and energy constraints, that principle may prove as valuable as the specific algorithm that demonstrates it.

Subject of Research: Metaheuristic optimization of virtual machine migration for load balancing in cloud data centers

Article Title: Structured migration shuffled frog leaping algorithm: capacity-constrained VM-to-PM load balancing via structured PM-Wise VM migration

Article References: Nouri Khajavi, D., Khakzar Bafruei, M., & Rashidi Zeglojeh, M. (2026). Structured migration shuffled frog leaping algorithm: capacity-constrained VM-to-PM load balancing via structured PM-Wise VM migration. Cluster Computing, 29(14), Article 816. https://doi.org/10.1007/s10586-026-06628-2

Image Credits: AI Generated

DOI: 10.1007/s10586-026-06628-2

Keywords: cloud computing, VM migration, load balancing, SM-SFLA, metaheuristic optimization, shuffled frog leaping algorithm, discrete optimization, utilization variance minimization, data centers, Artificial Bee Colony, Grey Wolf Optimizer, energy efficiency