SSPMO: A Scatter Tabu Search Procedure for Non-Linear Multiobjective Optimization
نویسندگان
چکیده
منابع مشابه
SSPMO: A Scatter Search Procedure for Non-Linear Multiobjective Optimization
We describe the development and testing of a metaheuristic procedure, based on the scatter search methodology, for the problem of approximating the efficient frontier of nonlinear multiobjective optimization problems with continuous variables. Recent applications of scatter search have shown its merit as a global optimization technique for single-objective problems. However, the application of ...
متن کاملSSPMO: A Scatter Tabu Search Procedure for Non-Linear Multiobjective Optimization
We describe the development and testing of a metaheuristic procedure, based on the scatter search methodology, for the problem of approximating the efficient frontier of nonlinear multiobjective optimization problems with continuous variables. Recent applications of scatter search have shown its merit as a global optimization technique for single-objective problems. However, the application of ...
متن کاملScatter tabu search for multiobjective clustering problems
We propose a hybrid heuristic procedure based on scatter search and tabu search for the problem of clustering objects to optimize multiple criteria. Our goal is to search for good approximations of the efficient frontier for this class of problems and provide a means for improving decision making in multiple application areas. Our procedure can be viewed as an extension of SSPMO (a scatter sear...
متن کاملTabu Search for Multiobjective Optimization: MOTS
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 ...
متن کاملAbYSS: Adapting Scatter Search for Multiobjective Optimization
In this paper we propose a new algorithm for solving multiobjective optimization problems. Our proposal adapts the well-known scatter search template for single objective optimization to the multiobjective domain. The result is a hybrid metaheuristic algorithm called AbYSS, which follows the scatter search structure but using mutation and crossover operators coming from the field of evolutionar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: INFORMS Journal on Computing
سال: 2007
ISSN: 1091-9856,1526-5528
DOI: 10.1287/ijoc.1050.0149