A novel objective function with artificial ecosystem-based optimization for relieving the mismatching power loss of large-scale photovoltaic array

2020 ◽  
Vol 225 ◽  
pp. 113385 ◽  
Author(s):  
Dalia Yousri ◽  
Thanikanti Sudhakar Babu ◽  
Seyedali Mirjalili ◽  
N. Rajasekar ◽  
Mohamed Abd Elaziz
Keyword(s):  
Objective Function ◽  
Power Loss ◽  
Large Scale ◽  
Photovoltaic Array ◽  
Artificial Ecosystem

Opinion Dynamics Optimization by Varying Susceptibility to Persuasion via Non-Convex Local Search

2021 ◽  
Vol 16 (2) ◽  
pp. 1-34
Author(s):  
Rediet Abebe ◽  
T.-H. HUBERT Chan ◽  
Jon Kleinberg ◽  
Zhibin Liang ◽  
David Parkes ◽  
...  
Keyword(s):  
Local Search ◽  
Objective Function ◽  
Iterative Process ◽  
Large Scale ◽  
Opinion Dynamics ◽  
Theoretical Models ◽  
Global Optimum ◽  
Local Optimum ◽  
Opinion Formation ◽  
Long Line

A long line of work in social psychology has studied variations in people’s susceptibility to persuasion—the extent to which they are willing to modify their opinions on a topic. This body of literature suggests an interesting perspective on theoretical models of opinion formation by interacting parties in a network: in addition to considering interventions that directly modify people’s intrinsic opinions, it is also natural to consider interventions that modify people’s susceptibility to persuasion. In this work, motivated by this fact, we propose an influence optimization problem. Specifically, we adopt a popular model for social opinion dynamics, where each agent has some fixed innate opinion, and a resistance that measures the importance it places on its innate opinion; agents influence one another’s opinions through an iterative process. Under certain conditions, this iterative process converges to some equilibrium opinion vector. For the unbudgeted variant of the problem, the goal is to modify the resistance of any number of agents (within some given range) such that the sum of the equilibrium opinions is minimized; for the budgeted variant, in addition the algorithm is given upfront a restriction on the number of agents whose resistance may be modified. We prove that the objective function is in general non-convex. Hence, formulating the problem as a convex program as in an early version of this work (Abebe et al., KDD’18) might have potential correctness issues. We instead analyze the structure of the objective function, and show that any local optimum is also a global optimum, which is somehow surprising as the objective function might not be convex. Furthermore, we combine the iterative process and the local search paradigm to design very efficient algorithms that can solve the unbudgeted variant of the problem optimally on large-scale graphs containing millions of nodes. Finally, we propose and evaluate experimentally a family of heuristics for the budgeted variant of the problem.

Cooperative Coevolution with Formula-Based Variable Grouping for Large-Scale Global Optimization

2018 ◽  
Vol 26 (4) ◽  
pp. 569-596 ◽  
Author(s):  
Yuping Wang ◽  
Haiyan Liu ◽  
Fei Wei ◽  
Tingting Zong ◽  
Xiaodong Li
Keyword(s):  
Global Optimization ◽  
Objective Function ◽  
Real World ◽  
Large Scale ◽  
Divide And Conquer ◽  
Group Method ◽  
Objective Functions ◽  
Elementary Functions ◽  
Cooperative Coevolution ◽  
Solution Quality

For a large-scale global optimization (LSGO) problem, divide-and-conquer is usually considered an effective strategy to decompose the problem into smaller subproblems, each of which can then be solved individually. Among these decomposition methods, variable grouping is shown to be promising in recent years. Existing variable grouping methods usually assume the problem to be black-box (i.e., assuming that an analytical model of the objective function is unknown), and they attempt to learn appropriate variable grouping that would allow for a better decomposition of the problem. In such cases, these variable grouping methods do not make a direct use of the formula of the objective function. However, it can be argued that many real-world problems are white-box problems, that is, the formulas of objective functions are often known a priori. These formulas of the objective functions provide rich information which can then be used to design an effective variable group method. In this article, a formula-based grouping strategy (FBG) for white-box problems is first proposed. It groups variables directly via the formula of an objective function which usually consists of a finite number of operations (i.e., four arithmetic operations “[Formula: see text]”, “[Formula: see text]”, “[Formula: see text]”, “[Formula: see text]” and composite operations of basic elementary functions). In FBG, the operations are classified into two classes: one resulting in nonseparable variables, and the other resulting in separable variables. In FBG, variables can be automatically grouped into a suitable number of non-interacting subcomponents, with variables in each subcomponent being interdependent. FBG can easily be applied to any white-box problem and can be integrated into a cooperative coevolution framework. Based on FBG, a novel cooperative coevolution algorithm with formula-based variable grouping (so-called CCF) is proposed in this article for decomposing a large-scale white-box problem into several smaller subproblems and optimizing them respectively. To further enhance the efficiency of CCF, a new local search scheme is designed to improve the solution quality. To verify the efficiency of CCF, experiments are conducted on the standard LSGO benchmark suites of CEC'2008, CEC'2010, CEC'2013, and a real-world problem. Our results suggest that the performance of CCF is very competitive when compared with those of the state-of-the-art LSGO algorithms.

