Hybrid Swarm and Annealing Algorithm Boosts Portfolio Optimization Performance

A team of researchers in China has unveiled a hybrid artificial intelligence framework that pairs an improved particle swarm optimization algorithm with simulated annealing to tackle one of finance’s oldest computational headaches: how to build an investment portfolio that performs well under real-world constraints. The study, published in the journal Discover Artificial Intelligence, reports that the combined SA–PSO model achieved investment success rates of 94.5 percent on a Sharpe ratio dataset and 96.2 percent on a Sortino ratio dataset, outperforming standard particle swarm optimization, genetic algorithms, differential evolution, and the covariance matrix adaptation evolution strategy across every metric tested. The work, led by Feiyan Pu and Bimei Zhang of the Digital and Intelligent Finance Institute at Jiangsu Vocational College of Business, aims to close a stubborn gap between the elegant mathematics of classical portfolio theory and the messy, constraint-laden reality of actual markets.

The starting point for the research is the well-known fragility of the Markowitz mean-variance model, the foundational framework of modern asset allocation introduced in the 1950s. That model promises to maximize returns at a given risk level, or minimize risk at a target return, but it comes with assumptions that rarely hold in practice. It is extraordinarily sensitive to its inputs: small estimation errors in expected returns or the covariance matrix can produce wildly different optimal portfolios. It assumes returns follow a normal distribution, ignoring the fat-tailed behavior that dominates real markets during crises. And it largely ignores practical constraints such as transaction costs, integer lot sizes, and position limits. The result is a framework that is theoretically beautiful but brittle in high-dimensional, non-convex market environments, where the optimization landscape is riddled with local optima that can trap naive search methods.

To understand why the authors turned to swarm intelligence, it helps to look at how particle swarm optimization works. Inspired by the foraging behavior of bird flocks, PSO populates a search space with particles, each representing a candidate portfolio. Every particle carries a velocity and a position, and at each iteration it updates both based on its own best historical position and the best position found by the entire swarm. The method is structurally simple, converges quickly, and handles continuous, high-dimensional problems well. But it has a notorious weakness: premature convergence. As iterations proceed, the swarm’s diversity collapses, particles cluster around a single point, and the algorithm settles into a local optimum rather than the global one. The researchers measured this directly: after 150 generations, the average pairwise distance between particles in a standard PSO run dropped to 0.21, while their hybrid maintained diversity above 0.43, roughly half the decay.

The first pillar of the new framework is a set of improvements to PSO itself. The authors introduced the Complex Method, a deterministic constraint-handling algorithm based on multi-vertex simplex evolution, which maintains a dynamically updated polytope of vertices within the feasible region and iteratively applies reflection, expansion, and contraction operations to shrink toward the optimum. In practice, PSO performs a global coarse search and supplies an initial population, while the Complex Method locally corrects and replaces poor particles every five generations. The team also replaced fixed learning factors with a random mechanism and added a contraction factor to the velocity update, both of which inject controlled uncertainty that keeps the swarm from homogenizing. Adaptive inertia weights, which decay linearly from an initial to a final value over the run, let the algorithm shift smoothly from broad exploration early on to fine-grained exploitation later, a balance that fixed-weight PSO cannot strike.

The second pillar is simulated annealing, an optimization technique borrowed from statistical mechanics that mimics the slow cooling of molten metal. SA generates candidate solutions by perturbing the current solution and then applies the Metropolis criterion: better solutions are always accepted, but worse ones are accepted with a probability that decreases as the system cools. This probabilistic acceptance of inferior moves is precisely what lets SA escape local optima that would trap a purely greedy search. SA, however, has its own drawbacks, including slow convergence and annealing parameters that must be set by experience. The researchers addressed this with an adaptive annealing strategy that dynamically optimizes the cooling process, using exponential cooling with a coefficient tuned through sensitivity analysis, and embedded local neighborhood search operators to sharpen solution accuracy in the low-temperature phase.

