Heuristics: Representation of Search Space and Neighborhoods 2: Unterschied zwischen den Versionen

Aus Operations-Research-Wiki
Wechseln zu: Navigation, Suche
[unmarkierte Version][unmarkierte Version]
(Die Seite wurde neu angelegt: „'''Heuristics: Representaion of Search Space and Neighbourhoods''' == 1. Introduction == There are lots of heuristics and metaheuristics adressing search s…“)
 
(1. Introduction)
Zeile 2: Zeile 2:
  
  
== 1. Introduction ==
+
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.
  
There are lots of heuristics and metaheuristics adressing search space problems. In this article we take a closer look on the
+
2. Basic idea of Variable Search Space heuristics
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
+
==
+

Version vom 18. Juni 2013, 14:37 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