scholarly journals Sustainable Water Resources Management in an Arid Area Using a Coupled Optimization-Simulation Modeling

Water ◽  
2020 ◽  
Vol 12 (3) ◽  
pp. 885 ◽  
Author(s):  
Siamak Farrokhzadeh ◽  
Seyed Hashemi Monfared ◽  
Gholamreza Azizyan ◽  
Ali Sardar Shahraki ◽  
Maurits Ertsen ◽  
...  
Keyword(s):  
Ecosystem Services ◽  
Water Resources ◽  
Environmental Data ◽  
Multi Objective Optimization ◽  
Wetland Ecosystems ◽  
Multi Objective ◽  
Sustainable Water Resources Management ◽  
Trade Offs ◽  
Conflicting Demands ◽  
Conflicting Objectives

Severe water scarcity in recent years has magnified the economic, social, and environmental significance of water stress globally, making optimal planning in water resources necessary for sustainable socio-economic development. One of the regions that is most affected by this is the Sistan region and its Hamoun wetland, located in south-east Iran. Water policies are essential to sustain current basin ecosystem services, maintaining a balance between conflicting demands from agriculture and the protection of wetland ecosystems. In the present study, a multi-objective optimization model is linked with the Water Evaluation and Planning (WEAP) software to optimize water allocation decisions over multiple years. We formulate and parameterize a multi-objective optimization problem where the net economic benefit from agriculture and the supply of environmental requirements were maximized, to analyze the trade-off between different stakeholders. This problem is modeled and solved for the study area with detailed agricultural, socio-economic, and environmental data for 30 years and quantification of ecosystem services. By plotting Pareto sets, we investigate the trade-offs between the two conflicting objectives and evaluate a possible compromise. The results are analyzed by comparing purely economic versus multi-objective scenarios on the Pareto front. Finally, the disadvantages and advantages of these scenarios are also qualitatively described to help the decision process for water resources managers.

Multi-Objective Pricing Optimization for a High-Speed Rail Network Under Competition

2019 ◽  
Vol 2673 (7) ◽  
pp. 215-226 ◽  
Author(s):  
Huizhuo Cao ◽  
Xuemei Li ◽  
Vikrant Vaze ◽  
Xueyan Li
Keyword(s):  
High Speed ◽  
Programming Model ◽  
Pareto Frontier ◽  
Multiple Objectives ◽  
Multi Objective Optimization ◽  
High Speed Rail ◽  
Multi Objective ◽  
Trade Offs ◽  
Conflicting Objectives ◽  
Single Objective

Multi-objective pricing of high-speed rail (HSR) passenger fares becomes a challenge when the HSR operator needs to deal with multiple conflicting objectives. Although many studies have tackled the challenge of calculating the optimal fares over railway networks, none of them focused on characterizing the trade-offs between multiple objectives under multi-modal competition. We formulate the multi-objective HSR fare optimization problem over a linear network by introducing the epsilon-constraint method within a bi-level programming model and develop an iterative algorithm to solve this model. This is the first HSR pricing study to use an epsilon-constraint methodology. We obtain two single-objective solutions and four multi-objective solutions and compare them on a variety of metrics. We also derive the Pareto frontier between the objectives of profit and passenger welfare to enable the operator to choose the best trade-off. Our results based on computational experiments with Beijing–Shanghai regional network provide several new insights. First, we find that small changes in fares can lead to a significant improvement in passenger welfare with no reduction in profitability under multi-objective optimization. Second, multi-objective optimization solutions show considerable improvements over the single-objective optimization solutions. Third, Pareto frontier enables decision-makers to make more informed decisions about choosing the best trade-offs. Overall, the explicit modeling of multiple objectives leads to better pricing solutions, which have the potential to guide pricing decisions for the HSR operators.

scholarly journals Comparative Study of Knee-Based Algorithms for Many-Objective Optimization Problems

