An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search

@article{Moscato1993AnIT,
  title={An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search},
  author={Pablo Moscato},
  journal={Annals of Operations Research},
  year={1993},
  volume={41},
  pages={85-121}
}
  • P. Moscato
  • Published 1993
  • Mathematics, Computer Science
  • Annals of Operations Research
Population approaches suitable for global combinatorial optimization are discussed in this paper. They are composed of a number of distinguishable individuals called "agents", each one using a particular optimization strategy. Periods of independent search follow phases on which the population is restarted from new configurations. Due to its intrinsic parallelism and the asynchronicity of the method, it is particularly suitable for parallel computers. Results on two test problems are presented… Expand
A Hybrid Cellular Genetic Algorithm for the Capacitated Vehicle Routing Problem
TLDR
This chapter solves a large benchmark of the Capacitated Vehicle Routing Problem (CVRP) with a cGA hybridized with a problem customized recombination operation, an advanced mutation operator integrating three mutation methods, and two well-known local search algorithms for routing problems. Expand
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
An Evolutionary Tabu Search Algorithm And The NHL Scheduling Problem
TLDR
The hybrid method developed in this paper is well suited for Open Shop Scheduling problems (OSSP), and the results obtained appear to be quite satisfactory. Expand
Investigation of simulated annealing components to solve the university course timetabling problem
Simulated Annealing (SA) is a common meta-heuristic algorithm that has been widely used to solve complex optimization problems. This is due to its ease of implementation and capability to escape fromExpand
Controlled Pool Maintenance for Metaheuristics
TLDR
This study analyzes the main pool components for metaheuristics and presents a review of the literature on relevant strategies in tabu search, scatter search, and path relinking to highlight the critical aspects of effective pool maintenance. Expand
Towards an Evolutionary Method — Cooperating Multi-Thread Parallel Tabu Search Hybrid
TLDR
The method appears to be the first to propose a cooperation scheme where the initial population of the genetic algorithm is an elite set of solutions obtained by the parallel metaheuristic, while the best individuals generated during the genetic search enrich the pool of solutions available to all tabu search threads. Expand
A survey of AI-based metaheuristics for dealing with local optima in local search Technical Report Series Report Number CSM-416 September 2004
Meta-heuristics are methods that sit on top of local search algorithms. They perform the function of avoiding or escaping a local optimum and/or premature convergence. The aim of this paper is toExpand
Incorporating domain-specific heuristics in a particle swarm optimization approach to the quadratic assignment problem
We propose two variations on particle swarm optimization (PSO): the use of a heuristic function as an additional biasing term in PSO solution construction; and the use of a local search step in theExpand
Simulated Annealing
Simulated annealing is a well-studied local search metaheuristic used to address discrete and, to a lesser extent, continuous optimization problems. The key feature of simulated annealing is that itExpand
Metaheuristics for High School Timetabling
TLDR
The results show that GA with local search and tabu search based on temporary problem relaxations both outperform simulated annealing and handmade timetables. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 88 REFERENCES
Tabu Search Applied to the Quadratic Assignment Problem
TLDR
This paper describes an adaptation of Tabu Search, a recent technique to overcome local optimality, to the Quadratic Assignment Problem (QAP), and suggests that good tabu list sizes increase with dimension of the problem. Expand
Tabu Search - Part II
  • F. Glover
  • Mathematics, Computer Science
  • INFORMS J. Comput.
  • 1990
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. Expand
A Parallel Tabu Search Algorithm for Large Traveling Salesman Problems
  • C. Fiechter
  • Computer Science, Mathematics
  • Discret. Appl. Math.
  • 1994
TLDR
An efficient algorithm for getting almost optimal solutions of large traveling salesman problems is proposed, which uses the intermediate- and long-term memory concepts of tabu search as well as a new kind of move. Expand
Physical aspects of evolutionary optimization and adaptation.
TLDR
A model of an objective function based on polynucleotide folding is used to investigate the dynamics of evolutionary adaptation in finite populations and represents a realistic example of a highly ``rugged landscape. Expand
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
This paper discusses a highly effective heuristic procedure for generating optimum and near-optimum solutions for the symmetric traveling-salesman problem. The procedure is based on a generalExpand
Towards a general theory of adaptive walks on rugged landscapes.
TLDR
This article develops parts of a universal theory of adaptation on correlated landscapes by adaptive processes that have sufficient numbers of mutations per individual to "jump beyond" the correlation lengths in the underlying landscape. Expand
Tabu search: a tutorial and an application to neural networks
Tabu Search is a general heuristic procedure for global optimization. Based on simple ideas it has been extremely efficient in getting almost optimal solutions for many types of difficultExpand
Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
  • R. Karp
  • Mathematics, Computer Science
  • Math. Oper. Res.
  • 1977
TLDR
This work considers partitioning algorithms for the approximate solution of large instances of the traveling-salesman problem in the plane, in which partitioning is used in conjunction with existing heuristic algorithms. Expand
The NK model of rugged fitness landscapes and its application to maturation of the immune response.
TLDR
This work analyzes a class of mathematical models the authors call NK models and shows that these models capture significant features of the maturation of the immune response, which is currently thought to share features with general protein evolution. Expand
The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization
TLDR
The search for well-Solved Special Cases and Performance Guarantees for Heuristics, and Polyhedral Algorithms: Foundations of Polyhedral Theory and Practice (M. Padberg and M. Grotschel) are reviewed. Expand
...
1
2
3
4
5
...