• Journal of Electrical Engineering and Technology
• /
• v.1 no.4
• /
• pp.466-471
• /
• 2006

This raper presents a new optimization method combining the genetic algorithm with the response surface method for the optimum design of a Brushless Direct Current motor. The method utilizes a regression function approximating an objective function and the window moving and zoom-in method so as to complement disadvantages of both the genetic algorithm and response surface method. The results verify that the proposed method is powerful and effective in reducing cogging torque by optimizing only a few decisive design factors compared with the conventional stochastic methods.

• Communications for Statistical Applications and Methods
• /
• v.29 no.6
• /
• pp.629-640
• /
• 2022

Variable selection is one of the most crucial tasks in supervised learning, such as regression and classification. The best subset selection is straightforward and optimal but not practically applicable unless the number of predictors is small. In this article, we propose directly solving the best subset selection via the genetic algorithm (GA), a popular stochastic optimization algorithm based on the principle of Darwinian evolution. To further improve the variable selection performance, we propose to run multiple GA to solve the best subset selection and then synthesize the results, which we call ensemble GA (EGA). The EGA significantly improves variable selection performance. In addition, the proposed method is essentially the best subset selection and hence applicable to a variety of models with different selection criteria. We compare the proposed EGA to existing variable selection methods under various models, including linear regression, Poisson regression, and Cox regression for survival data. Both simulation and real data analysis demonstrate the promising performance of the proposed method.

• Industrial Engineering and Management Systems
• /
• v.12 no.3
• /
• pp.172-180
• /
• 2013

We herein consider a stochastic multi-item inventory management problem in which a warehouse sells multiple items with stochastic demand and periodic replenishment from a supplier. Inventory management requires the timing and amounts of orders to be determined. For inventory replenishment, trucks of finite capacity are available. Most inventory management models consider either a single item or assume that multiple items are ordered independently, and whether there is sufficient space in trucks. The order cost is commonly calculated based on the number of carriers and the usage fees of carriers. In this situation, we can reduce future shipments by supplementing items to an order, even if the item is not scheduled to be ordered. On the other hand, we can reduce the average number of items in storage by reducing the order volume and at the risk of running out of stock. The primary variables of interest in the present research are the average number of items in storage, the stock-out volume, and the number of carriers used. We formulate this problem as a multi-objective optimization problem. In a numerical experiment based on actual shipment data, we consider the item shipping characteristics and simulate the warehouse replenishing items coordinately. The results of the simulation indicate that applying a conventional ordering policy individually will not provide effective inventory management.

• ETRI Journal
• /
• v.27 no.3
• /
• pp.294-303
• /
• 2005

In this paper, a supervised algorithm for the evaluation of geophysical sites using a multi-level cellular neural network (ML-CNN) is introduced, developed, and applied to real data. ML-CNN is a stochastic image processing technique based on template optimization using neighborhood relationships of the pixels. The separation/enhancement and border detection performance of the proposed method is evaluated by various interesting real applications. A genetic algorithm is used in the optimization of CNN templates. The first application is concerned with the separation of potential field data of the Dumluca chromite region, which is one of the rich reserves of Turkey; in this context, the classical approach to the gravity anomaly separation method is one of the main problems in geophysics. The other application is the border detection of archeological ruins of the Hittite Empire in Turkey. The Hittite civilization sites located at the Sivas-Altinyayla region of Turkey are among the most important archeological sites in history, one reason among others being that written documentation was first produced by this civilization.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.3
• /
• pp.1301-1312
• /
• 2020

Using decode-and-forward relaying in the cognitive radio networks, the spectrum efficiency can improve furthermore. The optimization algorithm of the spectrum sensing estimation time is presented for the cognitive relay networks in this paper. The longer sensing time will bring two aspects of the consequences. On the one hand, the channel parameters are estimated more accurate so as to reduce the interferences to the authorized users and to improve the throughput of the cognitive users. On the other hand, it shortens the transmission time so as to decease the system throughput. In this time, it exists an optimal sensing time to maximize the throughput. The channel state information of the sub-bands is considered as the exponentially distributed, so a stochastic programming method is proposed to optimize the sensing time for the cognitive relay networks. The computer simulation results using the Matlab software show that the algorithm is effective, which has a certain engineering application value.

• Computers and Concrete
• /
• v.32 no.2
• /
• pp.149-163
• /
• 2023

