• Journal of the Korea Safety Management & Science
• /
• v.13 no.1
• /
• pp.133-142
• /
• 2011

Overhead facility design problem(OFDP) is one of the shortest rectilinear flow network problem(SRFNP)[4]. Genetic algorithm(GA), artificial immune system(AIS), population management genetic algorithm (PM) and greedy randomized adaptive search procedures (GRASP) were introduced to solve OFDP. A path matrix formed individual was designed to represent rectilinear path between each facility. An exchange crossover operator and an exchange mutation operator were introduced for OFDP. Computer programs for each algorithm were constructed to evaluate the performance of algorithms. Computation experiments were performed on the quality of solution and calculations time by using randomly generated test problems. The average object value of PM was the best of among four algorithms. The quality of solutions of AIS for the big sized problem were better than those of GA and GRASP. The solution quality of GRASP was the worst among four algorithms. Experimental results showed that the calculations time of GRASP was faster than any other algorithm. GA and PM had shown similar performance on calculation time and the calculation time of AIS was the worst.

• KEPCO Journal on Electric Power and Energy
• /
• v.7 no.1
• /
• pp.73-77
• /
• 2021

As the big data analysis technologies has been developed worldwide, the importance of asset management for electric power facilities based data analysis is increasing. It is essential to secure quality of data that will determine the performance of the RISK evaluation algorithm for asset management. To improve reliability of asset management, asset data must be preprocessed. In particular, the process of cleaning dirty data is required, and it is also urgent to develop an algorithm to reduce time and improve accuracy for data treatment. In this paper, the result of the development of an automatic cleaning algorithm specialized in overhead transmission asset data is presented. A data cleaning algorithm was developed to enable data clean by analyzing quality and overall pattern of raw data.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.14 no.1
• /
• pp.59-66
• /
• 2000

As the highly complex and precise control functions are required in modern industrial process control system, the complex function models and developed in each hardware and software of PLC. The SFC graphical language is very powerful for describing the sequential logic control algorithm, on the other hand it graphical language is very powerful for describing the sequential logic control algorithm, on the other hand it has problems in describing the interlock logic control algorithm, such as error management algorithm. In this paper, we propose the efficient error management method using the action qualifiers to design the error management algorithm in industrial process control system described scheme, we realize the error management logic in process control system of film coating machine.From the experiment results, we confirm that the proposed scheme is very useful in aspects to realize easily th error management logic and to reduce the memory capacity for user's program.

• Journal of the Korea Safety Management & Science
• /
• v.11 no.3
• /
• pp.131-138
• /
• 2009

This paper considers a coordinated scheduling problem between multi-suppliers and an manufacture. When the supplier has insufficient inventory to meet the manufacture's order, the supplier may use the expedited production and the expedited transportation. In this case, we consider a scheduling problem to minimize the total cost of suppliers and manufacture. We suggest an population management genetic algorithm with local search and crossover (GALPC). By the computational experiments comparing with general genetic algorithm, the objective value of GALPC is reduced by 8% and the calculation time of GALPC is reduced by 70%.

• Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
• /
• 2004.05a
• /
• pp.67-72
• /
• 2004

Many port states such as New Zealand, the USA, Australia and Canada have strict regulations to prevent ships which arrive in their port from discharging polluted ballast water which contain harmful aquatic organism and pathogens. They are notified that transfer of polluted ballast water can cause serious injury to public health and damage to property and environment. For this reason, they perceived that the ballast exchange in deep sea is the most effective method, together with submitting the ballast management plan which contains the effective exchange method, ballast system and safety consideration. In this study, we pursued both nautical engineering analysis and optimization of algorithm in order to generate the sequence of stability and rapidity. Heuristic Algorithm was chosen on the basis of optimality and applicability to a sequential exchange problem. We have built an optimized algorithm, for automatic exchange of ballast water, by redefining core elements of the $A^\ast$ algorithm, such as node, operator and evaluation function. Final version of the optimized algorithm has been applied to existing bulk carrier and the performance of the algorithm has been verified successfully.

