scholarly journals Model Building and Optimization Analysis of MDF Continuous Hot-Pressing Process by Neural Network

2016 ◽  
Vol 2016 ◽  
pp. 1-16
Author(s):  
Qingfa Li ◽  
Yaqiu Liu ◽  
Liangkuan Zhu

We propose a one-layer neural network for solving a class of constrained optimization problems, which is brought forward from the MDF continuous hot-pressing process. The objective function of the optimization problem is the sum of a nonsmooth convex function and a smooth nonconvex pseudoconvex function, and the feasible set consists of two parts, one is a closed convex subset ofRn, and the other is defined by a class of smooth convex functions. By the theories of smoothing techniques, projection, penalty function, and regularization term, the proposed network is modeled by a differential equation, which can be implemented easily. Without any other condition, we prove the global existence of the solutions of the proposed neural network with any initial point in the closed convex subset. We show that any accumulation point of the solutions of the proposed neural network is not only a feasible point, but also an optimal solution of the considered optimization problem though the objective function is not convex. Numerical experiments on the MDF hot-pressing process including the model building and parameter optimization are tested based on the real data set, which indicate the good performance of the proposed neural network in applications.

2017 ◽  
Vol 7 (1) ◽  
pp. 137-150
Author(s):  
Агапов ◽  
Aleksandr Agapov

For the first time the mathematical model of task optimization for this scheme of cutting logs, including the objective function and six equations of connection. The article discusses Pythagorean area of the logs. Therefore, the target function is represented as the sum of the cross-sectional areas of edging boards. Equation of the relationship represents the relationship of the diameter of the logs in the vertex end with the size of the resulting edging boards. This relationship is described through the use of the Pythagorean Theorem. Such a representation of the mathematical model of optimization task is considered a classic one. However, the solution of this mathematical model by the classic method is proved to be problematic. For the solution of the mathematical model we used the method of Lagrange multipliers. Solution algorithm to determine the optimal dimensions of the beams and side edging boards taking into account the width of cut is suggested. Using a numerical method, optimal dimensions of the beams and planks are determined, in which the objective function takes the maximum value. It turned out that with the increase of the width of the cut, thickness of the beam increases and the dimensions of the side edging boards reduce. Dimensions of the extreme side planks to increase the width of cut is reduced to a greater extent than the side boards, which are located closer to the center of the log. The algorithm for solving the optimization problem is recommended to use for calculation and preparation of sawing schedule in the design and operation of sawmill lines for timber production. When using the proposed algorithm for solving the optimization problem the output of lumber can be increased to 3-5 %.


2011 ◽  
Vol 4 (2) ◽  
pp. 61-69 ◽  
Author(s):  
ZhenYa Zhang ◽  
HongMei Cheng ◽  
ShuGuang Zhang

Methods for the reconstruction of temperature fields in an intelligent building with temperature data of discrete observation positions is a current topic of research. To reconstruct temperature field with observation data, it is necessary to model the identification of temperature in each observation position. In this paper, models for temperature identification in an intelligent building are formalized as optimization problems based on observation temperature data sequence. To solve the optimization problem, a feed forward neural network is used to formalize the identification structure, and connection matrixes of the neural network are the identification parameters. With the object function for the given optimization problem as the fitness function, the training of the feed forward neural network is driven by a genetic algorithm. The experiment for the precision and stability of the proposed method is designed with real temperature data from an intelligent building.


2012 ◽  
Vol 433-440 ◽  
pp. 2808-2816
Author(s):  
Jian Jin Zheng ◽  
You Shen Xia

This paper presents a new interactive neural network for solving constrained multi-objective optimization problems. The constrained multi-objective optimization problem is reformulated into two constrained single objective optimization problems and two neural networks are designed to obtain the optimal weight and the optimal solution of the two optimization problems respectively. The proposed algorithm has a low computational complexity and is easy to be implemented. Moreover, the proposed algorithm is well applied to the design of digital filters. Computed results illustrate the good performance of the proposed algorithm.


2009 ◽  
Vol 18 (08) ◽  
pp. 1353-1367 ◽  
Author(s):  
DONG-CHUL PARK