2018 ◽  
Vol 12 (1) ◽  
pp. 7-16
Author(s):  
Saad M. Alzahrani ◽  
Naruemon Wattanapongsakorn
Keyword(s):  
Optimization Problems ◽  
Benchmark Problems ◽  
Multi Objective Optimization ◽  
Trade Off ◽  
Knee Region ◽  
Multi Objective ◽  
Trade Offs ◽  
Conflicting Objectives ◽  
Small Set ◽  
Optimum Solution

Nowadays, most real-world optimization problems consist of many and often conflicting objectives to be optimized simultaneously. Although, many current Multi-Objective optimization algorithms can efficiently solve problems with 3 or less objectives, their performance deteriorates proportionally with the increasing of the objectives number. Furthermore, in many situations the decision maker (DM) is not interested in all trade-off solutions obtained but rather interested in a single optimum solution or a small set of those trade-offs. Therefore, determining an optimum solution or a small set of trade-off solutions is a difficult task. However, an interesting method for finding such solutions is identifying solutions in the Knee region. Solutions in the Knee region can be considered the best obtained solution in the obtained trade-off set especially if there is no preference or equally important objectives. In this paper, a pruning strategy was used to find solutions in the Knee region of Pareto optimal fronts for some benchmark problems obtained by NSGA-II, MOEA/D-DE and a promising new Multi-Objective optimization algorithm NSGA-III. Lastly, those knee solutions found were compared and evaluated using a generational distance performance metric, computation time and a statistical one-way ANOVA test.

Collective intelligence approaches in interactive evolutionary multi-objective optimization

2020 ◽  
Vol 28 (1) ◽  
pp. 95-108 ◽  
Author(s):  
Daniel Cinalli ◽  
Luis Martí ◽  
Nayat Sanchez-Pi ◽  
Ana Cristina Bicharra Garcia
Keyword(s):  
Collective Intelligence ◽  
Real Life ◽  
Decision Makers ◽  
Multi Objective Optimization ◽  
Multi Objective ◽  
Pareto Optimal Set ◽  
Trade Offs ◽  
Life Problems ◽  
Conflicting Objectives ◽  
Optimal Set

Abstract Evolutionary multi-objective optimization algorithms (EMOAs) have been successfully applied in many real-life problems. EMOAs approximate the set of trade-offs between multiple conflicting objectives, known as the Pareto optimal set. Reference point approaches can alleviate the optimization process by highlighting relevant areas of the Pareto set and support the decision makers to take the more confident evaluation. One important drawback of this approaches is that they require an in-depth knowledge of the problem being solved in order to function correctly. Collective intelligence has been put forward as an alternative to deal with situations like these. This paper extends some well-known EMOAs to incorporate collective preferences and interactive techniques. Similarly, two new preference-based multi-objective optimization performance indicators are introduced in order to analyze the results produced by the proposed algorithms in the comparative experiments carried out.

Bector-Chandra Type Duality in Linear Programming Under Fuzzy Environment Using Hyperbolic Tangent Membership Functions

2019 ◽  
Vol 8 (2) ◽  
pp. 68-88
Author(s):  
Pratiksha Saxena ◽  
Ravi Jain
Keyword(s):  
Mathematical Model ◽  
Utility Function ◽  
Nonlinear Model ◽  
Probabilistic Approach ◽  
Utility Functions ◽  
Multi Objective Optimization ◽  
Total Utility ◽  
Multi Objective ◽  
Trade Offs ◽  
Conflicting Objectives

Multi-objective optimization has been applied in many fields of science, including engineering, economics and logistics where optimal decisions need to be taken in the presence of trade-offs between two or more conflicting objectives. One approach to optimize a multi-objective mathematical model is to employ utility functions for the objectives. Recent studies on utility-based multi-objective optimization concentrates on considering just one utility function for each objective. But, in reality, it is not reasonable to have a unique utility function corresponding to each objective function. Here, a constrained multi-objective mathematical model is considered in which several utility functions are associated for each objective. All of these utility functions are uncertain and in fuzzy form, so a fuzzy probabilistic approach is incorporated to investigate the uncertainty of the utility functions for each objective. Meanwhile, the total utility function of the problem will be a fuzzy nonlinear mathematical model. Since there are not any conventional approaches to solve such a model, a defuzzification method to change the total utility function to a crisp nonlinear model is employed. Also, a maximum technique is applied to defuzzify the conditional utility functions. This action results in changing the total utility function to a crisp single objective nonlinear model and will simplify the optimization process of the total utility function. The effectiveness of the proposed approach is shown by solving a test problem.

