A heuristic algorithm is one that is designed to solve a problem in a faster and more efficient fashion than traditional methods by sacrificing optimality, accuracy, precision, or completeness for speed. Heuristic algorithms often times used to solve NP-complete problems, a class of decision problems. In these problems, there is no known efficient way to find a solution quickly and accurately although solutions can be verified when given. Heuristics can produce a solution individually or be used to provide a good baseline and are supplemented with optimization algorithms. Heuristic algorithms are most often employed when approximate solutions are sufficient and exact solutions are necessarily computationally expensive

Last modified

• 11/29/2018

Creator

• Vincent Kenny
• Matthew Nathal
• Spencer Saldana

DOI

• https://doi.org/10.21985/N2HB44

Keyword

• Heuristic

Rights statement

• In Copyright