• Journal of the Korean Operations Research and Management Science Society
• /
• v.29 no.4
• /
• pp.117-134
• /
• 2004

This study suggests a data driven optimization approach, which simulates the models of human learning processes from cognitive sciences. It shows how the human learning processes can be simulated and applied to solving combinatorial optimization problems. The main advantage of using this method is in applying it into problems, which are very difficult to simulate. 'Undecidable' problems are considered as best possible application areas for this suggested approach. The concept of an 'undecidable' problem is redefined. The learning models in human learning and decision-making related to combinatorial optimization in cognitive and neural sciences are designed, simulated, and implemented to solve an optimization problem. We call this approach 'SLO : simulated learning for optimization.' Two different versions of SLO have been designed: SLO with position & link matrix, and SLO with decomposition algorithm. The methods are tested for traveling salespersons problems to show how these approaches derive new solution empirically. The tests show that simulated learning for optimization produces new solutions with better performance empirically. Its performance, compared to other hill-climbing type methods, is relatively good.

• Geomechanics and Engineering
• /
• v.36 no.3
• /
• pp.259-276
• /
• 2024

The undrained shear strength is widely acknowledged as a fundamental mechanical property of soil and is considered a critical engineering parameter. In recent years, researchers have employed various methodologies to evaluate the shear strength of soil under undrained conditions. These methods encompass both numerical analyses and empirical techniques, such as the cone penetration test (CPT), to gain insights into the properties and behavior of soil. However, several of these methods rely on correlation assumptions, which can lead to inconsistent accuracy and precision. The study involved the development of innovative methods using extreme gradient boosting (XGB) to predict the pile set-up component "A" based on two distinct data sets. The first data set includes average modified cone point bearing capacity (q_t), average wall friction (f_s), and effective vertical stress (σ_vo), while the second data set comprises plasticity index (PI), soil undrained shear cohesion (S_u), and the over consolidation ratio (OCR). These data sets were utilized to develop XGBoost-based methods for predicting the pile set-up component "A". To optimize the internal hyperparameters of the XGBoost model, four optimization algorithms were employed: Particle Swarm Optimization (PSO), Social Spider Optimization (SSO), Arithmetic Optimization Algorithm (AOA), and Sine Cosine Optimization Algorithm (SCOA). The results from the first data set indicate that the XGBoost model optimized using the Arithmetic Optimization Algorithm (XGB - AOA) achieved the highest accuracy, with R2 values of 0.9962 for the training part and 0.9807 for the testing part. The performance of the developed models was further evaluated using the RMSE, MAE, and VAF indices. The results revealed that the XGBoost model optimized using XGBoost - AOA outperformed other models in terms of accuracy, with RMSE, MAE, and VAF values of 0.0078, 0.0015, and 99.6189 for the training part and 0.0141, 0.0112, and 98.0394 for the testing part, respectively. These findings suggest that XGBoost - AOA is the most accurate model for predicting the pile set-up component.

• Journal of Mechanical Science and Technology
• /
• v.18 no.10
• /
• pp.1829-1836
• /
• 2004

This study presents the performance optimization of hypervelocity launcher system by using the experimentall data. During the optimization, the RSM (Response Surface Method) is adopted to find the operating parameters that could maximize the projectile speed. To construct a reliable response surface model, 3 full factorial method is used with the selected design variables, such as piston mass and 2 driver fill pressure. Nine test data could successfully construct the reasonable response surface, which used to yield the optimal operational conditions of the system using the genetic algorithm. The optimization results are confirmed by the experimental test with a good accuracy. Thus, the optimization can improve the performance of the facility.

• The KIPS Transactions:PartD
• /
• v.17D no.3
• /
• pp.175-184
• /
• 2010

Experiments and research on genes have become very convenient by using DNA chips, which provide large amounts of data from various experiments. The data provided by the DNA chips could be represented as a two dimensional matrix, in which one axis represents genes and the other represents samples. By performing an efficient and good quality clustering on such data, the classification work which follows could be more efficient and accurate. In this paper, we use a bio-inspired algorithm called the Particle Swarm Optimization algorithm to propose an efficient clustering mechanism for large amounts of DNA chip data, and show through experimental results that the clustering technique using the PSO algorithm provides a faster yet good quality result compared with other existing clustering solutions.

• Journal of Korean Association for Spatial Structures
• /
• v.21 no.4
• /
• pp.39-48
• /
• 2021

In this paper, a GAN-based data augmentation method is proposed for topology optimization. In machine learning techniques, a total amount of dataset determines the accuracy and robustness of the trained neural network architectures, especially, supervised learning networks. Because the insufficient data tends to lead to overfitting or underfitting of the architectures, a data augmentation method is need to increase the amount of data for reducing overfitting when training a machine learning model. In this study, the Ganerative Adversarial Network (GAN) is used to augment the topology optimization dataset. The produced dataset has been compared with the original dataset.

