This study explores quantum-inspired optimization algorithms (QIOAs) as practical tools for solving constrained combinatorial problems on classical machines. We analyze tasks that can be formulated in Ising or QUBO forms and benchmark three representative approaches: Simulated Bifurcation (SB), Quantum-Inspired Particle Swarm Optimization (QPSO), and a tensor-network (TN) method. A unified evaluation protocol is introduced that captures solution quality, feasibility, runtime, energy consumption, parameter sensitivity, and scalability. To ensure reliable performance, we develop automated penalty-adjustment and schedule-calibration strategies. Experimental results across diverse benchmarks show that SB and TN together yield the best trade-offs between accuracy and runtime: SB is efficient on dense instances with moderate penalties and low energy use, while TN is advantageous for sparse or modular networks, especially on GPUs. QPSO is competitive in smoother landscapes but more sensitive to hyperparameters. By linking performance to structural properties such as spectral gaps and constraint activity, we provide guidance for selecting suitable algorithms. Overall, QIOAs emerge as effective intermediaries between existing classical heuristics and emerging quantum devices, supported by a reproducible, energy-aware evaluation framework.
This study explores quantum-inspired optimization algorithms (QIOAs) as practical tools for solving constrained combinatorial problems on classical machines. We analyze tasks that can be formulated in Ising or QUBO forms and benchmark three representative approaches: Simulated Bifurcation (SB), Quantum-Inspired Particle Swarm Optimization (QPSO), and a tensor-network (TN) method. A unified evaluation protocol is introduced that captures solution quality, feasibility, runtime, energy consumption, parameter sensitivity, and scalability. To ensure reliable performance, we develop automated penalty-adjustment and schedule-calibration strategies. Experimental results across diverse benchmarks show that SB and TN together yield the best trade-offs between accuracy and runtime: SB is efficient on dense instances with moderate penalties and low energy use, while TN is advantageous for sparse or modular networks, especially on GPUs. QPSO is competitive in smoother landscapes but more sensitive to hyperparameters. By linking performance to structural properties such as spectral gaps and constraint activity, we provide guidance for selecting suitable algorithms. Overall, QIOAs emerge as effective intermediaries between existing classical heuristics and emerging quantum devices, supported by a reproducible, energy-aware evaluation framework.
Quantum-inspired optimization (QIO) has emerged as a promising paradigm for solving complex combinatorial problems in industrial scheduling. While most existing studies focus on algorithmic developments and classical implementations, recent advances in nanoscale computing, including memristor-based Ising machines, photonic computing systems, and oscillatory neural networks, have created new opportunities for implementing QUBO- and Ising-based optimization through physical hardware dynamics. This survey provides a comprehensive review of QIO techniques for industrial scheduling, with a particular emphasis on their compatibility with emerging nanoscale computing platforms. We first introduce how representative scheduling problems, including job shop, flexible job shop, and resource-constrained scheduling, can be reformulated into quadratic unconstrained binary optimization (QUBO) models. We then categorize QIO methods into annealing- and Ising-based methods, evolutionary and population-based methods, hybrid quantum-classical and decomposition methods, and emerging learning-augmented approaches, and examine their computational characteristics and compatibility with QUBO or Ising hardware. Beyond algorithmic perspectives, this work highlights the potential role of specialized Ising hardware in enabling highly parallel and potentially energy-efficient optimization. We discuss how QUBO and Ising formulations can be mapped to physical energy-minimization processes in nanoscale devices, thereby providing a computational framework that connects classical optimization, quantum-inspired algorithms, and nanoscale hardware systems. Finally, we identify key challenges, including scalability, penalty calibration, and system integration, and outline future research directions toward hybrid quantum-classical computing ecosystems incorporating nanoscale optimization hardware. This survey positions QIO as a promising paradigm for next-generation intelligent manufacturing, in which optimization algorithms and nanoscale hardware are jointly developed to support low-latency and energy-efficient decision-making.
Quadratic Unconstrained Binary Optimization (QUBO) provides a versatile framework for representing NP-hard combinatorial problems, yet existing solvers often face trade-offs among speed, accuracy, and scalability. In this work, we introduce a quantum-inspired solver (QIS) that unites branch-and-bound pruning, continuous gradient-descent refinement, and quantum-inspired heuristics within a fully adaptive control architecture. We benchmark QIS3 against eight state-of-the-art solvers, including genetic algorithms, coherent Ising machines, simulated bifurcation, parallel tempering, simulated annealing, our prior QIS2 version, D-Wave's simulated-annealing (Neal), and Gurobi on three canonical QUBO problem classes: Max-Cut, NAE-3SAT, and Sherrington-Kirkpatrick spin glass problems. Under a uniform runtime budget, QIS3 attains the best solution on nearly all instances, achieving optimality in 94% of max-cut instances. These results establish QIS3 as a robust, high-performance solver that bridges classical exact strategies and quantum-inspired heuristics for scalable QUBO optimization.
Industrial engineering increasingly depends on solving large-scale optimization problems involving scheduling, routing, resource allocation, inventory control, energy management, and supply-chain coordination. Classical exact methods often become computationally expensive when problem size, uncertainty, and combinatorial complexity grow rapidly. Although practical quantum computers are still developing, quantum-inspired computing approaches have emerged as powerful alternatives that adapt principles from quantum mechanics to run on classical hardware. This paper investigates quantum-inspired computing approaches for complex optimization problems in industrial engineering. It examines methodologies including simulated annealing, tensor-network optimization, Ising formulations, quantum- inspired evolutionary algorithms, digital annealers, and hybrid classical-intelligent heuristics. Applications in production scheduling, facility layout, vehicle routing, maintenance planning, portfolio optimization, warehouse operations, and smart manufacturing are analyzed. Particular attention is given to solution quality, scalability, stochastic decision-making, real-time adaptability, and integration with Industry 4.0 data systems. Benefits include faster near-optimal solutions, improved operational efficiency, reduced energy consumption, and better responsiveness under uncertainty. Major challenges include formulation difficulty, parameter tuning, benchmarking inconsistency, interpretability, and transition barriers within traditional industrial workflows. A future roadmap is proposed involving hybrid quantum-classical ecosystems, AI- guided optimization engines, digital twins, and autonomous decision platforms. The paper concludes that quantum-inspired computing can deliver practical industrial value today by bridging the gap between conventional optimization and future quantum advantage, especially in environments where speed, flexibility, and complexity management are essential.
This study explores quantum computing for combinatorial optimization, focusing on the Traveling Salesman Problem (TSP). Using Qiskit, the Quantum Approximate Optimization Algorithm (QAOA) is implemented on simulators and quantum hardware, and compared with classical optimization using Gurobi. TSP instances are encoded as Quadratic Unconstrained Binary Optimization (QUBO) problems derived from the Miller–Tucker–Zemlin formulation, with quadratic penalties enforcing degree and subtour constraints. Results indicate that QAOA consistently generates feasible tours, but classical branch-and-bound methods achieve better solution quality and runtime. On Noisy Intermediate-Scale Quantum (NISQ) devices, performance degrades with problem size due to sensitivity to parameter tuning, penalty scaling, and hardware noise. Among the tested classical optimizers, COBYLA provides the best balance of efficiency and noise tolerance. Overall, this work establishes a reproducible quantum-classical workflow, provides performance baselines, and identifies critical factors such as encoding design, optimizer choice, and error mitigation for improving near-term quantum heuristic performance.
Quantum-inspired algorithms (QIAs) are computationally efficient algorithms that generate a quantum model in classical hardware as an alternative to the use of quantum models. In this research paper, the researchers carried out an experimental appraisal of four quantum-inspired algorithms in quantum-inspired Evolutionary Algorithm (QEA), quantum-behaved Particle Swarm Optimization (QPSO), quantum-inspired Genetic Algorithm (QIGA) and quantum Simulated Annealing (QSA) on benchmark optimization functions. The introduction of a simulation-based methodology was done in Python to test the convergence speed, global search capability, accuracy and robustness. According to the experimental findings, QPSO always performs well compared with other methods in the achievement of faster convergence and enhanced global optimality, but QEA is highly successful in cases of discrete combinatorial problems. The paper concludes that quantum-inspired models are effective in modeling the key quantum concepts like probabilistic superposition and tunneling to attain high quality optimization results with conventional computing platforms. Such results demonstrate the opportunities of QIAs as scalable pre-quantum tools of designing, AI, and industrial optimization.
Purpose: The development of engineering decision support systems requires effective optimization techniques to deal with complex optimization problems such as energy management, logistics optimization, and resource management. The most popular classical optimization techniques, such as Genetic Algorithm (GA) and Particle Swarm Optimization (PSO), are often less effective in terms of optimization performance and are often likely to suffer from slow optimization speed and premature convergence to local optima when dealing with highdimensional optimization search space. The quantum-inspired optimization (QIO) techniques are an emerging class of optimization techniques that attempt to mimic some principles of quantum computing on classical computers to overcome the limitations of classical optimization techniques. The purpose of this research is to develop a quantum-inspired optimization framework to overcome the limitations of classical optimization techniques in engineering decision support systems. Method: The proposed optimization framework incorporates a probabilistic amplitude representation of solutions, rotation-based evolutionary optimization, and simulated annealing acceptance criteria. The optimization framework was tested on two optimization scenarios: a highdimensional optimization problem inspired by a Rastrigin-like function representing energy management optimization and a multi-objective optimization problem inspired by logistics optimization with the goal of minimizing transportation costs and time. The optimization performance and effectiveness of the proposed optimization framework were compared with classical optimization techniques such as GA and PSO. Findings: The proposed optimization framework outperforms traditional methods such as GA and PSO in terms of speed and quality of results. In the high-dimensional problem, the proposed framework achieved an optimal value of 38.96, which is better compared to the results of PSO, which achieved 69.42, and GA, which achieved 137.22. In the multi-objective problem, the proposed framework achieved Pareto results, which show better performance and effectiveness compared to the traditional methods. Conclusion: The optimization results indicate that the quantum-inspired optimization framework is an effective optimization tool that can be used to overcome the limitations of classical optimization techniques in engineering decision support systems. The proposed optimization framework provides a link between classical optimization techniques and emerging quantum optimization techniques while being able to run on classical computers.