The tabu search metaheuristic: How we used it
From MaRDI portal
Publication:1356212
DOI10.1007/BF01531073zbMath0878.68053OpenAlexW2052469048MaRDI QIDQ1356212
Alain Hertz, Dominique de Werra
Publication date: 14 December 1997
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01531073
Related Items
Tabu search for nonlinear and parametric optimization (with links to genetic algorithms), A parallel tabu search algorithm for large traveling salesman problems, Tabu Search metaheuristic for designing digital filters, A tabu search algorithm for computing an operational timetable, Dynamic tabu list management using the reverse elimination method, Hashing vectors for tabu search, A tabu search experience in production scheduling, Using a tabu search approach for solving the two-dimensional irregular cutting problem, On the use of some known methods for \(T\)-colorings of graphs, A graph partitioning heuristic for the parallel pseudo-exhaustive logical test of VLSI combinational circuits, Using the tabu search method for the distribution of supplies in a hospital, Unrelated parallel machine scheduling using local search, Simulated annealing and tabu search: Lessons from a line search, The depth and width of local minima in discrete solution spaces, Inverse chromatic number problems in interval and permutation graphs, Boolean query optimization and the 0-1 hyperbolic sum problem, Emergency facility location under random network damage: insights from the Istanbul case, Heuristic solution approaches to operational forest planning problems, Common due-date determination and sequencing using tabu search, Deadline scheduling of multiprocessor tasks, An improved tabu search approach for solving the job shop scheduling problem with tooling constraints, Tabu search techniques. A tutorial and an application to neural networks, A tabu thresholding algorithm for arc crossing minimization in bipartite graphs, A comparison of local search methods for flow shop scheduling, Metaheuristics: A bibliography, Foundations of operations research: from linear programming to data envelopment analysis, Least-cost network topology design for a new service: An application of tabu search, Lower and upper bounds for a two-level hierarchical location problem in computer networks, Finding a feasible course schedule using Tabu search, Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art, Developing exact and Tabu search algorithms for simultaneously determining AGV loop and P/D stations in single loop systems, EPCOT: An efficient procedure for coloring optimally with Tabu Search, TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph, Algorithms for the maximum satisfiability problem, Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs, Modeling and solving a real-life assignment problem at universities, Competitive methods for multi-level lot sizing and scheduling: tabu search and randomized regrets, Tabu search for large scale timetabling problems, Determining buffer location and size in production lines using tabu search, Global optimization for artificial neural networks: A tabu search application
Cites Work
- Using tabu search techniques for graph coloring
- Algorithms for the maximum satisfiability problem
- Tabu search for large scale timetabling problems
- A convoy scheduling problem
- A new heuristic method for the flow shop sequencing problem
- STABULUS: A technique for finding stable sets in large graphs with tabu search
- Future paths for integer programming and links to artificial intelligence
- The existence of persistent states in the brain
- Neural networks and physical systems with emergent collective computational abilities.