scholarly journals Designing a Framework for the Estuarine Monitoring System

10.29007/v44x ◽  
2018 ◽  
Author(s):  
Nam-Hoon Kim ◽  
Jin Hwan Hwang
Keyword(s):  
Numerical Model ◽  
Constrained Optimization ◽  
River Discharge ◽  
Design Space ◽  
Optimal Solution ◽  
Optimization Method ◽  
Environmental Data ◽  
Optimal Solutions ◽  
Simulation Data ◽  
Estuarine Monitoring

Where the physical and environmental characteristics of the coast and estuary change dramatically and complicatedly due to the multiple controlling sources as like as the tide, wave, river discharge, in order to collect the environmental data effectively and reliably, the locations of monitoring should be optimally determined with the standardized framework. The present study proposes a protocol to find the best monitoring location in a local bay based on a spatial and temporal optimizing method. With the simulation data from the accurately validated numerical model, the monitoring locations are designed with the constrained optimization method, which finds the optimal solution by constraining the objective function into the design space. The objective and constrained functions are determined from the objective analysis, which is combined with constrained optimization. Finally, those two functions are used to find the optimal solutions of the locations.

scholarly journals Heuristic approach applied to the optimum stratification problem

2021 ◽  
Author(s):  
José André Brito ◽  
Leonardo de Lima ◽  
Pedro Henrique González ◽  
Breno Oliveira ◽  
Nelson Maculan
Keyword(s):  
Variable Neighborhood Search ◽  
Optimal Solution ◽  
Optimization Method ◽  
Neighborhood Search ◽  
Optimal Solutions ◽  
Enumeration Algorithm ◽  
Global Optimal Solution ◽  
Optimal Sample ◽  
Precision Level ◽  
Global Optimal

The problem of finding an optimal sample stratification has been extensively studied in the literature. In this paper, we propose a heuristic optimization method for solving the univariate optimum stratification problem aiming at minimizing the sample size for a given precision level. The method is based on the variable neighborhood search metaheuristic, which was combined with an exact method. Numerical experiments were performed over a dataset of 24 instances, and the results of the proposed algorithm were compared with two very well-known methods from the literature. Our results outperformed $94\%$ of  the considered cases. In addition, we developed an enumeration algorithm to find the global optimal solution in some populations and scenarios, which enabled us to validate our metaheuristic method. Furthermore, we find that our algorithm obtained the global optimal solutions for the vast majority of the cases.

Optimization Method RasID-GA for Numerical Constrained Optimization Problems

2007 ◽  
Vol 11 (5) ◽  
pp. 469-477 ◽  
Author(s):  
Dongkyu Sohn ◽  
◽  
Shingo Mabu ◽  
Kotaro Hirasawa ◽  
Jinglu Hu
Keyword(s):  
Genetic Algorithm ◽  
Constrained Optimization ◽  
Optimization Problems ◽  
Random Search ◽  
Optimal Solution ◽  
Solution Space ◽  
Optimization Method ◽  
Penalty Functions ◽  
Objective Functions ◽  
Constrained Optimization Problems

This paper proposes Adaptive Random search with Intensification and Diversification combined with Genetic Algorithm (RasID-GA) for constrained optimization. In the previous work, we proposed RasID-GA which combines the best properties of RasID and Genetic Algorithm for unconstrained optimization problems. In general, it is very difficult to find an optimal solution for constrained optimization problems because their feasible solution space is very limited and they should consider the objective functions and constraint conditions. The conventional constrained optimization methods usually use penalty functions to solve given problems. But, it is generally recognized that the penalty function is hard to handle in terms of the balance between penalty functions and objective functions. In this paper, we propose a constrained optimization method using RasID-GA, which solves given problems without using penalty functions. The proposed method is tested and compared with Evolution Strategy with Stochastic Ranking using well-known 11 benchmark problems with constraints. From the Simulation results, RasID-GA can find an optimal solution or approximate solutions without using penalty functions.

Orientation Capability, Error Analysis, and Dimensional Optimization of Two Articulated Tool Heads With Parallel Kinematics

