backtracking search
Recently Published Documents


TOTAL DOCUMENTS

260
(FIVE YEARS 92)

H-INDEX

29
(FIVE YEARS 7)

2022 ◽  
Vol 70 (1) ◽  
pp. 1297-1313
Author(s):  
C. S. S. Anupama ◽  
L. Natrayan ◽  
E. Laxmi Lydia ◽  
Abdul Rahaman Wahab Sait ◽  
Jos�Escorcia-Gutierrez ◽  
...  

2022 ◽  
Vol 13 (1) ◽  
pp. 0-0

This manuscript investigates the performance of the backtracking search algorithm (BSA) to minimize various objectives for an economical and secure power system. A variety of single and multi - objectives are delineated and solved. This manuscript also includes the valve-point loading effect alongside the objectives considered. The simulation has been computed in the IEEE 30-bus, IEEE 57-bus and IEEE 118-bus test network. The simulation outcomes as obtained by the proposed BSA and various algorithms are compared. Convergence curves are plotted to testify the characteristics of the proposed BSA for proceeding towards the global minima.


Author(s):  
Sukanta Nama ◽  
Sushmita Sharma ◽  
Apu Kumar Saha ◽  
Amir H. Gandomi

Quantum ◽  
2021 ◽  
Vol 5 ◽  
pp. 550
Author(s):  
Kyle E. C. Booth ◽  
Bryan O'Gorman ◽  
Jeffrey Marshall ◽  
Stuart Hadfield ◽  
Eleanor Rieffel

Constraint programming (CP) is a paradigm used to model and solve constraint satisfaction and combinatorial optimization problems. In CP, problems are modeled with constraints that describe acceptable solutions and solved with backtracking tree search augmented with logical inference. In this paper, we show how quantum algorithms can accelerate CP, at both the levels of inference and search. Leveraging existing quantum algorithms, we introduce a quantum-accelerated filtering algorithm for the alldifferent global constraint and discuss its applicability to a broader family of global constraints with similar structure. We propose frameworks for the integration of quantum filtering algorithms within both classical and quantum backtracking search schemes, including a novel hybrid classical-quantum backtracking search method. This work suggests that CP is a promising candidate application for early fault-tolerant quantum computers and beyond.


Sign in / Sign up

Export Citation Format

Share Document