Conference Paper

A Multi-objective Tabu Search Algorithm for Constrained Optimisation Problems.

DOI: 10.1007/978-3-540-31880-4_34 Conference: Evolutionary Multi-Criterion Optimization, Third International Conference, EMO 2005, Guanajuato, Mexico, March 9-11, 2005, Proceedings
Source: DBLP

ABSTRACT Real-world engineering optimisation problems are typically multi-objective and highly constrained, and constraints may be
both costly to evaluate and binary in nature. In addition, objective functions may be computationally expensive and, in the
commercial design cycle, there is a premium placed on rapid initial progress in the optimisation run. In these circumstances,
evolutionary algorithms may not be the best choice; we have developed a multi-objective Tabu Search algorithm, designed to
perform well under these conditions. Here we present the algorithm along with the constraint handling approach, and test it
on a number of benchmark constrained test problems. In addition, we perform a parametric study on a variety of unconstrained
test problems in order to determine the optimal parameter settings. Our algorithm performs well compared to a leading multi-objective
Genetic Algorithm, and we find that its performance is robust to parameter settings.

1 Bookmark
 · 
204 Views

Full-text (5 Sources)

Download
45 Downloads
Available from
Sep 18, 2014