Results 11 - 20 of 3,048

Tabu Search for SAT

by Bertrand Mazure, Lakhdar Sais, Eric Gregoire - IN PROCEEDINGS OF AAAI’97 , 1997
"... In this paper, tabu search for SAT is investigated from an experimental point of view. To this end, TSAT, a basic tabu search algorithm for SAT, is introduced and compared with Selman et al. Random Walk Strategy GSAT procedure, in short RWS-GSAT. TSAT does not involve the additional ..."
Abstract - Cited by 50 (2 self) - Add to MetaCart
In this paper, tabu search for SAT is investigated from an experimental point of view. To this end, TSAT, a basic tabu search algorithm for SAT, is introduced and compared with Selman et al. Random Walk Strategy GSAT procedure, in short RWS-GSAT. TSAT does not involve the additional

A tabu search algorithm for . . .

by Marco A. Wisniewski, Marcus Ritt, Luciana S. Buriol
"... This paper considers the three-dimensional loading capacitated vehicle routing problem. It consists in finding a shortest routing of a fleet of vehicles through a network so as to deliver goods to customers and loading those goods into the vehicle satisfying three-dimensional loading constraints. We ..."
Abstract - Add to MetaCart
. We address the routing problem by means of a tabu search and a first-improvement local search. The loading is efficiently done by a randomized bottom-left based algorithm that uses a multipleviews data structure. Through computational experiments we show that our approach is able to produce quality

Human-Guided Tabu Search

by Gunnar W. Klau, Neal Lesh, Joe Marks, Michael Mitzenmacher - In Proceedings of the 18th National Conference on Artificial Intelligence , 2002
"... We present a human-guidable and general tabu search algorithm. ..."
Abstract - Cited by 25 (8 self) - Add to MetaCart
We present a human-guidable and general tabu search algorithm.

Tabu Search Techniques for Examination Timetabling

by Luca Di Gaspero, Andrea Schaerf , 2000
"... this paper we present an ongoing research on the development of a solution algorithm for Examination Timetabling based on tabu search (TS) [8]. The algorithm makes use of several features imported from the literature on the Graph Colouring problem. We perform preliminary experiments of the algorithm ..."
Abstract - Cited by 57 (5 self) - Add to MetaCart
this paper we present an ongoing research on the development of a solution algorithm for Examination Timetabling based on tabu search (TS) [8]. The algorithm makes use of several features imported from the literature on the Graph Colouring problem. We perform preliminary experiments

Tabu search fundamentals and uses

by Fred Glover , 1995
"... Tabu search has achieved widespread successes in solving practical optimization problems. Applications are rapidly growing in areas such as resource management, process design, logistics, technology planning, and general combinatorial optimization. Hybrids with other procedures, both heuristic and a ..."
Abstract - Cited by 24 (0 self) - Add to MetaCart
and algorithmic, have also produced productive results. We examine some of the principal features of tabu search that are most responsible for its successes, and that offer a basis for improved solution methods in the future. Note: This expanded version contains additional illustrations and information

Tabu search and adaptive memory programing – Advances, applications and challenges

by Fred Glover - Interfaces in Computer Science and Operations Research , 1996
"... Tabu search (TS) has provided advances for solving difficult optimization problems in many domains. At the same time, fundamental TS strategies are often not applied as effectively as they might be, and their underlying rationale is often not completely understood. We examine basic concepts and prin ..."
Abstract - Cited by 117 (7 self) - Add to MetaCart
TS strategies that provide useful alternatives to procedures often associated with "evolutionary " or "genetic " algorithms. Specific tabu search applications are also summarized to provide a clearer understanding of settings where the method is being used. Finally

Variable neighborhood search: Principles and applications

by Pierre Hansen, Nenad Mladenovic , 2001
"... Systematic change of neighborhood within a possibly randomized local search algorithm yields a simple and effective metaheuristic for combinatorial and global optimization, called variable neighborhood search (VNS). We present a basic scheme for this purpose, which can easily be implemented using an ..."
Abstract - Cited by 198 (15 self) - Add to MetaCart
-level VNS, called variable neighborhood decomposition search (VNDS); modifying the basic scheme to explore easily valleys far from the incumbent solution yields an efficient skewed VNS (SVNS) heuristic. Finally, we show how to stabilize column generation algorithms with help of VNS and discuss various ways

An evolutionary tabu search algorithm and the NHL scheduling problem

by Daniel Costa - INFOR , 1995
"... We present in this paper a new evolutionary procedure for solving general optimization problems that combines efficiently the mechanisms of genetic algorithms and tabu search. In order to explore the solution space properly interaction phases are interspersed with periods of optimization in the algo ..."
Abstract - Cited by 42 (0 self) - Add to MetaCart
We present in this paper a new evolutionary procedure for solving general optimization problems that combines efficiently the mechanisms of genetic algorithms and tabu search. In order to explore the solution space properly interaction phases are interspersed with periods of optimization

Learning to cluster web search results

by Gaojie He, Co-supervisor Robert Neumayer, Gaojie He, Robert Neumayer, Kjetil Norvag - In Proc. of SIGIR ’04 , 2004
"... In web search, surfers are often faced with the problem of selecting their most wanted information from the potential huge amount of search results. The clustering of web search results is the possible solution, but the traditional content based clustering is not sufficient since it ignores many uni ..."
Abstract - Cited by 195 (7 self) - Add to MetaCart
unique features of web pages. The link structure, authority, quality, or trustfulness of search results can play even the higher role than the actual contents of the web pages in clustering. These possible extents are reflected by Google's PageRank algorithm, HITS algorithm and etc. The main goal

Optimization of HMM by the tabu search algorithm

by Tsong-yi Chen, Xiao-dan Mei, Jeng-shyang Pan - In ROCLING , 2001
"... In this paper, a simple version of the tabu search algorithm is employed to train a Hidden Markov Model (HMM) to search out the optimal parameter structure of HMM for automatic speech recognition. The proposed TS-HMM training provides a mecha-nism that allows the search process to escape from a loca ..."
Abstract - Cited by 3 (1 self) - Add to MetaCart
In this paper, a simple version of the tabu search algorithm is employed to train a Hidden Markov Model (HMM) to search out the optimal parameter structure of HMM for automatic speech recognition. The proposed TS-HMM training provides a mecha-nism that allows the search process to escape from a
Results 11 - 20 of 3,048