Blar i Høgskolen i Molde på tidsskrift "Journal of Heuristics"
Viser treff 1-2 av 2
-
Delayed improvement local search
(Peer reviewed; Journal article, 2021)Local search is a fundamental tool in the development of heuristic algorithms. A neighborhood operator takes a current solution and returns a set of similar solutions, denoted as neighbors. In best improvement local search, ... -
Weighted proximity search
(Peer reviewed; Journal article, 2021)Proximity search is an iterative method to solve complex mathematical programming problems. At each iteration, the objective function of the problem at hand is replaced by the Hamming distance function to a given solution, ...