3D elastic full-waveform inversion of surface waves in the presence of irregular topography using an envelope-based misfit function

Geophysics ◽  
2018 ◽  
Vol 83 (1) ◽  
pp. R1-R11 ◽  
Author(s):  
Dmitry Borisov ◽  
Ryan Modrak ◽  
Fuchun Gao ◽  
Jeroen Tromp
Keyword(s):  
Surface Wave ◽  
Objective Function ◽  
Surface Waves ◽  
Large Scale ◽  
Body Wave ◽  
Waveform Inversion ◽  
Full Waveform Inversion ◽  
S Wave ◽  
Near Surface ◽  
Full Waveform

Full-waveform inversion (FWI) is a powerful method for estimating the earth’s material properties. We demonstrate that surface-wave-driven FWI is well-suited to recovering near-surface structures and effective at providing S-wave speed starting models for use in conventional body-wave FWI. Using a synthetic example based on the SEG Advanced Modeling phase II foothills model, we started with an envelope-based objective function to invert for shallow large-scale heterogeneities. Then we used a waveform-difference objective function to obtain a higher-resolution model. To accurately model surface waves in the presence of complex tomography, we used a spectral-element wave-propagation solver. Envelope misfit functions are found to be effective at minimizing cycle-skipping issues in surface-wave inversions, and surface waves themselves are found to be useful for constraining complex near-surface features.

An Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret Objectives

2021 ◽  
Author(s):  
Jungho Park ◽  
Hadi El-Amine ◽  
Nevin Mutlu
Keyword(s):  
Resource Allocation ◽  
Objective Function ◽  
Large Scale ◽  
Computational Study ◽  
Optimal Solution ◽  
Exact Algorithm ◽  
Minimax Regret ◽  
Optimal Solutions ◽  
Heuristic Approaches ◽  
Exact Approach

We study a large-scale resource allocation problem with a convex, separable, not necessarily differentiable objective function that includes uncertain parameters falling under an interval uncertainty set, considering a set of deterministic constraints. We devise an exact algorithm to solve the minimax regret formulation of this problem, which is NP-hard, and we show that the proposed Benders-type decomposition algorithm converges to an [Formula: see text]-optimal solution in finite time. We evaluate the performance of the proposed algorithm via an extensive computational study, and our results show that the proposed algorithm provides efficient solutions to large-scale problems, especially when the objective function is differentiable. Although the computation time takes longer for problems with nondifferentiable objective functions as expected, we show that good quality, near-optimal solutions can be achieved in shorter runtimes by using our exact approach. We also develop two heuristic approaches, which are partially based on our exact algorithm, and show that the merit of the proposed exact approach lies in both providing an [Formula: see text]-optimal solution and providing good quality near-optimal solutions by laying the foundation for efficient heuristic approaches.

scholarly journals Symbiotic Organism Search Algorithm for Power Loss Minimization in Radial Distribution Systems by Network Reconfiguration and Distributed Generation Placement

2020 ◽  
Vol 2020 ◽  
pp. 1-22
Author(s):  
Tung Tran The ◽  
Sy Nguyen Quoc ◽  
Dieu Vo Ngoc
Keyword(s):  
Distributed Generation ◽  
Radial Distribution ◽  
Power Loss ◽  
Distribution Systems ◽  
Large Scale ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Distribution Networks ◽  
Network Reconfiguration ◽  
Symbiotic Organism Search

This paper proposes the Symbiotic Organism Search (SOS) algorithm to find the optimal network configuration and the placement of distributed generation (DG) units that minimize the real power loss in radial distribution networks. The proposed algorithm simulates symbiotic relationships such as mutualism, commensalism, and parasitism for solving the optimization problems. In the optimization process, the reconfiguration problem produces a large number of infeasible network configurations. To reduce these infeasible individuals and ensure the radial topology of the network, the graph theory was applied during the power flow. The implementation of the proposed SOS algorithm was carried out on 33-bus, 69-bus, 84-bus, and 119-bus distribution networks considering seven different scenarios. Simulation results and performance comparison with other optimization methods showed that the SOS-based approach was very effective in solving the network reconfiguration and DG placement problems, especially for complex and large-scale distribution networks.

scholarly journals Randomized sketch descent methods for non-separable linearly constrained optimization

2020 ◽  
Author(s):  
Ion Necoara ◽  
Martin Takáč
Keyword(s):  
Objective Function ◽  
Large Scale ◽  
Convergence Rates ◽  
Optimization Problems ◽  
Sufficient Conditions ◽  
Linear Constraints ◽  
Descent Methods ◽  
Constrained Problems ◽  
Special Cases ◽  
Linearly Constrained

