Results 1 - 10 of 74

Tabu Search -- Part I

by Fred Glover , 1989
"... This paper presents the fundamental principles underlying tabu search as a strategy for combinatorial optimization problems. Tabu search has achieved impressive practical successes in applications ranging from scheduling and computer channel balancing to cluster analysis and space planning, and more ..."
Abstract - Cited by 680 (11 self) - Add to MetaCart
term memory processes for intensifying and diversifying the search. Included are illustrative data structures for implementing the tabu conditions (and associated aspiration criteria) that underlie these processes. Part I concludes with a discussion of probabilistic tabu search and a summary

A tabu search heuristic for the vehicle routing problem

by Michel Gendreau, Alain Hertz, Gilbert Laporte - Management Science , 1994
"... Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at ..."
Abstract - Cited by 237 (25 self) - Add to MetaCart
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at

Tabu Search: A Tutorial

by Fred Glover - Interfaces , 1990
"... Tabu search is a "higher level " heuristic procedure for solving optimization problems, designed to guide other methods (or their component processes) to escape the trap of local optimality. Tabu search has obtained optimal and near optimal solutions to a wide variety of classical and prac ..."
Abstract - Cited by 145 (2 self) - Add to MetaCart
Tabu search is a "higher level " heuristic procedure for solving optimization problems, designed to guide other methods (or their component processes) to escape the trap of local optimality. Tabu search has obtained optimal and near optimal solutions to a wide variety of classical

Coloring by tabu branch and bound

by Fred Glover, Mark Parker, Jennifer Ryan - In Johnson and Trick [136
"... Abstract. We give an adaptive depth procedure for coloring a graph that combines elements of tabu search and branch and bound. The resulting tabu branch and bound method can execute searches of varying degrees of exhaustiveness at different stages and in different regions of the search space, rangin ..."
Abstract - Cited by 21 (0 self) - Add to MetaCart
Abstract. We give an adaptive depth procedure for coloring a graph that combines elements of tabu search and branch and bound. The resulting tabu branch and bound method can execute searches of varying degrees of exhaustiveness at different stages and in different regions of the search space

Artificial intelligence, heuristic frameworks and tabu search

by Fred Glover - Managerial & Decision Economics 11 , 1990
"... This paper examines some of the characteristics of Al-based heuristic procedures that have emerged as frameworks for solving difficult optimization problems. Consideration of attributes shared to some degree by human prohlem solvers leads to focusing in greater detail on one of the more-ituccessful ..."
Abstract - Cited by 15 (1 self) - Add to MetaCart
has provided solutions superior to the best obtained by other methods for a variety of problems. Our development emphasizes the principles underlying the interplay between restricting tbe searcb to avoid unproductive retracing of patbs (by tneans of tabu conditions) and freeing the search to explore

Restricted Neighbourhood Search: An Implicit Tabu Method

by Colin R. Reeves , 1995
"... Recent work [1] has highlighted the value of using a restricted candidate list in the implementation of the Tabu Search (TS) method. The original motivation for this approach was to reduce the amount of computation involved in applying TS to the solution of flowshop sequencing problems. However, it ..."
Abstract - Add to MetaCart
the restricted neighbourhood alone. These results suggest that RNS imposes an implicit tabu condition on certain elements of the solution, and that the size of the restriction may interact with the tabu tenure in interesting ways. Keywords: Tabu search, Neighbourhood search, Machine sequencing. Presented

Implementing and testing the tabu cycle and conditional probability methods

by Manuel Laguna - Computers and Operations Research , 2006
"... Abstract — The purpose of this paper is to describe the implementation and testing of the tabu cycle method and two variants of the conditional probability method. These methods were originally described in Glover and Laguna (1997) but have been largely ignored in the tabu search literature. For the ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
Abstract — The purpose of this paper is to describe the implementation and testing of the tabu cycle method and two variants of the conditional probability method. These methods were originally described in Glover and Laguna (1997) but have been largely ignored in the tabu search literature

1. SYMBIOTIC TABU SEARCH ALGORITHM

by Ramin Halavati, Saeed Bagheri Shouraki, Bahareh Jafari Jashmi, Mojdeh Jalali Heravi
"... Recombination in the Genetic Algorithm (GA) is supposed to extract the component characteristics from two parents and reassemble them in different combinations but this task requires recognition of good characteristics of both parents. Symbiotic Combination is formerly introduced as an alternative f ..."
Abstract - Add to MetaCart
an empty Tabu list. 2. Repeat until stopping condition is met: 2.1. Create a number of assemblies by randomly choosing none conflicting chromosomes from the pool. If an assembly can not be completed using existing chromosomes, create some random chromosomes with one specified bit for all missing locations

Problem Difficulty for Tabu Search in Job-Shop Scheduling

by Jean-paul Watson, Christopher Beck, Adele E. Howe, L. Darrell Whitley - Artificial Intelligence , 2002
"... Tabu search algorithms are among the most effective approaches for solving the job-shop scheduling problem (JSP). Yet, we have little understanding of why these algorithms work so well, and under what conditions. We develop a model of problem difficulty for tabu search in the JSP, borrowing from sim ..."
Abstract - Cited by 23 (9 self) - Add to MetaCart
Tabu search algorithms are among the most effective approaches for solving the job-shop scheduling problem (JSP). Yet, we have little understanding of why these algorithms work so well, and under what conditions. We develop a model of problem difficulty for tabu search in the JSP, borrowing from

Analysis of random walks using tabu lists

by Karine Altisen , Stéphane Devismes , Antoine Gerbaud , Pascal Lafourcade - Structural Information and Communication Complexity - 19th International Colloquium, SIROCCO 2012, Reykjavik, Iceland, June 30-July 2, 2012, Revised Selected Papers, volume 7355 of Lecture Notes in Computer Science , 2012
"... Abstract. A tabu random walk on a graph is a partially self-avoiding random walk which uses a bounded memory to avoid cycles. This memory is called a tabu list and contains vertices already visited by the walker. The size of the tabu list being bounded, the way vertices are inserted and removed fro ..."
Abstract - Cited by 2 (2 self) - Add to MetaCart
from the list, called here an update rule, has an important impact on the performance of the walk, namely the mean hitting time between two given vertices. We define a large class of tabu random walks, characterized by their update rules. We enunciate a necessary and sufficient condition
Results 1 - 10 of 74