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

DOI10.1007/BF02022564zbMath0775.90292MaRDI QIDQ2366996

Pablo Moscato

Publication date: 16 August 1993

Published in: Annals of Operations Research (Search for Journal in Brave)

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Scatter search and star-paths: Beyond the genetic metaphor ⋮ Metaheuristics: A bibliography ⋮ Parallel local search ⋮ Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs ⋮ A memetic algorithm for the total tardiness single machine scheduling problem ⋮ A co-operative parallel heuristic for mixed zero--one linear programming: Combining simulated annealing with branch and bound ⋮ A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks ⋮ General local search methods

Cites Work

• Optimization by Simulated Annealing
• Using tabu search techniques for graph coloring
• Efficient simulated annealing on fractal energy landscapes
• The asymptotic behaviour of quadratic sum assignment problems: A statistical mechanics approach
• Optimization of a 532-city symmetric traveling salesman problem by branch and cut
• Threshold phenomena in random structures
• Tabu search techniques. A tutorial and an application to neural networks
• A review of combinatorial problems arising in feedforward neural network design
• The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
• An Overview of Sequence Comparison: Time Warps, String Edits, and Macromolecules
• A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
• Tabu Search Applied to the Quadratic Assignment Problem
• Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
• A deterministic annealing approach to clustering
• Paths, Trees, and Flowers
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item