Package es.urjc.etsii.grafo.algorithms.vns
package es.urjc.etsii.grafo.algorithms.vns
-
ClassDescriptionDefault VNSNeighChange implementation that increments K one by one until it reaches maxK.Variable neighborhood search (VNS) is a metaheuristic for solving combinatorial and global optimization problems.Calculates K value for each VNS step.