Algorithms tabu search

Lin, B., Miller, D.C. Tabu search algorithm for chemical process optimization. Comput. Chem. Eng. 28, 2287-2306 (2004)... 

Pastor, R., Andres, C., Duran, A. and Perez, M., 2002. Tabu search algorithms for an industrial multi-product and multi-objective assembly line balancing problem with reduction of the task dispersion, Jb r a/ of Operational Research Society, 53,1317-1323. 

Mehrabad, M.S. Fattahi, P. (2007). Flexible job shop scheduling with tabu search algorithms. The International Journal of Advanced Manufacturing Technology, Vol. 32, No. 5-6, pp. 563-570. 

Edieston, O.S.S.T. Bartlett, L.M. (2012) A Tabu search algorithm applied to the staffing roster problem of Leicestershire police force. Journal of the Operational Research Society 63(4) 489 96. 

Genetic algorithms Scatter search Simulated annealing Tabu search... 

Heuristic Search / 10.5.2 Tabu Search / 10.5.3 Simulated Annealing / 10.5.4 Genetic and Evolutionary Algorithms /... 

II with a new chapter (for the second edition) on global optimization methods, such as tabu search, simulated annealing, and genetic algorithms. Only deterministic optimization problems are treated throughout the book because lack of space precludes discussing stochastic variables, constraints, and coefficients. 

Since scope economies are especially hard to quantify, a separate class of optimization models solely dealing with plant loading decisions can be found. For example, Mazzola and Schantz (1997) propose a non-linear mixed integer program that combines a fixed cost charge for each plant-product allocation, a fixed capacity consumption to reflect plant setup and a non-linear capacity-consumption function of the total product portfolio allocated to the plant. To develop the capacity consumption function the authors build product families with similar processing requirements and consider effects from intra- and inter-product family interactions. Based on a linear relaxation the authors explore both tabu-search heuristics and branch-and-bound algorithms to obtain solutions. 

The upper level sub-problem decides the locations of DC by the sophisticated tabu search. Tabu search (TS Glover, 1989) is a metaheuristic algorithm on a basis of local search technique with a memory structure. The TS repeats the local search iteratively to move from a current solution jr to a possible and best solution x in the neighbor of a . To avoid the cycling of the solution, the TS uses the tabu list that prohibits transition to any solutions for a while even if this will improve the current solution. 

Genetic algorithms Annealing techniques Dynamic programming Collocation methods Stochastic optimisation Agent-based computations Disjunctive programming Tabu search... 

Gavin, L., Fischer, U., Glover, F. and Flungerbilhler, K. (2004). Multi-objective process design in multi-purpose batch plants using tabu search optimization algorithm, Comput. Chem. Eng., 28, pp. 459-478. 

Hou, T., Wang, J., Chen, L. Xu, X. (1999). Automated docking of peptides and proteins by using a genetic algorithm combined with a tabu search. Protein Eng 12(8), 639-48. 

Cao T, Li T (2004) A combination of numeric genetic algorithm and tabu search can he applied to molecular docking. Comput Biol Chem 28(4) 303-312... 

Compare the optimization strategies of genetic algorithms, simulated annealing, and tabu search with those of local optimization methods. 

---