• Publications
  • Influence
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 thatExpand
  • 1,301
  • 90
  • PDF
Handbook of metaheuristics
List of Contributing Authors. Preface. 1. Scatter Search and Path Relinking: Advances and Applications F. Glover, et al. 2. An Introduction to Tabu Search M. Grenreau. 3. Genetic Algorithms C.Expand
  • 1,849
  • 45
Tabu Search: A Tutorial
TLDR
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. Expand
  • 992
  • 34
  • PDF
Tabu Search and Adaptive Memory Programming — Advances, Applications and Challenges
TLDR
We examine basic concepts and principles of tabu search, emphasizing those that have sometimes led to applying the label “adaptive memory programming” to this class of methods. Expand
  • 529
  • 30
  • PDF
Critical Event Tabu Search for Multidimensional Knapsack Problems
TLDR
We report a new approach to creating a tabu search method whose underlying memory mechanisms are organized around a strategic oscillation process that navigates both sides of the feasibility boundary and serves to define the critical events. Expand
  • 196
  • 17
  • PDF
Scatter search and path relinking
The evolutionary approach called scatter search, and its generalized form called path relinking, originated from strategies for creating composite decision rules and surrogate constraints. RecentExpand
  • 176
  • 13
  • PDF
Tabu Search Fundamentals and Uses
Tabu search has achieved widespread successes in solving practical optimization problems. Applications are rapidly growing in areas such as resource management, process design, logistics, technologyExpand
  • 102
  • 13
  • PDF
Scatter search and star-paths: beyond the genetic metaphor
Scatter search and genetic algorithms have originated from somewhat different traditions and perspectives, yet exhibit features that are strongly complementary. Links between the approaches haveExpand
  • 73
  • 12
Practical introduction to simulation optimization
TLDR
The merging of optimization and simulation has seen a rapid growth in recent years. Expand
  • 150
  • 11
Maximum matching in a convex bipartite graph
A special matching problem arising in industry is shown to be solvable by an algorithm of the form: match objects ai and bj if they satisfy a local optirnality criterion based on a ranking ofExpand
  • 166
  • 10