Download presentation

Presentation is loading. Please wait.

Published byEstefania Dunman Modified over 3 years ago

1
High-order Pareto frontier approximation and visualization: 30 years of experience and new trends Abstract of the paper at MCDM 2011 Alexander V. Lotov Dorodnicyn Computing Center of Russian Academy of Sciences and Lomonosov Moscow State University

2
Plan of the talk 1. Few words concerning Pareto frontier visualization 2. Interactive Decision Maps (IDM) technique for visualization of the high-order Pareto frontier 3. Few words about application of IDM in the convex case 4. IDM in the non-linear non-convex case: using of hybrid (classic&genetic) optimization 5. Application of IDM in non-linear non-convex problems: a) study of the cooling equipment for continuous steel casting b) designing the release rules for the Baikal Lake Basin c) development of efficient strategies for AIDS treatment 6. New studies: linearization of response surface, identification of math models

3
This job was carried out by a large group of specialists and students that includes V.Bushenkov, O.Chernykh, G.Kamenev, D.Gusev, L.Bourmistrova, R. Efremov, V.Berezkin, A.Pospelov, and many others.

4
Few words concerning Pareto frontier visualization

5
Notation Then, Z=f(X) = feasible set in objective space Pareto domination (minimization case) Non-dominated (efficient, Pareto) frontier Let X be the feasible set in decision space, z=(z 1, z 2,…, z m )= f(x) be the criteria vector, where f(x) is the vector of objective functions.

6
Z=f(X) Feasible set in objective space

7
Z=f(X) Non-dominated (Pareto) frontier is visible

8
Pareto frontier methods (a posteriori preference) methods Pareto frontier methods consist in 1)approximating the Pareto frontier and 2)informing the Decision Maker about it. In contrast to preference-oriented methods, Pareto frontier methods do not require the DM to answer multiple questions concerning his/her preferences, but only inform the DM.

9
Two basic ways for informing the DM about the Pareto frontier By providing a list of the objective (criterion) points that belong to the Pareto frontier By visualization of the Pareto frontier

10
Selecting from a large list of objective points (more than one or two dozens) with more than two criteria turned out to be too complicated for a human being. See, for example, the paper Larichev O. Cognitive Validity in Design of Decision-Aiding Techniques. Journal of Multi-Criteria Decision Analysis, 1992, v.1, n 3.

11
Visualization of the Paretoo frontier can help ”A picture is worth a thousand words” Prof. A.Wierzbicki proved that a picture is worth 10 thousand words

12
Tradeoff information is important for DM f(x*) f(x 1 ) f(x 2 )

13
Two problems must be solved How to approximate the Pareto frontier? How to inform the stakeholders about the Pareto frontier? We develop the Pareto frontier visualization methods for the high-order problems (m > 2)

14
Interactive Decision Maps (IDM) technique solves these problems in high- order MOO problems. Its generic ideas were formulated in 1980 (Lotov, A.V. On the concept of the GRS and its constructing for linear controlled systems. Sov. Phys. Dokl., American Istitute of Physics, 1980, 25(2), 82–84)

15
Sometimes the EPH is called the Free Disposal Hull. It holds that is The IDM technique is based on approximating the feasible objective set Z or its Edgeworth-Pareto Hull (EPH),

16
P(Z) f(X)

17
Visualization by usung the IDM tech In this talk, we restrict with visualization of the EPH. The IDM tech is based on the display of bi- objective slices of the EPH. Decision map is a collection of overlapped bi- objective slices in the case m=3. If for m>3, the IDM technique displays decision maps interactively. Decision maps can be re- arranged, animated, zoomed, etc. by the user. This option is based on the approximating the EPH, which has to be completed in advance.

18
Example of the Pareto frontier display for m=5 in the convex case

20
Another example of the Pareto frontier display for m=5 in the convex case by using the matrix of decision maps

22
Application of the IDM tech: Feasible Goals Method (FGM). It is the IDM-supported goal method, in the framework of which the goal is identified at the Pareto frontier. Objective (criterion) tradeoff information helps the decision maker to identify the preferable non- dominated objective point (goal) consciously. It is important that the goal located at the Pareto frontier is feasible. Due to it, the associated decision does exist and can be computed.

24
Application of the IDM in the convex case

