Abstract

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. General Terms Algorithms,

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call