A Centroid Neural Network with Weighted Features (CNN-WF) is proposed and presented in this paper. The proposed CNN-WF is based on a Centroid Neural Network (CNN), an effective clustering tool that has been successfully applied to various problems. In order to evaluate the importance of each feature in a set of data, a feature weighting concept is introduced to the Centroid Neural Network in the proposed algorithm. The weight update equations for CNN-WF are derived by applying the Lagrange multiplier procedure to the objective function constructed for CNN-WF in this paper. The use of weighted features makes it possible to assess the importance of each feature and to reject features that can be considered as noise in data. Experiments on a synthetic data set and a typical image compression problem show that the proposed CNN-WF can assess the importance of each feature and the proposed CNN-WF outperforms conventional algorithms including the Self-Organizing Map (SOM) and CNN in terms of clustering accuracy.


SPE Journal ◽  
2021 ◽  
pp. 1-28
Author(s):  
Faruk Alpak ◽  
Vivek Jain ◽  
Yixuan Wang ◽  
Guohua Gao

Summary We describe the development and validation of a novel algorithm for field-development optimization problems and document field-testing results. Our algorithm is founded on recent developments in bound-constrained multiobjective optimization of nonsmooth functions for problems in which the structure of the objective functions either cannot be exploited or are nonexistent. Such situations typically arise when the functions are computed as the result of numerical modeling, such as reservoir-flow simulation within the context of field-development planning and reservoir management. We propose an efficient implementation of a novel parallel algorithm, namely BiMADS++, for the biobjective optimization problem. Biobjective optimization is a special case of multiobjective optimization with the property that Pareto points may be ordered, which is extensively exploited by the BiMADS++ algorithm. The optimization algorithm generates an approximation of the Pareto front by solving a series of single-objective formulations of the biobjective optimization problem. These single-objective problems are solved using a new and more efficient implementation of the mesh adaptive direct search (MADS) algorithm, developed for nonsmooth optimization problems that arise within reservoir-simulation-based optimization workflows. The MADS algorithm is extensively benchmarked against alternative single-objective optimization techniques before the BiMADS++ implementation. Both the MADS optimization engine and the master BiMADS++ algorithm are implemented from the ground up by resorting to a distributed parallel computing paradigm using message passing interface (MPI) for efficiency in industrial-scaleproblems. BiMADS++ is validated and field tested on well-location optimization (WLO) problems. We first validate and benchmark the accuracy and computational performance of the MADS implementation against a number of alternative parallel optimizers [e.g., particle-swarm optimization (PSO), genetic algorithm (GA), and simultaneous perturbation and multivariate interpolation (SPMI)] within the context of single-objective optimization. We also validate the BiMADS++ implementation using a challenging analytical problem that gives rise to a discontinuous Pareto front. We then present BiMADS++ WLO applications on two simple, intuitive, and yet realistic problems, and a model for a real problem with known Pareto front. Finally, we discuss the results of the field-testing work on three real-field deepwater models. The BiMADS++ implementation enables the user to identify various compromise solutions of the WLO problem with a single optimization run without resorting to ad hoc adjustments of penalty weights in the objective function. Elimination of this “trial-and-error” procedure and distributed parallel implementation renders BiMADS++ easy to use and significantly more efficient in terms of computational speed needed to determine alternative compromise solutions of a given WLO problem at hand. In a field-testing example, BiMADS++ delivered a workflow speedup of greater than fourfold with a single biobjective optimization run over the weighted-sumsobjective-function approach, which requires multiple single-objective-function optimization runs.


2011 ◽  
Vol 19 (4) ◽  
pp. 597-637 ◽  
Author(s):  
Francisco Chicano ◽  
L. Darrell Whitley ◽  
Enrique Alba

A small number of combinatorial optimization problems have search spaces that correspond to elementary landscapes, where the objective function f is an eigenfunction of the Laplacian that describes the neighborhood structure of the search space. Many problems are not elementary; however, the objective function of a combinatorial optimization problem can always be expressed as a superposition of multiple elementary landscapes if the underlying neighborhood used is symmetric. This paper presents theoretical results that provide the foundation for algebraic methods that can be used to decompose the objective function of an arbitrary combinatorial optimization problem into a sum of subfunctions, where each subfunction is an elementary landscape. Many steps of this process can be automated, and indeed a software tool could be developed that assists the researcher in finding a landscape decomposition. This methodology is then used to show that the subset sum problem is a superposition of two elementary landscapes, and to show that the quadratic assignment problem is a superposition of three elementary landscapes.


