General Meta-heuristic Search Algorithms: Generalised Modelling of Combinatorial Problems

Research output: Book/ReportBookResearchpeer-review

Abstract

In recent years, there have been many studies in which tailored heuristics and meta-heuristics have been applied to specific optimisation problems. These algorithms can be extremely efficient, but may also lack generality. In contrast, the research outlined in this monograph focuses on building a general-purpose combinatorial optimisation problem solver using a variety of meta-heuristic algorithms including Simulated Annealing and Tabu Search. The work is novel because it uses a modelling environment in which the solution is stored in dense dynamic list structures, unlike a more conventional sparse vector notation. Because of this, it incorporates a number of neighbourhood search operators that are normally only found in tailored algorithms and it performs well on a range of problems. The general nature of the outlined system allows a model developer to rapidly prototype different problems. The results indicate that the system achieves good performance in terms of solution quality and runtime on a range of combinatorial problems.
Original languageEnglish
Place of PublicationSaarbrücken, Germany
PublisherVDM Verlag Dr. Muller
Number of pages201
ISBN (Print)9783639267686 , 3639267680
Publication statusPublished - 2010

Fingerprint

Tabu search
Combinatorial optimization
Heuristic algorithms
Simulated annealing
Mathematical operators

Cite this

@book{f52f42a28d8045a993ffd825f9661f81,
title = "General Meta-heuristic Search Algorithms: Generalised Modelling of Combinatorial Problems",
abstract = "In recent years, there have been many studies in which tailored heuristics and meta-heuristics have been applied to specific optimisation problems. These algorithms can be extremely efficient, but may also lack generality. In contrast, the research outlined in this monograph focuses on building a general-purpose combinatorial optimisation problem solver using a variety of meta-heuristic algorithms including Simulated Annealing and Tabu Search. The work is novel because it uses a modelling environment in which the solution is stored in dense dynamic list structures, unlike a more conventional sparse vector notation. Because of this, it incorporates a number of neighbourhood search operators that are normally only found in tailored algorithms and it performs well on a range of problems. The general nature of the outlined system allows a model developer to rapidly prototype different problems. The results indicate that the system achieves good performance in terms of solution quality and runtime on a range of combinatorial problems.",
author = "Marcus Randall",
year = "2010",
language = "English",
isbn = "9783639267686",
publisher = "VDM Verlag Dr. Muller",

}

General Meta-heuristic Search Algorithms: Generalised Modelling of Combinatorial Problems. / Randall, Marcus.

Saarbrücken, Germany : VDM Verlag Dr. Muller, 2010. 201 p.

Research output: Book/ReportBookResearchpeer-review

TY - BOOK

T1 - General Meta-heuristic Search Algorithms: Generalised Modelling of Combinatorial Problems

AU - Randall, Marcus

PY - 2010

Y1 - 2010

N2 - In recent years, there have been many studies in which tailored heuristics and meta-heuristics have been applied to specific optimisation problems. These algorithms can be extremely efficient, but may also lack generality. In contrast, the research outlined in this monograph focuses on building a general-purpose combinatorial optimisation problem solver using a variety of meta-heuristic algorithms including Simulated Annealing and Tabu Search. The work is novel because it uses a modelling environment in which the solution is stored in dense dynamic list structures, unlike a more conventional sparse vector notation. Because of this, it incorporates a number of neighbourhood search operators that are normally only found in tailored algorithms and it performs well on a range of problems. The general nature of the outlined system allows a model developer to rapidly prototype different problems. The results indicate that the system achieves good performance in terms of solution quality and runtime on a range of combinatorial problems.

AB - In recent years, there have been many studies in which tailored heuristics and meta-heuristics have been applied to specific optimisation problems. These algorithms can be extremely efficient, but may also lack generality. In contrast, the research outlined in this monograph focuses on building a general-purpose combinatorial optimisation problem solver using a variety of meta-heuristic algorithms including Simulated Annealing and Tabu Search. The work is novel because it uses a modelling environment in which the solution is stored in dense dynamic list structures, unlike a more conventional sparse vector notation. Because of this, it incorporates a number of neighbourhood search operators that are normally only found in tailored algorithms and it performs well on a range of problems. The general nature of the outlined system allows a model developer to rapidly prototype different problems. The results indicate that the system achieves good performance in terms of solution quality and runtime on a range of combinatorial problems.

M3 - Book

SN - 9783639267686

SN - 3639267680

BT - General Meta-heuristic Search Algorithms: Generalised Modelling of Combinatorial Problems

PB - VDM Verlag Dr. Muller

CY - Saarbrücken, Germany

ER -