search

josura / ILS-minimum-node-weight-vertex-cover

1 stars 0 forks source link

Implementing variable depth neighbourhood and mixed operation for Local search #3

Open josura opened 2 years ago

josura commented 2 years ago

The neighbourhood is composed of a solution with 1 node removed and a solution with 1 node swapped out the solution with a node not in the solution.

It is kind of logical to expand the neighbourhood with 1 removal and 1 substitution(or even more removals and 1 or more substitutions), even though the size of the neighbourhood will be too high.

josura commented 2 years ago

Implemented mixed operation(1 remove+1swap).

josura commented 2 years ago

Implemented (1 remove+ n insertions) and (1 insertion + n remove), It remains to implement (p removals , m insertions).