Multi-objective parallel tabu search

Daniel Jaeggi*, Chris Asselin-Miller, Geoff Parks, Timoleon Kipouros, Theo Bell, John Clarkson

*Corresponding author for this work

Research output: Chapter in Book/Conference proceedings/Edited volumeChapterScientificpeer-review

21 Citations (Scopus)

Abstract

This paper describes the implementation of a parallel Tabu Search algorithm for multi-objective continuous optimisation problems. We compare our new algorithm with a leading multi-objective Genetic Algorithm and find it exhibits comparable performance on standard benchmark problems. In addition, for certain problem types, we expect Tabu Search to outperform other algorithms and present preliminary results from an aerodynamic shape optimisation problem. This is a real-world, highly constrained, computationally demanding design problem which requires efficient optimisation algorithms that can be run on parallel computers: with this approach optimisation algorithms are able to play a part in the design cycle.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsXin Yao, John A. Bullinaria, Jonathan Rowe, Peter Tino, Ata Kaban, Edmund Burke, Jose A. Lozano, Jim Smith, Juan J. Merelo-Guervos, Hans-Paul Schwefel
PublisherSpringer
Pages732-741
Number of pages10
ISBN (Print)3540230920, 9783540230922
DOIs
Publication statusPublished - 2004
Externally publishedYes

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3242
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

Dive into the research topics of 'Multi-objective parallel tabu search'. Together they form a unique fingerprint.

Cite this