• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.20 no.3
• /
• pp.232-238
• /
• 2011

In the present study, Taguchi method is used to determine the rough region first, followed by RSM technique to determine the exact optimum value during milling on a machining center. A region reducing algorithm is applied to narrow down the region of the Taguchi method for RSM. The result from the Taguchi method is fed to train the artificial neural network (ANN), whose optimum value is used to drive the region reducing algorithm. The proposed algorithm is tested under different cutting condition and results show that the introduced algorithm works well during milling process. It is also shown that theoretically obtained optimal cutting condition is very close to experimentally obtained result.

• Journal of Fisheries and Marine Sciences Education
• /
• v.29 no.2
• /
• pp.544-551
• /
• 2017

Metaheuristic algorithms are efficient techniques for a class of mathematical optimization problems without having to deeply adapt to the inherent nature of each problem. They are very useful for structural design optimization in which the cost of gradient computation can be very expensive. Among them, the characteristics of simulated annealing and genetic algorithms are briefly discussed. In Metropolis genetic algorithm, favorable features of Metropolis criterion in simulated annealing are incorporated in the reproduction operations of simple genetic algorithm. Numerical examples of structural design optimization are presented. The example structures are truss, breakwater and steel box girder bridge. From the theoretical evaluation and numerical experience, performance and applicability of metaheuristic algorithms for structural design optimization are discussed.

• Steel and Composite Structures
• /
• v.17 no.5
• /
• pp.705-719
• /
• 2014

Composite steel-concrete box girders are frequently used in bridge construction for their economic and structural advantages. An integrated metaheuristic based optimization procedure is proposed for discrete size optimization of straight multi-span steel box girders with the objective of minimizing the self-weight of girder. The metaheuristic algorithm of choice is the Cuckoo Search (CS) algorithm. The optimum design of a box girder is characterized by geometry, serviceability and ultimate limit states specified by the American Association of State Highway and Transportation Officials (AASHTO). Size optimization of a practical design example investigates the efficiency of this optimization approach and leads to around 15% of saving in material.

• Journal of information and communication convergence engineering
• /
• v.11 no.1
• /
• pp.30-44
• /
• 2013

Traffic congestion has become a serious problem with the recent exponential increase in the number of vehicles. In urban areas, almost all traffic congestion occurs at intersections. One of the ways to solve this problem is road expansion, but it is difficult to realize in urban areas because of the high cost and long construction period. In such cases, traffic signal control is a reasonable method for reducing traffic jams. In an actual situation, the traffic flow changes randomly and its randomness makes the control of traffic signals difficult. A prediction of traffic jams is, therefore, necessary and effective for reducing traffic jams. In addition, an autonomous distributed (stand-alone) point control of each traffic light individually is better than the wide and/or line control of traffic lights from the perspective of real-time control. This paper describes a stochastic optimum control of crossroads and multi-way traffic signals. First, a stochastic model of traffic flows and traffic jams is constructed by using a Bayesian network. Secondly, the probabilistic distributions of the traffic flows are estimated by using a cellular automaton, and then the probabilistic distributions of traffic jams are predicted. Thirdly, optimum traffic signals of crossroads and multi-way intersection are searched by using a modified particle swarm optimization algorithm to realize real-time traffic control. Finally, simulations are carried out to confirm the effectiveness of the real-time stochastic optimum control of traffic signals.

• Journal of Korean Society of Steel Construction
• /
• v.17 no.4 s.77
• /
• pp.491-498
• /
• 2005

This study involves the development of a computer program to analyze the local buckling stresses for the flange and the web of I-beams under compression at elevated temperatures, and the optimization algorithm to analyze the optimum width-thickness ratios which does not occur their local buckling prior to yield failure. The high-temperature stress-strain relationships of steel used in this study were based on EC3 (Eurocode3) Part1.2 (2000b). In this study, the local buckling stresses and the optimum width-thichness ratios were analyzed considering the influences of the yield stress, local buckling coefficients and width-thickness ratios of the flange and the web. Design examples show the applicability of the computer program developed in this study.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.38 no.5
• /
• pp.86-92
• /
• 2001

