Preview

Pareto

Good Essays
Open Document
Open Document
9492 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
Pareto
LAPPEENRANTA UNIVERSITY OF TECHNOLOGY
Laboratory of Information Processing

Jouni Lampinen

Multiobjective Nonlinear Pareto-Optimization
A Pre-Investigation Report

LAPPEENRANTA 2000

1(30)

Contents
1 Introduction 2 Major Information Sources 2.1 2.2 2.3 2.4 2.5 Literature surveys, reviews Bibliographies Thesis works Books Some significant articles 13 15 17 18 23 25 27 2 9

3. Basic Problem Statements 4. Classification for Multiobjective Optimization Approaches 5. Usage of Weighted Objective Functions 6. Pareto Optimization – Definitions 7. Evaluation of Multiobjective Evolutionary Algorithms 8. Concluding Remarks References

2(30)

1 Introduction
This report surveys briefly multiobjective nonlinear Pareto-optimization. The focus is on the usage of evolutionary algorithms for multiobjective decision making. The term evolutionary algorithms refer to a class of computationally intelligent algorithms, which are based on an artificial model of evolution in nature. When considering multiobjective optimization problems, the most frequently applied evolutionary optimization algorithms are genetic algorithms [Gol90] and evolution strategies [Schw95]. The purpose of this report is to serve as an initial investigation for establishing a future research project. The weight is on literature survey, finding the most important previous works, explaining the problem, methodology, terminology, classifications, concepts etc. In a nutshell, the objective is a brief up-to-date presentation of Status Quo, including the recent advances. Practical optimization problems, especially the engineering design optimization problems, seem to have a multiobjective nature much more frequently than a single objective one. Typically, some structural performance criteria are to be maximized, while the weight of the structure and the implementation costs should be minimized simultaneously. For example, consider designing the appearance of a wing for an advanced military