• Structural Engineering and Mechanics
• /
• v.36 no.1
• /
• pp.79-94
• /
• 2010

This study shows how uncertainties of data like material properties quantitatively have an influence on structural topology optimization results for dynamic problems, here such as both optimal topology and shape. In general, the data uncertainties may result in uncertainties of structural behaviors like deflection or stress in structural analyses. Therefore optimization solutions naturally depend on the uncertainties in structural behaviors, since structural behaviors estimated by the structural analysis method like FEM need to execute optimization procedures. In order to quantitatively estimate the effect of data uncertainties on topology optimization solutions of dynamic problems, a so-called interval analysis is utilized in this study, and it is a well-known non-stochastic approach for uncertainty estimate. Topology optimization is realized by using a typical SIMP method, and for dynamic problems the optimization seeks to maximize the first-order eigenfrequency subject to a given material limit like a volume. Numerical applications topologically optimizing dynamic wall structures with varied supports are studied to verify the non-stochastic interval analysis is also suitable to estimate topology optimization results with dynamic problems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.5
• /
• pp.1886-1908
• /
• 2020

With the technical advances, the amount of big data is increasing day-by-day such that the traditional software tools face a burden in handling them. Additionally, the presence of the imbalance data in big data is a massive concern to the research industry. In order to assure the effective management of big data and to deal with the imbalanced data, this paper proposes a new indexing algorithm for retrieving big data in the MapReduce framework. In mappers, the data clustering is done based on the Sparse Fuzzy-c-means (Sparse FCM) algorithm. The reducer combines the clusters generated by the mapper and again performs data clustering with the Sparse FCM algorithm. The two-level query matching is performed for determining the requested data. The first level query matching is performed for determining the cluster, and the second level query matching is done for accessing the requested data. The ranking of data is performed using the proposed Monarch chaotic whale optimization algorithm (M-CWOA), which is designed by combining Monarch butterfly optimization (MBO) [22] and chaotic whale optimization algorithm (CWOA) [21]. Here, the Parametric Enabled-Similarity Measure (PESM) is adapted for matching the similarities between two datasets. The proposed M-CWOA outperformed other methods with maximal precision of 0.9237, recall of 0.9371, F1-score of 0.9223, respectively.

• Korean Journal of Computational Design and Engineering
• /
• v.21 no.1
• /
• pp.51-60
• /
• 2016

The arrangement design of a submarine has been performed based on data of parent ships and experts' experiences. To support such a task, it is necessary to accumulate and use systematically the data, and to optimize the task. The expert system for the first issue and the optimization method for the latter issue can be used. At this time, a suitable data structure to share the data on the arrangement design of the submarine should be used. In this study, the data structure named an arrangement template model (ATM) is proposed. To check the applicability of the ATM, a prototype program which consists of the expert system and the optimization method is developed. Finally, the developed program is applied to a small submarine of US Navy. As a result, it is confirmed that the ATM can be used to share the data between the expert system and the optimization method.

• Proceedings of the Korea Society for Energy Engineering kosee Conference
• /
• 1997.10a
• /
• pp.17-23
• /
• 1997

A methodology for on-line data reconciliation and optimization has been proposed to minimize the energy cost of a utility system. As industrial data tend to be corrupted by noise or gross error, fast and robust data reconciliation technique is essential for the on-line optimization of utility system. Thus, we propose the hierarchical decomposition approach that can be applicable to on-line data reconciliation and optimization. As this approach divides whole system into several subsystems and removes the nonlinearity of constraint systematically, it handles complexity of system easily and shows good performance in accuracy and computation speed. Through case studies, we prove that this methodology is a good candidate for on-line data reconciliation and optimization.

• Journal of Distribution Science
• /
• v.11 no.3
• /
• pp.5-11
• /
• 2013

Purpose - Going concern is one of fundamental concepts in accounting and auditing and sometimes the assessment of a company's going concern status that is a tough process. Various going concern prediction models' based on statistical and data mining methods help auditors and stakeholders suggested in the previous literature. Research design - This paper employs a data mining approach to prediction of going concern status of Iranian firms listed in Tehran Stock Exchange using Particle Swarm Optimization. To reach this goal, at the first step, we used the stepwise discriminant analysis it is selected the final variables from among of 42 variables and in the second stage; we applied a grid-search technique using 10-fold cross-validation to find out the optimal model. Results - The empirical tests show that the particle swarm optimization (PSO) model reached 99.92% and 99.28% accuracy rates for training and holdout data. Conclusions - The authors conclude that PSO model is applicable for prediction going concern of Iranian listed companies.