2014 ◽  
Vol 519-520 ◽  
pp. 811-815
Author(s):  
Xiao Hong Qiu ◽  
Yong Bo Tan ◽  
Bo Li

The fractals of the optimization problems are first discussed. The multi-fractal parameters of the optimal objective function are computed by the Detrended Fluctuation Analysis (DFA) method. The multi-fractal general Hurst Index is related to the difficulty to solve the optimization problem. These features are verified by analyzing the first six test functions proposed on 2005 IEEE Congress on Evolutionary Computation. The results show that the different objective functions have obvious different multifractal and the general Hurst Index can be used to evaluate the difficulty to solve the optimization problem.


2020 ◽  
Vol 10 (1) ◽  
pp. 97-111
Author(s):  
Taleh Agasiev

AbstractAdvanced optimization algorithms with a variety of configurable parameters become increasingly difficult to apply effectively to solving optimization problems. Appropriate algorithm configuration becomes highly relevant, still remaining a computationally expensive operation. Development of machine learning methods allows to model and predict the efficiency of different solving strategies and algorithm configurations depending on properties of optimization problem to be solved. The paper suggests the Dependency Decomposition approach to reduce computational complexity of modeling the efficiency of optimization algorithm, also considering the amount of computational resources available for optimization problem solving. The approach requires development of explicit Exploratory Landscape Analysis methods to assess a variety of significant characteristic features of optimization problems. The results of feature assessment depend on the number of sample points analyzed and their location in the design space, on top of that some of methods require additional evaluations of objective function. The paper proposes new landscape analysis methods based on given points without the need of any additional objective function evaluations. An algorithm of building a so-called Full Variability Map is suggested based on informativeness criteria formulated for groups of sample points. The paper suggests Generalized Information Content method for analysis of Full Variability Map which allows to get accurate and stable estimations of objective function features. The Sectorization method of Variability Map analysis is proposed to assess characteristic features reflecting such properties of objective function that are critical for optimization algorithm efficiency. The resulting features are invariant to the scale of objective function gradients which positively affects the generalizing ability of problems classification algorithm. The procedure of the comparative study of effectiveness of landscape analysis algorithms is introduced. The results of computational experiments indicate reliability of applying the suggested landscape analysis methods to optimization problem characterization and classification.


2020 ◽  
Vol 10 (2) ◽  
pp. 179-187
Author(s):  
Olga Rubleva

Glue tenon joints are widely used in wood products. The face pressing method of the tenon joint elements is an economical alternative to traditional milling. The industrial implementation of the new method requires a reasonable choice of process operating parameters that ensure high quality processing with minimal resource costs. This multicriteria problem belongs to the field of operations research and is solved by mathematical modeling methods. The goal of the work is to determine the rational values of the parameters of the end face pressing process of rectangular eyes in blanks from wood of typical species: coniferous (pine), broad-leaved diffuse-porous (birch), leaf ring-porous (oak). The development of the objective function for the optimization procedure was carried out on the basis of the principle of fair compromise with the reduction of particular criteria to dimensionless form. To construct the objective function, we used regression models that describe the output parameters of the process: the pressing force, the hardness of eye bottoms, and the depth of the deformed zone. The search for solutions to optimization problems was performed using the generalized reduced gradient method in the Microsoft Excel software package. The rational values of the input parameters (moisture content, depth and width of the eyes) and the expected values of the output parameters for each of the studied species have been determined. Recommended moisture values for blanks from pine wood are 8%, birch - 9.5%, oak - 7%; the depth of the pressed eyes is 11, 8 and 9 mm, respectively, the width of the eyes is 4 mm. The objective function has the potential in the direction of reducing the width of the eyes, which can be used to improve the strength characteristics of adhesive joints on multiple extruded spikes.


2019 ◽  
pp. 2022-2029
Author(s):  
Saba Nasser Majeed

In this paper, we propose new types of non-convex functions called strongly --vex functions and semi strongly --vex functions. We study some properties of these proposed functions. As an application of these functions in optimization problems, we discuss some optimality properties of the generalized nonlinear optimization problem for which we use, as an objective function, strongly --vex function and semi strongly --vex function.


Sign in / Sign up

Export Citation Format

Share Document