The development of a multi-threaded multi-objective tabu search algorithm

Conference paper (2007)

Authors

Peter Dawson University of Cambridge
Geoffrey T. Parks University of Cambridge
Daniel M. Jaeggi University of Cambridge
Arturo Molina-Cristobal University of Sheffield
P.J. Clarkson University of Cambridge
Affiliation
External organisation
More Info
expand_more

Published Date

2007

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Affiliation

External organisation

Abstract

The reliance of Tabu Search (TS) algorithms on a local search leads to a logical development of algorithms that use more than one search concurrently. In this paper we present a multi-threaded TS algorithm employing a number of threads that share information. We assess the performance of this algorithm compared to previous multi-objective TS algorithms, via the results obtained from applying the algorithms to a range of standard test functions. We also consider whether an optimal number of threads can be found, and what impact changing the number of threads used has on performance. We discover that, contrary to the popular belief that multi-threading is usually beneficial, performance only improves in a few special cases.