Experimental pool design: input, output and combination strategies for scatter search

Authors:
Peter Greistorfer
Affiliations:
Institut für Industrie und Fertigungswirtschaft, Karl-Franzens-Universität, Graz, Austria
Venue:
Metaheuristics
Year:
2004

Citing 11
Cited 2

Dynamic tabu list management using the reverse elimination method

Annals of Operations Research - Special issue on Tabu search
Hashing vectors for tabu search

Annals of Operations Research - Special issue on Tabu search
Genetic algorithms

Modern heuristic techniques for combinatorial problems
Scatter search for the linear ordering problem

New ideas in optimization
Tabu Search

Tabu Search
Impact of Emerging Technologies on Computer Science and Operations Research

Impact of Emerging Technologies on Computer Science and Operations Research
An Experimental Evaluation of a Scatter Search for the Linear Ordering Problem

Journal of Global Optimization
A tabu scatter search metaheuristic for the arc routing problem

Computers and Industrial Engineering - Special issue: Focussed issue on applied meta-heuristics
A Template for Scatter Search and Path Relinking

AE '97 Selected Papers from the Third European Conference on Artificial Evolution
A Tabu Search Heuristic for the Capacitated Arc Routing Problem

Operations Research
Improved heterogeneous distance functions

Journal of Artificial Intelligence Research

Deconstructing Nowicki and Smutnicki's i-TSAB tabu search algorithm for the job-shop scheduling problem

Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
Revised GRASP with path-relinking for the linear ordering problem

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate several versions of a tabu scatter search heuristic to solve permutation type optimization problems. The focus lies on the design of the three main components which are comprised in every pool-oriented method. These components are the input and output procedures, which are responsible for pool maintenance and determine the transfer of elite solutions, and a solution combination method which must effectively combine a set of elite solutions. We propose several methods for each of these three components and evaluate their combinations as heuristic design variants on a sample set of capacitated Chinese postman instances. Descriptive results are discussed in detail and supported by the testing of a statistical hypothesis.