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

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

1 2 3 ... 51 52 53 next

  1. Brimberg, Jack; Drezner, Zvi: Improved starting solutions for the planar (p)-median problem (2021)
  2. Cavero, Sergio; Pardo, Eduardo G.; Laguna, Manuel; Duarte, Abraham: Multistart search for the cyclic cutwidth minimization problem (2021)
  3. Chang, Jian; Wang, Lifang; Hao, Jin-Kao; Wang, Yang: Parallel iterative solution-based Tabu search for the obnoxious (p)-median problem (2021)
  4. Rao, Yunqing; Wang, Peng; Luo, Qiang: Hybridizing beam search with tabu search for the irregular packing problem (2021)
  5. Acharyya, S.; Datta, A. K.: Matching formulation of the staff transfer problem: meta-heuristic approaches (2020)
  6. Alcaraz, Javier; García-Nové, Eva M.; Landete, Mercedes; Monge, Juan F.: The linear ordering problem with clusters: a new partial ranking (2020)
  7. Aribi, Walid Ben; Ammar, Hamadi; Alaya, Mohamed Ben: Stochastic global optimization using tangent minorants for Lipschitz functions (2020)
  8. Brandão, José: A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem (2020)
  9. Casado, Silvia; Laguna, Manuel; Pacheco, Joaquín; Puche, Julio C.: Grouping products for the optimization of production processes: a case in the steel manufacturing industry (2020)
  10. Drezner, Tammy; Drezner, Zvi; Kalczynski, Pawel: Directional approach to gradual cover: a maximin objective (2020)
  11. Freitas, Juliana Campos de; Florentino, Helenice de Oliveira; Benedito, Antone dos Santos; Cantane, Daniela Renata: Optimization model applied to radiotherapy planning problem with dose intensity and beam choice (2020)
  12. Ibrahim Alsaad, Dhurgam Kalel; Ghanbari, Reza; Sohrabi, Ali Akbar; Ghorbani Moghadam, Khatere: A new model for reassignment of tasks to available employees in Iraq’s firms (2020)
  13. Li, Mingjie; Hao, Jin-Kao; Wu, Qinghua: General swap-based multiple neighborhood adaptive search for the maximum balanced biclique problem (2020)
  14. Narvekar, Sanmit; Peng, Bei; Leonetti, Matteo; Sinapov, Jivko; Taylor, Matthew E.; Stone, Peter: Curriculum learning for reinforcement learning domains: a framework and survey (2020)
  15. Pamukcu, Duygu; Balcik, Burcu: A multi-cover routing problem for planning rapid needs assessment under different information-sharing settings (2020)
  16. Pastore, Tommaso; Martínez-Gavara, Anna; Napoletano, Antonio; Festa, Paola; Martí, Rafael: Tabu search for min-max edge crossing in graphs (2020)
  17. Radonjić Ɖogatović, Vesna; Ɖogatović, Marko; Stanojević, Milorad; Mladenović, Nenad: Revenue maximization of Internet of things provider using variable neighbourhood search (2020)
  18. Rashid, Kashif: Managing geological uncertainty in expensive reservoir simulation optimization (2020)
  19. Shinitzky, Hilla; Stern, Roni: Batch repair actions for automated troubleshooting (2020)
  20. Thiruvady, Dhananjay; Lewis, Rhyd; Morgan, Kerri: Tackling the maximum happy vertices problem in large networks (2020)

1 2 3 ... 51 52 53 next