© 2026 Aqora Quantum S.A.S.

Terms Privacy Legal Notice

Hybrid Pattern Search-Quantum Optimization Method for Engineering Optimization Problems

Fawzan S. Alfares, Athoob A. Alabdaly, Mohamed S. Alfares, Emad A. Khorshid

Published Jan 17, 2024• 0 citations

Abstract

Abstract The Quantum-Based Optimisation Method (QBOM) is a novel optimization approach based on quantum computing concepts. The novel optimization method's durability is studied using its capacity to conjoin with existing optimization techniques. This study uses The QBOM with the Pattern Search (PS) technique to solve engineering optimization problems. The first strategy, Hybrid I, uses QBOM for global search optimization, followed by PS searching in the nearby region for the optimum solution. The second strategy, Hybrid II, uses QBOM as a local search optimization within Pattern Search. In each iteration, QBOM starts searching inside PS for a better solution than the one detected at that stage, which is labelled as PS's new search point. These two hybrid techniques attempt to expand the possibilities of QBOM's local search mechanism while demonstrating its resilience. The hybridised methodologies are used to solve benchmark optimization problems and six real-world engineering optimization problems. The study revealed that the two hybrid techniques worked brilliantly, producing solutions that exceeded previous methods described in the literature for certain benchmark optimization problems. Not only did the hybridised methods produce better results in less computational time, but they also demonstrated that QBOM could be used to improve the search mechanism and accelerate the performance of the evolutionary algorithm in the local search to match its execution in the global search.

DOI: 10.21203/rs.3.rs-3860130/v1

Related papers

An Adaptive Quantum Evolutionary Algorithm for Engineering Optimization Problems

Ashish Mani, C. Patvardhan

Real world problems in engineering domain are typically constraint optimization problems.An Adaptive Quantum Evolutionary Algorithm for solving such problems is proposed in this paper.The proposed technique uses a novel qubits representation for search and optimization and uses feasibility rules for handling constraints.Moreover, it does not need stochastic ranking or niching or other methods for maintaining diversity.It does not even require mutation and local heuristics.The algorithm is tested on a standard set of four widely studied benchmark engineering design optimization problems.The results obtained are better than the existing state of the art approaches.The proposed algorithm is simple in concept and implementation, while being robust.

International Journal of Computer Applications•Feb 25, 2010•11 citations

Quantum evolutionary computational technique for constrained engineering optimization

V. Astuti, K. Hans Raj

A Quantum Evolutionary Computational Technique (QECT) is proposed in this paper. The approach is based on the integration of quantum computing concepts such as superposition of states, application of quantum gate with the concept of genetic algorithm and simulated annealing. To demonstrate effectiveness and applicability of QECT, simulations are carried out on five Benchmark Test functions, which are well-known combinatorial optimization problems. These exemplify that the proposed algorithm has a capability to obtain near global optimum, without premature convergence unlike other variants. QECT has the strong capability to explore the nonlinear search regions and it is a step forward in the area of hybrid stochastic search. It is applied on a problem of mechanical engineering design of a pressure vessel. The application of proposed heuristic technique in mechanical engineering design is a step towards agility in design and manufacturing.

International Conference on Next Generation Computing Technologies•Oct 1, 2016•1 citation

Adaptive Hybrid Quantum-Inspired Optimization for Enhanced Global Search Efficiency

Annam Rupa

In this paper a new optimization algorithm named Adaptive Hybrid Quantum-Inspired Optimization Algorithm (AHQSOA) is presented for solving the complex optimization problems effectively. Stochastic traditional algorithms typically fail to come to be stuck in local optimum solutions and they need quite few iterations for converging. Our method integrates two quantum-inspired methodology: Quantum Particle Swarm Optimization (QPSO) for searching a large set solutions based on properties of quantum mechanics - superposition, point are located as randomly as possible, and Quantum Evolutionary Algorithms (QEA) for refining potential solutions by mutation and crossover operation. An adaptive tuning component based on the reinforcement learning dynamically adjusts the algorithm’s parameters, thus balancing the exploration in the wide interval and exploitation in the precise interval. Assessed on the commonly used benchmark functions like Sphere, Rosenbrock, Rastrigin, AHQSOA exhibits faster convergence (only 400 iterations in comparison to 1200 in standard methods), global search superiority (94% whereas 75–87% the traditional methods), and low computational simplicity. These results show all of our algorithm are nicer and faster and more efficient and robust makes for it a good candidate as for high dimensional and complex optimization problems.

Journal of Information Systems Engineering & Management•Apr 3, 2025•1 citation

Quantum-Enhanced Generalized Pattern Search Optimization

Colton Mikes, David H. Gutman, Victoria E. Howle

