Journal ArticleDOI
Tabu Search—Part II
Reads0
Chats0
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.Abstract:
This is the second half of a two part series devoted to the tabu search metastrategy for optimization problems. Part I introduced the fundamental ideas of tabu search as an approach for guiding other heuristics to overcome the limitations of local optimality, both in a deterministic and a probabilistic framework. Part I also reported successful applications from a wide range of settings, in which tabu search frequently made it possible to obtain higher quality solutions than previously obtained with competing strategies, generally with less computational effort. Part II, in this issue, examines refinements and more advanced aspects of tabu search. Following a brief review of notation, Part II introduces new dynamic strategies for managing tabu lists, allowing fuller exploitation of underlying evaluation functions. In turn, the elements of staged search and structured move sets are characterized, which bear on the issue of finiteness. Three ways of applying tabu search to the solution of integer programmin...read more
Citations
More filters
Journal ArticleDOI
Horse herd optimization algorithm: A nature-inspired algorithm for high-dimensional optimization problems
TL;DR: In this article, a new meta-heuristic algorithm inspired by horses' herding behavior for high-dimensional optimization problems is proposed, called the horse herd optimization algorithm (HOA), which is based on six important features: grazing, hierarchy, sociability, imitation, defense mechanism and roam.
Dissertation
Pattern search algorithms for mixed variable general constrained optimization problems
TL;DR: A new class of algorithms for solving nonlinearly constrained mixed variable optimization problems is presented that can exploit any available derivative information to speed convergence without sacrificing the flexibility often employed by GPS methods to find better local optima.
Journal ArticleDOI
An optimization methodology for intermodal terminal management
TL;DR: A solution to the problems of resource allocation and scheduling of loading and unloading operations in a container terminal is presented and it is shown that the optimized lists reduce the number of crane conflicts on the yard and the average length of the truck queues in the terminal.
Book ChapterDOI
Meta-heuristics: The State of the Art
TL;DR: The state of the art of meta-heuristics for combinatorial optimization problems has been discussed in this paper, focusing on the significant progress which general frames within the meta heuristics field have implied.
Journal ArticleDOI
Priority-based assignment and routing of a fleet of unmanned combat aerial vehicles
TL;DR: This paper considers the strategic routing of a fleet of unmanned combat aerial vehicles (UCAVs) to service a set of predetermined targets from a prior surveillance mission, and develops a Tabu search heuristic to coordinate the two problems.
References
More filters
Journal ArticleDOI
Optimization by Simulated Annealing
TL;DR: There is a deep and useful connection between statistical mechanics and multivariate or combinatorial optimization (finding the minimum of a given function depending on many parameters), and a detailed analogy with annealing in solids provides a framework for optimization of very large and complex systems.
Book
Integer programming
TL;DR: The principles of integer programming are directed toward finding solutions to problems from the fields of economic planning, engineering design, and combinatorial optimization as mentioned in this paper, which is a standard of graduate-level courses since 1972.
Journal ArticleDOI
Future paths for integer programming and links to artificial intelligence
TL;DR: Four key areas of Integer programming are examined from a framework that links the perspectives of artificial intelligence and operations research, and each has characteristics that appear usefully relevant to developments on the horizon.
The traveling salesman problem
TL;DR: This study tested human performance on a real and virtual floor, as well as in a threedimensional (3D) virtual space, and modeled these results by a graph pyramid algorithm, which suggests that deterioration of performance in the 3D space can be attributed to geometrical relations between hierarchical clustering in a3D space and coarse-to-fine production of a tour.
Journal ArticleDOI
Heuristics for integer programming using surrogate constraints
TL;DR: In this paper, a class of surrogate constraint heuristics are proposed for integer programming problems. But they are based on a simple framework that illuminates the character of several earlier heuristic proposals and provides a variety of new alternatives.