Optimization, Tabu Search, Travelling Salesman.
from iteration 1 the best move that we can do in a way not to violate the constrains is by adding x3 and dropping x1. This will reduce the penalty from 100 -> 0. while increasing the cost from 16 -> 28. X3 now is considered as tabu. Iteration 2: now by the tabu status rule we make x3 as tabu. so we