2008 ◽  
Vol 130 (1) ◽  
Author(s):  
Xin-Jun Liu ◽  
Ilian A. Bonev
Keyword(s):  
Design Space ◽  
Optimization Method ◽  
Thin Wall ◽  
Optimal Solutions ◽  
Parallel Kinematics ◽  
Spherical Joint ◽  
Increasing Demand ◽  
Error Index ◽  
Three Degree Of Freedom ◽  
Dimensional Optimization

Because of the increasing demand in industry for A/B-axis tool heads, particularly in thin wall machining applications for structural aluminium aerospace components, the three-degree-of-freedom articulated tool head with parallel kinematics has become very popular. This paper addresses the dimensional optimization of two types of tool head with 3-P̱VPHS and 3-P̱VRS parallel kinematics (P, R, and S standing for prismatic, revolute, and spherical joint, respectively; the subscripts V and H indicating that the direction of the P joint is vertical or horizontal, and the joint symbol with underline means the joint is active) by considering their orientation capability and positioning accuracy. We first investigate the tilt angle of the spherical joint, the orientation capability, and the error of one point from the mobile platform caused by input errors. Optimization of the 3-P̱VPHS tool head is easy. For the 3-P̱VRS tool head, a design space is developed to illustrate how the orientation capability and error index are related to the link lengths. An optimization process is accordingly presented. Using the optimization method introduced here, it is not difficult to find all the possible optimal solutions.

scholarly journals Optimal solution of the fractional order breast cancer competition model

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
H. Hassani ◽  
J. A. Tenreiro Machado ◽  
Z. Avazzadeh ◽  
E. Safari ◽  
S. Mehrabi
Keyword(s):  
Breast Cancer ◽  
Fractional Order ◽  
Legendre Polynomials ◽  
Numerical Experiments ◽  
Optimal Solution ◽  
Optimization Method ◽  
Competition Model ◽  
Basis Functions ◽  
Cell Populations ◽  
Operational Matrices

AbstractIn this article, a fractional order breast cancer competition model (F-BCCM) under the Caputo fractional derivative is analyzed. A new set of basis functions, namely the generalized shifted Legendre polynomials, is proposed to deal with the solutions of F-BCCM. The F-BCCM describes the dynamics involving a variety of cancer factors, such as the stem, tumor and healthy cells, as well as the effects of excess estrogen and the body’s natural immune response on the cell populations. After combining the operational matrices with the Lagrange multipliers technique we obtain an optimization method for solving the F-BCCM whose convergence is investigated. Several examples show that a few number of basis functions lead to the satisfactory results. In fact, numerical experiments not only confirm the accuracy but also the practicability and computational efficiency of the devised technique.

scholarly journals On quantitative stability in infinite-dimensional optimization under uncertainty

2021 ◽  
Author(s):  
M. Hoffhues ◽  
W. Römisch ◽  
T. M. Surowiec
Keyword(s):  
Stochastic Optimization ◽  
Constrained Optimization ◽  
Optimization Problems ◽  
Optimization Under Uncertainty ◽  
Optimal Solutions ◽  
Probability Metrics ◽  
Pde Constrained Optimization ◽  
Quantitative Stability ◽  
Infinite Dimensional ◽  
Optimal Value

AbstractThe vast majority of stochastic optimization problems require the approximation of the underlying probability measure, e.g., by sampling or using observations. It is therefore crucial to understand the dependence of the optimal value and optimal solutions on these approximations as the sample size increases or more data becomes available. Due to the weak convergence properties of sequences of probability measures, there is no guarantee that these quantities will exhibit favorable asymptotic properties. We consider a class of infinite-dimensional stochastic optimization problems inspired by recent work on PDE-constrained optimization as well as functional data analysis. For this class of problems, we provide both qualitative and quantitative stability results on the optimal value and optimal solutions. In both cases, we make use of the method of probability metrics. The optimal values are shown to be Lipschitz continuous with respect to a minimal information metric and consequently, under further regularity assumptions, with respect to certain Fortet-Mourier and Wasserstein metrics. We prove that even in the most favorable setting, the solutions are at best Hölder continuous with respect to changes in the underlying measure. The theoretical results are tested in the context of Monte Carlo approximation for a numerical example involving PDE-constrained optimization under uncertainty.

scholarly journals Temporal concatenation for Markov decision processes

