|
Abstract : |
Abstract: This paper presents the multiobjective tabu search method, MOTS. Being an adaptation of the well known tabu search, it is used heuristically to generate non-dominated alternatives to multiobjective combinatorial optimization problems. MOTS works with a set of current solutions which, through manipulation of weights, are optimized towards the nondominated frontier while at the same time seek to disperse over the frontier. The general procedure and some extensions to it are given, as well as suggestions of usage in interactive procedures. A computational experiment is also presented., |
