• Korean Management Science Review
• /
• v.12 no.2
• /
• pp.105-127
• /
• 1995

This paper solves different machine-part group formation (MPGF) problems using genetic algorithms to demonstrate that it can be a new robust alternative to the conventional heuristic approaches for optimization problems. We first give an overview of genetic algorithms: Its principle, various considerations required for its implementation, and the method for setting up parameter values are explained. Then, we describe the MPGF problem which are critical to the successful operation of cellular manufacturing or flexible manufacturing systems. We concentrate on three models of the MPGF problems whose forms of the objective function and/or constraints are quite different from each other. Finally, numerical examples of each of the models descibed above are solved by using genetic algorithms. The result shows that the solutions derived by genetic algorithms are comparable to those obtained through problem-specific heuristic methods.

• Architectural research
• /
• v.8 no.2
• /
• pp.43-48
• /
• 2006

The appropriate fleet estimation of the excavation equipment is a major factor in the determination of the cost and time requirements of a project. But the decision of what kind of equipment selected is often based on heuristic methods or trial and error in Korea. Thus, this study proposes a prototype model that uses genetic algorithms to select fleet estimation of loaders (backhoe) and trucks used in excavation work. To verify the applicability of this model, the case study was performed. And the result of the genetic model was compared with that of the trial & error method. The use of the genetic model suggested this study required 44days, 2 units of backhoes, 7 units of trucks, and a total cost of 171,839,756 won. With the estimated fleet number of equipment, the minimum cost of excavation work can be calculated, taking account of the time-cost trade-off. By utilizing this prototype model, the efficiency of excavation work can be improved.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.27 no.2
• /
• pp.97-109
• /
• 2002

Manufacturing environments in the real world are subject to many sources of change and uncertainty, such as new job releases, job cancellations, a chance in the processing time or start time of some operation. Thus, the realistic scheduling method should Properly reflect these dynamic environment. Based on the release times of jobs, JSSP (Job Shoe Scheduling Problem) can be classified as static and dynamic scheduling problem. In this research, we mainly consider the dynamic JSSP with continually arriving jobs. The goal of this research is to develop an efficient scheduling method based on GA (Genetic Algorithm) to address dynamic JSSP. we designed scheduling method based on SGA (Sing1e Genetic Algorithm) and PGA (Parallel Genetic Algorithm) The scheduling method based on GA is extended to address dynamic JSSP. Then, This algorithms are tested for scheduling and rescheduling in dynamic JSSP. The results is compared with dispatching rule. In comparison to dispatching rule, the GA approach produces better scheduling performance.

• International Journal of Korean Welding Society
• /
• v.3 no.2
• /
• pp.15-23
• /
• 2003

A genetic algorithm was applied to an arc welding process to determine near optimal settings of welding process parameters which produce good weld quality. This method searches for optimal settings of welding parameters through systematic experiments without a model between input and output variables. It has an advantage of being able to find optimal conditions with a fewer number of experiments than conventional full factorial design. A genetic algorithm was applied to optimization of weld bead geometry. In the optimization problem, the input variables were wire feed rate, welding voltage, and welding speed, root opening and the output variables were bead height, bead width, penetration and back bead width. The number of level for each input variable is 8, 16, 8 and 3, respectively. Therefore, according to the conventional full factorial design, in order to find the optimal welding conditions, 3,072 experiments must be performed. The genetic algorithm, however, found the near optimal welding conditions from less than 48 experiments.

• Industrial Engineering and Management Systems
• /
• v.8 no.4
• /
• pp.228-238
• /
• 2009

This paper first presents two supply chain design problems: 1) a factory location setting and factory selection problem, and 2) a factory location setting and factory/supplier selection problem. The first involves a number of location known retailers choosing one factory to supply their demands from a number of factories whose locations are to be determined. The goal is to minimize the transportation and manufacturing cost to satisfy the demands. The problem is then augmented into the second problem, where the procurement cost of the raw materials from a chosen material supplier (from a number of suppliers) is considered for each factory. Economic beneficial is taken into account in the cost evaluation. Therefore, the partner selections will influence the cost of the supply chain significantly. To solve these problems, an agent gaming and genetic algorithm hybrid method (AGGAHM) is proposed. The AGGAHM consecutively and alternatively enable and disable the advancement of agent gaming and the evolution of genetic computation. Computation results on solving a number of examples by the AGGAHM were compared with those from methods of a general genetic algorithm and a mutual frozen genetic algorithm. Results showed that the AGGAHM outperforms the methods solely using genetic algorithms. In addition, various parameter settings are tested and discussed to facilitate the supply chain designs.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.50 no.2
• /
• pp.76-82
• /
• 2001