The Genetic algorithm is well known as an efficient algorithm which can solve a difficult optimization problems. Recently, there has been increasing interest in applying genetic algorithm to problems related to network design. In this paper, we propose a two step genetic algorithm for designing an optimum virtual path network(VPN) for a given physical network and traffic demand. The first step is to span route between every node pair in the network. The second step assigns VPs to minimize the total number of VPs, the number of VPs carried by a link, and the VPs hopcount. The propose algorithm is evaluated using computer simulation. The result shows that the VPN generated by the proposed algorithm is good in minimizing the number of VPs, the load on a link, and the VPs hopcount.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.4
• /
• pp.147-152
• /
• 2012

This paper estimates the direction of arrival of desired a target using propagation wave in spatial. Direction of arrival estimation is to find desired target position among received signal to receiver array antennas. In this paper, we estimated direction of arrival for target, by using cost function and high resolution MUSIC algorithm, in order to direction of arrival estimation, and calculated optimum weight vector. Through simulation, in regard to the estimation of the arrival direction of a target, the performances of the existing ESPRIT algorithm and the proposed algorithm were comparatively analyzed. In the estimation time of the arrival direction of a target object, the proposed algorithm showed an improvement of approximately as compared to the existing ESPRIT algorithm.

• Journal of information and communication convergence engineering
• /
• v.13 no.2
• /
• pp.123-131
• /
• 2015

Training neural networks is a complex task with great importance in the field of supervised learning. In the training process, a set of input-output patterns is repeated to an artificial neural network (ANN). From those patterns weights of all the interconnections between neurons are adjusted until the specified input yields the desired output. In this paper, a new hybrid algorithm is proposed for global optimization of connection weights in an ANN. Dynamic swarms are shown to converge rapidly during the initial stages of a global search, but around the global optimum, the search process becomes very slow. In contrast, the gradient descent method can achieve faster convergence speed around the global optimum, and at the same time, the convergence accuracy can be relatively high. Therefore, the proposed hybrid algorithm combines the dynamic particle swarm optimization (DPSO) algorithm with the backpropagation (BP) algorithm, also referred to as the DPSO-BP algorithm, to train the weights of an ANN. In this paper, we intend to show the superiority (time performance and quality of solution) of the proposed hybrid algorithm (DPSO-BP) over other more standard algorithms in neural network training. The algorithms are compared using two different datasets, and the results are simulated.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.4
• /
• pp.1128-1145
• /
• 2022

Owing to the rapid development of information science, data analysis based on machine learning has become an interdisciplinary and strategic area. Marine predators algorithm (MPA) is a novel metaheuristic algorithm inspired by the foraging strategies of marine organisms. Considering the randomness of these strategies, an improved algorithm called co-evolutionary cultural mechanism-based marine predators algorithm (CECMPA) is proposed. Through this mechanism, search agents in different spaces can share knowledge and experience to improve the performance of the native algorithm. More specifically, CECMPA has a higher probability of avoiding local optimum and can search the global optimum quickly. In this paper, it is the first to use CECMPA to perform feature subset selection and optimize hyperparameters in support vector machine (SVM) simultaneously. For performance evaluation the proposed method, it is tested on twelve datasets from the university of California Irvine (UCI) repository. Moreover, the coronavirus disease 2019 (COVID-19) can be a real-world application and is spreading in many countries. CECMPA is also applied to a COVID-19 dataset. The experimental results and statistical analysis demonstrate that CECMPA is superior to other compared methods in the literature in terms of several evaluation metrics. The proposed method has strong competitive abilities and promising prospects.

• Journal of the military operations research society of Korea
• /
• v.8 no.2
• /
• pp.31-35
• /
• 1982

Recently, Park [1] proposed an algorithm for the optimum spare-part stock level in an (S-1, S) inventory system for small fleet. This paper reports validative GPSS simulation results and numerical experiences with the algorithm.