• Structural Engineering and Mechanics
• /
• v.50 no.3
• /
• pp.257-273
• /
• 2014

This paper introduces a novel optimization technique based on gravitational search algorithm (GSA) for numerical optimization and multi-objective optimization of foundation. In the proposed method, a chaotic time varying system is applied into the position updating equation to increase the global exploration ability and accurate local exploitation of the original algorithm. The new algorithm called global-local GSA (GLGSA) is applied for optimization of some well-known mathematical benchmark functions as well as two design examples of spread foundation. In the foundation optimization, two objective functions include total cost and $CO_2$ emissions of the foundation subjected to geotechnical and structural requirements are considered. From environmental point of view, minimization of embedded $CO_2$ emissions that quantifies the total amount of carbon dioxide emissions resulting from the use of materials seems necessary to include in the design criteria. The experimental results demonstrate that, the proposed GLGSA remarkably improves the accuracy, stability and efficiency of the original algorithm.

• Smart Structures and Systems
• /
• v.26 no.4
• /
• pp.451-468
• /
• 2020

Although model updating has been widely applied using a specific optimization algorithm with a single objective function using frequencies, mode shapes or frequency response functions, there are few studies that investigate hybrid optimization algorithms for real structures. Many of them did not take into account the sensitivity of the updating parameters to the model outputs. Therefore, in this paper, optimization algorithms and sensitivity analysis are applied for model updating of a real cable-stayed bridge, i.e., the Kien bridge in Vietnam, based on experimental data. First, a global sensitivity analysis using Morris method is employed to find out the most sensitive parameters among twenty surveyed parameters based on the outputs of a Finite Element (FE) model. Then, an objective function related to the differences between frequencies, and mode shapes by means of MAC, COMAC and eCOMAC indices, is introduced. Three metaheuristic algorithms, namely Gravitational Search Algorithm (GSA), Particle Swarm Optimization algorithm (PSO) and hybrid PSOGSA algorithm, are applied to minimize the difference between simulation and experimental results. A laboratory pipe and Kien bridge are used to validate the proposed approach. Efficiency and reliability of the proposed algorithms are investigated by comparing their convergence rate, computational time, errors in frequencies and mode shapes with experimental data. From the results, PSO and PSOGSA show good performance and are suitable for complex and time-consuming analysis such as model updating of a real cable-stayed bridge. Meanwhile, GSA shows a slow convergence for the same number of population and iterations as PSO and PSOGSA.

• Structural Engineering and Mechanics
• /
• v.60 no.6
• /
• pp.1093-1117
• /
• 2016

Global sensitivity analysis (GSA) has been widely used to investigate the sensitivity of the model output with respect to its input parameters. In this paper a new single-solution search optimization algorithm is developed based on the GSA, and applied to the size optimization of truss structures. In this method the search space of the optimization is determined using the sensitivity indicator of variables. Unlike the common meta-heuristic algorithms, where all the variables are simultaneously changed in the optimization process, in this approach the sensitive variables of solution are iteratively changed more rapidly than the less sensitive ones in the search space. Comparisons of the present results with those of some previous population-based meta-heuristic algorithms demonstrate its capability, especially for decreasing the number of fitness functions evaluations, in solving the presented benchmark problems.

• Structural Engineering and Mechanics
• /
• v.68 no.5
• /
• pp.549-561
• /
• 2018

Sobol method is applied as a powerful variance decomposition technique in the field of global sensitivity analysis (GSA). The paper is devoted to increase convergence speed of the extracted Sobol indices using a new proposed sampling technique called genetic based Latine hypercube sampling (GBLHS). This technique is indeed an improved version of restricted Latine hypercube sampling (LHS) and the optimization algorithm is inspired from genetic algorithm in a new approach. The new approach is based on the optimization of minimax value of LHS arrays using manipulation of array indices as chromosomes in genetic algorithm. The improved Sobol method is implemented to perform factor prioritization and fixing of an uncertain comprehensive high speed rotor-bearing system. The finite element method is employed for rotor-bearing modeling by considering Eshleman-Eubanks assumption and interaction of axial force on the rotor whirling behavior. The performance of the GBLHS technique are compared with the Monte Carlo Simulation (MCS), LHS and Optimized LHS (Minimax. criteria). Comparison of the GBLHS with other techniques demonstrates its capability for increasing convergence speed of the sensitivity indices and improving computational time of the GSA.

• Journal of applied mathematics & informatics
• /
• v.20 no.1_2
• /
• pp.327-343
• /
• 2006

