scholarly journals Solution Selection from a Pareto Optimal Set of Multi-Objective Reservoir Operation via Clustering Operation Processes and Objective Values

Water ◽  
2021 ◽  
Vol 13 (8) ◽  
pp. 1046
Author(s):  
Yanjun Kong ◽  
Yadong Mei ◽  
Xianxun Wang ◽  
Yue Ben

Multi-objective evolutionary algorithms (MOEAs) are widely used to optimize multi-purpose reservoir operations. Considering that most outcomes of MOEAs are Pareto optimal sets with a large number of incomparable solutions, it is not a trivial task for decision-makers (DMs) to select a compromise solution for application purposes. Due to the increasing popularity of data-driven decision-making, we introduce a clustering-based decision-making method into the multi-objective reservoir operation optimization problem. Traditionally, solution selection has been conducted based on trade-off ranking in objective space, and solution characteristics in decision space have been ignored. In our work, reservoir operation processes were innovatively clustered into groups with unique properties in decision space, and the trade-off surfaces were analyzed via clustering in objective space. To attain a suitable performance, a new similarity measure, referred to as the Mei–Wang fluctuation similarity measure (MWFSM), was tailored to reservoir operation processes. This method describes time series in terms of both their shape and quantitative variation. Then, a compromise solution was selected via the joint use of two clustering results. A case study of the Three Gorges cascade reservoirs system under small and medium floods was investigated to verify the applicability of the proposed method. The results revealed that the MWFSM effectively distinguishes reservoir operation processes. Two more operation patterns with similar positions but different shapes were identified via MWFSM when compared with Euclidean distance and the dynamic time warping method. Furthermore, the proposed method decreased the selection range from the whole Pareto optimal set to a set containing relatively few solutions. Finally, a compromise solution was selected.

Author(s):  
Poya Khalaf ◽  
Hanz Richter ◽  
Antonie J. van den Bogert ◽  
Dan Simon

We design a control system for a prosthesis test robot that was previously developed for transfemoral prosthesis design and test. The robot’s control system aims to mimic human walking in the sagittal plane. It has been seen in previous work that trajectory control alone fails to produce human-like forces. Therefore, we utilize an impedance controller to achieve reasonable tracking of motion and force simultaneously. However, these objectives conflict. Impedance control design can therefore be viewed as a multi-objective optimization problem. We use an evolutionary multi-objective strategy called Multi-Objective Invasive Weed Optimization (MOIWO) to design the impedance controller. The multi-objective optimization problem admits a set of equally valid alternative solutions known as the Pareto optimal set. We use a pseudo weight vector approach to select a single solution from the Pareto optimal set. Simulation results show that a solution that is selected for pure motion tracking performs very accurate motion tracking (RMS error of 0.06 cm) but fails to produce the desired forces (RMS error of 70% peak load). On the other hand, a solution that is selected for pure force tracking successfully tracks the desired force (RMS error of 12.7% peak load) at the expense of motion trajectory errors (RMS error of 4.5 cm).


2014 ◽  
Vol 22 (4) ◽  
pp. 651-678 ◽  
Author(s):  
Ioannis Giagkiozis ◽  
Peter J. Fleming

The set of available multi-objective optimisation algorithms continues to grow. This fact can be partially attributed to their widespread use and applicability. However, this increase also suggests several issues remain to be addressed satisfactorily. One such issue is the diversity and the number of solutions available to the decision maker (DM). Even for algorithms very well suited for a particular problem, it is difficult—mainly due to the computational cost—to use a population large enough to ensure the likelihood of obtaining a solution close to the DM's preferences. In this paper we present a novel methodology that produces additional Pareto optimal solutions from a Pareto optimal set obtained at the end run of any multi-objective optimisation algorithm for two-objective and three-objective problem instances.


2011 ◽  
Vol 38 (7) ◽  
pp. 8045-8053 ◽  
Author(s):  
Luis M. Torres-Treviño ◽  
Felipe A. Reyes-Valdes ◽  
Victor López ◽  
Rolando Praga-Alejo

