Incorporating Likelihood information into Multiobjective Calibration of Conceptual Rainfall- Runoff Models
|
|
- Bruno Wilkins
- 5 years ago
- Views:
Transcription
1 International Congress on Environmental Modelling and Software Brigham Young University BYU ScholarsArchive th International Congress on Environmental Modelling and Software - Barcelona, Catalonia, Spain - July Jul st, : AM Incorporating Likelihood information into Multiobjective Calibration of Conceptual Rainfall- Runoff Models Alireza Azemi Andrew H. C. Chan Xin Yao Follow this and additional works at: Azemi, Alireza; Chan, Andrew H. C.; and Yao, Xin, "Incorporating Likelihood information into Multi-objective Calibration of Conceptual Rainfall-Runoff Models" (). International Congress on Environmental Modelling and Software.. This Event is brought to you for free and open access by the Civil and Environmental Engineering at BYU ScholarsArchive. It has been accepted for inclusion in International Congress on Environmental Modelling and Software by an authorized administrator of BYU ScholarsArchive. For more information, please contact scholarsarchive@byu.edu, ellen_amatangelo@byu.edu.
2 iemss : International Congress on Environmental Modelling and Software Intelligent Environmental Decision Support Systems th Biennial Meeting of iemss, M. Sànchez-Marrè, J. Béjar, J. Comas, A. Rizzoli and G. Guariso (Eds.) International Environmental Modelling and Software Society (iemss), Incorporating Likelihood information into Multi-objective Calibration of Conceptual Rainfall-Runoff Models Alireza azemi a, Andrew H. C. Chan a, Xin Yao b a Department of Civil Engineering, The University of Birmingham, Birmingham, UK, B TT (a.nazemi@cs.bham.ac.uk, a.h.chan@bham.ac.uk ) b School of Computer Science, The University of Birmingham, Birmingham, UK, B TT (x.yao@cs.bham.ac.uk) Abstract: In this paper, the incorporation of parametric likelihood information into NSGA- II algorithm has been attempted in order to preserve solutions with more overall likelihood. The crowded comparison operator in NSGA-II, which is used to select the potential solutions for the next generation, is substituted by likelihood comparison operator which includes the consideration of the likelihood information about the potential solutions rather than their distance from each other. As a result the potential solution with higher overall likelihood measure has more chance to be selected in the next generation. Three different scenarios for the estimation of overall likelihood measure are presented. The modified algorithm is used for calibration of two different conceptual rainfall-runoff models in USA MOPEX catchments. The results show that the new modification results to different searching process which can be compared with NSGA-II from different perspectives. Keywords: Rainfall-Runoff models; Multi-objective calibration; NSGA-II; Parametric Likelihood, Likelihood comparison operator.. I TRODUCTIO The conceptual modelling paradigm assumes that rainfall-runoff process can be described by a simple sequential structure formed from a soil moisture accounting unit which converts the total rainfall into effective rainfall, followed by a routing unit which translates the amount of effective rainfall to its corresponding runoff quantity. All the conceptual models have some internal parameters which should be approximated using the observed measurements. Although the majority of previous calibration studies have been focused on single objective optimization for the calibration of conceptual rainfall-runoff models, recent investigations suggested that single objective function, no matter how carefully chosen, is often inadequate to properly represent all of the characteristics of the observed data and simulated values [Vrugt et al., a]. Also, Boyle et al. [] showed the existence of different response modes on catchment s hydrograph, during the wetting up and drainage periods. It can be also shown that there are different response modes during high and low flows in both the wetting and drainage periods. These observations have opened new research direction toward multi-objective calibration of rainfall-runoff models, in which each particular part of the hydrograph can be described by a separate objective function. Considering more than two conflicting objective functions in the search process, it may result in a set of solutions which might be quite diverse in both parametric and objective spaces. However, many of the solutions might not be useful in practice because of the considerable amount of sensitivity to small parametric changes. This behaviour, in many cases, is a disadvantage particularly in dealing with real world modelling problems, such as rainfall-runoff process, which contains several sources of uncertainties that can affect the performance of overall model output [Nazemi et al., a]. Looking at this problem from another perspective, it can be questioned that if it is more promising to use other aspects of
3 the solutions such as parametric likelihood in the search process which may be able to give more chance to more likely solutions to be included in the final calibration results. In this paper, an intuitive framework is introduced to incorporate likelihood information into the multi-objective calibration of rainfall-runoff models.. MULTI-OBJECTIVE CALIBRATIO OF RAI FALL-RU OFF MODELS Let assume that the observed hydrograph and the model structure are Qobs andξ, respectively. By considering the model parameter set θ, the simulated hydrograph Q( ξ θ ) can be calculated. In the case of multi-objective calibration, the difference between Q Q( ξ θ ) is measured by a set of M objective functions { f, f,..., f M } and calibration can be described as: min{ f, f,..., f θ Θ M } obs and The result of this optimization problem will be a set of Pareto parametric valuesφ in which there is no solution better than the other regarding to all M objective functions. From the optimization point of view, the task of multi-objective optimization is not only assigning the best parametric values regarding each objective function; but also locating all * possible Pareto optimal solutions and store them in the non-dominated setφ. Before applying multi-objective optimization framework to the calibration of rainfall-runoff models, a set of objective functions should be assigned. One possible approach would be to divide the whole hydrograph into different response modes and try to find a behavioural error measure related to each segment. We applied a heuristic segmentation approach introduced by Wagener and Wheater [] which uses the gradient of the hydrograph and an additional threshold as segmentation criteria to divide the whole hydrograph into different response modes. The flow gradient separates the hydrograph into wetting up and drainage periods in a way that positive gradient shows the rainfall periods, i.e. wetting up times and negative gradient shows the drainage periods. A threshold is used to separate period of high and low flow, which is the mean flow for wetting periods and % of the mean flow for drainage periods. In order to quantify the behaviour of the model for each segment, the Root Mean Squared Error (RMSE) in each mode was used. For instance for Driven High flows (FDH), the following error measure can be defined. nfdh Qi Qˆ ( i) () RMSE i FDH= =, i FDH nfdh Non-dominated Sorting Genetic Algorithm II (NSGA-II) is a multi-objective evolutionary algorithm introduced by Deb et al. []. NSGA-II has been used in rainfall-runoff model calibration such as Tang et al [] and Nazemi et al [b]. In brief, NSGA-II can be considered as an ordinary evolutionary multi-objective algorithm, coupled with three new operators. The first operator is the fast non-dominated sort which can efficiently rank a set of solutions based on the multi-objective dominancy principle. The second operator is the crowding distance calculation operator which gives each solution a distant measure indicating its diversity and it is designed in a way that gives ultimate amount of distant to the edges of the Pareto-front. The third operator, i.e. the crowded comparison operator, is a selection rule designed in a way that not only consider the rank of the solutions but also select the solutions with more diversity distant measures based on the information obtained from crowding distance calculation. By this rule, the diversity of solution would be preserved during the search process. The algorithm will be run for a number of generations and the best non-dominating front will be saved in an archive. The solutions in this archive are the non-dominated solutions of the calibration. Although these solutions have the greatest importance from the theoretical point of view, they might be unsuitable for the implementation of the model in practice. Comprehensive () * 7
4 preliminary study done by authors showed that, in most of the cases, the usage of the whole Pareto set is practically impossible for model implementation because of the high variation in the model output and the diversity of non-dominated solutions in the parametric space. As a result, a solution or a region of solutions should be picked. However, the parametric selection is not an easy task due to the existence of different parametric and objective clusters that can be linked to each other in a quite irregular way. It means that similar (close) solutions in either space can map to different (distant) solutions in the other space, which shows large amount of multi-objective multi-modality in the models landscape.. I CORPORATI G LIKELIHOOD I FORMATIO I TO MULTI-OBJECTIVE CALIBRATIO OF RAI FALL-RU OFF MODELS As suggested by Vrugt et al [b], in Bayesian statistics, the parametric solutions are treated as probabilistic variables having joint probability density functions, which show the belief about the parametric solutions in the light of measured observation. Considering the model parameter as θ and the measured observation as y, the probability density function pθ ( y) is proportional to the product of likelihood function and the initial probability density function. Beven and Binley (99) proposed the imposition of a uniform distribution on the feasible parametric space as the prior density function. Assuming a noninformative prior distribution, it has been shown that the posterior probability density ( t) function p( θ y) is proportional to the sum square error of the model in the form of: ( t) ( t) p( y) ( e( ) i) i= () θ θ The above formulation can be easily extended to each segment of the hydrograph. As an (t) illustration, the posterior density distribution of parameter set θ in the light of observed driven high flow (FDH) segment of the hydrograph can be described as: FDH FDH t t ( ) ( ) () p( θ y FDH ) ( e( θ ) i) i = The crowded comparison operator of NSGA-II is an intuitive rule: A solution i dominates another solution j, if and only if the solution i has a better rank or both solutions have the same rank but the solution i has a higher crowding distance measure. Based on Deb et al [], this rule can be formulated as following: i p n j if ( i rank < jrank ) () Or [( i rank = jrank ) and ( i dist > jdist )] This formulation can be easily reconstructed in order to preserve the solutions with higher likelihood. Considering ilikelihood and j Likelihood as the representatives of the overall likelihood estimations for solutions i and j, respectively; the Likelihood Comparison Operator can be defined as following: i p n j if ( i rank < jrank ) Or i = j ) and () [( rank rank ( i Likelihood > jlikelihood )] For each solution, the row measures of total and segmental posterior density measure be calculated using Equation and Equation respectively. It should be noted that these equations allocate a lower posterior measures to more likely solutions; as a result, in order to express the more likely solutions with higher measures of likelihood, the row measures can be considered with a minus sign. In order to eliminate the effect of different scales, all likelihood measures should be normalized to the same scale, i.e., [,] using the maximum and minimum of the minus row posterior density measures regarding each segment. Therefore, considering m as the number of segments considered and n as the number of solutions in each selecting pool, it would be a matrix L indicating the relative likelihood n m
5 measures of the solutions in a particular selecting pool. Here, three different scenarios are suggested in order to estimate the overall likelihood measure for each solution. Scenario I. The maximum likelihood operator: In this scenario, the overall likelihood for each solution i can be estimated using following equation: max( U m i Likelihood = { i }) (7) k k= Scenario II. The average likelihood operator: In this interpretation, the overall likelihood can be estimated using following equation: m i Likelihood = ( i k ) () m k= Scenario III. The minimum likelihood operator: The overall measure can be described as min( U m i Likelihood = { i k }) (9) k= By applying one of these scenarios to estimate the overall likelihood measure, the crowded comparison operator of NSGA-II (Equation ) can be replaced by the likelihood comparison operator (Equation ) in order to preserve the solutions with higher amount of overall likelihood measure. The new modification can be considered as the Likelihood nondominated Sorting Genetic Algorithm II or LNSGA-II.. CASE STUDIES A D MODELS APPLIED. MOPEX catchments The Model Parameter Estimation Experiment (MOPEX) is an international project aimed at developing enhanced techniques for the a priori estimation of parameters in hydrologic models and in land surface parameterization schemes of atmospheric models [Duan et al. ]. In this study we considered daily time series data for USA catchments provided by MOPEX. These catchments can represent different hydrological mechanism. The key physical characteristics of the catchments used in this study are shown in Table. Table. The variation of key physical properties of twenty four USA MOPEX catchments used in this study ( Area (km ) Main channel slope (m/km) Stream length (km) Mean basin elevation (m) Area of storage (%) Forest area (%) Mean annual rainfall (mm) Models applied The conceptual structures used here are based on the Rainfall Runoff Modelling Toolbox (RRMT) [Wagener et al., ]. Both structures have a soil moisture accounting unit and a routing module. The two soil moisture accounting units have been used here are the catchment wetness index [Jakeman and Hornberger, 99] and the probability distribution of stores [Moore, 999]. These units have been combined with a two parallel linear reservoirs representing quick and slow responses of the system producing two conceptual models. Here, we labelled the two models used as model and Model. Both models have five free parameters. Table and Table summarize the free model parameters and their feasible parametric space. Table. Description and feasible interval for free parameters of Model applied in this study [Wagener et al., ] Model Feasible Definition parameter interval M- Soil moisture accounting parameter, time constant of the catchment losses [ ] M- Soil moisture accounting parameter, modulation factor [ ] M- Routing parameter, time constant of quick flow reservoir [ ] M- Routing parameter, time constant of slow flow reservoir [ ] 9
6 M- Routing parameter, fraction of flow through quick reservoir [ ] Table. Description and feasible interval for free parameters of Model applied in this study [Wagener et al., ] Model Feasible Definition parameter interval M- Soil moisture accounting parameter, maximum storage capacity [ ] M- Soil moisture accounting parameter, shape of Pareto distribution [.] M- Routing parameter, time constant of quick flow reservoir [ ] M- Routing parameter, time constant of slow flow reservoir [ ] M- Routing parameter, fraction of flow through quick reservoir [ ]. Calibration framework Three scenarios of LNSGA-II were introduced along with original NSGA-II algorithm for calibration of free parameters of Model and Model in MOPEX catchments. For each catchment, five years daily data have been considered in the calibration. Scatter crossover, Gaussian mutation and binary tournament selection have been fixed as the genetic operators in this experimental study. For the calibration of Model, five objective functions have been used including total and segmental RMSE. Also the same values for internal parameters have been used for NSGA-II and LNSGA-II scenarios. For Model, probability of crossover, probability of mutation, number of population and number of generations were assumed to be.,., and respectively. In the case of Model only four segmental error measures were used and the internal parameters were assumed to be.,., and for the probability of crossover, probability of mutation, number of population and number of generations, respectively. In order to compare the objective optimality of solutions, the non-dominated solutions resulted from applied algorithms were compared with the single objective calibration solution of SCEM [Vrugt et al., b]. If the archived solutions can reach relatively to the same level of optimality that single objective calibration does, it can be confirmed that the multi-objective sampler is at least as optimal as the single objective optimization but more time efficient because a set of objective functions were considered simultaneously. Considering the results of single objective optimization achieved by SCEM as the benchmark for the comparison, the level FS of optimality can be defined as in which F S and F M are the objective function FM convergence achieved by the single and multi-objective procedures, respectively.. RESULTS A D DISCUSSIO S Table shows the average level of optimality achieved by considered algorithms in MOPEX catchments using applied models in the case of Model, it is possible for LNSGA-II scenarios to converge to some optimal objective function values that can dominate the results of NSGA-II or even single objective solutions assigned by SCEM. In the case of Model, it can be concluded that LNSGA-II scenarios are not as successful as they were in the case of Model ; however, it is still possible for LNSGA-II scenarios to result in better level of objective function optimality in comparison to NSGA-II and SCEM for some of the MOPEX catchments. Considering the relationship between the Pareto fronts achieved from LNSGA-II scenarios and NSGA-II algorithm, three different outcomes can be observed and they are shown in Figure. In the first case, the LNSGA-II front can dominate the solutions achieved from NSGA-II. In the second one, LNSGA-II and NSGA-II can converge to more-or-less same front whereas in the third situation, the LNSGA-II solutions were dominated by NSGA-II. Based on this observation, it can be concluded that the applying likelihood comparison operator can result in an entirely different searching mechanism which can result in dominating, similar, or dominated solutions when compared to the NSGA-II solutions. Figure shows the histograms for the number of archived calibration solutions assigned by NSGA-II and scenarios of LNSGA-II considered in the MOPEX catchments. Analysing Figure, it can be concluded that for the LNSGA-II algorithm the diversity preservation
7 capability is lower than NSGA-II. This characteristic can be addressed by fundamental difference between the crowded comparison operator and the likelihood comparison operator for which the aim is to preserve the more likely solutions rather than providing a spread-out Pareto front. However, as Figure shows regarding the calibration of Model, LNSGA-II can converge quite fast toward the neighbourhood of the non-dominated solutions. This property can have a particular importance in the calibration of rainfallrunoff models in which in some cases, each model simulation can be quite computationally expensive. Perhaps, the advantage of this fast convergence can be further highlighted for the regionalization purposes in which a model should be calibrated using several catchments. However, it should be noted that there is a trade-off between speed and robustness of convergence in LNSGA-II. The same observation can be made for Model. Table. The average level of optimality achieved by considered algorithms in MOPEX catchments using applied models Model Calibration method RMSE RMSE(FDH) RMSE(FDL) RMSE(FNQ) RMSE(FNS) NSGA-II 9.7% 9.% 9.% 9.% 9.% Model LNSGA-II, S.% 9.%.% 97.9% 9.7% LNSGA-II, S 99.% 9.%.7% 97.% 9.7% LNSGA-II, S 99.% 9.%.9% 9.% 9.% NSGA-II % 9.77% 99.9% 9.% Model LNSGA-II, S % 99.7% 99.7% 9.7% LNSGA-II, S % 9.% 99.% 9.% LNSGA-II, S % 9.7% 99.9%.9% RMSE(FNQ)..7. RMSE(FNQ)... RMSE(FNQ) RMSE(FDH). RMSE(FDH)... RMSE(FDH) Figure. Different conditions between the Pareto front achieved by NSGA-II and LNSGA-II scenarios. Dots are representing NSGA-II solutions and the results of LNSGA- II scenarios have been plotted using stars, circles and triangular respectively. Left) Results of Model in catchment ID 7; Middle) Results of Model in catchment ID 7; Right) Results of Model in catchment ID 77 NSGA-II 7 LNSGA-II, First scenario 7 LNSGA-II, Second scenario 7 LNSGA-II, Third scenario.. O c c ure n c e... 7 NSGA-II LNSGA-II, First Scenario (a) LNSGA-II, Second Scenario LNSGA -II, Third Scenario Oc cu re nc e (b)
8 Figure. Comparison among the numbers of archived solutions for the applied models in MOPEX catchments using NSGA-II and LNSGA-II scenarios; (a) Model (b) Model Using LNSGA-II, a more compact and clustered solutions in the parametric space can result which makes the parameter selection less complex. As an illustration, Figure compares the MDS plots [Buja and Swayne, ] of parametric solutions resulted from NSGA-II and three scenarios using LNSGA-II for the calibration of Model in the catchment ID 77. As can be observed, NSGA-II results in wide spread solutions in the parametric space; whereas the solutions are more compact and clustered in MDS plots for LNSGA-II scenarios. RMSE(FDH) RMSE(FDL) RMSE(FNQ) RMSE(FNS).. Function evaluation x.. Function evaluation x.. Function evaluation x.. Function evaluation x.. Function evaluation x.. Function evaluation x.. Function evaluation x.. Function evaluation x.. Function evaluation x.. Function evaluation x.. Function evaluation x.. Function evaluation x Figure. Comparison among the speed of convergence related to calibration of Model in MOPEX catchments using three different scenarios of LNSGA-II. The first row indicates the number of required function evaluations in the first scenario and the other two rows are related to second and third scenarios, respectively. (a) (b) (c) (d) Figure. Comparison among MDS plots of non-dominated solutions resulted from calibration of Model in catchment ID 77 using NSGA-II and three different scenarios for LNSGA-II; (a) NSGA-II (b) LNSGA-II, first scenario (c) LNSGA-II, second scenario (d) LNSGA-II, third scenario
9 . CO CLUSIO S Applying the whole Pareto calibration solutions of rainfall-runoff models is practically impossible due to the considerable amount of diversity in the assigned solutions of NSGA- II. This paper has explored the possibility of tailoring NSGA-II in order to capture more likely solutions instead of providing spread out Pareto optimal solutions. The results have shown that the solutions assigned by the tailored algorithm, i.e. LNSGA-II, contain less diversity (due to the less number of archived questions) and can locate more compact solutions in the parametric space (due to the results of MDS plots). In addition, changing the selection rule establishes a new searching mechanism which can result in a better or worse Pareto-front in comparison to the result of NSGA-II. However, it was found that LNSGA-II scenarios can converge much faster than NSGA-II. REFERE CES Beven, K. J. and Binley, A. M. The future of distributed models: model calibration and uncertainty prediction. Hydrological Processes,, pp. 79-9, 99. Boyle, D. P., Gupta, H. V., and Sorooshian S., Toward improved calibration of hydrological models: Combination the strengths of manual and automatic methods, Water Resources Research, VOL. (), -7,. Buja, A. and Swayne, D. Visualization Methodology for Multidimensional Scaling, Journal of Classification, (9), pp 7, Deb, K., Pratap, A., Agarwal, S., Mayarivan, T., Fast and elitist multi-objective genetic algorithm: NSGA-II, IEEE Transactions on Evolutionary Computation, VOL., NO., pp.-9,. Duan, Q., Schaake, J., Andreassian, V., et al., Model Parameter Estimation Experiment (MOPEX): An Overview of Science Strategy and Major Results from the Second and Third Workshops, J. Hydrol.,, vol., nos., pp. 7. Jakeman, A. J., Hornberger, G. M., How much complexity is warranted in rainfall-runoff model, Water Resources Research, VOL. 9, NO., pp. 7-9, 99. Moore, R.J., Real-time flood forecasting systems: Perspectives and prospects. In: Floods and landslides: Integrated risk assessment (Eds. R. Casale and C. Margottini), Springer, Berlin, Nazemi, A.-R., Yao, x., Chan A. H., " Extracting a Set of Robust Pareto-Optimal Parameters for Hydrologic Models using NSGA-II and SCEM, in the proceeding of IEEE 7th World Congress on Computational Intelligence, Vancouver, Canada, July. Nazemi, A.-R., Yao, X., Chan A. H., " Multi-objective calibration of conceptual rainfallrunoff models using NSGA-II, in the proceeding of 7th International Conference on Hydroinformatics, Nice, France, September. Tang, Y., Reed, P., Wagener, T., How effective and efficient are multi-objective evolutionary algorithms at hydrologic model calibration? Hydrology and Earth Sciences Discussion, (), pp -,. Vrugt, J. A., Gupta H. V., Bastidas, L. A., Bouten, W., and Sorooshian, S., Effective and efficient algorithm for multi-objective optimization of hydrologic models, Water Resources Research, VOL. 9 (),. Vrugt, J. A., Gupta H. V., Bouten, W., and Sorooshian, S., A shuffled complex evolution metropolis algorithm for optimization and uncertainty assessment of hydrologic model parameters, Water Resources Research, VOL. 9 (),. Wagener, T., Lee, M. J., Wheater, H. S., Rainfall-runoff modelling toolbox user manual (RRMT v.), Civil Engineering and Environmental Sciences Department, Imperial College, London,. Wagener, T., Wheater, H. S., On the evaluation of conceptual rainfall-runoff models using multiple-objectives and dynamic identifiability analysis, In Littlewood, I. (ed.), Continuous river flow simulation: methods, applications and uncertainty, British Hydrological Society, Occasional paper, No., Wallingford, UK, pp.-,.
Heatmap Visualisation of Population Based Multi Objective Algorithms
Heatmap Visualisation of Population Based Multi Objective Algorithms Andy Pryke 1, Sanaz Mostaghim 2, Alireza Nazemi 3 1 Cercia, School of Computer Science / 3 Department of Civil Engineering University
More informationMulti-Objective Pipe Smoothing Genetic Algorithm For Water Distribution Network Design
City University of New York (CUNY) CUNY Academic Works International Conference on Hydroinformatics 8-1-2014 Multi-Objective Pipe Smoothing Genetic Algorithm For Water Distribution Network Design Matthew
More informationEvolutionary Algorithms: Lecture 4. Department of Cybernetics, CTU Prague.
Evolutionary Algorithms: Lecture 4 Jiří Kubaĺık Department of Cybernetics, CTU Prague http://labe.felk.cvut.cz/~posik/xe33scp/ pmulti-objective Optimization :: Many real-world problems involve multiple
More informationIncorporation of Scalarizing Fitness Functions into Evolutionary Multiobjective Optimization Algorithms
H. Ishibuchi, T. Doi, and Y. Nojima, Incorporation of scalarizing fitness functions into evolutionary multiobjective optimization algorithms, Lecture Notes in Computer Science 4193: Parallel Problem Solving
More informationMulti-objective Optimization
Jugal K. Kalita Single vs. Single vs. Single Objective Optimization: When an optimization problem involves only one objective function, the task of finding the optimal solution is called single-objective
More informationMulti-objective Optimization
Some introductory figures from : Deb Kalyanmoy, Multi-Objective Optimization using Evolutionary Algorithms, Wiley 2001 Multi-objective Optimization Implementation of Constrained GA Based on NSGA-II Optimization
More informationComparison of parameter estimation algorithms in hydrological modelling
Calibration and Reliability in Groundwater Modelling: From Uncertainty to Decision Making (Proceedings of ModelCARE 2005, The Hague, The Netherlands, June 2005). IAHS Publ. 304, 2006. 67 Comparison of
More informationUsing ɛ-dominance for Hidden and Degenerated Pareto-Fronts
IEEE Symposium Series on Computational Intelligence Using ɛ-dominance for Hidden and Degenerated Pareto-Fronts Heiner Zille Institute of Knowledge and Language Engineering University of Magdeburg, Germany
More informationPerformance Assessment of DMOEA-DD with CEC 2009 MOEA Competition Test Instances
Performance Assessment of DMOEA-DD with CEC 2009 MOEA Competition Test Instances Minzhong Liu, Xiufen Zou, Yu Chen, Zhijian Wu Abstract In this paper, the DMOEA-DD, which is an improvement of DMOEA[1,
More informationMulti-Objective Optimization using Evolutionary Algorithms
Multi-Objective Optimization using Evolutionary Algorithms Kalyanmoy Deb Department of Mechanical Engineering, Indian Institute of Technology, Kanpur, India JOHN WILEY & SONS, LTD Chichester New York Weinheim
More informationIdentifying and reducing model structure uncertainty based on analysis of parameter interaction
Adv. Geosci., 11, 117 122, 2007 Author(s) 2007. This work is licensed under a Creative Commons License. Advances in Geosciences Identifying and reducing model structure uncertainty based on analysis of
More informationAn Evolutionary Algorithm Approach to Generate Distinct Sets of Non-Dominated Solutions for Wicked Problems
An Evolutionary Algorithm Approach to Generate Distinct Sets of Non-Dominated Solutions for Wicked Problems Marcio H. Giacomoni Assistant Professor Civil and Environmental Engineering February 6 th 7 Zechman,
More informationHOW WELL DOES A MODEL REPRODUCE
HOW WELL DOES A MODEL REPRODUCE HYDROLOGIC RESPONSE? Lessons from an inter-model comparison Riddhi Singh, Basudev Biswal Department of Civil Engineering Indian Institute of Technology Bombay, India 2018
More informationMulti-Objective Optimization using Evolutionary Algorithms
Multi-Objective Optimization using Evolutionary Algorithms Kalyanmoy Deb Department ofmechanical Engineering, Indian Institute of Technology, Kanpur, India JOHN WILEY & SONS, LTD Chichester New York Weinheim
More informationHow effective and efficient are multiobjective evolutionary algorithms at hydrologic model calibration?
How effective and efficient are multiobjective evolutionary algorithms at hydrologic model calibration? Y. Tang, P. Reed, T. Wagener To cite this version: Y. Tang, P. Reed, T. Wagener. How effective and
More informationCHAPTER 6 REAL-VALUED GENETIC ALGORITHMS
CHAPTER 6 REAL-VALUED GENETIC ALGORITHMS 6.1 Introduction Gradient-based algorithms have some weaknesses relative to engineering optimization. Specifically, it is difficult to use gradient-based algorithms
More informationBi-Objective Optimization for Scheduling in Heterogeneous Computing Systems
Bi-Objective Optimization for Scheduling in Heterogeneous Computing Systems Tony Maciejewski, Kyle Tarplee, Ryan Friese, and Howard Jay Siegel Department of Electrical and Computer Engineering Colorado
More informationHybrid Particle Swarm and Neural Network Approach for Streamflow Forecasting
Math. Model. Nat. Phenom. Vol. 5, No. 7, 010, pp. 13-138 DOI: 10.1051/mmnp/01057 Hybrid Particle Swarm and Neural Network Approach for Streamflow Forecasting A. Sedki and D. Ouazar Department of Civil
More informationNeural Network Regularization and Ensembling Using Multi-objective Evolutionary Algorithms
Neural Network Regularization and Ensembling Using Multi-objective Evolutionary Algorithms Yaochu Jin Honda Research Institute Europe Carl-Legien-Str 7 Offenbach, GERMANY Email: yaochujin@honda-ride Tatsuya
More informationIncorporating Decision-Maker Preferences into the PADDS Multi- Objective Optimization Algorithm for the Design of Water Distribution Systems
Incorporating Decision-Maker Preferences into the PADDS Multi- Objective Optimization Algorithm for the Design of Water Distribution Systems Bryan A. Tolson 1, Mohammadamin Jahanpour 2 1,2 Department of
More informationFinding Sets of Non-Dominated Solutions with High Spread and Well-Balanced Distribution using Generalized Strength Pareto Evolutionary Algorithm
16th World Congress of the International Fuzzy Systems Association (IFSA) 9th Conference of the European Society for Fuzzy Logic and Technology (EUSFLAT) Finding Sets of Non-Dominated Solutions with High
More informationMechanical Component Design for Multiple Objectives Using Elitist Non-Dominated Sorting GA
Mechanical Component Design for Multiple Objectives Using Elitist Non-Dominated Sorting GA Kalyanmoy Deb, Amrit Pratap, and Subrajyoti Moitra Kanpur Genetic Algorithms Laboratory (KanGAL) Indian Institute
More informationEvolutionary Multi-Objective Optimization of Trace Transform for Invariant Feature Extraction
Evolutionary Multi-Objective Optimization of Trace Transform for Invariant Feature Extraction Wissam A. Albukhanajer, Yaochu Jin, Johann Briffa and Godfried Williams Nature Inspired Computing and Engineering
More informationA genetic algorithms approach to optimization parameter space of Geant-V prototype
A genetic algorithms approach to optimization parameter space of Geant-V prototype Oksana Shadura CERN, PH-SFT & National Technical Univ. of Ukraine Kyiv Polytechnic Institute Geant-V parameter space [1/2]
More informationOptimization Tool User Manual
Optimization Tool User Manual Prepared by SAN FRANCISCO ESTUARY INSTITUTE 4911 Central Avenue, Richmond, CA 94804 Phone: 510-746-7334 (SFEI) Fax: 510-746-7300 www.sfei.org Table of Contents 1. OPTIMIZATION
More informationAn evolutionary annealing-simplex algorithm for global optimisation of water resource systems
FIFTH INTERNATIONAL CONFERENCE ON HYDROINFORMATICS 1-5 July 2002, Cardiff, UK C05 - Evolutionary algorithms in hydroinformatics An evolutionary annealing-simplex algorithm for global optimisation of water
More informationA Multi-Objective Evolutionary Approach to Pareto Optimal Model Trees. A preliminary study
A Multi-Objective Evolutionary Approach to Pareto Optimal Model Trees. A preliminary study Marcin Czajkowski and Marek Kretowski TPNC 2016 12-13.12.2016 Sendai, Japan Faculty of Computer Science Bialystok
More informationComparison of Evolutionary Multiobjective Optimization with Reference Solution-Based Single-Objective Approach
Comparison of Evolutionary Multiobjective Optimization with Reference Solution-Based Single-Objective Approach Hisao Ishibuchi Graduate School of Engineering Osaka Prefecture University Sakai, Osaka 599-853,
More informationAssessing the Convergence Properties of NSGA-II for Direct Crashworthiness Optimization
10 th International LS-DYNA Users Conference Opitmization (1) Assessing the Convergence Properties of NSGA-II for Direct Crashworthiness Optimization Guangye Li 1, Tushar Goel 2, Nielen Stander 2 1 IBM
More informationGlobal optimisation techniques in water resources management
XXVI General Assembly of European Geophysical Society Nice, France, 6-30 March 001 HSC/ Water Resources Engineering: Hydroinformatics Global optimisation techniques in water resources management Andreas
More informationMultiobjective Formulations of Fuzzy Rule-Based Classification System Design
Multiobjective Formulations of Fuzzy Rule-Based Classification System Design Hisao Ishibuchi and Yusuke Nojima Graduate School of Engineering, Osaka Prefecture University, - Gakuen-cho, Sakai, Osaka 599-853,
More informationExploration of Pareto Frontier Using a Fuzzy Controlled Hybrid Line Search
Seventh International Conference on Hybrid Intelligent Systems Exploration of Pareto Frontier Using a Fuzzy Controlled Hybrid Line Search Crina Grosan and Ajith Abraham Faculty of Information Technology,
More informationEvolutionary multi-objective algorithm design issues
Evolutionary multi-objective algorithm design issues Karthik Sindhya, PhD Postdoctoral Researcher Industrial Optimization Group Department of Mathematical Information Technology Karthik.sindhya@jyu.fi
More informationDesign of Curves and Surfaces Using Multi-Objective Optimization
Design of Curves and Surfaces Using Multi-Objective Optimization Rony Goldenthal and Michel Bercovier Abstract. Design by optimization of curves and surfaces is a powerful design technique. The mathematical
More informationTrade-off Between Computational Complexity and Accuracy in Evolutionary Image Feature Extraction
Trade-off Between Computational Complexity and Accuracy in Evolutionary Image Feature Extraction Wissam A. Albukhanajer, Yaochu Jin and Johann A. Briffa Wissam A. Albukhanajer (student) E: w.albukhanajer@surrey.ac.uk
More informationKernel Density Independence Sampling based Monte Carlo Scheme (KISMCS) for inverse hydrological modeling
International Environmental Modelling and Software Society (iemss) 7th Intl. Congress on Env. Modelling and Software, San Diego, CA, USA, Daniel P. Ames, Nigel W.T. Quinn and Andrea E. Rizzoli (Eds.) http://www.iemss.org/society/index.php/iemss-2014-proceedings
More informationEvolutionary Computation
Evolutionary Computation Lecture 9 Mul+- Objec+ve Evolu+onary Algorithms 1 Multi-objective optimization problem: minimize F(X) = ( f 1 (x),..., f m (x)) The objective functions may be conflicting or incommensurable.
More informationGT HEURISTIC FOR SOLVING MULTI OBJECTIVE JOB SHOP SCHEDULING PROBLEMS
GT HEURISTIC FOR SOLVING MULTI OBJECTIVE JOB SHOP SCHEDULING PROBLEMS M. Chandrasekaran 1, D. Lakshmipathy 1 and P. Sriramya 2 1 Department of Mechanical Engineering, Vels University, Chennai, India 2
More informationModeling Urban Growth and Land Use Change with Cellular Automata and Genetic Algorithms
International Congress on Environmental Modelling and Software Brigham Young University BYU ScholarsArchive 6th International Congress on Environmental Modelling and Software - Leipzig, Germany - July
More informationLamarckian Repair and Darwinian Repair in EMO Algorithms for Multiobjective 0/1 Knapsack Problems
Repair and Repair in EMO Algorithms for Multiobjective 0/ Knapsack Problems Shiori Kaige, Kaname Narukawa, and Hisao Ishibuchi Department of Industrial Engineering, Osaka Prefecture University, - Gakuen-cho,
More informationMultiobjective Prototype Optimization with Evolved Improvement Steps
Multiobjective Prototype Optimization with Evolved Improvement Steps Jiri Kubalik 1, Richard Mordinyi 2, and Stefan Biffl 3 1 Department of Cybernetics Czech Technical University in Prague Technicka 2,
More informationMulti-objective Optimization Algorithm based on Magnetotactic Bacterium
Vol.78 (MulGrab 24), pp.6-64 http://dx.doi.org/.4257/astl.24.78. Multi-obective Optimization Algorithm based on Magnetotactic Bacterium Zhidan Xu Institute of Basic Science, Harbin University of Commerce,
More informationA Distance Metric for Evolutionary Many-Objective Optimization Algorithms Using User-Preferences
A Distance Metric for Evolutionary Many-Objective Optimization Algorithms Using User-Preferences Upali K. Wickramasinghe and Xiaodong Li School of Computer Science and Information Technology, RMIT University,
More informationLithological and surface geometry joint inversions using multi-objective global optimization methods
Lithological and surface geometry joint inversions using multi-objective global optimization methods Peter G. Lelièvre 1, Rodrigo Bijani and Colin G. Farquharson 1 plelievre@mun.ca http://www.esd.mun.ca/~peter/home.html
More informationGenetically Enhanced Parametric Design in the Exploration of Architectural Solutions
Genetically Enhanced Parametric Design in the Exploration of Architectural Solutions P. von Buelow University of Michigan, Ann Arbor, USA ABSTRACT: ParaGen is a method for exploring solution options in
More informationOptimizing Delivery Time in Multi-Objective Vehicle Routing Problems with Time Windows
Optimizing Delivery Time in Multi-Objective Vehicle Routing Problems with Time Windows Abel Garcia-Najera and John A. Bullinaria School of Computer Science, University of Birmingham Edgbaston, Birmingham
More informationTheoretical Foundations of SBSE. Xin Yao CERCIA, School of Computer Science University of Birmingham
Theoretical Foundations of SBSE Xin Yao CERCIA, School of Computer Science University of Birmingham Some Theoretical Foundations of SBSE Xin Yao and Many Others CERCIA, School of Computer Science University
More informationImproving interpretability in approximative fuzzy models via multi-objective evolutionary algorithms.
Improving interpretability in approximative fuzzy models via multi-objective evolutionary algorithms. Gómez-Skarmeta, A.F. University of Murcia skarmeta@dif.um.es Jiménez, F. University of Murcia fernan@dif.um.es
More informationA Novel Model Calibration Technique Through Application of Machine Learning Association Rules
International Congress on Environmental Modelling and Software Brigham Young University BYU ScholarsArchive 5th International Congress on Environmental Modelling and Software - Ottawa, Ontario, Canada
More informationSPEA2+: Improving the Performance of the Strength Pareto Evolutionary Algorithm 2
SPEA2+: Improving the Performance of the Strength Pareto Evolutionary Algorithm 2 Mifa Kim 1, Tomoyuki Hiroyasu 2, Mitsunori Miki 2, and Shinya Watanabe 3 1 Graduate School, Department of Knowledge Engineering
More informationGenetic Algorithm Performance with Different Selection Methods in Solving Multi-Objective Network Design Problem
etic Algorithm Performance with Different Selection Methods in Solving Multi-Objective Network Design Problem R. O. Oladele Department of Computer Science University of Ilorin P.M.B. 1515, Ilorin, NIGERIA
More informationNon-Dominated Bi-Objective Genetic Mining Algorithm
Advances in Computational Sciences and Technology ISSN 0973-6107 Volume 10, Number 6 (2017) pp. 1607-1614 Research India Publications http://www.ripublication.com Non-Dominated Bi-Objective Genetic Mining
More informationUsing Database Storage to Improve Explorative Optimization of Form Critical Structures
15 to 19 September 2014, Brasilia, Brazil Reyolando M.L.R.F. BRASIL and Ruy M.O. PAULETTI (eds.) Using Database Storage to Improve Explorative Optimization of Form Critical Structures VON BUELOW, Peter
More informationSolving Multi-objective Optimisation Problems Using the Potential Pareto Regions Evolutionary Algorithm
Solving Multi-objective Optimisation Problems Using the Potential Pareto Regions Evolutionary Algorithm Nasreddine Hallam, Graham Kendall, and Peter Blanchfield School of Computer Science and IT, The Univeristy
More informationFinding a preferred diverse set of Pareto-optimal solutions for a limited number of function calls
Finding a preferred diverse set of Pareto-optimal solutions for a limited number of function calls Florian Siegmund, Amos H.C. Ng Virtual Systems Research Center University of Skövde P.O. 408, 541 48 Skövde,
More informationExperimental Study on Bound Handling Techniques for Multi-Objective Particle Swarm Optimization
Experimental Study on Bound Handling Techniques for Multi-Objective Particle Swarm Optimization adfa, p. 1, 2011. Springer-Verlag Berlin Heidelberg 2011 Devang Agarwal and Deepak Sharma Department of Mechanical
More informationA Model-Based Evolutionary Algorithm for Bi-objective Optimization
A Model-Based Evolutionary Algorithm for Bi-objective Optimization Aimin Zhou 1, Qingfu Zhang 1, Yaochu Jin 2, Edward Tsang 1 and Tatsuya Okabe 3 1 Department of Computer Science, University of Essex,
More informationA GENETIC ALGORITHM FOR CLUSTERING ON VERY LARGE DATA SETS
A GENETIC ALGORITHM FOR CLUSTERING ON VERY LARGE DATA SETS Jim Gasvoda and Qin Ding Department of Computer Science, Pennsylvania State University at Harrisburg, Middletown, PA 17057, USA {jmg289, qding}@psu.edu
More informationAn Evolutionary Multi-Objective Crowding Algorithm (EMOCA): Benchmark Test Function Results
Syracuse University SURFACE Electrical Engineering and Computer Science College of Engineering and Computer Science -0-005 An Evolutionary Multi-Objective Crowding Algorithm (EMOCA): Benchmark Test Function
More informationMULTI-OBJECTIVE GENETIC LOCAL SEARCH ALGORITHM FOR SUPPLY CHAIN SIMULATION OPTIMISATION
MULTI-OBJECTIVE GENETIC LOCAL SEARCH ALGORITHM FOR SUPPLY CHAIN SIMULATION OPTIMISATION Galina Merkuryeva (a), Liana Napalkova (b) (a) (b) Department of Modelling and Simulation, Riga Technical University,
More informationApproximation Model Guided Selection for Evolutionary Multiobjective Optimization
Approximation Model Guided Selection for Evolutionary Multiobjective Optimization Aimin Zhou 1, Qingfu Zhang 2, and Guixu Zhang 1 1 Each China Normal University, Shanghai, China 2 University of Essex,
More informationGrade 8. Strand: Number Specific Learning Outcomes It is expected that students will:
8.N.1. 8.N.2. Number Demonstrate an understanding of perfect squares and square roots, concretely, pictorially, and symbolically (limited to whole numbers). [C, CN, R, V] Determine the approximate square
More informationAn Analysis of Interface Quality for Decision Support
International Congress on Environmental Modelling and Software Brigham Young University BYU ScholarsArchive 4th International Congress on Environmental Modelling and Software - Barcelona, Catalonia, Spain
More informationSpatial and temporal rainfall approximation using additive models
ANZIAM J. 42 (E) ppc1599 C1611, 2000 C1599 Spatial and temporal rainfall approximation using additive models C. Zoppou S. Roberts M. Hegland (Received 7 August 2000) Abstract We investigate the approximation
More informationEstimation of Parameter Uncertainty in the HBV Model
Nordic Hydrology, 28 (4/5), 1997, 247-262 Estimation of Parameter Uncertainty in the HBV Model Jan Seibert Uppsala University, Institute of Earth Sciences, Department of Hydrology, S-752 36 Uppsala, Sweden
More informationA gradient-based multiobjective optimization technique using an adaptive weighting method
10 th World Congress on Structural and Multidisciplinary Optimization May 19-24, 2013, Orlando, Florida, USA A gradient-based multiobjective optimization technique using an adaptive weighting method Kazuhiro
More informationImproving Performance of Multi-objective Genetic for Function Approximation through island specialisation
Improving Performance of Multi-objective Genetic for Function Approximation through island specialisation A. Guillén 1, I. Rojas 1, J. González 1, H. Pomares 1, L.J. Herrera 1, and B. Paechter 2 1) Department
More informationReal Coded Genetic Algorithm Particle Filter for Improved Performance
Proceedings of 2012 4th International Conference on Machine Learning and Computing IPCSIT vol. 25 (2012) (2012) IACSIT Press, Singapore Real Coded Genetic Algorithm Particle Filter for Improved Performance
More informationDynamic Resampling for Preference-based Evolutionary Multi-Objective Optimization of Stochastic Systems
Dynamic Resampling for Preference-based Evolutionary Multi-Objective Optimization of Stochastic Systems Florian Siegmund a, Amos H. C. Ng a, and Kalyanmoy Deb b a School of Engineering, University of Skövde,
More informationA012 A REAL PARAMETER GENETIC ALGORITHM FOR CLUSTER IDENTIFICATION IN HISTORY MATCHING
1 A012 A REAL PARAMETER GENETIC ALGORITHM FOR CLUSTER IDENTIFICATION IN HISTORY MATCHING Jonathan N Carter and Pedro J Ballester Dept Earth Science and Engineering, Imperial College, London Abstract Non-linear
More informationEvolving SQL Queries for Data Mining
Evolving SQL Queries for Data Mining Majid Salim and Xin Yao School of Computer Science, The University of Birmingham Edgbaston, Birmingham B15 2TT, UK {msc30mms,x.yao}@cs.bham.ac.uk Abstract. This paper
More informationMultiobjective Optimization Using Adaptive Pareto Archived Evolution Strategy
Multiobjective Optimization Using Adaptive Pareto Archived Evolution Strategy Mihai Oltean Babeş-Bolyai University Department of Computer Science Kogalniceanu 1, Cluj-Napoca, 3400, Romania moltean@cs.ubbcluj.ro
More informationA Search Method with User s Preference Direction using Reference Lines
A Search Method with User s Preference Direction using Reference Lines Tomohiro Yoshikawa Graduate School of Engineering, Nagoya University, Nagoya, Japan, {yoshikawa}@cse.nagoya-u.ac.jp Abstract Recently,
More informationHow to correct and complete discharge data Main text
Table of Contents. General 2. Completion from another record at the same station 3. Interpolating discharge gaps of short duration 4. Interpolating gaps during recessions 5. Interpolation using regression
More informationNCGA : Neighborhood Cultivation Genetic Algorithm for Multi-Objective Optimization Problems
: Neighborhood Cultivation Genetic Algorithm for Multi-Objective Optimization Problems Shinya Watanabe Graduate School of Engineering, Doshisha University 1-3 Tatara Miyakodani,Kyo-tanabe, Kyoto, 10-031,
More informationDEMO: Differential Evolution for Multiobjective Optimization
DEMO: Differential Evolution for Multiobjective Optimization Tea Robič and Bogdan Filipič Department of Intelligent Systems, Jožef Stefan Institute, Jamova 39, SI-1000 Ljubljana, Slovenia tea.robic@ijs.si
More informationA Bayesian approach to artificial neural network model selection
A Bayesian approach to artificial neural network model selection Kingston, G. B., H. R. Maier and M. F. Lambert Centre for Applied Modelling in Water Engineering, School of Civil and Environmental Engineering,
More informationMultidisciplinary System Design Optimization (MSDO) Course Summary
Multidisciplinary System Design Optimization (MSDO) Course Summary Lecture 23 Prof. Olivier de Weck Prof. Karen Willcox 1 Outline Summarize course content Present some emerging research directions Interactive
More informationThe Pennsylvania State University The Graduate School ADVANCING HYDROLOGIC MODEL EVALUATION AND IDENTIFICATION USING MULTIOBJECTIVE CALIBRATION,
The Pennsylvania State University The Graduate School ADVANCING HYDROLOGIC MODEL EVALUATION AND IDENTIFICATION USING MULTIOBJECTIVE CALIBRATION, SENSITIVITY ANALYSIS, AND PARALLEL COMPUTATION A Thesis
More informationA Parallel Shuffled Complex Evolution Model Calibrating Algorithm to Reduce Computational Time
A Parallel Shuffled Complex Evolution Model Calibrating Algorithm to Reduce Computational Time Muttil, N. 1,*, S.Y. Liong 2, O. Nesterov 2 1 School of Architectural, Civil and Mechanical Engineering and
More informationA noninformative Bayesian approach to small area estimation
A noninformative Bayesian approach to small area estimation Glen Meeden School of Statistics University of Minnesota Minneapolis, MN 55455 glen@stat.umn.edu September 2001 Revised May 2002 Research supported
More informationA New Rainfall Runoff Software Library
A New Rainfall Runoff Software Library J.-M. Perraud a, G. M. Podger b, J. M. Rahman a, R. A. Vertessy a a Cooperative Research Centre for Catchment Hydrology, CSIRO Land and Water, Canberra, jean-michel.perraud@csiro.au
More informationOverview of NSGA-II for Optimizing Machining Process Parameters
Available online at www.sciencedirect.com Procedia Engineering 15 (2011 ) 3978 3983 Overview of NSGA-II for Optimizing Machining Process Parameters Yusliza Yusoff *, Mohd Salihin Ngadiman, Azlan Mohd Zain
More informationData-Driven Evolutionary Optimization of Complex Systems: Big vs Small Data
Data-Driven Evolutionary Optimization of Complex Systems: Big vs Small Data Yaochu Jin Head, Nature Inspired Computing and Engineering (NICE) Department of Computer Science, University of Surrey, United
More informationUnsupervised Feature Selection Using Multi-Objective Genetic Algorithms for Handwritten Word Recognition
Unsupervised Feature Selection Using Multi-Objective Genetic Algorithms for Handwritten Word Recognition M. Morita,2, R. Sabourin 3, F. Bortolozzi 3 and C. Y. Suen 2 École de Technologie Supérieure, Montreal,
More informationHydrologic Modeling using HEC-HMS
Hydrologic Modeling using HEC-HMS CE 412/512 Spring 2017 Introduction The intent of this exercise is to introduce you to the structure and some of the functions of the HEC-Hydrologic Modeling System (HEC-HMS),
More informationEvolutionary Multi-objective Optimization of Business Process Designs with Pre-processing
Evolutionary Multi-objective Optimization of Business Process Designs with Pre-processing Kostas Georgoulakos Department of Applied Informatics University of Macedonia Thessaloniki, Greece mai16027@uom.edu.gr
More informationFACILITY LIFE-CYCLE COST ANALYSIS BASED ON FUZZY SETS THEORY Life-cycle cost analysis
FACILITY LIFE-CYCLE COST ANALYSIS BASED ON FUZZY SETS THEORY Life-cycle cost analysis J. O. SOBANJO FAMU-FSU College of Engineering, Tallahassee, Florida Durability of Building Materials and Components
More informationLate Parallelization and Feedback Approaches for Distributed Computation of Evolutionary Multiobjective Optimization Algorithms
Late arallelization and Feedback Approaches for Distributed Computation of Evolutionary Multiobjective Optimization Algorithms O. Tolga Altinoz Department of Electrical and Electronics Engineering Ankara
More informationPreferences in Evolutionary Multi-Objective Optimisation with Noisy Fitness Functions: Hardware in the Loop Study
Proceedings of the International Multiconference on ISSN 1896-7094 Computer Science and Information Technology, pp. 337 346 2007 PIPS Preferences in Evolutionary Multi-Objective Optimisation with Noisy
More informationGenetically Enhanced Parametric Design for Performance Optimization
Genetically Enhanced Parametric Design for Performance Optimization Peter VON BUELOW Associate Professor, Dr. -Ing University of Michigan Ann Arbor, USA pvbuelow@umich.edu Peter von Buelow received a BArch
More informationEstimation of Design Flow in Ungauged Basins by Regionalization
Estimation of Design Flow in Ungauged Basins by Regionalization Yu, P.-S., H.-P. Tsai, S.-T. Chen and Y.-C. Wang Department of Hydraulic and Ocean Engineering, National Cheng Kung University, Taiwan E-mail:
More informationExpectation Maximization (EM) and Gaussian Mixture Models
Expectation Maximization (EM) and Gaussian Mixture Models Reference: The Elements of Statistical Learning, by T. Hastie, R. Tibshirani, J. Friedman, Springer 1 2 3 4 5 6 7 8 Unsupervised Learning Motivation
More informationGECCO 2007 Tutorial / Evolutionary Multiobjective Optimization. Eckart Zitzler ETH Zürich. weight = 750g profit = 5.
Tutorial / Evolutionary Multiobjective Optimization Tutorial on Evolutionary Multiobjective Optimization Introductory Example: The Knapsack Problem weight = 75g profit = 5 weight = 5g profit = 8 weight
More informationMULTI-OBJECTIVE OPTIMIZATION
MULTI-OBJECTIVE OPTIMIZATION Introduction Many real-world problems require the simultaneous optimization of a number of objective functions. Some of these objectives may be in conflict. Example 1:optimal
More informationAn Evolutionary Algorithm for the Multi-objective Shortest Path Problem
An Evolutionary Algorithm for the Multi-objective Shortest Path Problem Fangguo He Huan Qi Qiong Fan Institute of Systems Engineering, Huazhong University of Science & Technology, Wuhan 430074, P. R. China
More informationA technique for constructing monotonic regression splines to enable non-linear transformation of GIS rasters
18 th World IMACS / MODSIM Congress, Cairns, Australia 13-17 July 2009 http://mssanz.org.au/modsim09 A technique for constructing monotonic regression splines to enable non-linear transformation of GIS
More informationEffects of Discrete Design-variable Precision on Real-Coded Genetic Algorithm
Effects of Discrete Design-variable Precision on Real-Coded Genetic Algorithm Toshiki Kondoh, Tomoaki Tatsukawa, Akira Oyama, Takeshi Watanabe and Kozo Fujii Graduate School of Engineering, Tokyo University
More informationInternational Conference on Computer Applications in Shipbuilding (ICCAS-2009) Shanghai, China Vol.2, pp
AUTOMATIC DESIGN FOR PIPE ARRANGEMENT CONSIDERING VALVE OPERATIONALITY H Kimura, Kyushu University, Japan S Iehira, Kyushu University, Japan SUMMARY We propose a novel evaluation method of valve operationality
More informationA Clustering Multi-objective Evolutionary Algorithm Based on Orthogonal and Uniform Design
A Clustering Multi-objective Evolutionary Algorithm Based on Orthogonal and Uniform Design Yuping Wang, Chuangyin Dang, Hecheng Li, Lixia Han and Jingxuan Wei Abstract Designing efficient algorithms for
More information