A general methodology is suggested to solve shelf-space allocation problem of retailers. A multi-item inventory model of breakable items is developed, where items are either complementary or substitute. Demands of the items depend on the amount of stock on the showroom and unit price of the respective items. Also demand of one item decreases (increases) due to the presence of others in case of substitute (complementary) product. For such a model, a Contractive Mapping Genetic Algorithm (CMGA) has been developed and implemented to find the values of different decision variables. These are evaluated to have maximum possible profit out of the proposed system. The system has been illustrated numerically and results for some particular cases are derived. The results are compared with some other heuristic approaches- Simulated Annealing (SA), simple Genetic Algorithm (GA) and Greedy Search Approach (GSA) developed for the present model.

• Structural Engineering and Mechanics
• /
• v.45 no.1
• /
• pp.111-127
• /
• 2013

In this paper, a new version of gravitational search algorithm based on opposition-based learning (OBGSA) is introduced and applied for optimum design of reinforced concrete retaining walls. The new algorithm employs the opposition-based learning concept to generate initial population and updating agents' position during the optimization process. This algorithm is applied to minimize three objective functions include weight, cost and $CO_2$ emissions of retaining structure subjected to geotechnical and structural requirements. The optimization problem involves five geometric variables and three variables for reinforcement setups. The performance comparison of the new OBGSA and classical GSA algorithms on a suite of five well-known benchmark functions illustrate a faster convergence speed and better search ability of OBGSA for numerical optimization. In addition, the reliability and efficiency of the proposed algorithm for optimization of retaining structures are investigated by considering two design examples of retaining walls. The numerical experiments demonstrate that the new algorithm has high viability, accuracy and stability and significantly outperforms the original algorithm and some other methods in the literature.

• The Pure and Applied Mathematics
• /
• v.31 no.1
• /
• pp.57-81
• /
• 2024

We introduce a new degree reduction method for homogeneous symmetric polynomials on binary variables that generalizes the conventional degree reduction methods on monomials introduced by Freedman and Ishikawa. We also design an degree reduction algorithm for general polynomials on binary variables, simulated on the graph coloring problem for random graphs, and compared the results with the conventional methods. The simulated results show that our new method produces reduced quadratic polynomials that contains less variables than the reduced quadratic polynomials produced by the conventional methods.

• Journal of IKEEE
• /
• v.25 no.4
• /
• pp.650-663
• /
• 2021

Subsurface topology estimation is an important factor in the geophysical survey. Electrical impedance tomography is one of the popular methods used for subsurface imaging. The EIT inverse problem is highly nonlinear and ill-posed; therefore, reconstructed conductivity distribution suffers from low spatial resolution. The subsurface region can be approximated as piece-wise separate regions with constant conductivity in each region; therefore, the conductivity estimation problem is transformed to estimate the shape and location of the layer boundary interface. Each layer interface boundary is treated as an open boundary that is described using front points. The subsurface domain contains multi-layers with very complex configurations, and, in such situations, conventional methods such as the modified Newton Raphson method fail to provide the desired solution. Therefore, in this work, we have implemented a 7-layer artificial neural network (ANN) as an inverse problem algorithm to estimate the front points that describe the multi-layer interface boundaries. An ANN model consisting of input, output, and five fully connected hidden layers are trained for interlayer boundary reconstruction using training data that consists of pairs of voltage measurements of the subsurface domain with three-layer configuration and the corresponding front points of interface boundaries. The results from the proposed ANN model are compared with the gravitational search algorithm (GSA) for interlayer boundary estimation, and the results show that ANN is successful in estimating the layer boundaries with good accuracy.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.40 no.4
• /
• pp.275-292
• /
• 2022

In order to detect climate changes using satellite imagery, the GCOS (Global Climate Observing System) defines requirements such as spatio-temporal resolution, stability by the time change, and uncertainty. Due to limitation of GK-2A sensor performance, the level-2 products can not satisfy the requirement, especially for spatial resolution. In this paper, we found the optimal pan-sharpening algorithm for GK-2A products. The six pan-sharpening methods included in CS (Component Substitution), MRA (Multi-Resolution Analysis), VO (Variational Optimization), and DL (Deep Learning) were used. In the case of DL, the synthesis property based method was used to generate training dataset. The process of synthesis property is that pan-sharpening model is applied with Pan (Panchromatic) and MS (Multispectral) images with reduced spatial resolution, and fused image is compared with the original MS image. In the synthesis property based method, fused image with desire level for user can be produced only when the geometric characteristics between the PAN with reduced spatial resolution and MS image are similar. However, since the dissimilarity exists, RD (Random Down-sampling) was additionally used as a way to minimize it. Among the pan-sharpening methods, PSGAN was applied with RD (PSGAN_RD). The fused images are qualitatively and quantitatively validated with consistency property and the synthesis property. As validation result, the GSA algorithm performs well in the evaluation index representing spatial characteristics. In the case of spectral characteristics, the PSGAN_RD has the best accuracy with the original MS image. Therefore, in consideration of spatial and spectral characteristics of fused image, we found that PSGAN_RD is suitable for GK-2A products.