Energies ◽  
2021 ◽  
Vol 14 (17) ◽  
pp. 5545
Author(s):  
Huijun Feng ◽  
Wei Tang ◽  
Lingen Chen ◽  
Junchao Shi ◽  
Zhixiang Wu

A marine condenser with exhausted steam as the working fluid is researched in this paper. Constructal designs of the condenser are numerically conducted based on single and multi-objective optimizations, respectively. In the single objective optimization, there is an optimal dimensionless tube diameter leading to the minimum total pumping power required by the condenser. After constructal optimization, the total pumping power is decreased by 42.3%. In addition, with the increase in mass flow rate of the steam and heat transfer area and the decrease in total heat transfer rate, the minimum total pumping power required by the condenser decreases. In the multi-objective optimization, the Pareto optimal set of the entropy generation rate and total pumping power is gained. The optimal results gained by three decision methods in the Pareto optimal set and single objective optimizations are compared by the deviation index. The optimal construct gained by the TOPSIS decision method corresponding to the smallest deviation index is recommended in the optimal design of the condenser. These research ideas can also be used to design other heat transfer devices.


2007 ◽  
Vol 15 (1) ◽  
pp. 61-93 ◽  
Author(s):  
Edwin D. de Jong

Coevolution has already produced promising results, but its dynamic evaluation can lead to a variety of problems that preventmost algorithms from progressing monotonically. An important open question therefore is how progress towards a chosen solution concept can be achieved. A general solution concept for coevolution is obtained by viewing opponents or tests as objectives. In this setup known as Pareto-coevolution, the desired solution is the Pareto-optimal set. We present an archive that guarantees monotonicity for this solution concept. The algorithm is called the Incremental Pareto-Coevolution Archive (IPCA), and is based on Evolutionary Multi-Objective Optimization (EMOO). By virtue of its monotonicity, IPCA avoids regress even when combined with a highly explorative generator. This capacity is demonstrated on a challenging test problem requiring both exploration and reliability. IPCA maintains a highly specific selection of tests, but the size of the test archive nonetheless grows unboundedly. We therefore furthermore investigate how archive sizes may be limited while still providing approximate reliability. The LAyered Pareto-Coevolution Archive (LAPCA) maintains a limited number of layers of candidate solutions and tests, and thereby permits a trade-off between archive size and reliability. The algorithm is compared in experiments, and found to be more efficient than IPCA. The work demonstrates how the approximation of amonotonic algorithm can lead to algorithms that are sufficiently reliable in practice while offering better efficiency.


2011 ◽  
Vol 14 (2) ◽  
pp. 270-285 ◽  
Author(s):  
Gift Dumedah ◽  
Aaron A. Berg ◽  
Mark Wineberg

Multi-objective genetic algorithms are increasingly being applied to calibrate hydrological models by generating several competitive solutions usually referred to as a Pareto-optimal set. The Pareto-optimal set comprises non-dominated solutions at the calibration phase but it is usually unknown whether all or only a subset of non-dominated solutions at the calibration phase remains non-dominated at the validation phase. In practice, users would like to know solutions (and their associated properties) which remain non-dominated at both the calibration and validation phases. This study investigates robustness of the Pareto-optimal set by developing a model characterization framework (MCF). The MCF uses cluster analysis to examine the distribution of solutions in parameter space and objective space, and conditional probability to combine linkages between the distributions of solutions in both spaces. The MCF has been illustrated for calibration output generated from application of the Non-dominated Sorting Genetic Algorithm-II to calibrate the Soil and Water Assessment Tool for streamflow in the Fairchild Creek watershed in southern Ontario. Our results show that not all non-dominated solutions found at the calibration phase perform the same for different validation periods. The MCF illustrates that robust solutions – non-dominated solutions which cluster in similar locations in parameter space and objective space – performed consistently well for several validation periods.


Sign in / Sign up

Export Citation Format

Share Document