|
 |
Tabu Search
Tabu Search is an iterative procedure for solving discrete combinatorial optimisation
problems. It has been successfully used to obtain optimal and
near-optimal solutions for problems involving scheduling, time-tabling,
and layout optimisation. The basic idea of Tabu Search is to explore the
search space of all feasible solutions by a sequence of moves. However,
to escape from locally optimal but not globally optimal solutions, and
to prevent cycling, some moves (at one particular iteration) are
classified as forbidden or “tabu.” Tabu moves are based on the
short-term and long-term history of the sequence of moves. A simple
implementation, for example, might classify a move as tabu if the
reverse move has been made recently or frequently.
To see how SolveIT Software can optimise your operation, please contact us.
|
|
