Combining a Local Search and Grover’s Algorithm in Black-Box Global Optimization

A combined global and local search metho

A combined global and local search method to deal with constrained optimization for continuous tabu search

✍ Xi Chen; Jing Yang; Zhaohua Li; Daqing Tian; Zhijiang Shao 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 269 KB

## Abstract Heuristic methods, such as tabu search, are efficient for global optimizations. Most studies, however, have focused on constraint‐free optimizations. Penalty functions are commonly used to deal with constraints for global optimization algorithms in dealing with constraints. This is some