scholarly journals A Comparison of Genetic Representations and Initialisation Methods for the Multi-objective Shortest Path Problem on Multigraphs

2021 ◽  
Vol 2 (3) ◽  
Author(s):  
Lilla Beke ◽  
Michal Weiszer ◽  
Jun Chen
Keyword(s):  
Shortest Path ◽  
Time Budget ◽  
Exact Algorithm ◽  
Simple Graph ◽  
Shortest Path Problem ◽  
Future Application ◽  
Multi Objective ◽  
Trade Offs ◽  
Conflicting Objectives ◽  
Problem Instances

AbstractThis paper compares different solution approaches for the multi-objective shortest path problem (MSPP) on multigraphs. Multigraphs as a modelling tool are able to capture different available trade-offs between objectives for a given section of a route. For this reason, they are increasingly popular in modelling transportation problems with multiple conflicting objectives (e.g., travel time and fuel consumption), such as time-dependent vehicle routing, multi-modal transportation planning, energy-efficient driving, and airport operations. The multigraph MSPP is more complex than the NP-hard simple graph MSPP. Therefore, approximate solution methods are often needed to find a good approximation of the true Pareto front in a given time budget. Evolutionary algorithms have been successfully applied for the simple graph MSPP. However, there has been limited investigation of their applications to the multigraph MSPP. Here, we extend the most popular genetic representations to the multigraph case and compare the achieved solution qualities. Two heuristic initialisation methods are also considered to improve the convergence properties of the algorithms. The comparison is based on a diverse set of problem instances, including both bi-objective and triple objective problems. We found that the metaheuristic approach with heuristic initialisation provides good solutions in shorter running times compared to an exact algorithm. The representations were all found to be competitive. The results are encouraging for future application to the time-constrained multigraph MSPP.

scholarly journals Multi-Objective Optimization of Autonomous Microgrids with Reliability Consideration

Energies ◽  
2021 ◽  
Vol 14 (15) ◽  
pp. 4466
Author(s):  
Maël Riou ◽  
Florian Dupriez-Robin ◽  
Dominique Grondin ◽  
Christophe Le Loup ◽  
Michel Benne ◽  
...  
Keyword(s):  
Power Systems ◽  
Rural Areas ◽  
Energy System ◽  
Design Stage ◽  
Multi Objective Optimization ◽  
Renewable Energy Resources ◽  
Nsga Ii ◽  
Renewable Integration ◽  
Multi Objective ◽  
Trade Offs

Microgrids operating on renewable energy resources have potential for powering rural areas located far from existing grid infrastructures. These small power systems typically host a hybrid energy system of diverse architecture and size. An effective integration of renewable energies resources requires careful design. Sizing methodologies often lack the consideration for reliability and this aspect is limited to power adequacy. There exists an inherent trade-off between renewable integration, cost, and reliability. To bridge this gap, a sizing methodology has been developed to perform multi-objective optimization, considering the three design objectives mentioned above. This method is based on the non-dominated sorting genetic algorithm (NSGA-II) that returns the set of optimal solutions under all objectives. This method aims to identify the trade-offs between renewable integration, reliability, and cost allowing to choose the adequate architecture and sizing accordingly. As a case study, we consider an autonomous microgrid, currently being installed in a rural area in Mali. The results show that increasing system reliability can be done at the least cost if carried out in the initial design stage.

Efficient Computation of Probabilistic Dominance in Multi-objective Optimization

