recently, lotfi et al. [10] established an equivalence model between the output-oriented dual ccr model and multiple objective linear programming (molp) and used an interactive method for finding target unit on efficiency frontier such that the decision maker preferences can be taken into account. however their method is not applicable for situations in which some outputs are undesirable and ne...

‎a common approach to determine efficient solutions of a multiple objective optimization problem‎ ‎is reformulating it to a parameter dependent scalar optimization problem‎. ‎this reformulation is called scalarization approach‎. here, a well-known scalarization approach named pascoletti-serafini scalarization is considered‎. first, some difficulties of this scalarization are discussed and then ...

multiple objective programming (mop) problems have become famous among many researchers due to more practical and realistic implementations. there have been a lot of methods proposed especially during the past four decades. in this paper, we develop a new algorithm based on a new approach to solve mop problems by starting from a utopian point (which is usually infeasible) and moving towards the...

A common approach in multiobjective optimization is to perform the decision making process after the search process: first, a search heuristic approximates the set of Pareto-optimal solutions, and then the decision maker chooses an appropriate trade-off solution from the resulting approximation set. Both processes are strongly affected by the number of optimization criteria. The more objectives...

This paper presents an ant colony optimization metaheuristic for the solution of an industrial scheduling problem in an aluminum casting center. We present an efficient representation of a continuous horizontal casting process which takes account of a number of objectives that are important to the scheduler. We have incorporated the methods proposed in software that has been implemented in the ...