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
Solving the hub location problem with modular link capacities
Hande Yaman,Giuliana Carello +1 more
TL;DR: This paper deals with a capacitated hub location problem arising in the design of telecommunications networks and presents an exact and a heuristic method to investigate whether it is possible to improve the results within limited computational times.
Journal ArticleDOI
A tabu search algorithm for the open shop scheduling problem
TL;DR: An efficient local search algorithm based on the tabu search technique is proposed for solving the open shop scheduling problem with the objective of minimizing makespan and results show that the algorithm performs extremely well on both benchmarks and randomly generated problems.
Tabu search techniques for large high-school timetabling problems
TL;DR: In this paper, a solution algorithm based on tabu search was proposed to solve the high school timetabling problem, which is NP-complete and is usually tackled using heuristic methods.
Journal ArticleDOI
The application of a tabu search metaheuristic to the assembly line balancing problem
TL;DR: This paper describes the application of tabu search, a metaheuristic technique for optimization problems, to assembly line balancing problems, and shows thattabu search always finds optimal solutions.
Journal ArticleDOI
When it is worthwhile to work with the stochastic RCPSP
TL;DR: This paper discusses when it is worth the effort, in heuristic algorithms, to work with stochastic durations instead of deterministic ones and develops two algorithms that include these procedures and that are capable of outperforming other existing heuristics in the literature.
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.