•
|
•
|
|
This
code is a java framework that helps you implement tabu search in a well-defined,
object-oriented design. OpenTS is
part of the Common Optimization Interface for Operations Research (COIN-OR or
simply COIN)
initiative. Tabu
Search for the n-Queens problem This
code is described in M Laguna (1994) “A
Guide to Implementing Tabu Search,” Investigación Operativa, vol.
4, no. 1, pp. 5-25. Scatter
Search for nonlinear optimization This
code is described in F. Glover, M . Laguna and R. Martí (forthcoming) “Scatter
Search,” Theory and Applications of Evolutionary Computation: Recent
Trends, A. Ghosh and S. Tsutsui (Eds.), Springer-Verlag. |