Tabu Programming for Multiobjective Optimization Problems
نویسنده
چکیده
In this paper, tabu programming for solving multiobjective optimization problems has been considered. Tabu search algorithm has been extended by using a computer program instead of a mathematical variable. For finding Paretooptimal solutions, the ranking procedure in the neighborhood of the current solutions has been applied. Moreover, the multiobjective optimization problem of task assignment in a distributed computer system has been studied. Finally, results of some numerical experiments have been presented.
منابع مشابه
A hybrid metaheuristic for multiobjective unconstrained binary quadratic programming
The conventional Unconstrained Binary Quadratic Programming (UBQP) problem is known to be a unified modeling and solution framework for many combinatorial optimization problems. This paper extends the single-objective UBQP to the multiobjective case (mUBQP) where multiple objectives are to be optimized simultaneously. We propose a hybrid metaheuristic which combines an elitist evolutionary mult...
متن کاملMultiobjective Imperialist Competitive Evolutionary Algorithm for Solving Nonlinear Constrained Programming Problems
Nonlinear constrained programing problem (NCPP) has been arisen in diverse range of sciences such as portfolio, economic management etc.. In this paper, a multiobjective imperialist competitive evolutionary algorithm for solving NCPP is proposed. Firstly, we transform the NCPP into a biobjective optimization problem. Secondly, in order to improve the diversity of evolution country swarm, and he...
متن کاملA multiobjective Tabu framework for the optimization and evaluation of wireless systems
This chapter will focus on the multiobjective formulation of an optimization problem and highlight the assets of a multiobjective Tabu implementation for such problems. An illustration of a specific Multiobjective Tabu heuristic (referred to as MO Tabu in the following) will be given for 2 particular problems arising in wireless systems. The first problem addresses the planning of access points...
متن کاملA Survey on Different Solution Concepts in Multiobjective Linear Programming Problems with Interval Coefficients
Optimization problems have dedicated a branch of research to themselves for a long time ago. In this field, multiobjective programming has special importance. Since in most real-world multiobjective programming problems the possibility of determining the coefficients certainly is not existed, multiobjective linear programming problems with interval coefficients are investigated in this paper. C...
متن کاملNew optimality conditions for multiobjective fuzzy programming problems
In this paper we study fuzzy multiobjective optimization problems defined for $n$ variables. Based on a new $p$-dimensional fuzzy stationary-point definition, necessary efficiency conditions are obtained. And we prove that these conditions are also sufficient under new fuzzy generalized convexity notions. Furthermore, the results are obtained under general differentiability hypothesis.
متن کامل