25
In the convex case polyhedral approximation of the EPH is used. Method and applications are described in Lotov A.V., Bushenkov V.A., and Kamenev G.K. Interactive Decision Maps. Approximation and Visualization of Pareto Frontier. Kluwer Academic Publishers, 2004.

26
Real-life applications of FGM and its modification (Reasonable Goals Method) in the convex case DSS for Water Quality Planning (Russian Federal Programme “Revival of the Volga River”) Searching for trans-boundary air pollution control strategies (jointly with M.Pohjola and V.Kaitala, Finland) Exploration of pollution abatement cost in the Electricity Sector – Israeli case study (Ministry of National Infrastructures of Israel, D.Soloveichik et al.). Web-based Participatory Decision Support for Integrated River Basin Planning (jointly with J.Dietrich and A.H. Schumann, Germany) Water quality planning in rivers of Cataluña (A.L.Udias Moinelo and R.Efremov, Spain, A.Pospelov, Russia)

27
Academic applications in the convex problems Development of smart response strategies related to global climate change Environmentally sound agricultural planning in the Netherlands (jointly with S.Orlovski and P.˚van Walsum from IIASA, Austria) Allocation of sea oil platforms and planning the oil fields development (jointly with R.Efremov, Spain, A.Barron Alcantara, Mexico) E-democracy: web-based participatory decision support (jointly with Efremov R., Rios-Insua D.) Etc.

28
IDM in the non-linear non-convex case

29
The main problems that arise in the non-linear case: 1. non-convexity of the EPH; 2. time-consuming processes of global scalar optimization, i.e. computing the support function may require too much time or may be impossible.

30
Approximation of the non-convex EPH

31
Approximation for visualization The EPH is approximated by the set T* that is the union of the non-negative cones with apexes in a finite number of points z of the set Z=f(X). Collection of such points z is called the approximation base and is denoted by T. Important! Multiple slices of such an approximation can be computed and displayed fairly fast.

32
Visualization example for 8 criteria

35
We concentrated our efforts at the methods for approximating the EPH in MOO problems with criterion functions given by black-box models (say, FEM/FDM modules, or different simulation modules). Thus, the Lipschitz constants are unknown (or may not exist at all) and cannot be used in the methods. Actually, the only feasible operation with the module is variation of its inputs and collecting the related outputs. Approximation of the EPH

36
We have developed hybrid methods for approximating the EPH for black-box modules that include: a) random (Monte Carlo) search; b) adaptive and non-adaptive local simulation-based optimization; c) importance sampling (squeezing the search region); d) semi-genetic algorithms. Statistical tests were developed that provide the basis for the stopping rules.

37
Local simulation-based optimization Simulation provides an opportunity to approximate the gradient of a scalar function. It means that it is possible to use various effective gradient-based methods (for example, methods of conjugated gradients) to find local maximum (or minimum) of a scalar function. These methods can be used for ‘improving’ a random decision x by moving the associated criterion point f(x) in the direction of the Pareto frontier.

38
Two-phase method: combination of random search and local optimization Combination of random search and local optimization is often used in scalar optimization. The simplest methods of this kind are multi-start methods, more complicated methods have been proposed, too. Methods of this kind are known as the two-phase methods. We apply two-phase methods as the basic tool for approximation of the Pareto frontier. In our methods the scalarizing function is not given. Several concepts for adaptive selecting of scalarizing functions were proposed by us.

39
Three-phase method The three-phase methods include squeezing of the search region. The methods for adaptive squeezing were proposed. Plastering (semi-genetic) method Plastering method that has some properties of genetic algorithms (as cross-over and selecting of non- dominated decisions) is used at the very end of the approximation process.

40
The proposed methods have the form that can be used in parallel computing (clusters, supercomputers, grids, etc.) – it is sufficient to separate simulation and Pareto frontier computing. Even cloud computing can be used since methods are nor sensitive to a partial loss of the results of simulation. Approximating the EPH using parallel computing

42
Two-platform implementation

43
IDM applications in the non-linear non-convex MOO problems

44
a) Multi-objective study of the cooling equipment in continuous casting of steel The research was carried out jointly with K.Miettinen and several other researchers from University of Jyvaskyla.

46
Criteria J 1 is the original single optimization criterion: deviation from the desired surface temperature of the steel strand must be minimized. J 2 to J 5 are the penalty criteria introduced to describe violation of constraints imposed on : -surface temperature (J 2 ); -gradient of surface temperature along the strand (J 3 ); -on the temperature after point z 3 (J 4 ); and -on the temperature at point z 5 (J 5 ). J 2 to J 5 were considered in this study.