2021 ◽  
pp. 1-28
Author(s):  
Ruiyang Song ◽  
Kuang Xu
Keyword(s):  
Markov Decision Processes ◽  
Large Scale ◽  
Optimal Solution ◽  
Upper Bounds ◽  
Black Box ◽  
Decision Processes ◽  
Optimal Solutions ◽  
Wide Range ◽  
Markov Decision ◽  
Speed Up

We propose and analyze a temporal concatenation heuristic for solving large-scale finite-horizon Markov decision processes (MDP), which divides the MDP into smaller sub-problems along the time horizon and generates an overall solution by simply concatenating the optimal solutions from these sub-problems. As a “black box” architecture, temporal concatenation works with a wide range of existing MDP algorithms. Our main results characterize the regret of temporal concatenation compared to the optimal solution. We provide upper bounds for general MDP instances, as well as a family of MDP instances in which the upper bounds are shown to be tight. Together, our results demonstrate temporal concatenation's potential of substantial speed-up at the expense of some performance degradation.

scholarly journals Economic Development Based on a Mathematical Model: An Optimal Solution Method for the Fuel Supply of International Road Transport Activity

Energies ◽  
2021 ◽  
Vol 14 (10) ◽  
pp. 2963
Author(s):  
Melinda Timea Fülöp ◽  
Miklós Gubán ◽  
György Kovács ◽  
Mihály Avornicului
Keyword(s):  
Decision Making ◽  
Ad Hoc ◽  
Market Competition ◽  
Optimal Solution ◽  
Cost Savings ◽  
Cost Effective ◽  
Optimization Method ◽  
Optimal Decision ◽  
Environmental Damage ◽  
Fuel Cost

Due to globalization and increased market competition, forwarding companies must focus on the optimization of their international transport activities and on cost reduction. The minimization of the amount and cost of fuel results in increased competition and profitability of the companies as well as the reduction of environmental damage. Nowadays, these aspects are particularly important. This research aims to develop a new optimization method for road freight transport costs in order to reduce the fuel costs and determine optimal fueling stations and to calculate the optimal quantity of fuel to refill. The mathematical method developed in this research has two phases. In the first phase the optimal, most cost-effective fuel station is determined based on the potential fuel stations. The specific fuel prices differ per fuel station, and the stations are located at different distances from the main transport way. The method developed in this study supports drivers’ decision-making regarding whether to refuel at a farther but cheaper fuel station or at a nearer but more expensive fuel station based on the more economical choice. Thereafter, it is necessary to determine the optimal fuel volume, i.e., the exact volume required including a safe amount to cover stochastic incidents (e.g., road closures). This aspect of the optimization method supports drivers’ optimal decision-making regarding optimal fuel stations and how much fuel to obtain in order to reduce the fuel cost. Therefore, the application of this new method instead of the recently applied ad-hoc individual decision-making of the drivers results in significant fuel cost savings. A case study confirmed the efficiency of the proposed method.

Well Placement Technique and Production Optimization for Mature Field - A Case Study of L-X Field

2020 ◽  
Vol 46 ◽  
pp. 168-179
Author(s):  
Patrick Nwafor ◽  
Kelani Bello
Keyword(s):  
Oil And Gas ◽  
Optimization Technique ◽  
Optimal Solution ◽  
Oil And Gas Industry ◽  
Optimization Method ◽  
Simulation Software ◽  
Production Optimization ◽  
Direct Optimization ◽  
Well Placement ◽  
Local Optimal Solution

A Well placement is a well-known technique in the oil and gas industry for production optimization and are generally classified into local and global methods. The use of simulation software often deployed under the direct optimization technique called global method. The production optimization of L-X field which is at primary recovery stage having five producing wells was the focus of this work. The attempt was to optimize L-X field using a well placement technique.The local methods are generally very efficient and require only a few forward simulations but can get stuck in a local optimal solution. The global methods avoid this problem but require many forward simulations. With the availability of simulator software, such problem can be reduced thus using the direct optimization method. After optimization an increase in recovery factor of over 20% was achieved. The results provided an improvement when compared with other existing methods from the literatures.

Sign in / Sign up

Export Citation Format

Share Document