One of the main design parameters traditionally utilized in projects of geotechnical engineering is the uniaxial compressive strength. The present paper employed three artificial intelligence methods, i.e., the stochastic fractal search (SFS), the multi-verse optimization (MVO), and the vortex search algorithm (VSA), in order to determine the compressive strength of concrete (CSC). For the same reason, 1030 concrete specimens were subjected to compressive strength tests. According to the obtained laboratory results, the fly ash, cement, water, slag, coarse aggregates, fine aggregates, and SP were subjected to tests as the input parameters of the model in order to decide the optimum input configuration for the estimation of the compressive strength. The performance was evaluated by employing three criteria, i.e., the root mean square error (RMSE), mean absolute error (MAE), and the determination coefficient (R²). The evaluation of the error criteria and the determination coefficient obtained from the above three techniques indicates that the SFS-MLP technique outperformed the MVO-MLP and VSA-MLP methods. The developed artificial neural network models exhibit higher amounts of errors and lower correlation coefficients in comparison with other models. Nonetheless, the use of the stochastic fractal search algorithm has resulted in considerable enhancement in precision and accuracy of the evaluations conducted through the artificial neural network and has enhanced its performance. According to the results, the utilized SFS-MLP technique showed a better performance in the estimation of the compressive strength of concrete (R²=0.99932 and 0.99942, and RMSE=0.32611 and 0.24922). The novelty of our study is the use of a large dataset composed of 1030 entries and optimization of the learning scheme of the neural prediction model via a data distribution of a 20:80 testing-to-training ratio.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.812-815
• /
• 1996

In this paper, we consider the optimal control problem based on Discrete Event Dynamic Systems(DEDS) in the Temporal Logic framework(TLF) which have studied for a convenient modeling technique. The TLF is enhanced with objective functions(event cost indices) and a measurement space is also defined. Our research goal is the design of the optimal controller for DEDSs. This procedure could be guided by the heuristic search methods. For the heuristic search, we suggested the Stochastic Ruler algorithm, instead of the A algorithm with difficulties as following; the uniqueness of solutions, the computational complexity and how to select a heuristic function. This SR algorithm is used for solving the optimal problem. An example is shown to illustrate our results.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.7 no.2
• /
• pp.25-33
• /
• 1997

A DEDS is a system whose states change in response to the occurence of events from a predefined event set. In this paper, we consider the optimal control and reasoning problem for Discrete Event Systems(DES) in the Temporal Logic Framework(TEL) which have been recnetly defined. The TLE is enhanced with objective functions(event cost indices) and a measurement space is alos deined. A sequence of event which drive the system form a give initial state to a given final state is generated by minimizing a cost functioin index. Our research goal is the reasoning of optimal trajectory and the design of the optimal controller for DESs. This procedure could be guided by the heuristic search methods. For the heuristic search, we suggested the Stochastic Ruler algorithm, instead of the A algorithm with difficulties as following ; the uniqueness of solutions, the computational complexity and how to select a heuristic function. This SR algorithm is used for solving the optimal problem. An example is shown to illustrate our results.

• Journal of Computational Design and Engineering
• /
• v.1 no.3
• /
• pp.187-193
• /
• 2014

One of the hottest challenges in automotive industry is related to weight reduction in sheet metal forming processes, in order to produce a high quality metal part with minimal material cost. Stamping is the most widely used sheet metal forming process; but its implementation comes with several fabrication flaws such as springback and failure. A global and simple approach to circumvent these unwanted process drawbacks consists in optimizing the initial blank shape with innovative methods. The aim of this paper is to introduce an efficient methodology to deal with complex, computationally expensive multicriteria optimization problems. Our approach is based on the combination of methods to capture the Pareto Front, approximate criteria (to save computational costs) and global optimizers. To illustrate the efficiency, we consider the stamping of an industrial workpiece as test-case. Our approach is applied to the springback and failure criteria. To optimize these two criteria, a global optimization algorithm was chosen. It is the Simulated Annealing algorithm hybridized with the Simultaneous Perturbation Stochastic Approximation in order to gain in time and in precision. The multicriteria problems amounts to the capture of the Pareto Front associated to the two criteria. Normal Boundary Intersection and Normalized Normal Constraint Method are considered for generating a set of Pareto-optimal solutions with the characteristic of uniform distribution of front points. The computational results are compared to those obtained with the well-known Non-dominated Sorting Genetic Algorithm II. The results show that our proposed approach is efficient to deal with the multicriteria shape optimization of highly non-linear mechanical systems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.10
• /
• pp.2587-2600
• /
• 2012

It has been demonstrated that choosing an appropriate relay node can improve the transmission rate for the system. However, such system improvement brought by the relay selection may be degraded with the presence of the malicious relay nodes, which are selected but refuse to cooperate for transmissions deliberately. In this paper, we formulate the relay selection issue as a restless bandit problem with the objective to maximize the average rate, while considering the credibility of each relay node, which may be different at each time instant. Then the optimization problem is solved by using the priority-index heuristic method effectively. Furthermore, a low complexity algorithm is offered in order to facilitate the practical implementations. Simulation results are conducted to demonstrate the effectiveness of the proposed trust-based relay selection scheme.