Skip to search formSkip to main contentSkip to account menu
Tabu Search - Part I
TLDR
The fundamental principles underlying tabu search as a strategy for combinatorial optimization problems are presented and more advanced considerations are examined, applying the basic ideas to special settings and outlining a dynamic move structure to insure finiteness.
View via Publisher
Future paths for integer programming and links to artificial intelligence
  • F. Glover
  • Computer Science
    Comput. Oper. Res.
  • 1 May 1986
View via Publisher
Tabu Search - Part II
  • F. Glover
  • Business
    INFORMS J. Comput.
  • 1 August 1989
TLDR
The elements of staged search and structured move sets are characterized, which bear on the issue of finiteness, and new dynamic strategies for managing tabu lists are introduced, allowing fuller exploitation of underlying evaluation functions.
View via Publisher
HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS
This paper proposes a class of surrogate constraint heuristics for obtaining approximate, near optimal solutions to integer programming problems. These heuristics are based on a simple framework that…
View via Publisher
In Modern Heuristic Techniques for Combinatorial Problems
A rock drill bit comprises a bit body and at least one rolling cone cutter mounted on the bit body, the rolling cone cutter comprising a plurality of tungsten carbide inserts including a plurality of…
Tabu Search
From the Publisher: This book explores the meta-heuristics approach called tabu search, which is dramatically changing our ability to solve a hostof problems that stretch over the realms of resource…
View via Publisher
A Template for Scatter Search and Path Relinking
  • F. Glover
  • Computer Science
    Artificial Evolution
  • 1 October 1997
TLDR
This work identifies a template for scatter search and path relinking methods that provides a convenient and user friendly basis for their implementation and describes Illustrative forms of these subroutines that make it possible to create methods for a wide range of optimization problems.
View via Publisher
IMPROVED LINEAR INTEGER PROGRAMMING FORMULATIONS OF NONLINEAR INTEGER PROBLEMS
A variety of combinatorial problems (e.g., in capital budgeting, scheduling, allocation) can be expressed as a linear integer programming problem. However, the standard devices for doing this often…
View via Publisher
Tabu Search: A Tutorial
TLDR
This paper presents tabu search, a heuristic procedure designed to guide other methods to escape the trap of local optimality, which has obtained optimal and near optimal solutions to a wide variety of classical and practical problems.
View via Publisher
Fundamentals of Scatter Search and Path Relinking
TLDR
The features of Scatter Search and Path Relinking are described, which set them apart from other evolutionary approaches, and that offer opportunities for creating increasingly more versatile and effective methods in the future.
...
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License