1,697 research outputs found

    A fuzzy multiobjective algorithm for multiproduct batch plant: Application to protein production

    Get PDF
    This paper addresses the problem of the optimal design of batch plants with imprecise demands and proposes an alternative treatment of the imprecision by using fuzzy concepts. For this purpose, we extended a multiobjective genetic algorithm (MOGA) developed in previousworks, taking into account simultaneously maximization of the net present value (NPV) and two other performance criteria, i.e. the production delay/advance and a flexibility criterion. The former is computed by comparing the fuzzy computed production time to a given fuzzy production time horizon and the latter is based on the additional fuzzy demand that the plant is able to produce. The methodology provides a set of scenarios that are helpful to the decision’s maker and constitutes a very promising framework for taken imprecision into account in new product development stage

    A Better Approach for Solving a Fuzzy Multiobjective Programming Problem by Level Sets

    Get PDF
    In this paper, we deal with the resolution of a fuzzy multiobjective programming problem using the level sets optimization. We compare it to other optimization strategies studied until now and we propose an algorithm to identify possible Pareto efficient optimal solutions

    Multi-objective evolutionary–fuzzy augmented flight control for an F16 aircraft

    Get PDF
    In this article, the multi-objective design of a fuzzy logic augmented flight controller for a high performance fighter jet (the Lockheed-Martin F16) is described. A fuzzy logic controller is designed and its membership functions tuned by genetic algorithms in order to design a roll, pitch, and yaw flight controller with enhanced manoeuverability which still retains safety critical operation when combined with a standard inner-loop stabilizing controller. The controller is assessed in terms of pilot effort and thus reduction of pilot fatigue. The controller is incorporated into a six degree of freedom motion base real-time flight simulator, and flight tested by a qualified pilot instructor

    Domination and Decomposition in Multiobjective Programming

    Get PDF
    During the last few decades, multiobjective programming has received much attention for both its numerous theoretical advances as well as its continued success in modeling and solving real-life decision problems in business and engineering. In extension of the traditionally adopted concept of Pareto optimality, this research investigates the more general notion of domination and establishes various theoretical results that lead to new optimization methods and support decision making. After a preparatory discussion of some preliminaries and a review of the relevant literature, several new findings are presented that characterize the nondominated set of a general vector optimization problem for which the underlying domination structure is defined in terms of different cones. Using concepts from linear algebra and convex analysis, a well known result relating nondominated points for polyhedral cones with Pareto solutions is generalized to nonpolyhedral cones that are induced by positively homogeneous functions, and to translated polyhedral cones that are used to describe a notion of approximate nondominance. Pareto-oriented scalarization methods are modified and several new solution approaches are proposed for these two classes of cones. In addition, necessary and sufficient conditions for nondominance with respect to a variable domination cone are developed, and some more specific results for the case of Bishop-Phelps cones are derived. Based on the above findings, a decomposition framework is proposed for the solution of multi-scenario and large-scale multiobjective programs and analyzed in terms of the efficiency relationships between the original and the decomposed subproblems. Using the concept of approximate nondominance, an interactive decision making procedure is formulated to coordinate tradeoffs between these subproblems and applied to selected problems from portfolio optimization and engineering design. Some introductory remarks and concluding comments together with ideas and research directions for possible future work complete this dissertation
    corecore