This paper presents a approach for a service restoration and optimal reconfiguration of distribution network using Genetic algorithm(GA) and Tabu search(TS) method. Restoration and reconfiguration problems in distribution network are difficult to solve in short times, because distribution network supplies power for customers combined with many tie-line switches and sectionalizing switches. Furthermore, the solutions of these problems have to satisfy radial operation conditions and reliability indices. To overcome these time consuming and sub-optimal problem characteristics, this paper applied Genetic-Tabu algorithm. The Genetic-Tabu algorithm is a Tabu search combined with Genetic algorithm to complement the weak points of each algorithm. The case studies with 7 bus distribution network showed that not the loss reduction but also the reliability cost should be considered to achieve the economic service restoration and reconfiguration in the distribution network. The results of suggested Genetic-Tabu algorithm and simple Genetic algorithm are compared in the case study also.

• Proceedings of the Microbiological Society of Korea Conference
• /
• 1991.04a
• /
• pp.157-172
• /
• 1991

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.8
• /
• pp.344-351
• /
• 2016

In the point of view of a train operator, the main concern with a train operation is not only to maintain a time schedule, but also to decrease the energy consumption as much as possible. Generally for a manual drive, a train conductor controls the train acceleration and deceleration by controlling the notches not to exceed the regulation velocity by considering the given maximum velocity profile for an operation route. For this case, the guideline for a conductor is needed to choose the proper notches by applying the notch optimization so as to drive at the regulation velocity and minimize energy consumption simultaneously. In this paper, the real-time notch optimization plan is suggested using a genetic algorithm that optimizes the notches for the remaining route in real time when the event occurs that track information or regulation velocity profile of the remaining route changes during train operation as well as a normal operation situation. An energy saving effect and the convergence behavior of the optimal solution obtained was analyzed in a genetic algorithm.

• Journal of Korean Society of Water and Wastewater
• /
• v.32 no.5
• /
• pp.421-434
• /
• 2018

Water supply/intake pumps operation use 70~80% of power costs in water treatment plants. In the water treatment plant, seasonal and hourly differential electricity rates are applied, so proper pump scheduling can yield power cost savings. Accordingly, the purpose of this study was to develop an optimal water supply pump scheduling scheme. An optimal operation method of water supply pumps by using genetic algorithm was developed. Also, a method to minimize power cost for water supply pump operation based on pump performance derived from the thermodynamic pump efficiency measurement method was proposed. Water level constraints to provide sufficient disinfection performance in a clearwell and reservoirs were calibrated. In addition, continuous operation time constraints were calibrated to prevent frequent pump switching. As a result of optimization, savings ratios during 7 days in winter and summer were 4.5% and 5.1%, respectively. In this study, the method for optimal water pump operation was developed to secure disinfection performance in the clearwell and to save power cost. It is expected that it will be used as a more advanced optimal water pump operation method through further studies such as water demand forecasting and efficiency according to pump combination.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.53 no.9
• /
• pp.481-486
• /
• 2004

In operation of distribution system, $DG_s$ Distributed Generations) are installed as an alternative of extension and establishment of substations and transmission and distribution lines according to increasing power demand. In operation planning of $DG_s$, determining optimal capacity and allocation gets economical pro(it and improves power reliability. This paper proposes determining a optimal number, size and allocation of $DG_s$ needed to minimize operation cost of distribution system. Capacity of $DG_s$ (or economical operation of distribution system estimated by the load growth and line capacity during operation planning duration, DG allocations are determined to minimize total cost with power buying cost. operation cost of DG, loss cost and outage cost using GA(Genetic Algorithm).