Heuristic Search Optimization
Heuristic Search Optimization refers to a family of algorithms for solving optimization problems by iteratively improving an estimate of the desired solution using heuristics, which are strategies or techniques that guide the search towards optimal solutions.
Areas of application
- Mixed-Integer Programming
- Non-Linear Programming
- Convex Optimization
- Evolutionary Algorithms
- Swarm Intelligence
Example
For example, a heuristic search algorithm could be used to find the shortest path between two cities on a map. The algorithm would start with an initial guess for the path and then iteratively improve the estimate based on heuristics such as distance or time estimates.