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 1067 articles , 2 standard articles )

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

1 2 3 ... 52 53 54 next

  1. Carvalho, Desiree M.; Nascimento, Mariá C. V.: Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup (2022)
  2. Karimi-Mamaghan, Maryam; Mohammadi, Mehrdad; Meyer, Patrick; Karimi-Mamaghan, Amir Mohammad; Talbi, El-Ghazali: Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art (2022)
  3. Nascimento Silva, Janio Carlos; Coelho, Igor M.; Souza, Ueverton S.; Ochi, Luiz Satoru; Coelho, Vitor N.: Finding the maximum multi improvement on neighborhood exploration (2022)
  4. Swan, Jerry; Adriaensen, Steven; Brownlee, Alexander E. I.; Hammond, Kevin; Johnson, Colin G.; Kheiri, Ahmed; Krawiec, Faustyna; Merelo, J. J.; Minku, Leandro L.; Özcan, Ender; Pappa, Gisele L.; García-Sánchez, Pablo; Sörensen, Kenneth; Voß, Stefan; Wagner, Markus; White, David R.: Metaheuristics “In the large” (2022)
  5. Brimberg, Jack; Drezner, Zvi: Improved starting solutions for the planar (p)-median problem (2021)
  6. Cavero, Sergio; Pardo, Eduardo G.; Laguna, Manuel; Duarte, Abraham: Multistart search for the cyclic cutwidth minimization problem (2021)
  7. Chang, Jian; Wang, Lifang; Hao, Jin-Kao; Wang, Yang: Parallel iterative solution-based Tabu search for the obnoxious (p)-median problem (2021)
  8. Drezner, Tammy; Drezner, Zvi; Kalczynski, Pawel: Directional approach to gradual cover: the continuous case (2021)
  9. Festa, Paola: Comments on: “Tabu search tutorial. A graph drawing application” (2021)
  10. Glover, Fred; Campos, Vicente; Martí, Rafael: Tabu search tutorial. A graph drawing application (2021)
  11. Glover, Fred; Campos, Vicente; Martí, Rafael: Rejoinder on: “Tabu search tutorial. A graph drawing application” (2021)
  12. Kim, Seohee; Lee, Chungmok: A branch and price approach for the robust bandwidth packing problem with queuing delays (2021)
  13. Lai, Xiangjing; Hao, Jin-Kao; Fu, Zhang-Hua; Yue, Dong: Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping (2021)
  14. López-Sánchez, A. D.; Sánchez-Oro, J.; Laguna, M.: A new scatter search design for multiobjective combinatorial optimization with an application to facility location (2021)
  15. Luo, Zhixing; Qin, Hu; Cheng, T. C. E.; Wu, Qinghua; Lim, Andrew: A branch-and-price-and-cut algorithm for the cable-routing problem in solar power plants (2021)
  16. Matos, Telmo; Oliveira, Óscar; Gamboa, Dorabela: RAMP algorithms for the capacitated facility location problem (2021)
  17. Zhang, Xindi; Li, Bohan; Cai, Shaowei; Wang, Yiyuan: Efficient local search based on dynamic connectivity maintenance for minimum connected dominating set (2021)
  18. Acharyya, S.; Datta, A. K.: Matching formulation of the staff transfer problem: meta-heuristic approaches (2020)
  19. Alcaraz, Javier; García-Nové, Eva M.; Landete, Mercedes; Monge, Juan F.: The linear ordering problem with clusters: a new partial ranking (2020)
  20. Aribi, Walid Ben; Ammar, Hamadi; Alaya, Mohamed Ben: Stochastic global optimization using tangent minorants for Lipschitz functions (2020)

1 2 3 ... 52 53 54 next