Applying multiple objective tabu search to continuous optimization problems with a simple neighbourhood strategy

Baykasoglu A.

INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, vol.65, no.3, pp.406-424, 2006 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 65 Issue: 3
  • Publication Date: 2006
  • Doi Number: 10.1002/nme.1455
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.406-424
  • Keywords: multiple objective optimization, tabu search, non-linear programming, design optimization, CONTINUOUS-VARIABLES, ALGORITHM
  • Dokuz Eylül University Affiliated: No


One of the first multiple objective versions of the tabu search (TS) algorithm is proposed by the author. The idea of applying TS to multiple objective optimization is inspired from its solution structure. TS works with more than one solution (neighbourhood solutions) at a time and this situation gives the opportunity to evaluate multiple objectives simultaneously in one run. The selection and updating stages are modified to enable the original TS algorithm to work with more than one objective. In this paper, the multiple objective tabu search (MOTS) algorithm is applied to multiple objective non-linear optimization problems with continuous variables using a simple neighbourhood strategy. The algorithm is applied to four mechanical components design problems. The results are compared with several other solution techniques including multiple objective genetic algorithms. It is observed that MOTS is able to find better and much wider spread of solutions than the reported ones. Copyright (c) 2005 John Wiley & Sons, Ltd.