References: on Evolutionary Multiobjective Optimization. Laboratorio Nacional de Informática Avanzada, México. Available via Internet http://www.lania.mx/~ccoello/EMOO/EMOObib.html. Cited 12. December 1999. [CCoel99b] Carlos A. Coello (1999). Constraint handling through a multiobjective optimization technique. In: Annie S. Wu, editor, Proceedings of the 1999 Genetic and Evolutionary Computation Conference. Workshop Program, pages 117-118, Orlando, Florida, July 1999. [CCoel99c] Carlos A. Coello (to appear). Treating constraints as objectives for single-objective evolutionary optimization. Engineering Optimization 32(?):?–?,1999. 28(30) [CCoel99d] Carlos A. Coello (1999). An Updated Survey of Evolutionary Multiobjective Optimization Techniques : State of the Art and Future Trends. In: 1999 Congress on Evolutionary Computation, pages 3-13, Washington, D.C., July 1999. IEEE Service Center. [CCoel99e] Carlos A. Coello Coello (1999). A Comprehensive Survey of Evolutionary-Based Multiobjective Optimization Techniques. Knowledge and Information Systems. An International Journal, 1(3):269-308, August 1999. [Deb99] Kalyanmoy Deb (1999). Multi-Objective Genetic Algorithms: Problem Difficulties and Construction of Test Problems. Evolutionary Computation, 7(3):205–230. [Fon95] Carlos Manuel Mira de Fonseca (1995). Multiobjective Genetic Algorithms with Applications to Control Engineering Problems. PhD thesis, Department of Automatic Control and Systems Engineering, University of Sheffield, Sheffield, UK, September 1995. [Gol90] Goldberg, David E. (1989). Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading (MA). [Gri99] Pierre M. Grignon (1999). Configuration Design. PhD thesis, Mechanical Engineering Department, Clemson University, Clemson, SC, May 1999 . [HA79] Hwang, Ching-Lai and Abu Syed Md. Masud (1979). Multiple Objective Decision Making – Methods and Applications. Springer Verlag. [Hor97] Jeffrey Horn (1997). The Nature of Niching: Genetic Algorithms and the Evolution of Optimal, Cooperative Populations. PhD thesis, University of Illinois at Urbana Champaign, Urbana, Illinois. [Lam99] Jouni Lampinen (1999). Cam Shape Optimization by Genetic Algorithm. Ph.D. Thesis. Acta Wasaensia 70, Computer Science 2. University of Vaasa. Vaasa (Finland), September 1999. ISBN 951-683-801-4. [Leg99] Patrick Christopher Leger (1999). Automated Synthesis and Optimization of Robot Configurations: An Evolutionary Approach. PhD thesis, The Robotics Institute, Carnegie Mellon University, Pittsburgh, Pennsylvania, December 1999. [Lou98] Daniel Hopkins Loughlin (1998). Genetic Algorithm-Based Optimization in the Development of Tropospheric Ozone Control Strategies: Least Cost, Multiobjective, Alternative Generation, and ChanceConstrained Applications. (Air Quality Management), PhD thesis, North Carolina State University, February 1998. [Loui93] Sushil J. Louis (1993). Genetic Algorithms as a Computational Tool for Design. PhD thesis, Department of Computer Science, Indiana University, August 1993. [Mie99] Miettinen, Kaisa (1999). Non-linear Multiobjective Optimization. Kluwer Academic Publishers, Boston. 29(30) [Mur97] Tadahiko Murata (1997). Genetic Algorithms for Multi-Objective Optimization, PhD thesis, Osaka Prefecture University, Japan, 1997. [PAMS98] Palli, N., Azarm, S., McCluskey, P. and Sandarajan, P. (1998). An Interactive eInequality Constraint Method for Multiple Objectives Decision Making. Transactions of the ASME, Journal of Mechanical Design, 120(4):678–686, December 1998. ISSN 1050-0472. [Par1886] Pareto, Vilfredo (1886). Cours D’Economie Politique, volume I and II. F. Rouge, Lausanne. [Park97] Seong-Jin Park (1997). A Data Allocation Methodology Using the Multiple Aspects Petri Net and the Pareto Genetic Algorithm in Distributed Databases. PhD thesis, Korea University. [Per97] Â. Guimarães Pereira (1997). Extending Environmental Impact Assessment Processes: Generation of Alternatives for Siting and Routing Infrastructural Facilities by Multi-Criteria Evaluation and Genetic Algorithms. PhD thesis, New University of Lisbon, Lisbon, Portugal. [RV99] Katya Rodríguez-Vázquez (1999). Multiobjective Evolutionary Algorithms in Non-Linear System Identification. PhD thesis, Department of Automatic Control and Systems Engineering, The University of Sheffield, Sheffield, UK. [Schw95] Schwefel, Hans-Paul (1995). Evolution and Optimum Seeking. John Wiley & Sons Inc., New York. [Shaf84] J. David Schaffer (1984). Multiple Objective Optimization with Vector Evaluated Genetic Algorithms. PhD thesis, Vanderbilt University. [Sha97] Katharine Jane Shaw (1997). Using Genetic Algorithms for Practical Multi-Objective Production Schedule Optimisation. PhD thesis, Department of Automatic Control and Systems Engineering, The University of Sheffield, Sheffield, UK. [She95] Porter Sherman (1995). Ranking Techniques in Multicriteria Genetic Algorithm-Based Optimization. PhD thesis, Department of Computer and Information Science, Polytechnic University, Brooklyn, New York, 1995. [Tho98] Mark W. Thomas (1998). A Pareto Frontier for Full Stern Submarines via Genetic Algorithm. PhD thesis, Ocean Engineering Department, Massachusetts Institute of Technology, Cambridge, MA, June 1998. (Available online) [Tod97] David S. Todd (1999). Multiple Criteria Genetic Algorithms in Engineering Design and Operation. PhD thesis, University of Newcastle, Newcastle-upon-Tyne, UK, October 1997. [Vel99] David A. Van Veldhuizen (1999). Multiobjective Evolutionary Algorithms: Classifications, Analyses, and New Innovations. PhD thesis, Department of Electrical and Computer Engineering. Graduate School of Engineering. Air Force Institute of Technology, Wright-Patterson AFB, Ohio, May 1999. 30(30) [Zit99] Eckart Zitzler (1999). Evolutionary Algorithms for Multiobjective Optimization: Methods and Applications. PhD thesis, Swiss Federal Institute of Technology (ETH), Zurich, Switzerland, November 1999. [Yoo97] Seung-Ryul Yoo (1997). Determination of Operational Frequencies on Express Bus Service using Dynamic Niche Sharing Pareto GA. PhD thesis, Graduate School of Korea University, Department of Industrial Engineering, Korea. (In Korean).

