Heuristics: Representation of Search Space and Neighborhoods 2: Unterschied zwischen den Versionen
| [unmarkierte Version] | [unmarkierte Version] |
Goetza (Diskussion | Beiträge) (→1. Introduction) |
Goetza (Diskussion | Beiträge) |
||
| Zeile 7: | Zeile 7: | ||
2. Basic idea of Variable Search Space heuristics | 2. Basic idea of Variable Search Space heuristics | ||
| + | |||
| + | The Variable neighborhood search (VNS) is a methaheuristic based upon a systematic change of neighborhoods, aimed to solve combinatorial and global optimization problems and to find a local minimum. It does explore increasingly distant neighborhoods of the current solution and goes from this solution to the next new one but only if an improvement has been made. This assures that variables which are already at their optimal solutions are being kept and used to find neighboring solutions. Eventually this search routine will end in a local optima. | ||
Version vom 18. Juni 2013, 14:59 Uhr
Heuristics: Representaion of Search Space and Neighbourhoods
1. Introduction
There are lots of heuristics and metaheuristics adressing search space problems. In this article we take a closer look on the variable-neighbourhood-search heuristic, further shortend with "vns". First we like to present the idea of vns, then we formulate the problem and the algorithm mathematically and show its implementation in the travelling salesman problem.
2. Basic idea of Variable Search Space heuristics
The Variable neighborhood search (VNS) is a methaheuristic based upon a systematic change of neighborhoods, aimed to solve combinatorial and global optimization problems and to find a local minimum. It does explore increasingly distant neighborhoods of the current solution and goes from this solution to the next new one but only if an improvement has been made. This assures that variables which are already at their optimal solutions are being kept and used to find neighboring solutions. Eventually this search routine will end in a local optima.