Abstract In this paper we consider large-scale smooth optimization problems with multiple linear coupled constraints. Due to the non-separability of the constraints, arbitrary random sketching would not be guaranteed to work. Thus, we first investigate necessary and sufficient conditions for the sketch sampling to have well-defined algorithms. Based on these sampling conditions we develop new sketch descent methods for solving general smooth linearly constrained problems, in particular, random sketch descent (RSD) and accelerated random sketch descent (A-RSD) methods. To our knowledge, this is the first convergence analysis of RSD algorithms for optimization problems with multiple non-separable linear constraints. For the general case, when the objective function is smooth and non-convex, we prove for the non-accelerated variant sublinear rate in expectation for an appropriate optimality measure. In the smooth convex case, we derive for both algorithms, non-accelerated and A-RSD, sublinear convergence rates in the expected values of the objective function. Additionally, if the objective function satisfies a strong convexity type condition, both algorithms converge linearly in expectation. In special cases, where complexity bounds are known for some particular sketching algorithms, such as coordinate descent methods for optimization problems with a single linear coupled constraint, our theory recovers the best known bounds. Finally, we present several numerical examples to illustrate the performances of our new algorithms.

scholarly journals Optimization of Power and Levelized Cost for Shrouded Small Wind Turbine

Inventions ◽  
2020 ◽  
Vol 5 (4) ◽  
pp. 59
Author(s):  
Hasanali Khojasteh ◽  
Younes Noorollahi ◽  
Mojtaba Tahani ◽  
Mehran Masdari
Keyword(s):  
Wind Energy ◽  
Objective Function ◽  
Wind Power ◽  
Wind Turbines ◽  
Power Plants ◽  
Large Scale ◽  
Renewable Energies ◽  
Levelized Cost ◽  
Small Wind Turbines ◽  
Input Parameters

Nowadays, by increasing energy demand and considering the importance of environmental issues in recent decades, the use of renewable energies is expanding. Among renewable energies, wind power and its technology are growing and evolving more rapidly. Resource assessment in Iran has revealed the significant potential of wind energy around the country. To further develop wind energy in the country and create large-scale wind power plants, the consideration of distributed power generation using small wind turbines for applications in agricultural and residential use is needed. Conventional small wind turbines and small wind lens turbines have been developed in recent years. In this research project, a small wind lens turbine is designed. The advantages of this turbine are an increased production capacity and reduced cut-in speed and noise pollution. In this study, a lens (or shroud) is added to a small turbine, and the maximized annual energy production (AEP) and minimization of the levelized cost of energy (LCOE) are modeled. We applied the NSGA-II algorithm for optimization to find the best answer. The input parameters in the objective function of the AEP are cut-in, cut-out, rated speeds, scale factor, and shape factor. Additionally, the input parameters in the objective function of the LCOE are the power production, initial capital cost, annual operating expenses, and balance of energy. The results indicate that installing a wind lens turbine in Kish Island led to an LCOE decrease of 56% on average, and we can see an 83% increase in the AEP. In the Firoozkooh area, an average reduction of 59% in the LCOE and 74% increase in the AEP for a wind lens turbine is observed.

scholarly journals Estimation of ECHAM5 climate model closure parameters with adaptive MCMC

2010 ◽  
Vol 10 (20) ◽  
pp. 9993-10002 ◽  
Author(s):  
H. Järvinen ◽  
P. Räisänen ◽  
M. Laine ◽  
J. Tamminen ◽  
A. Ilin ◽  
...  
Keyword(s):  
Parameter Estimation ◽  
Objective Function ◽  
Large Scale ◽  
Computational Models ◽  
Climate Models ◽  
Climate Model ◽  
Expert Knowledge ◽  
Adaptive Mcmc ◽  
Posterior Probability Density ◽  
Probability Densities

Abstract. Climate models contain closure parameters to which the model climate is sensitive. These parameters appear in physical parameterization schemes where some unresolved variables are expressed by predefined parameters rather than being explicitly modeled. Currently, best expert knowledge is used to define the optimal closure parameter values, based on observations, process studies, large eddy simulations, etc. Here, parameter estimation, based on the adaptive Markov chain Monte Carlo (MCMC) method, is applied for estimation of joint posterior probability density of a small number (n=4) of closure parameters appearing in the ECHAM5 climate model. The parameters considered are related to clouds and precipitation and they are sampled by an adaptive random walk process of the MCMC. The parameter probability densities are estimated simultaneously for all parameters, subject to an objective function. Five alternative formulations of the objective function are tested, all related to the net radiative flux at the top of the atmosphere. Conclusions of the closure parameter estimation tests with a low-resolution ECHAM5 climate model indicate that (i) adaptive MCMC is a viable option for parameter estimation in large-scale computational models, and (ii) choice of the objective function is crucial for the identifiability of the parameter distributions.

Sign in / Sign up

Export Citation Format

Share Document