BSA: A Hybrid Bees’ Simulated Annealing Algorithm To Solve Optimization & NP-Complete Problems
Swarm-based algorithms such as Bees Algorithm BA have proven to be verypowerful computational techniques due to their search capabilities. Other methodswhich are useful in diverse application areas are simulated annealing, evolutionstrategies etc. The searching ability of these algorithms can be imp...
Main Authors: | Ahmed Tariq Sadiq, Amaal Ghazi Hamad |
---|---|
Format: | Article |
Language: | English |
Published: |
Unviversity of Technology- Iraq
2010-01-01
|
Series: | Engineering and Technology Journal |
Online Access: | https://etj.uotechnology.edu.iq/article_26939_5d631c51b012b5397b1378492fcd641e.pdf |
Similar Items
-
Using Ant Colony Algorithm to solve NP-Complete problems
by: Waffa Abdul-Abbas
Published: (2019-05-01) -
Using Ant Colony Algorithm to solve NP-Complete problems
by: Waffa Abdul-Abbas
Published: (2019-05-01) -
Using Ant Colony Algorithm to solve NP-Complete problems
by: Waffa Abdul-Abbas
Published: (2019-05-01) -
Classifying and Benchmarking Quantum Annealing Algorithms Based on Quadratic Unconstrained Binary Optimization for Solving NP-Hard Problems
by: Jehn-Ruey Jiang, et al.
Published: (2023-01-01) -
Solving the Rubik’s Cube optimally is NP-complete
by: Demaine, Erik D, et al.
Published: (2019)