 |
|
| ||||||||||||||||||||||||||
|
|
| ||||||||||||||||||||||||||
|
|
|
|
|
| ||||||||
A local optimum of a combinatorial optimization problem is a solution that is optimal within a neighboring set of solutions. This is in contrast to a global optimum, which is the optimal solution of the whole solution space.
The locality of the optimum is dependent on the neighborhood structure as defined by the meta heuristic that is used for optimizing the solution.
|
||||
| View Live Article | This article is from Wikipedia. All text is available under the terms of the GNU Free Documentation License | |
||
