• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.4
• /
• pp.572-580
• /
• 2021

In order to reduce transmission delay and increase reliability in networks, mainly high-performance and high-power network equipment is used to guarantee network quality. In this paper, we propose an optimization algorithm to minimize the energy consumed when transmitting traffic in networks with a bundle link composed of multiple physical cables. The proposed optimization algorithm is a meta-heuristic method, which uses tabu search algorithm. In addition, it is designed to minimize transmission energy by minimizing the cables on the paths of the source and destination nodes for each traffic. In the proposed optimization algorithm, performance evaluation was performed in terms of the number of cables used in the transmission and the link utilization for all traffic on networks, and the performance evaluation result confirmed the superior performance than the previously proposed method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.9
• /
• pp.1193-1201
• /
• 2020

Cell planning, which determines the cell structure for location management of mobile terminals in mobile communications, has been dealt with as an important research task to determine network performance. Among the factors influencing the cell structure planning in mobile communication, the signal cost for location management plays the most important role. In this paper, we propose an optimization algorithm that minimizes the location management cost of all the cells used to plan the cell structure in the network with reporting cell structure in mobile communication. The proposed algorithm uses a Tabu search algorithm, which is a meta-heuristic algorithm, and the proposed algorithm proposes a new neighborhood generation method to obtain a result close to the optimal solution. In order to evaluate the performance of the proposed algorithm, the simulation was performed in terms of location management cost and algorithm execution time. The evaluation results show that the proposed algorithm outperforms the existing genetic algorithm and simulated annealing.

• Journal of the Korea Society for Simulation
• /
• v.19 no.1
• /
• pp.73-82
• /
• 2010

Productivity improvement is considered as one of hot potato topics in international shipyards by the increasing amount of orders. In order to improve productivity of lines, shipbuilders have been researching and developing new work method, process automation, advanced planning and scheduling and so on. An optimization approach was accomplished on short-term scheduling of subassembly lines in this research. The problem of subassembly line scheduling turned out to be a non-deterministic polynomial time problem with regard to SKID pattern’s sequence and worker assignment to each station. The problem was applied by simulated annealing algorithm, one of meta-heuristic methods. The algorithm was aimed to avoid local minimum value by changing results with probability function. The optimization result was compared with discrete-event simulation's to propose what pros and cons were. This paper will help planners work on scheduling and decision-making to complete their task by evaluation.

• Geomechanics and Engineering
• /
• v.30 no.6
• /
• pp.489-502
• /
• 2022

In this study, a Gaussian process regression (GPR) model as well as six GPR-based metaheuristic optimization models, including GPR-PSO, GPR-GWO, GPR-MVO, GPR-MFO, GPR-SCA, and GPR-SSO, were developed to predict fly-rock distance in the blasting operation of open pit mines. These models included GPR-SCA, GPR-SSO, GPR-MVO, and GPR. In the models that were obtained from the Soungun copper mine in Iran, a total of 300 datasets were used. These datasets included six input parameters and one output parameter (fly-rock). In order to conduct the assessment of the prediction outcomes, many statistical evaluation indices were used. In the end, it was determined that the performance prediction of the ML models to predict the fly-rock from high to low is GPR-PSO, GPR-GWO, GPR-MVO, GPR-MFO, GPR-SCA, GPR-SSO, and GPR with ranking scores of 66, 60, 54, 46, 43, 38, and 30 (for 5-fold method), respectively. These scores correspond in conclusion, the GPR-PSO model generated the most accurate findings, hence it was suggested that this model be used to forecast the fly-rock. In addition, the mutual information test, also known as MIT, was used in order to investigate the influence that each input parameter had on the fly-rock. In the end, it was determined that the stemming (T) parameter was the most effective of all the parameters on the fly-rock.

• Geomechanics and Engineering
• /
• v.31 no.2
• /
• pp.129-147
• /
• 2022

The properties of soil are naturally highly variable and thus, to ensure proper safety and reliability, we need to test a large number of samples across the length and depth. In pile foundations, conducting field tests are highly expensive and the traditional empirical relations too have been proven to be poor in performance. The study proposes a state-of-art Particle Swarm Optimization (PSO) hybridized Artificial Neural Network (ANN), Extreme Learning Machine (ELM) and Adaptive Neuro Fuzzy Inference System (ANFIS); and comparative analysis of metaheuristic models (ANN-PSO, ELM-PSO, ANFIS-PSO) for prediction of bearing capacity of pile foundation trained and tested on dataset of nearly 300 dynamic pile tests from the literature. A novel ensemble model of three hybrid models is constructed to combine and enhance the predictions of the individual models effectively. The authenticity of the dataset is confirmed using descriptive statistics, correlation matrix and sensitivity analysis. Ram weight and diameter of pile are found to be most influential input parameter. The comparative analysis reveals that ANFIS-PSO is the best performing model in testing phase (R² = 0.85, RMSE = 0.01) while ELM-PSO performs best in training phase (R² = 0.88, RMSE = 0.08); while the ensemble provided overall best performance based on the rank score. The performance of ANN-PSO is least satisfactory compared to the other two models. The findings were confirmed using Taylor diagram, error matrix and uncertainty analysis. Based on the results ELM-PSO and ANFIS-PSO is proposed to be used for the prediction of bearing capacity of piles and ensemble learning method of joining the outputs of individual models should be encouraged. The study possesses the potential to assist geotechnical engineers in the design phase of civil engineering projects.