You May Also Find These Documents Helpful

  • Good Essays

    This figure assumes that the main reference set, covers the indicated circle of sections A, B, C. The solution 1 is created from a convex combination of reference solutions A, B that is added to the reference set as the only solution. In a similar way, combining of convex and non-convex reference of new and original solutions are created points 2, 3 and 4. The complete reference set are including 7 solutions (members) that is shown in the figure above. In genetic algorithm, two solutions are selected randomly from the population and a crossover operator used for the production of one or more children. GA are including a sample population of 100 elements that are selected randomly to create crossover. But in scatter search, two or more of the reference set in a systematic approach in order to produce new…

    • 623 Words
    • 3 Pages
    Good Essays
  • Satisfactory Essays

    CanGo week 6

    • 337 Words
    • 2 Pages

    Weights are usually assigned to criteria based on the importance of the criteria to the decision maker, and criteria are rarely of equal importance to a decision maker. The synthesis of an alternative is mainly done on the basis of prioritized objectives. When a suitable process is decided and applied to a problem, rating of the alternatives can be converted into ranks, based basically on the preferences of a decision maker. Once the a list of key features is arrived at, they are ordered from most to least important.…

    • 337 Words
    • 2 Pages
    Satisfactory Essays
  • Good Essays

    This objective function is subject to some constraints. These constraints can be classified in to three categories.…

    • 1401 Words
    • 6 Pages
    Good Essays
  • Satisfactory Essays

    Mb300 Unit 1

    • 4739 Words
    • 19 Pages

    Welcome to the unit on Operations Research Management. Operations Research Management focuses on the mathematical scoring of consequences of a…

    • 4739 Words
    • 19 Pages
    Satisfactory Essays
  • Powerful Essays

    finding the best decision to optimize a linear objective subject to multiple linear constarints is referred to as…

    • 1510 Words
    • 7 Pages
    Powerful Essays
  • Good Essays

    Many questions arise when we think about optimization problem in healthcare industry. Like how to decide the best location for OPD and emergency vehicles…

    • 523 Words
    • 3 Pages
    Good Essays
  • Good Essays

    Semiconductor manufacturing processes are very costly and complex. Every stage of the semiconductor in the supply chain can be ordered by customers. In addition, processing of semiconductors is very time consuming and therefore it is very hard to satisfy demands with different amplitude and priorities. Ordinary optimization methods are not best suited for this industry and will be explained below.…

    • 805 Words
    • 4 Pages
    Good Essays
  • Powerful Essays

    Bridge Risk Assessment

    • 8086 Words
    • 33 Pages

    References: Adey, B., Hajdin, R., & Bruhwiler, E. (2003). Risk-based approach to the determination of optimal interventions for bridges affected by ¨ multiple hazards. Engineering Structures, 25(7), 903–912. Bowen, W. M. (1990). Subjective judgements and data envelopment analysis in site selection. Computers, Environment and Urban Systems, 14(2), 133–144. British Highways Agency (2004). Value Management of the Structures Renewal Programme. Version 2.2. Charnes, A., Cooper, W. W., & Rhodes, E. (1978). Measuring the efficiency of decision making units. European Journal of Operational Research, 2(6), 429–444. Ertay, T., Ruan, D., & Tuzkaya, U. R. (2006). Integrating data envelopment analysis and analytic hierarchy for the facility layout design in manufacturing systems. Information Sciences, 176(3), 237–262. Johnson, P. A., & Niezgoda, S. L. (2004). Risk-based method for selecting bridge scour countermeasures. Journal of Hydraulic Engineering, 130(2), 121–128. Hwang, C. L., & Yoon, K. (1981). Multiple attribute decision making: methods and applications. Berlin: Springer. Liu, F. H. F., & Hai, H. L. (2005). The voting analytic hierarchy process method for selecting supplier. International Journal of Production Economics, 97(3), 308–317. Lounis, A. (2004). Risk-based maintenance optimization of bridge structures. hhttp://irc.nrc-cnrc.gc.ca/fulltext/nrcc47063/nrcc47063.pdfi. Noguchi, H., Ogawa, M., & Ishii, H. (2002). The appropriate total ranking method using DEA for multiple categorized purposes. Journal of Computational and Applied Mathematics, 146(1), 155–166. Ramanathan, R. (2006). Data envelopment analysis for weight derivation and aggregation in the analytic hierarchy process. Computers and Operations Research, 33(5), 1289–1307. Saaty, T. L. (1980). The analytic hierarchy process. New York: McGraw-Hill. Saaty, T. L. (1990). How to make a decision: The analytic hierarchy process.…

    • 8086 Words
    • 33 Pages
    Powerful Essays
  • Satisfactory Essays

    The importance of statistical information cannot be stressed enough in the business world, but even with our advanced computing systems, information can be entered wrong, or the deviation to large or small. The purpose of this article is to investigate the potential, and problems, with the dual response system (DRS), response surface methodology (RSM), and robust parameter design (RPD). In this study, the author explores the use of each system and the inherent problems that arise when a business chooses to use optimize the mean while keeping the standard deviation below a specified value. This one shot approach is acceptable, but this approach resists easy analysis. To eliminate some of these problems, many business are using the DRS to obtain more flexible information access. One of the approaches is to use a nonlinear multiobjective programing technique that uses the NIMBUS software and Solver in an Excel spreadsheet to acquire simultaneous solutions to the mean and standard deviation functions. The author suggests that through the use of specific algorithms, business can eliminate the DNS problems, and achieve a standardization of reporting. The findings of this study are not so much to introduce an overall fix for the DNS problem, but to inform the reader about a number of mathematician who are working to introduce a “one size fits all” solution to the global optimal solution in reporting the mean and the standard deviation targets (Onur, Necip 2003).…

    • 280 Words
    • 1 Page
    Satisfactory Essays
  • Powerful Essays

    Pareto Analysis

    • 1059 Words
    • 5 Pages

    In this chapter, we will discuss on Pareto Analysis topic which is a statistical techniques in decision making.…

    • 1059 Words
    • 5 Pages
    Powerful Essays
  • Good Essays

    The fourth stage would be to derive the optimal solution of the model through the use of a standard computer package, or specially developed algorithm. Different numeric scenarios will be used to establish sensitivity. In addition, checks should be done to ensure the speed of…

    • 426 Words
    • 2 Pages
    Good Essays
  • Powerful Essays

    ITVEM Optimization Model

    • 1383 Words
    • 6 Pages

    Associated with the ITVEM optimization model, it will be the optimization of the cost minimization, although the optimization can also be in terms of maximizing the performance. To do so, Figure V.5 can assist to be a chart reference, whereas it should also develop several assumptions regarding the optimization process, for example, the Cobb-Douglas production function (Lin and Kao, 2014) replaces each the desired output (the starred y*it, i = 1, 2, 3, 4 and t = 1, ..., 11) of subsystems. In this optimization testing, the data that will be used is Telkom’s data representing the others. Moreover, the Cobb-Douglass function is as follows:…

    • 1383 Words
    • 6 Pages
    Powerful Essays
  • Good Essays

    If there are several decision alternatives available , then in order to identify the decision variables you need to ask yourself the question – what decisions must be made in order to optimize the objective function ?…

    • 269 Words
    • 2 Pages
    Good Essays
  • Powerful Essays

    Interior point method

    • 5498 Words
    • 37 Pages

    this requirement does not seem to be particularly restrictive, but it can be costly in computation.…

    • 5498 Words
    • 37 Pages
    Powerful Essays
  • Good Essays

    Raa, Taughts

    • 3606 Words
    • 15 Pages

    INTRODUCTION In many important real-world decision-making situations, it may not be feasible, or desirable to reduce all the goals of an organization into b. single objective. For example, instead of focusing only on optimizing profits, the organization may simultaneously be interested in maintaining a stable work force, increasing its share of market and limiting price increases. Goal programming is an extension of linear or nonlinear programming involving an objective function with multiple objectives. While developing a goal programming model, the decision variables of the model are to be defined first. Then the managerial goals related to the problems are to be listed down and ranked in order of priority. Since it may be very difficult to rank these goals on a cardinal scale, an ordinal ranking is usually applied to each of the goals. It may not always be possible to fully achieve every goal specified by the decision-maker. Thus, goal programming is often referred to as a lexicographic procedure in which the various goals are satisfied in order of their relative importance. Example 1 An office equipment manufacturer produces two kinds of products: computer covers and floppy boxes. Production of either a computer cover or a floppy box requires 1 hour of production capacity in the plant. The plant has a maximum production capacity of 10 hours per day. Because of the limited sales capacity, the maximum number of computer covers and floppy boxes that can be sold are 6 and 8 per day, respectively. The gross margin from the sale of a computer cover is Rs. 80, and Rs. 40 for a floppy box. The overtime hour should not exceed 2 hours/day. The plant manager has set the following goals arranged in order of importance. 1. To avoid any underutilization of production capacity. 2. To limit the overtime hours to 2 hours. 3. To sell as many computer covers and…

    • 3606 Words
    • 15 Pages
    Good Essays