47
Description of the module FEM/FDM module was developed by researchers from University of Jyvaskyla. Properties of the model: 325 control variables that describe intensity of water application.

50
b) Application of the non-linear IDM in the design of the release rules for the hydro power stations in the Baikal Lake basin (encouraged by the group of Prof. R. Soncini-Sessa from Politecnico di Milano)

51
Scheme of the Baikal Lake basin (cascade of hydropower stations)

52
The problem of release rules design for a hydropower stations cascade Water managers develop some rules, which relate the flow through a dam (release) to the current level of the reservoir. The parameters of the release rules must be specified to satisfy the requirements of the industrial, agricultural and municipal users as well as environmental requirements.

53
The main concept in the design of the release rules The approach is based on direct application of the historical inflow data. Then, any particular release rule can be simulated by using a water flow model combined with historical data on inflow through the time period under study (about 100 years). By this, performance indicators for any particular release rule can be estimated.

54
Optimization criteria are based on deviations from : Required level of electricity production; Satisfaction of environmental requirements to water use of Baikal; Absence of floods; etc. Thus, the objective values must be minimized.

55
Completed study: Pareto frontier for Irkutsk hydropower station

56
The Baikal Lake basin Irkutsk HPS

57
The decision rule was described by 132 parameters, eight objectives were used. After about one hour of computing at a supercomputer an approximation of the EPH was constructed.

58
Visualization After a few steps of visual study of the EPH in general, it was decided that four objective must have their minimal values y3=y4=y6=y7=0. The rest of objectives are: y1 is the volume of water released without producing energy y2 is the violation of the NO FLOOD requirement y5 is the violation of a high requirement on energy production y8 is the violation of the requirement to have the level of the Baikal Lake in a corridor set fixed by government

59
Decision map 1

60
Decision map 2

61
Decision map 3

62
Decision map 4

63
Decision map 5

64
Selected objective points y1=0.86, y2=0.00, y5=0.77, y8=0.93 y1=0.77, y2=0.22, y5=0.85, y8=0.84 y1=0.85, y2=0.11, y5=0.42, y8=0.88 y1=0.91, y2=0.00, y5=0.42, y8=0.91 y1=0.92, y2=0.11, y5=0.34, y8=0.90 y1=0.89, y2=0.00, y5=0.33, y8=0.93

65
Value Path

66
Search for effective strategies for HIV therapy

67
The model n is the number of healthy lymphocytes of CD4+ type, I 1 is the number of lymphocytes infected by the natural HIV virus, I 2 is the number of lymphocytes infected by the mutated HIV virus, h is the concentration of drug in blood, u is the intensity of treatment: 0<u<U

68
Objectives y1 is the drug application during one year y2 is the maximal concentration of drug in the body y3 is the number of infected lymphocytes at the very end of the time-period y4 is the maximal number of infected lymphocytes during the time-period y5 is the number of healthy lymphocytes at the very end of the time-period y6 is the maximal number of healthy lymphocytes during the time-period

69
One of the decision maps

70
One of the Pareto optimal therapy strategies

71
The result of the selected Pareto optimal therapy

72
New developments: linearization of response surface and identification of math models

73
Linearization of response surface in Water Quality Rehabilitation Details described in: A. Castelletti, A. Lotov, R. Soncini-Sessa. Visualization-based multi-criteria improvement of environmental decision-making using linearization of response surfaces. Environmental Modelling and Software, v.25, 2010, pp. 1552-1564.

74
б) а) в) Examples of graphs of error function of parameter λ

75
Our Web site http://www.ccas.ru/mmes/mmeda/

Similar presentations

OK

Bulgarian Academy of Sciences. 22 July, 2008 1 Index Introduction Outline of the scheme Step 1. Individual weights Step 2. Preference aggregation Step.

Bulgarian Academy of Sciences. 22 July, 2008 1 Index Introduction Outline of the scheme Step 1. Individual weights Step 2. Preference aggregation Step.

© 2018 SlidePlayer.com Inc.

All rights reserved.

To make this website work, we log user data and share it with processors. To use this website, you must agree to our Privacy Policy, including cookie policy.

Ads by Google