scholarly journals Optimal placement of tsunami sensors with depth constraint

2021 ◽  
Vol 7 ◽  
pp. e685
Author(s):  
Ikha Magdalena ◽  
Raynaldi La’lang ◽  
Renier Mendoza ◽  
Jose Ernie Lope

Tsunamis are destructive natural disasters that can cause severe damage to property and the loss of many lives. To mitigate the damage and casualties, tsunami warning systems are implemented in coastal areas, especially in locations with high seismic activity. This study presents a method to identify the placement of near-shore detection sensors by minimizing the tsunami detection time, obtained by solving the two-dimensional shallow water equations (SWE). Several benchmark tests were done to establish the robustness of the SWE model, which is solved using a staggered finite volume method. The optimization problem is solved using particle swarm optimization (PSO). The proposed method is applied to different test problems. As an application, the method is used to find the optimal location of a detection sensor using data from the 2018 Palu tsunami. Our findings show that detection time can be significantly reduced through the strategic placement of tsunami sensors.


Author(s):  
T Thomas ◽  
C Pfrommer ◽  
R Pakmor

Abstract We present a new numerical algorithm to solve the recently derived equations of two-moment cosmic ray hydrodynamics (CRHD). The algorithm is implemented as a module in the moving mesh Arepo code. Therein, the anisotropic transport of cosmic rays (CRs) along magnetic field lines is discretised using a path-conservative finite volume method on the unstructured time-dependent Voronoi mesh of Arepo. The interaction of CRs and gyroresonant Alfvén waves is described by short-timescale source terms in the CRHD equations. We employ a custom-made semi-implicit adaptive time stepping source term integrator to accurately integrate this interaction on the small light-crossing time of the anisotropic transport step. Both the transport and the source term integration step are separated from the evolution of the magneto-hydrodynamical equations using an operator split approach. The new algorithm is tested with a variety of test problems, including shock tubes, a perpendicular magnetised discontinuity, the hydrodynamic response to a CR overpressure, CR acceleration of a warm cloud, and a CR blast wave, which demonstrate that the coupling between CR and magneto-hydrodynamics is robust and accurate. We demonstrate the numerical convergence of the presented scheme using new linear and non-linear analytic solutions.



Author(s):  
Xiaomin Chen ◽  
Ramesh Agarwal

In this paper, we consider the Wind Farm layout optimization problem using a genetic algorithm. Both the Horizontal–Axis Wind Turbines (HAWT) and Vertical-Axis Wind Turbines (VAWT) are considered. The goal of the optimization problem is to optimally place the turbines within the wind farm such that the wake effects are minimized and the power production is maximized. The reasonably accurate modeling of the turbine wake is critical in determination of the optimal layout of the turbines and the power generated. For HAWT, two wake models are considered; both are found to give similar answers. For VAWT, a very simple wake model is employed.



2018 ◽  
Vol 18 (4) ◽  
pp. 997-1012 ◽  
Author(s):  
Émilie Bresson ◽  
Philippe Arbogast ◽  
Lotfi Aouf ◽  
Denis Paradis ◽  
Anna Kortcheva ◽  
...  

Abstract. Winds, waves and storm surges can inflict severe damage in coastal areas. In order to improve preparedness for such events, a better understanding of storm-induced coastal flooding episodes is necessary. To this end, this paper highlights the use of atmospheric downscaling techniques in order to improve wave and storm surge hindcasts. The downscaling techniques used here are based on existing European Centre for Medium-Range Weather Forecasts reanalyses (ERA-20C, ERA-40 and ERA-Interim). The results show that the 10 km resolution data forcing provided by a downscaled atmospheric model gives a better wave and surge hindcast compared to using data directly from the reanalysis. Furthermore, the analysis of the most extreme mid-latitude cyclones indicates that a four-dimensional blending approach improves the whole process, as it assimilates more small-scale processes in the initial conditions. Our approach has been successfully applied to ERA-20C (the 20th century reanalysis).



2010 ◽  
Vol 18 (3) ◽  
pp. 403-449 ◽  
Author(s):  
Kalyanmoy Deb ◽  
Ankur Sinha

Bilevel optimization problems involve two optimization tasks (upper and lower level), in which every feasible upper level solution must correspond to an optimal solution to a lower level optimization problem. These problems commonly appear in many practical problem solving tasks including optimal control, process optimization, game-playing strategy developments, transportation problems, and others. However, they are commonly converted into a single level optimization problem by using an approximate solution procedure to replace the lower level optimization task. Although there exist a number of theoretical, numerical, and evolutionary optimization studies involving single-objective bilevel programming problems, not many studies look at the context of multiple conflicting objectives in each level of a bilevel programming problem. In this paper, we address certain intricate issues related to solving multi-objective bilevel programming problems, present challenging test problems, and propose a viable and hybrid evolutionary-cum-local-search based algorithm as a solution methodology. The hybrid approach performs better than a number of existing methodologies and scales well up to 40-variable difficult test problems used in this study. The population sizing and termination criteria are made self-adaptive, so that no additional parameters need to be supplied by the user. The study indicates a clear niche of evolutionary algorithms in solving such difficult problems of practical importance compared to their usual solution by a computationally expensive nested procedure. The study opens up many issues related to multi-objective bilevel programming and hopefully this study will motivate EMO and other researchers to pay more attention to this important and difficult problem solving activity.



2013 ◽  
Vol 141 (4) ◽  
pp. 1216-1240 ◽  
Author(s):  
Xingliang Li ◽  
Chungang Chen ◽  
Xueshun Shen ◽  
Feng Xiao

