Questions tagged [tabu-search]

Tabu search is an optimization heuristic that uses a memory to guide the search into unexplored regions.

Tabu search is a trajectory-based metaheuristic that iteratively modifies a solution through small changes. It evaluates each of a possible number of changes and in general chooses that change that maximizes the gain on the fitness function. However, it also remembers previously made changes and avoids to revert changes that were made in the recent history, thus preventing the search to return to already explored areas. More advanced versions also feature additional memories that influence the decision to move towards promising areas.

34 questions
0
votes
1 answer

Roster/Timetable generation

I'm working on a tool to generate a timetable for employee up to a month taking into account commercial and labor law constraints. Few challenges and difference from similar problem: The shift concept contains breaks split up to half an hour. There…
0
votes
0 answers

Tabu Search in TSPTW

I applied Tabu Search in TSPTW problem, but it gives me result similar to getting best improvement using exchanging pivot rule (exchange between 2 cities ), However in some papers, it is stated that Tabu gives good result near to the optimal one (I…
Yasmin
  • 931
  • 3
  • 14
  • 35
0
votes
1 answer

Tabu search structures

I understand how Tabu search works, namely how it is similiar to Hill Climbing, however sets of points in the search space are remembered. This is called the Tabu list as the algorithm tries to avoid them. I then came across this quote which can be…
-1
votes
1 answer

Check for items visited in text file

I have a code that reads items in a text file. It reads them line-by-line. When an item is read it will be added to a list that prevents it from revisited again. When the list is full (max size), it will be cleared. However, there is a need to check…
1 2
3