Tabu search
= Tabu search
<Tabu search> keeps a short-term memory of recently reversed moves or visited attributes and prohibits them temporarily, reducing cycling in <local search>. It can select the best admissible neighbor even when that neighbor worsens the objective; an aspiration rule permits a tabu move when it improves the best known solution. For allocations, transfers and exchanges maintain feasibility and recent reverse transfers can be tabu.