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 887 articles , 1 standard article )
Showing results 1 to 20 of 887.
Sorted by year (- 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)
- Zakouni, Amiyne; Luo, Jiawei; Kharroubi, Fouad: Genetic algorithm and tabu search algorithm for solving the static manycast RWA problem in optical networks (2017)
- Amaral, Paula; Pais, Tiago Cardal: Compromise ratio with weighting functions in a tabu search multi-criteria approach to examination timetabling (2016)
- Amaran, Satyajith; Sahinidis, Nikolaos V.; Sharda, Bikram; Bury, Scott J.: Simulation optimization: a review of algorithms and applications (2016)
- Cheng, T.C.Edwin; Peng, Bo; Lü, Zhipeng: A hybrid evolutionary algorithm to solve the job shop scheduling problem (2016)
- Chen, Yuning; Hao, Jin-Kao; Glover, Fred: A hybrid metaheuristic approach for the capacitated arc routing problem (2016)
- 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)
- De Santis, M.; Festa, P.; Liuzzi, G.; Lucidi, S.; Rinaldi, F.: A nonmonotone GRASP (2016)
- Ferrucci, Francesco; Bock, Stefan: Pro-active real-time routing in applications with multiple request patterns (2016)
- Gach, Olivier; Hao, Jin-Kao: Combined neighborhood tabu search for community detection in complex networks (2016)
- Goerigk, Marc; Westphal, Stephan: A combined local search and integer programming approach to the traveling tournament problem (2016)
- Holm, Åsa; Carlsson Tedgren, Åsa; Larsson, Torbjörn: Heuristics for integrated optimization of catheter positioning and Dwell time distribution in prostate HDR brachytherapy (2016)
- Khalid, Ruzelan; Nawawi, Mohd.Kamal Mohd.; Kawsar, Luthful A.; Ghani, Noraida A.; Kamil, Anton A.; Mustafa, Adli: The evaluation of pedestrians’ behavior using $M/G/C/C$ analytical, weighted distance and real distance simulation models (2016)
- Lai, Xiangjing; Hao, Jin-Kao: A tabu search based memetic algorithm for the Max-Mean dispersion problem (2016)
- Low, W.Z.; vanden Broucke, S.K.L.M.; Wynn, M.T.; ter Hofstede, A.H.M.; De Weerdt, J.; van der Aalst, W.M.P.: Revising history for cost-informed process improvement (2016)
- Pillay, Nelishia: A review of hyper-heuristics for educational timetabling (2016)
- Poppenborg, Jens; Knust, Sigrid: A flow-based tabu search algorithm for the RCPSP with transfer times (2016)
- Punnen, Abraham P.; Wang, Yang: The bipartite quadratic assignment problem and extensions (2016)
- Sánchez-Oro, Jesús; Laguna, Manuel; Martí, Rafael; Duarte, Abraham: Scatter search for the bandpass problem (2016)