2026· Computers, Materials & Continua· Vol 89, pp. 1-10· 0 citations· 17 references
TL;DR
Experimental results demonstrate that MoQTS can obtain high-quality Pareto-optimal solutions with strong convergence and diversity performance, and computational cost analysis shows that MoQTS substantially reduces the number of evaluations and execution time compared with the comparison algorithms while maintaining high-quality Pareto-optimal solutions.
Abstract
: Portfolio optimization is inherently a multi-objective problem that aims to maximize expected return while minimizing investment risk, while also facing exponential growth in the search space and increasing market complexity. Existing multi-objective optimization approaches often struggle to balance convergence and diversity, particularly under realistic trading conditions such as short-selling. To address these challenges, this paper proposes a novel Multi-objective Quantum-inspired Tabu Search (MoQTS) framework for portfolio optimization with short-selling strategies. The proposed method incorporates a quantum-inspired superposition mechanism to enhance global exploration and introduces an entanglement-driven neighborhood search strategy that systematically generates structured local perturbations by modifying one or two asset-selection states. This mechanism enables effective exploration of the neighborhood of non-dominated solutions, thereby improving both convergence accuracy and solution diversity. In addition, a trend ratio (TR)-based evaluation model is adopted to jointly capture return and risk dynamics under real-world market fluctuations. Experiments are conducted on the U.S. stock market using Dow Jones Industrial Average (DJIA) data from 2013 to 2025. The proposed MoQTS is compared with several state-of-the-art multi-objective algorithms, including NSGA-II, MOEA/D, SMS-EMOA, and MOPSO. Experimental results demonstrate that MoQTS can obtain high-quality Pareto-optimal solutions with strong convergence and diversity performance. Results over multiple independent periods further support the effectiveness and robustness of MoQTS. In addition, computational cost analysis shows that MoQTS substantially reduces the number of evaluations and execution time compared with the comparison algorithms while maintaining high-quality Pareto-optimal solutions.
Loan portfolio optimization (LPO) seeks portfolios that minimize credit risk while satisfying practical selection constraints. Accounting for portfolio-level risk requires modeling not only expected losses but also loss variability and borrower-default correlations, leading to a large-scale combinatorial optimization p...
B. A. Bhargava, Kamlesh Kumar, Gouranga Dinda et al.· 0 citations
Near-term quantum and quantum-inspired solvers for portfolio optimization rely on local subproblem execution under severe size constraints, but this locality can omit cross-cluster covariance essential for global risk coordination. We propose Context-Aware Folding (CAF), a lightweight hybrid quantum-classical coordinat...
Results show that integrating local search significantly enhances performance, while a principled method for setting hybrid parameters ensures robustness and reproducibility, highlighting the potential of combining mathematical programming techniques with evolutionary algorithms for high-dimensional many-objective opti...
Regina C. L. C. de Sousa, Dênis E. C. Vargas, Elizabeth F. Wanner et al.· Journal of Heuristics· 0 citations
The proposed Quantum-Memetic Hybrid Algorithm (QMHA), a component-based framework that synergistically integrates qubit-based global search with adaptive classical refinement, offers a robust, verified approach to hybrid optimization without relying on biological metaphors.
Raza Hasan, V. Dattana, Salman Mahmood· Applied Informatics· 0 citations
It is shown that a class of binary optimization problems with complex non-quadratic objectives or constraints can be reformulated as multi-objective quadratic unconstrained binary optimization problems and evaluated classically on Pareto-optimal candidates rather than encoded as penalties.
Andres D. Ruiz, Soumyadip Ghosh, S. Woerner· 1 citation
We propose NB-HalpernSGD via LM-MultiLRSGA, a two-phase optimizer for multi-objective optimization. The process starts with a competitive optimization phase by applying a limited-memory variant of MultiLRSGA, named LM-MultiLRSGA, designed to reduce the memory footprint of the original optimizer while preserving its rot...
Katherine Rossella Foglia, F. Pisani, Vittorio Colao· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.