2021 ◽  
Vol 1 (4) ◽  
pp. 1-26
Author(s):  
Faramarz Khosravi ◽  
Alexander Rass ◽  
Jürgen Teich
Keyword(s):  
Optimization Problems ◽  
Statistical Tests ◽  
Optimization Techniques ◽  
Simultaneous Optimization ◽  
Sampled Data ◽  
Efficient Computation ◽  
Multi Objective Optimization ◽  
Multi Objective ◽  
Conflicting Objectives ◽  
Comparison Operator

Real-world problems typically require the simultaneous optimization of multiple, often conflicting objectives. Many of these multi-objective optimization problems are characterized by wide ranges of uncertainties in their decision variables or objective functions. To cope with such uncertainties, stochastic and robust optimization techniques are widely studied aiming to distinguish candidate solutions with uncertain objectives specified by confidence intervals, probability distributions, sampled data, or uncertainty sets. In this scope, this article first introduces a novel empirical approach for the comparison of candidate solutions with uncertain objectives that can follow arbitrary distributions. The comparison is performed through accurate and efficient calculations of the probability that one solution dominates the other in terms of each uncertain objective. Second, such an operator can be flexibly used and combined with many existing multi-objective optimization frameworks and techniques by just substituting their standard comparison operator, thus easily enabling the Pareto front optimization of problems with multiple uncertain objectives. Third, a new benchmark for evaluating uncertainty-aware optimization techniques is introduced by incorporating different types of uncertainties into a well-known benchmark for multi-objective optimization problems. Fourth, the new comparison operator and benchmark suite are integrated into an existing multi-objective optimization framework that features a selection of multi-objective optimization problems and algorithms. Fifth, the efficiency in terms of performance and execution time of the proposed comparison operator is evaluated on the introduced uncertainty benchmark. Finally, statistical tests are applied giving evidence of the superiority of the new comparison operator in terms of \epsilon -dominance and attainment surfaces in comparison to previously proposed approaches.

Multi-objective optimization for safety and reliability trade-off: Optimization and results processing

2018 ◽  
Vol 232 (6) ◽  
pp. 661-676
Author(s):  
Cristina Johansson ◽  
Johan Ölvander ◽  
Micael Derelöv
Keyword(s):  
Decision Making ◽  
Solid Base ◽  
Multi Objective Optimization ◽  
Specific System ◽  
Multi Objective ◽  
Trade Offs ◽  
Design Alternatives ◽  
Safety And Reliability ◽  
Potential Issue ◽  
Selection Of

In early design phases, it is vital to be able to screen the design space for a set of promising design alternatives for further study. This article presents a method able to balance several objectives of different mathematical natures, with high impact on the design choices. The method (MOSART) handles multi-objective optimization for safety and reliability trade-offs. The article focuses on optimization problem approach and processing of results as a base for decision-making. The output of the optimization step is the selection of specific system elements obtaining the best balance between the targets. However, what is a good base for decision can easily transform into too much information and overloading of the decision-maker. To solve this potential issue, from a set of Pareto optimal solutions, a smaller sub-set of selected solutions are visualized and filtered out using preference levels of the objectives, yielding a solid base for decision-making and valuable information on potential solutions. Trends were observed regarding each system element and discussed while processing the results of the analysis, supporting the decision of one final best solution.

Dynamic Template Generation

2021 ◽  
pp. 1-37
Keyword(s):  
Optimization Problems ◽  
Real Life ◽  
Dynamic Test ◽  
Test Paper ◽  
Multi Objective Optimization ◽  
Multi Objective ◽  
Life Problems ◽  
Conflicting Objectives ◽  
Complex Optimization ◽  
Dynamic Template

A test blueprint/test template, also known as the table of specifications, represents the structure of a test. It has been highly recommended in assessment textbook to carry out the preparation of a test with a test blueprint. This chapter focuses on modeling a dynamic test paper template using multi-objective optimization algorithm and makes use of the template in dynamic generation of examination test paper. Multi-objective optimization-based models are realistic models for many complex optimization problems. Modeling a dynamic test paper template, similar to many real-life problems, includes solving multiple conflicting objectives satisfying the template specifications.

Sign in / Sign up

Export Citation Format

Share Document