The effective management of natural resources is a critical issue that concerns many people with differing interests. This paper examines aspects of overcapacity and optimal capacity within fisheries by accounting for...
详细信息
This paper presents a new multi-objective fuzzy mathematical model for the cellular manufacturing system (CMS) design and its solution methodology. The aim of the proposed model is to handle two important problems of ...
详细信息
This paper presents a new multi-objective fuzzy mathematical model for the cellular manufacturing system (CMS) design and its solution methodology. The aim of the proposed model is to handle two important problems of CMS design called cell formation and exceptional elements simultaneously in fuzzy environment. The objective functions of the model are minimization of the cost of exceptional element elimination, minimization of the number of outer cell operations and maximization of the utilized machine capacity. The fuzziness stems from model parameters which are part demand, machine capacity and the exceptional elements' elimination costs. To illustrate the model, an example problem with fuzzy extension is adopted from literature and computational results are obtained by using the two-phased solution procedure proposed by Arikan and Gungor [F. Arikan, Z. Gungor, A two-phased approach for multi-objectiveprogramming problems with fuzzy coefficients, Information Science 177 (2007), 5191-5202]. The approach is performed to reach simultaneous optimal solutions for all objective functions. The model solutions are investigated by using well-known performance measures and also three problem-specific performance measures are proposed. The model is capable of expressing vagueness of all the system parameters and gives the decision-maker (DM) alternative decision plans for different grades of precision. (C) 2009 Elsevier Ltd. All rights reserved.
In this paper we develop a general approach to generate all non-dominated solutions of the multi-objective integer programming (MOIP) Problem. Our approach, which is based on the identification of objective efficiency...
详细信息
In this paper we develop a general approach to generate all non-dominated solutions of the multi-objective integer programming (MOIP) Problem. Our approach, which is based on the identification of objective efficiency ranges, is an improvement over classical epsilon-constraint method. objective efficiency ranges are identified by solving simpler MOIP problems with fewer objectives. We first provide the classical epsilon-constraint method on the bi-objective integer programming problem for the sake of completeness and comment on its efficiency. Then present our method on tri-objective integer programming problem and then extend it to the general MOIP problem with k objectives. A numerical example considering tri-objective assignment problem is also provided. (C) 2008 Elsevier B.V. All rights reserved.
An algorithm for enumerating all nondominated vectors of multipleobjective integer linear programs is presented. The method tests different regions where candidates can be found using an auxiliary binary problem for ...
详细信息
An algorithm for enumerating all nondominated vectors of multipleobjective integer linear programs is presented. The method tests different regions where candidates can be found using an auxiliary binary problem for tracking the regions already explored. An experimental comparision with our previous efforts shows the method has relatively good time performance.
We introduce the class of MP-pseudoinvex multiobjective optimal control problems. We show that the concept of MP-pseudoinvexity is a sufficient condition of optimality and, further, that problems such that every contr...
详细信息
We introduce the class of MP-pseudoinvex multiobjective optimal control problems. We show that the concept of MP-pseudoinvexity is a sufficient condition of optimality and, further, that problems such that every control process satisfying Pontryagin's maximum principle is an optimal process are necessarily MP-pseudoinvex problems. Moreover, a sub-class of the MP-pseudoinvex problems, which we call MP-invex multiobjective optimal control problems, is defined. We prove that the set of optimal solutions of MP-invex multiobjective problems coincides with the set of optimal solutions of a related scalar problem. Copyright (C) 2008 John Wiley & Sons, Ltd.
In this paper, we present an interactive algorithm (ISTMO) for stochastic multiobjective problems with continuous random variables. This method combines the concept of probability efficiency for stochastic problems wi...
详细信息
In this paper, we present an interactive algorithm (ISTMO) for stochastic multiobjective problems with continuous random variables. This method combines the concept of probability efficiency for stochastic problems with the reference point philosophy for deterministic multiobjective problems. The decision maker expresses her/his references by dividing the variation range of each objective into intervals, and by setting the desired probability for each objective to achieve values belonging to each interval. These intervals may also be redefined during the process. This interactive procedure helps the decision maker to understand the stochastic nature of the problem, to discover the risk level (s)he is willing to assume for each objective, and to learn about the trade-offs among the objectives. (C) 2008 Elsevier B.V. All rights reserved.
This paper presents the theoretical foundations of the new integral analysis method (IAM), and its application to it facility location problem. This methodology integrates the cardinal and ordinal criteria of combinat...
详细信息
This paper presents the theoretical foundations of the new integral analysis method (IAM), and its application to it facility location problem. This methodology integrates the cardinal and ordinal criteria of combinatorial stochastic optimization problems in four stages: definition of the problem, cardinal analysis, ordinal analysis and integration analysis. The method uses the concepts of stochastic multicriteria acceptability analysis (SMAA), Monte Carlo simulation, optimization techniques and elements of probability. The proposed method (IAM) was used to determine optimal locations for the retail stores of it Colombian coffee marketing company. (c) 2007 Elsevier B.V. All rights reserved.
We are interested in a class of linear bilevel programs where the upper level is a linear scalar optimization problem and the lower level is a linear multi-objective optimization problem. We approach this problem via ...
详细信息
We are interested in a class of linear bilevel programs where the upper level is a linear scalar optimization problem and the lower level is a linear multi-objective optimization problem. We approach this problem via an exact penalty method. Then, we propose an algorithm illustrated by numerical examples. (C) 2008 Elsevier B.V. All rights reserved.
Issues in measuring and reporting solution quality are examined when value functions are used in computational experiments of interactive multiple objective programming procedures. They include value functions used, w...
详细信息
Issues in measuring and reporting solution quality are examined when value functions are used in computational experiments of interactive multiple objective programming procedures. They include value functions used, weights assigned to the objective functions in the value functions, the size of the efficient set, and the Dumber of objective functions. The feasibility and existence of the ideal and nadir points are also discussed. Detailed examples are presented to demonstrate these issues. Neither the users nor, in fact, the researchers may discern these issues even though they have strong impacts on the reported solution qualities. Common practices in the computational experiments of interactive multiple objective programming procedures are reviewed. (C) 2003 Elsevier B.V. All rights reserved.
This research deals with a real-world planning problem in railway infrastructure operations. It is part of the RECIFE project, which seeks to develop a decision support software to help evaluate the capacity of a rail...
详细信息
This research deals with a real-world planning problem in railway infrastructure operations. It is part of the RECIFE project, which seeks to develop a decision support software to help evaluate the capacity of a rail junction or station. To this end, the project is working on a timetable optimization model, as well as timetable evaluation modules. This paper presents a module for evaluating timetable stability, which uses an original method based on delay propagation and using shortest path problem resolution. A didactic example and a complete case study applying this method to the Pierrefitte-Gonesse junction are also presented. (C) 2007 Elsevier B.V. All rights reserved.
暂无评论