Tabu Search: Applications and Prospects
1993; Linguagem: Inglês
10.1142/9789812798190_0017
ISSN1793-0928
Autores Tópico(s)Mobile and Web Applications
ResumoSeries on Applied MathematicsNetwork Optimization Problems: Algorithms, Applications and Complexity, pp. 333-353 (1993) No AccessTabu Search: Applications and ProspectsStefan VoßStefan VoßTechnische Hochschule Darmstadt, FB 1/FG Operations Research, Hochschulstraße 1, D - 6100 Darmstadt, Germanyhttps://doi.org/10.1142/9789812798190_0017Cited by:17 (Source: Crossref) PreviousNext AboutSectionsPDF/EPUB ToolsAdd to favoritesDownload CitationsTrack CitationsRecommend to Library ShareShare onFacebookTwitterLinked InRedditEmail Abstract: Tabu Search is a metastrategy for guiding known heuristics to overcome local optimality. Successful applications of this kind of metaheuristic to a great variety of problems have been reported in the literature. In this paper we consider two applications of tabu search with special emphasis on dynamic tabu list management. Although still in its infancy, recently some implementations of tabu search on parallel computers have come up. Whereas these implementations are tailored to specific problems we attempt to provide ideas for a more general concept for developing parallel tabu search algorithms. FiguresReferencesRelatedDetailsCited By 17Cited by lists all citing articles based on Crossref citation.Initialization of metaheuristics: comprehensive review, critical analysis, and research directionsMalek Sarhani, Stefan Voß and Raka Jovanovic13 December 2022 | International Transactions in Operational Research, Vol. 30, No. 6Parallel Block-Based Simulated Annealing for the Single Machine Total Weighted Tardiness Scheduling ProblemWojciech Bożejko, Jarosław Pempera, Mariusz Uchroński and Mieczysław Wodecki23 September 2021Fitness Landscape Ruggedness Impact on PSO in Dealing with Three Variants of the Travelling Salesman ProblemAbtin Nourmohammadzadeh, Malek Sarhani and Stefan Voß5 February 2023Robust Single Machine Scheduling with Random Blocks in an Uncertain EnvironmentWojciech Bożejko, Paweł Rajba and Mieczysław Wodecki15 June 2020Parallel Combinatorial OptimizationVan‐Dat Cung, Bertrand Le Cun and Catherine Roucairol8 August 2014General Bibliography8 August 2014References1 June 2009Metaheuristics: Intelligent Problem SolvingMarco Caserta and Stefan Voß1 September 2009A Local-Search-Based Heuristic for the Demand-Constrained Multidimensional Knapsack ProblemPaola Cappanera and Marco Trubian1 Feb 2005 | INFORMS Journal on Computing, Vol. 17, No. 1The multidimensional 0–1 knapsack problem: An overviewArnaud Fréville1 May 2004 | European Journal of Operational Research, Vol. 155, No. 1Integrating Spent Products' Material into Supply Chains: The Recycling of End-Of-Life Vehicles as an ExampleFrank Schultmann, Moritz Zumkeller and Otto Rentz1 Jan 2004Parallel Tabu Search for Large Optimization ProblemsEl-Ghazali Talbi, Zouhir Hafidi and Jean-Marc Geib1 Jan 1999A parallel adaptive tabu search approachE.G. Talbi, Z. Hafidi and J-M. Geib1 Dec 1998 | Parallel Computing, Vol. 24, No. 14IMPROVING AQUATIC HABITAT CONDITIONS OVER TIME WHILE PRODUCING WOOD PRODUCTS: AN EXAMINATION OF OPTIONS 1Pete Bettinger, K. Norman Johnson and John Sessions8 June 2007 | JAWRA Journal of the American Water Resources Association, Vol. 34, No. 4Tabu Search and Adaptive Memory Programming — Advances, Applications and ChallengesFred Glover1 Jan 1997Parallel local searchM. G. A. Verhoeven and E. H. L. Aarts1 Sep 1995 | Journal of Heuristics, Vol. 1, No. 1Solving Quadratic Assignment Problems Using the Reverse Elimination MethodStefan Voß1 Jan 1995 Recommended Network Optimization Problems: Algorithms, Applications and ComplexityMetrics History PDF download
Referência(s)