While the development of quantum computers promises a myriad of advantages over their classical counterparts, care must be taken when designing algorithms that substitute a classical technique with a potentially advantageous quantum method. The probabilistic nature of many quantum algorithms may result in new behavior that could negatively impact the performance of the larger algorithm. The purpose of this work is to preserve the advantages of applying quantum search methods for generalized pattern search algorithms (GPSs) without violating the convergence criteria. It is well known that quantum search methods are able to reduce the expected number of oracle calls needed for finding the solution to a search problem from O(N) to O(N) However, the number of oracle calls needed to determine that no solution exists with certainty is exceedingly high and potentially infinite. In the case of GPS, this is a significant problem since overlooking a solution during an iteration will violate a needed assumption for convergence. Here, we overcome this problem by introducing the quantum improved point search (QIPS), a classical–quantum hybrid variant of the quantum search algorithm QSearch. QIPS retains the O(N) oracle query complexity of QSearch when a solution exists. However, it is able to determine when no solution exists, with certainty, using only O(N) oracle calls.

Quantum Reports•Sep 29, 2024•1 citation

Quantum-Guided Evolutionary Algorithms (QGEA)

Jincheng Zhang

Quantum-Guided Evolutionary Algorithms (QGEA) represent a novel approach to optimization by integrating quantum mechanics into the evolutionary algorithm framework. This paper proposes a method utilizing quantum simulations to enhance the search process, aiming to accelerate the discovery of optimal solutions to complex problems. We detail the core mechanism, the quantum-guided evolution process, and the expected benefits of this hybrid approach. The research explores the potential of leveraging quantum phenomena to identify subtle patterns and optimization strategies previously inaccessible to traditional evolutionary algorithms. This work introduces a framework for accelerating the solution of challenging problems across diverse fields, including machine learning, materials science, and logistics. We present a comprehensive analysis of the algorithm's performance, including simulations demonstrating its effectiveness in tackling specific optimization challenges.

•Sep 6, 2026•0 citations

Real-Coded Quantum Inspired Evolution Algorithm Applied to Engineering Optimization Problems

Fawzan S. Alfares, I.I. Esat

A novel evolutionary algorithm based on quantum computing concepts is applied to engineering optimization problems. Quantum computing mimics behavior of atoms in processing information. Quantum inspired algorithm is a concept, which employs certain elements of quantum computing to use in a wider class of search and optimization problems. The main parts of a quantum-inspired algorithm are the qubits (quantum equivalent of bits) and the quantum gates. Qubits hold the information in a superposition of all the states, while the quantum gates evolve the qubit to achieve the desired objective, which is, in optimization the maximum or the minimum. The paper addresses the ability of the Quantum-Inspired Evolution Algorithm (QIEA) to solve practical engineering optimization problems. QIEA, which is developed by authors, is based on their previous work and it is extended to acquire the floating-point representation of the information. The RQIEA is tested on a four benchmark engineering optimization problems. The results showed that the new algorithm has the ability to compete and even overcome other well known methods.

Leveraging Applications of Formal Methods•Nov 1, 2006•15 citations

Abstract The Quantum-Based Optimisation Method (QBOM) is a novel optimization approach based on quantum computing concepts. The novel optimization method's durability is studied using its capacity to conjoin with existing optimization techniques. This study uses The QBOM with the Pattern Search (PS) technique to solve engineering optimization problems. The first strategy, Hybrid I, uses QBOM for global search optimization, followed by PS searching in the nearby region for the optimum solution. The second strategy, Hybrid II, uses QBOM as a local search optimization within Pattern Search. In each iteration, QBOM starts searching inside PS for a better solution than the one detected at that stage, which is labelled as PS's new search point. These two hybrid techniques attempt to expand the possibilities of QBOM's local search mechanism while demonstrating its resilience. The hybridised methodologies are used to solve benchmark optimization problems and six real-world engineering optimization problems. The study revealed that the two hybrid techniques worked brilliantly, producing solutions that exceeded previous methods described in the literature for certain benchmark optimization problems. Not only did the hybridised methods produce better results in less computational time, but they also demonstrated that QBOM could be used to improve the search mechanism and accelerate the performance of the evolutionary algorithm in the local search to match its execution in the global search.

Real world problems in engineering domain are typically constraint optimization problems.An Adaptive Quantum Evolutionary Algorithm for solving such problems is proposed in this paper.The proposed technique uses a novel qubits representation for search and optimization and uses feasibility rules for handling constraints.Moreover, it does not need stochastic ranking or niching or other methods for maintaining diversity.It does not even require mutation and local heuristics.The algorithm is tested on a standard set of four widely studied benchmark engineering design optimization problems.The results obtained are better than the existing state of the art approaches.The proposed algorithm is simple in concept and implementation, while being robust.