• Computers and Concrete
• /
• v.32 no.6
• /
• pp.577-594
• /
• 2023

Engineered cementitious composites with calcined clay limestone cement (LC³-ECC) as a kind of green, low-carbon and high toughness concrete, has recently received significant investigation. However, the complicated relationship between potential influential factors and LC³-ECC compressive strength makes the prediction of LC³-ECC compressive strength difficult. Regarding this, the machine learning-based prediction models for the compressive strength of LC³-ECC concrete is firstly proposed and developed. Models combine three novel meta-heuristic algorithms (golden jackal optimization algorithm, butterfly optimization algorithm and whale optimization algorithm) with support vector regression (SVR) to improve the accuracy of prediction. A new dataset about LC³-ECC compressive strength was integrated based on 156 data from previous studies and used to develop the SVR-based models. Thirteen potential factors affecting the compressive strength of LC³-ECC were comprehensively considered in the model. The results show all hybrid SVR prediction models can reach the Coefficient of determination (R²) above 0.95 for the testing set and 0.97 for the training set. Radar and Taylor plots also show better overall prediction performance of the hybrid SVR models than several traditional machine learning techniques, which confirms the superiority of the three proposed methods. The successful development of this predictive model can provide scientific guidance for LC³-ECC materials and further apply to such low-carbon, sustainable cement-based materials.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.2
• /
• pp.8-18
• /
• 2020

An Exponential Bandwidth Harmony Search with Centralized Global Search (EBHS-CGS) was developed to enhance the performance of a Harmony Search (HS). EBHS-CGS added two methods to improve the performance of HS. The first method is an improvement of bandwidth (bw) that enhances the local search. This method replaces the existing bw with an exponential bw and reduces the bw value as the iteration proceeds. This form of bw allows for an accurate local search, which enables the algorithm to obtain more accurate values. The second method is to reduce the search range for an efficient global search. This method reduces the search space by considering the best decision variable in Harmony Memory (HM). This process is carried out separately from the global search of the HS by the new parameter, Centralized Global Search Rate (CGSR). The reduced search space enables an effective global search, which improves the performance of the algorithm. The proposed algorithm was applied to a representative optimization problem (math and engineering), and the results of the application were compared with the HS and better Improved Harmony Search (IHS).

• Journal of KIISE:Software and Applications
• /
• v.34 no.3
• /
• pp.196-211
• /
• 2007

In the Product Line Engineering (PLE), current studies about an analysis of the feature have uncertain and ad-hoc criteria of analysis based on developer’s intuition or domain expert’s heuristic approach and difficulty to extract explicit features from a product in a product line because the stakeholders lack comprehensive understanding of the features in feature modeling. Therefore, this paper proposes a model of the analyzing commonality and variability of the feature based on the Ontology. The proposed model in this paper suggests two approaches in order to solve the problems mentioned above: First, the model explicitly expresses the feature by making an individual feature attribute list based on the meta feature modeling to understand common feature. Second, the model projects an analysis model of commonality and variability using the semantic similarity between features based on the Ontology to the stakeholders. The main contribution of this paper is to improve the reusability of distinguished features on developing products of same line henceforth.

• KEPCO Journal on Electric Power and Energy
• /
• v.2 no.2
• /
• pp.311-316
• /
• 2016

Network intrusion detection system based on machine learning method such as artificial neural network is quite dependent on the selected features in terms of accuracy and efficiency. Nevertheless, choosing the optimal combination of features, which guarantees accuracy and efficienty, from generally used many features to detect network intrusion requires extensive computing resources. In this paper, we deal with a optimal feature selection problem to determine 6 denial service attacks and normal usage provided by NSL-KDD data. We propose a optimal feature selection algorithm. Proposed algorithm is based on the multi-start local search algorithm, one of representative meta-heuristic algorithm for solving optimization problem. In order to evaluate the performance of our proposed algorithm, comparison with a case of all 41 features used against NSL-KDD data is conducted. In addtion, comparisons between 3 well-known machine learning methods (multi-layer perceptron., Bayes classifier, and Support vector machine) are performed to find a machine learning method which shows the best performance combined with the proposed feature selection method.

• The KIPS Transactions:PartB
• /
• v.11B no.2
• /
• pp.221-226
• /
• 2004

Ant Colony System(ACS) Algorithm is new meta-heuristic for hard combinational optimization problem. It is a population-based approach that uses exploitation of positive feedback as well as greedy search. Recently, various methods and solutions are proposed to solve optimal solution of graph coloring problem that assign to color for adjacency node($v_i, v_j$) that they has not same color. In this paper introducing ANTCOL Algorithm that is method to solve solution by Ant Colony System algorithm that is not method that it is known well as solution of existent graph coloring problem. After introducing ACS algorithm and Assignment Type Problem, show the wav how to apply ACS to solve ATP And compare graph coloring result and execution time when use existent generating functions(ANT_Random, ANT_LF, ANT_SL, ANT_DSATUR, ANT_RLF method) with ANT_XRLF method that use XRLF that apply Randomize to RLF to solve ANTCOL. Also compare graph coloring result and execution time when use method to add re-search to ANT_XRLF(ANT_XRLF_R) with existent generating functions.