Abstract The two-dimensional nonhydrostatic compressible dynamical core for the atmosphere has been developed by using a new nodal-type high-order conservative method, the so-called multimoment constrained finite-volume (MCV) method. Different from the conventional finite-volume method, the predicted variables (unknowns) in an MCV scheme are the values at the solution points distributed within each mesh cell. The time evolution equations to update the unknown point values are derived from a set of constraint conditions based on the multimoment concept, where the constraint on the volume-integrated average (VIA) for each mesh cell is cast into a flux form and thus guarantees rigorously the numerical conservation. Two important features make the MCV method particularly attractive as an accurate and practical numerical framework for atmospheric and oceanic modeling. 1) The predicted variables are the nodal values at the solution points that can be flexibly located within a mesh cell (equidistant solution points are used in the present model). It is computationally efficient and provides great convenience in dealing with complex geometry and source terms. 2) High-order and physically consistent formulations can be built by choosing proper constraints in view of not only numerical accuracy and efficiency but also underlying physics. In this paper the authors present a dynamical core that uses the third- and the fourth-order MCV schemes. They have verified the numerical outputs of both schemes by widely used standard benchmark tests and obtained competitive results. The present numerical core provides a promising and practical framework for further development of nonhydrostatic compressible atmospheric models.



2011 ◽  
Vol 2011 ◽  
pp. 1-9 ◽  
Author(s):  
Wei-Xiang Wang ◽  
You-Lin Shang ◽  
Wei-Gang Sun ◽  
Ying Zhang

We present a novel filled function approach to solve box-constrained system of nonlinear equations. The system is first transformed into an equivalent nonsmooth global minimization problem, and then a new filled function method is proposed to solve this global optimization problem. Numerical experiments on several test problems are conducted and the computational results are also reported.



2020 ◽  
Vol 6 ◽  
pp. e333
Author(s):  
Angelie Ferrolino ◽  
Renier Mendoza ◽  
Ikha Magdalena ◽  
Jose Ernie Lope

Rapid detection and early warning systems demonstrate crucial significance in tsunami risk reduction measures. So far, several tsunami observation networks have been deployed in tsunamigenic regions to issue effective local response. However, guidance on where to station these sensors are limited. In this article, we address the problem of determining the placement of tsunami sensors with the least possible tsunami detection time. We use the solutions of the 2D nonlinear shallow water equations to compute the wave travel time. The optimization problem is solved by implementing the particle swarm optimization algorithm. We apply our model to a simple test problem with varying depths. We also use our proposed method to determine the placement of sensors for early tsunami detection in Cotabato Trench, Philippines.



Complexity ◽  
2019 ◽  
Vol 2019 ◽  
pp. 1-11 ◽  
Author(s):  
Cai Dai ◽  
Xiujuan Lei

Brain storm optimization (BSO) algorithm is a simple and effective evolutionary algorithm. Some multiobjective brain storm optimization algorithms have low search efficiency. This paper combines the decomposition technology and multiobjective brain storm optimization algorithm (MBSO/D) to improve the search efficiency. Given weight vectors transform a multiobjective optimization problem into a series of subproblems. The decomposition technology determines the neighboring clusters of each cluster. Solutions of adjacent clusters generate new solutions to update population. An adaptive selection strategy is used to balance exploration and exploitation. Besides, MBSO/D compares with three efficient state-of-the-art algorithms, e.g., NSGAII and MOEA/D, on twenty-two test problems. The experimental results show that MBSO/D is more efficient than compared algorithms and can improve the search efficiency for most test problems.



2019 ◽  
Vol 29 (01) ◽  
pp. 2050003
Author(s):  
Lalin L. Laudis ◽  
N. Ramadass

The complexity of any integrated circuit pushes the researchers to optimize the various parameters in the design process. Usually, the Nondeterministic Polynomial problems in the design process of Very Large Scale Integration (VLSI) are considered as a Single Objective Optimization Problem (SOOP). However, due to the increasing demand for the multi-criterion optimization, researchers delve up on Multi-Objective Optimization methodologies to solve a problem with multiple objectives. Moreover, it is evident from the literature that biologically inspired algorithm works very well in optimizing a Multi-Objective Optimization Problem (MOOP). This paper proposes a new Lion’s pride inspired algorithm to solve any MOOP. The methodologies mimic the traits of a Lion which always strives to become the Pride Lion. The Algorithm was tested with VLSI floorplanning problem wherein the area and dead space are the objectives. The algorithm was also tested with several standard test problems. The tabulated results justify the ruggedness of the proposed algorithm in solving any MOOP.



2020 ◽  
Author(s):  
Kang Ma ◽  
Lurui Fang ◽  
Wangwei Kong

Phase unbalance is widespread in the distribution networks in the UK, continental Europe, US, China, and other countries. First, this paper reviews the mass scale of phase unbalance and its causes and consequences. Three challenges arise from phase rebalancing: the scalability, data scarcity, and adaptability (towards changing unbalance over time) challenges. Solutions to address the challenges are: 1) using retrofit-able, maintenance-free, automatic solutions to overcome the scalability challenge; 2) using data analytics to overcome the data-scarcity challenge; and 3) using phase balancers or other online phase rebalancing solutions to overcome the adaptability challenge. This paper categorizes existing phase rebalancing solutions into three classes: 1) load/lateral re-phasing; 2) using phase balancers; 3) controlling energy storage, electric vehicles, distributed generation, and micro-grids for phase rebalancing. Their advantages and limitations are analyzed and ways to overcome the limitations are recommended. Finally, this paper suggests future research topics: 1) long-term forecast of phase unbalance; 2) whole-system analysis of the unbalance-induced costs; 3) phase unbalance diagnosis for data-scarce LV networks; 4) techno-commercial solutions to exploit the flexibility from large three-phase customers for phase balancing; 5) the optimal placement of phase balancers; 6) the transition from single-phase customers to three-phase customers. <br>



Sign in / Sign up

Export Citation Format

Share Document