A Quantum Evolutionary Computational Technique (QECT) is proposed in this paper. The approach is based on the integration of quantum computing concepts such as superposition of states, application of quantum gate with the concept of genetic algorithm and simulated annealing. To demonstrate effectiveness and applicability of QECT, simulations are carried out on five Benchmark Test functions, which are well-known combinatorial optimization problems. These exemplify that the proposed algorithm has a capability to obtain near global optimum, without premature convergence unlike other variants. QECT has the strong capability to explore the nonlinear search regions and it is a step forward in the area of hybrid stochastic search. It is applied on a problem of mechanical engineering design of a pressure vessel. The application of proposed heuristic technique in mechanical engineering design is a step towards agility in design and manufacturing.

In this paper a new optimization algorithm named Adaptive Hybrid Quantum-Inspired Optimization Algorithm (AHQSOA) is presented for solving the complex optimization problems effectively. Stochastic traditional algorithms typically fail to come to be stuck in local optimum solutions and they need quite few iterations for converging. Our method integrates two quantum-inspired methodology: Quantum Particle Swarm Optimization (QPSO) for searching a large set solutions based on properties of quantum mechanics - superposition, point are located as randomly as possible, and Quantum Evolutionary Algorithms (QEA) for refining potential solutions by mutation and crossover operation. An adaptive tuning component based on the reinforcement learning dynamically adjusts the algorithm’s parameters, thus balancing the exploration in the wide interval and exploitation in the precise interval. Assessed on the commonly used benchmark functions like Sphere, Rosenbrock, Rastrigin, AHQSOA exhibits faster convergence (only 400 iterations in comparison to 1200 in standard methods), global search superiority (94% whereas 75–87% the traditional methods), and low computational simplicity. These results show all of our algorithm are nicer and faster and more efficient and robust makes for it a good candidate as for high dimensional and complex optimization problems.

While the development of quantum computers promises a myriad of advantages over their classical counterparts, care must be taken when designing algorithms that substitute a classical technique with a potentially advantageous quantum method. The probabilistic nature of many quantum algorithms may result in new behavior that could negatively impact the performance of the larger algorithm. The purpose of this work is to preserve the advantages of applying quantum search methods for generalized pattern search algorithms (GPSs) without violating the convergence criteria. It is well known that quantum search methods are able to reduce the expected number of oracle calls needed for finding the solution to a search problem from O(N) to O(N) However, the number of oracle calls needed to determine that no solution exists with certainty is exceedingly high and potentially infinite. In the case of GPS, this is a significant problem since overlooking a solution during an iteration will violate a needed assumption for convergence. Here, we overcome this problem by introducing the quantum improved point search (QIPS), a classical–quantum hybrid variant of the quantum search algorithm QSearch. QIPS retains the O(N) oracle query complexity of QSearch when a solution exists. However, it is able to determine when no solution exists, with certainty, using only O(N) oracle calls.

Quantum-Guided Evolutionary Algorithms (QGEA) represent a novel approach to optimization by integrating quantum mechanics into the evolutionary algorithm framework. This paper proposes a method utilizing quantum simulations to enhance the search process, aiming to accelerate the discovery of optimal solutions to complex problems. We detail the core mechanism, the quantum-guided evolution process, and the expected benefits of this hybrid approach. The research explores the potential of leveraging quantum phenomena to identify subtle patterns and optimization strategies previously inaccessible to traditional evolutionary algorithms. This work introduces a framework for accelerating the solution of challenging problems across diverse fields, including machine learning, materials science, and logistics. We present a comprehensive analysis of the algorithm's performance, including simulations demonstrating its effectiveness in tackling specific optimization challenges.

A novel evolutionary algorithm based on quantum computing concepts is applied to engineering optimization problems. Quantum computing mimics behavior of atoms in processing information. Quantum inspired algorithm is a concept, which employs certain elements of quantum computing to use in a wider class of search and optimization problems. The main parts of a quantum-inspired algorithm are the qubits (quantum equivalent of bits) and the quantum gates. Qubits hold the information in a superposition of all the states, while the quantum gates evolve the qubit to achieve the desired objective, which is, in optimization the maximum or the minimum. The paper addresses the ability of the Quantum-Inspired Evolution Algorithm (QIEA) to solve practical engineering optimization problems. QIEA, which is developed by authors, is based on their previous work and it is extended to acquire the floating-point representation of the information. The RQIEA is tested on a four benchmark engineering optimization problems. The results showed that the new algorithm has the ability to compete and even overcome other well known methods.