The real innovation lies in how the two algorithms talk to each other. The hybrid operates through bidirectional information exchange at the iteration level: in each cycle, PSO passes its current global best solution to SA as the starting point for Metropolis sampling and annealing; SA then returns an improved solution, which updates the global best and replaces several inferior particles in the swarm. Temperature also modulates the swarm itself. A velocity perturbation term proportional to the square root of the current temperature is added to each particle’s update, so large random kicks at high temperatures promote global exploration while small ones at low temperatures accelerate convergence. The inertia weight is likewise coupled to temperature through an exponential relationship, working in tandem with the cooling schedule. The result is a single control parameter, temperature, that choreographs the entire transition from exploration to exploitation across both algorithms simultaneously.

The experimental results are striking. On the Sharpe ratio dataset, built from A-share market data including ratings, stock reviews, and user profiles, SA–PSO reached a 94.5 percent investment success rate after 250 iterations, compared with 88.4 percent for genetic algorithms and 72.1 percent for standard PSO. On the Sortino ratio dataset, the gap widened: 96.2 percent for the hybrid versus 80.9 and 80.4 percent for the baselines. Response times at a sample size of 120 were roughly 22 and 26 milliseconds for the hybrid on the two datasets, against 37 to 49 milliseconds for the competitors, a speedup of more than 40 percent. Wilcoxon signed-rank tests confirmed statistical significance at the 95 percent confidence level for all comparisons, with Cohen’s d exceeding 0.8, indicating the improvements are practically meaningful rather than random fluctuations. Against the more modern CMA-ES benchmark, the hybrid improved success rates by about 3.1 percentage points, cut convergence iterations by 15.2 percent, and reduced solution standard deviation by 28.2 percent.

Ablation experiments disentangled the contributions of each component. Adding adaptive inertia weights alone slashed convergence iterations from 165 to 118, confirming their role in accelerating global search, while SA fusion alone cut the standard deviation of the best solution by 48.2 percent, demonstrating its stabilizing effect. Only the full model excelled on every metric, proving the two mechanisms are complementary rather than redundant. Parameter sensitivity analysis offered practical guidance: a population of 100 particles, a cooling coefficient of 0.95, and a constraint penalty coefficient of 10 delivered the best balance of accuracy and efficiency. Perhaps most tellingly, when complex constraints were added to the optimization problem, the hybrid’s investment accuracy fell only from 98 to 92 percent, while MATLAB solvers dropped from 80 to 60 percent and Python commercial solvers from 78 to 50 percent, a result that speaks directly to practitioners who have watched textbook optimizers collapse under real-world conditions.

The model also proved robust across market regimes and investor types. In both bull and bear market simulations, SA–PSO maintained investment stability above 90 percent, while genetic algorithms fluctuated around 80 percent and standard PSO between 70 and 80 percent. A multi-objective risk spectrum framework let the same engine serve investors with different risk preferences, from extremely conservative profiles, where the mean-variance configuration produced about 2 percent return at the lowest risk level, to aggressive ones, where the mean-conditional value-at-risk configuration reached 10 percent returns at a risk of 4.0. The authors are candid about limitations: their experiments covered only stocks and bonds, roughly 50 assets each, and excluded commodities, foreign exchange, and cryptocurrencies, whose high volatility and regulatory heterogeneity would demand additional constraints. Computational cost scales near-linearly with dimension, though a single run at higher dimensionality took about 2.8 minutes. Future work, the team says, will target online rebalancing with rolling windows, integration of high-frequency volatility features extracted by deep learning models, liquidity constraint modeling using bid-ask spreads, and an open-source Python toolkit to make the framework reproducible for the wider research community.

Subject of Research: A hybrid particle swarm optimization and simulated annealing algorithm for investment portfolio optimization

Article Title: Portfolio optimization strategy based on improved particle swarm optimization algorithm and SA fusion

Article References: Pu, F., & Zhang, B. (2026). Portfolio optimization strategy based on improved particle swarm optimization algorithm and SA fusion. Discover Artificial Intelligence, 6(1), Article 1406. https://doi.org/10.1007/s44163-026-02347-0

Image Credits: AI Generated

DOI: 10.1007/s44163-026-02347-0

Keywords: portfolio optimization, particle swarm optimization, simulated annealing, Metropolis criterion, adaptive inertia weight, swarm intelligence, metaheuristics, Markowitz mean-variance model, Sharpe ratio, Sortino ratio, financial optimization, hybrid algorithms