• Journal of Korean Society for Quality Management
• /
• v.39 no.1
• /
• pp.98-108
• /
• 2011

Clustering is an useful method to classify objects into subsets that have some meaning in the context of a particular problem and has been applied in variety of fields, customer relationship management, data mining, pattern recognition, and biotechnology etc. This paper addresses the unknown K clustering problems and presents a new approach based on a coevolutionary algorithm to solve it. Coevolutionary algorithms are known as very efficient tools to solve the integrated optimization problems with high degree of complexity compared to classical ones. The problem considered in this paper can be divided into two sub-problems; finding the number of clusters and classifying the data into these clusters. To apply to coevolutionary algorithm, the framework of algorithm and genetic elements suitable for the sub-problems are proposed. Also, a neighborhood-based evolutionary strategy is employed to maintain the population diversity. To analyze the proposed algorithm, the experiments are performed with various test-bed problems which are grouped into several classes. The experimental results confirm the effectiveness of the proposed algorithm.

• Journal of the Korean Society for Precision Engineering
• /
• v.29 no.12
• /
• pp.1304-1312
• /
• 2012

According to the successful development of hybrid vehicle, hybridization of construction equipments like excavator, wheel loader, and backhoe etc., is gaining increasing attention. However, hybridization of excavator and commercial vehicle is very different. Therefore a specialized energy management control algorithm for excavator should be developed. In this paper, hybridization of excavators is investigated and a new energy management control algorithm is proposed. Four control parameters, i.e., lower baseline, upper baseline, idling generation speed, and idling generation torque, are newly introduced and a new operating principle using those four control parameters is proposed. The use of Genetic Algorithm for the optimization of the four control parameters from the view point of minimization of fuel consumption for standard excavating operation is suggested. In order to verify the proposed algorithm, dedicated simulation program of hybrid excavator was developed. The proposed algorithm is applied to a specific hydraulic excavator and 20.7% improvement of fuel consumption is achieved.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.1
• /
• pp.21-27
• /
• 2020

In this paper, a hybrid scheduling algorithm is proposed for CMS(Combat Management System) to improve QoS(Quality of Service) based on DWDRR(Dynamic Weighted Deficit Round Robin) and priority-based scheduling method. The main proposed scheme, DWDRR is method of packet transmission through giving weight by traffic of queue and priority. To demonstrate an usefulness of proposed algorithm through simulation, efficiency in special section of the proposed algorithm is proved. Therefore, We propose hybrid algorithm between existing algorithm and proposed algorithm. Also, to prevent frequent scheme conversion, a hysteresis method is applied. The proposed algorithm shows lower packet loss rate and delay in the same traffic than existing algorithm.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.42 no.3
• /
• pp.13-24
• /
• 2017

This paper aims to implement "structural changes detection procedure" in pairs trading algorithm and to show that the proposed approach outperforms the extant pair trading algorithm. Structural changes in pairs trading are defined in terms of changes in cointegrating factors and broken cointegration relationship. These changes are designed to test extant structural changes and unit root test methodologies. The simulation finds that expanding the changes in structure, increasing the mean reverting process of spread, and extending the consecutive days of broken cointegration will increase the performances of the proposed algorithm. Empirical study results are also consistent those of the simulation studies. The proposed algorithm outperforms the extant algorithm relative to risk and return given that the cumulative profit/loss has a significant upward-slope with minimal variance.

• Journal of Korean Institute of Industrial Engineers
• /
• v.33 no.3
• /
• pp.329-338
• /
• 2007

This paper presents a dispatching algorithm for nonidentical parallel machines problem considering rework, sequence dependent setup times and release times. For each pair of a machine and a job type, rework probability of each job on a machine can be known through historical data acquisition. The heuristic scheduling scheme named by EDDR (Earliest Due Date with Rework probability) algorithm is proposed in this paper making use of the rework probability. The proposed dispatching algorithm is measured by two objective function value: 1) total tardiness and 2) the number of reworked jobs, respectively. The extensive computational results show that the proposed algorithm gives very efficient schedules superior to the existing dispatching algorithms.