Research Article
A Matheuristic Approach Combining Local Search and Mathematical Programming
Algorithm 1
LS-MIP matheuristic algorithm.
begin | ; | = initialSolution(); | = ; | while within timeLimit do | = generateNeighbourhood(); | = findBest(); | while isTabu do | if cost of < cost of then | aspirationCriterion; | break; | replace ; | if then | = ; | noBestSol = 0; | noBestSol++; | = ; | update(tabuList); | check (diversificationCriterion, noBestSol); | |
|