Editing Tabu search (section)

==Background==

The word ''[[Taboo#Etymology|tabu]]'' comes from  the [[Tongan language|Tongan]] word to indicate things that cannot be touched because they are sacred.<ref name="ise.ncsu.edu">{{Cite web | url=http://www.ise.ncsu.edu/fangroup/ie789.dir/IE789F_tabu.pdf | title=Courses}}</ref>

Tabu search is a [[metaheuristic]] algorithm that can be used for solving [[combinatorial optimization]] problems (problems where an optimal ordering and selection of options is desired).

Current applications of TS span the areas of [[Enterprise resource planning|resource planning]], telecommunications, [[Very-large-scale integration|VLSI design]], financial analysis, scheduling, space planning, energy distribution, molecular engineering, logistics, [[pattern classification]], flexible manufacturing, waste management, mineral exploration, biomedical analysis, environmental conservation and scores of others.  In recent years, journals in a wide variety of fields have published tutorial articles and computational studies documenting successes by tabu search in extending the frontier of problems that can be handled effectively — yielding solutions whose quality often significantly surpasses that obtained by methods previously applied. A comprehensive list of applications, including summary descriptions of gains achieved from practical implementations, can be found in <ref name="gloverlaguna1997">{{cite book |author1=F. Glover |author2=M. Laguna | year = 1997 | title = Tabu Search |url=https://archive.org/details/tabusearch00glov_0 |url-access=registration | publisher = Kluwer Academic Publishers |isbn=978-1-4613-7987-4}}</ref>