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.
What our
customers say
 |
Mr Benno Giuliani |
“We selected SolveIT Software for Integrated Planning of the NCA demand chain as they are experienced in optimising complex and dynamic logistics processes. The NCA coal chain is a key asset in the Xstrata Coal Australia portfolio and is set for significant expansion in coming years. Ensuring we exceed customer expectations through optimisation of value, quality, quantity and cost of XCQ’s coal products is our primary goal, and logistics optimisation initiatives across our systems landscape is a key driver for improved commercial and operational outcomes.”
Transport and Logistics Manager
Xstrata Coal
Xstrata Coal