scholarly journals Tabu Search: A Comparative Study

Tabu Search ◽  
10.5772/5637 ◽  
2008 ◽  
Author(s):  
Harun Pirim ◽  
Engin Bayraktar ◽  
Burak Eksioglu
2012 ◽  
pp. 1734-1748
Author(s):  
José Francisco Ferreira Ribeiro

In this chapter a comparative study is presented between (I) sequential heuristics, (II) simulated annealing, (III) tabu search, and (IV) threshold algorithm for graph coloring and its application for solving the problem of the design of manufacturing cells in a job shop system production. The job shop production system has a very large proportion of all manufacturing activity. The principal concepts of manufacturing cells, graph theory, and heuristics are presented. The results obtained with these algorithms on several examples found in the literature are consistently equivalent with the best solution hitherto known in terms of numbers of inter-cell moves and dimensions of cells.


Author(s):  
Amalia Utamima ◽  
Arif Djunaidy ◽  
Angelia Melani Adrian

Several heuristics algorithms can be employed to solve single row layout in construction site planning. Firstly, this chapter builds Tabu Search to deal with the problem. Other heuristics methods which are genetic algorithm (GA) and estimation distribution algorithm (EDA) are also developed against Tabu Search. A comparative study is performed to test the effectiveness and efficiency of the algorithms. The statistical test, ANOVA followed by the t-test, compares the results of the three algorithms. Then, the pros and cons of using the algorithms are stated.


Author(s):  
José Francisco Ferreira Ribeiro

In this chapter a comparative study is presented between (I) sequential heuristics, (II) simulated annealing, (III) tabu search, and (IV) threshold algorithm for graph coloring and its application for solving the problem of the design of manufacturing cells in a job shop system production. The job shop production system has a very large proportion of all manufacturing activity. The principal concepts of manufacturing cells, graph theory, and heuristics are presented. The results obtained with these algorithms on several examples found in the literature are consistently equivalent with the best solution hitherto known in terms of numbers of inter-cell moves and dimensions of cells.


2020 ◽  
Author(s):  
Bruno Oliveira Ferreira de Souza ◽  
Éve‐Marie Frigon ◽  
Robert Tremblay‐Laliberté ◽  
Christian Casanova ◽  
Denis Boire

Sign in / Sign up

Export Citation Format

Share Document