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.

References in zbMATH (referenced in 918 articles , 2 standard articles )

Showing results 1 to 20 of 918.
Sorted by year (citations)

1 2 3 ... 44 45 46 next

  1. Battistutta, Michele; Schaerf, Andrea; Urli, Tommaso: Feature-based tuning of single-stage simulated annealing for examination timetabling (2017)
  2. Bueno, Marcos L.P.; Hommersom, Arjen; Lucas, Peter J.F.; Linard, Alexis: Asymmetric hidden Markov models (2017)
  3. Bürgy, Reinhard: A neighborhood for complex job shop scheduling problems with regular objectives (2017)
  4. Galligari, Alessandro; Maischberger, Mirko; Schoen, Fabio: Local search heuristics for the zone planning problem (2017)
  5. Glover, Fred; Rego, César: New relationships for multi-neighborhood search for the minimum linear arrangement problem (2017)
  6. Hanafi, Saïd; Todosijević, Raca: Mathematical programming based heuristics for the 0--1 MIP: a survey (2017)
  7. Jayaswal, Sachin; Vidyarthi, Navneet; Das, Sagnik: A cutting plane approach to combinatorial bandwidth packing problem with queuing delays (2017)
  8. Ma, Fuda; Hao, Jin-Kao: A multiple search operator heuristic for the max-k-cut problem (2017)
  9. Martínez-Gavara, Anna; Campos, Vicente; Laguna, Manuel; Martí, Rafael: Heuristic solution approaches for the maximum minsum dispersion problem (2017)
  10. Rybarczyk, Agnieszka; Hertz, Alain; Kasprzak, Marta; Blazewicz, Jacek: Tabu search for the RNA partial degradation problem (2017)
  11. Sharma, Amita; Utz, Sebastian; Mehra, Aparna: Omega-CVaR portfolio optimization and its worst case analysis (2017)
  12. Vömel, Christof; de Lorenzi, Flavio; Beer, Samuel; Fuchs, Erwin: The secret life of keys: on the calculation of mechanical lock systems (2017)
  13. Zakouni, Amiyne; Luo, Jiawei; Kharroubi, Fouad: Genetic algorithm and tabu search algorithm for solving the static manycast RWA problem in optical networks (2017)
  14. Zyngier, Danielle: An uncertainty management framework for industrial applications (2017)
  15. Amaral, Paula; Pais, Tiago Cardal: Compromise ratio with weighting functions in a tabu search multi-criteria approach to examination timetabling (2016)
  16. Amaran, Satyajith; Sahinidis, Nikolaos V.; Sharda, Bikram; Bury, Scott J.: Simulation optimization: a review of algorithms and applications (2016)
  17. Cheng, T.C.Edwin; Peng, Bo; Lü, Zhipeng: A hybrid evolutionary algorithm to solve the job shop scheduling problem (2016)
  18. Chen, Yuning; Hao, Jin-Kao; Glover, Fred: A hybrid metaheuristic approach for the capacitated arc routing problem (2016)
  19. Cortinhal, Maria João; Mourão, Maria C^andida; Nunes, Ana Catarina: Local search heuristics for sectoring routing in a household waste collection context (2016)
  20. De Santis, M.; Festa, P.; Liuzzi, G.; Lucidi, S.; Rinaldi, F.: A nonmonotone GRASP (2016)

1 2 3 ... 44 45 46 next