Tabu search
A user’s guide to tabu search. We describe the main features of tabu search, emphasizing a perspective for guiding a user to understand basic implementation principles for solving combinatorial or nonlinear problems. We also identify recent developments and extensions that have contributed to increasing the efficiency of the method. One of the useful aspects of tabu search is the ability to adapt a rudimentary prototype implementation to encompass additional model elements, such as new types of constraints and objective functions. Similarly, the method itself can be evolved to varying levels of sophistication. We provide several examples of discrete optimization problems to illustrate the strategic concerns of tabu search, and to show how they may be exploited in various contexts. Our presentation is motivated by the emergence of an extensive literature of computational results, which demonstrates that a well-tuned implementation makes it possible to obtain solutions of high quality for difficult problems, yielding outcomes in some settings that have not been matched by other known techniques.
Keywords for this software
References in zbMATH (referenced in 931 articles , 2 standard articles )
Showing results 1 to 20 of 931.
Sorted by year (- Ben Jouida, Sihem; Krichen, Saoussen: A DSS based on optimizer tools and MTS meta-heuristic for the warehousing problem with conflicts (2018)
- Chen, Yuning; Hao, Jin-Kao: Two phased hybrid local search for the periodic capacitated arc routing problem (2018)
- Noham, Reut; Tzur, Michal: Designing humanitarian supply chains by incorporating actual post-disaster decisions (2018)
- Sioud, A.; Gagné, C.: Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times (2018)
- Battistutta, Michele; Schaerf, Andrea; Urli, Tommaso: Feature-based tuning of single-stage simulated annealing for examination timetabling (2017)
- Bueno, Marcos L.P.; Hommersom, Arjen; Lucas, Peter J.F.; Linard, Alexis: Asymmetric hidden Markov models (2017)
- Bürgy, Reinhard: A neighborhood for complex job shop scheduling problems with regular objectives (2017)
- Cabrera-Guerrero, Guillermo; Lagos, Carolina; Castañeda, Carolina; Johnson, Franklin; Paredes, Fernando; Cabrera, Enrique: Parameter tuning for local-search-based matheuristic methods (2017)
- Galligari, Alessandro; Maischberger, Mirko; Schoen, Fabio: Local search heuristics for the zone planning problem (2017)
- Glover, Fred; Rego, César: New relationships for multi-neighborhood search for the minimum linear arrangement problem (2017)
- Hanafi, Saïd; Todosijević, Raca: Mathematical programming based heuristics for the 0--1 MIP: a survey (2017)
- Jayaswal, Sachin; Vidyarthi, Navneet; Das, Sagnik: A cutting plane approach to combinatorial bandwidth packing problem with queuing delays (2017)
- Ma, Fuda; Hao, Jin-Kao: A multiple search operator heuristic for the max-k-cut problem (2017)
- Martínez-Gavara, Anna; Campos, Vicente; Laguna, Manuel; Martí, Rafael: Heuristic solution approaches for the maximum minsum dispersion problem (2017)
- Rybarczyk, Agnieszka; Hertz, Alain; Kasprzak, Marta; Blazewicz, Jacek: Tabu search for the RNA partial degradation problem (2017)
- Salem, Mariem Ben; Hanafi, Saïd; Taktak, Raouia; Abdallah, Han^ene Ben: Probabilistic tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem (2017)
- Sánchez-Oro, Jesús; Martínez-Gavara, Anna; Laguna, Manuel; Martí, Rafael; Duarte, Abraham: Variable neighborhood scatter search for the incremental graph drawing problem (2017)
- Sergienko, I. V.; Shylo, V. P.: Kernel technology to solve discrete optimization problems (2017)
- Sharma, Amita; Utz, Sebastian; Mehra, Aparna: Omega-CVaR portfolio optimization and its worst case analysis (2017)
- Vömel, Christof; de Lorenzi, Flavio; Beer, Samuel; Fuchs, Erwin: The secret life of keys: on the calculation of mechanical lock systems (2017)