• Journal of Korean Society for Quality Management
• /
• v.30 no.3
• /
• pp.139-149
• /
• 2002

A successful product development process can not be achieved without a proper focus and prioritization. For this research, the priority is defined as the relative urgency of a system compared to other system in order to develop and launch a successful product. The process of integrated approach for prioritization using ID and Goal Programming is developed. The development of a mid-size car by an internationally reputed automotive company is described as a case study.

• IE interfaces
• /
• v.17 no.3
• /
• pp.282-293
• /
• 2004

Line Balancing is the problem to assign tasks to stations while satisfying some managerial viewpoints. Most researches about the Mixed-Model Line Balancing problems are focused on the minimizing the total processing time or the number of workstations. Independently, some research reports consider the balance issues of the physical workloads on the assembly line. In this paper, we are presenting a new mathematical model to accomplish the line balance considering both the processing time and the workloads at the same time. To this, end, we propose an zero-one integer program problem, and we use the Chebyshev Goal Programming approach as the solution method. Some computational test runs are performed to compare the pay-offs between the processing time and the workloads. And, the test results show us that the reliable balanced work schedules can be obtained through the proposed model.

• Journal of Korean Institute of Industrial Engineers
• /
• v.42 no.6
• /
• pp.386-394
• /
• 2016

In this research, in order to optimize the multi-objective function effectively, we suggested the optimization model to maximize the total destruction of ground targets and minimize the total damage of aircrafts and cost of air munitions by using goal programming. To satisfy the various variables and constraints of this mathematical model, the concept of air strike package is applied. As a consequence, effective attack can be possible by identifying the prior ground targets more quickly. This study can contribute to maximize the ROK air force's combat power and preservation of high value air asset in the war.

• Journal of Navigation and Port Research
• /
• v.33 no.4
• /
• pp.271-275
• /
• 2009

A strategic decision making on location selection for product transportation includes many tangible and untangible factors. To choose the best locations is a difficult job in the sense that objectives usually conflict with each other. In this paper, we consider a multi stage multi criteria transshipment problem with different types of items to be transported from the sources to the destination points. For the optimization of the problem, a goal programming formulation will be presented in which the location selection for each product type will be determined under the multi objective criteria. In the study, we generalize the transshipment model with a variety of product types and finite number of different intermediate nodes between origins and destinations. For the selection of the criteria we selected the costs(fixed cost and transportation cost), location numbers, and unsatisfied demand for each type of products in multi stage transportation, which are the main goals in transshipment modelling problems. The related conditions are also modelled through linear formats.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 1998.10a
• /
• pp.153-158
• /
• 1998

In this paper, we present a design of optimal 2-DOF PID controller for control of gantry crane which has to control swing motion and trolley position. For tuning the parameter of 2-DOF PID controller, we used evolution strategy(ES). During operate the crane system in yard, the goal is transporting the load to a goal position as quick as possible without rope oscillation. The crane is generally operated by an expert operator, but recently an automatic control system with high speed and rapid transportation is required. However, we developed an optimal controller which has to control the crane system with disturbance.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.52 no.10
• /
• pp.584-592
• /
• 2003

This paper presents a fuzzy-GA method for the allocation and operation of dispersed generator systems(DGs) based on load model in composite distribution systems. Groups of each individual load model consist of residential, industrial, commercial, official and agricultural load. The problem formulation considers an objective to reduce power loss of distribution systems and the constraints such as the number or total capacity of DGs and the deviation of the bus voltage. The main idea of solving fuzzy goal programming is to transform the original objective function and constraints into the equivalent multi-objectives functions with fuzzy sets to evaluate their imprecise nature for the criterion of power loss minimization, the number or total capacity of DGs and the bus voltage deviation, and then solve the problem using genetic algorithm. The method proposed is applied to IEEE 12 bus and 33 bus test systems to demonstrate its effectiveness. .

• KIEE International Transaction on Systems and Control
• /
• v.2D no.2
• /
• pp.125-134
• /
• 2002

This paper proposes a method for identifying temporal pattern clusters to predict events in time series. Instead of predicting future values of the time series, the proposed method forecasts specific events that may be arbitrarily defined by the user. The prediction is defined by an event characterization function, which is the target of prediction. The events are predicted when the time series belong to temporal pattern clusters. To identify the optimal temporal pattern clusters, fuzzy goal programming is formulated to combine multiple objectives and solved by an adaptive differential evolution technique that can overcome the sensitivity problem of control parameters in conventional differential evolution. To evaluate the prediction method, five test examples are considered. The adaptive differential evolution is also tested for twelve optimization problems.

• Proceedings of the KIEE Conference
• /
• 2000.07d
• /
• pp.3060-3062
• /
• 2000

A fast optimal path planning algorithm using the analog Cellular Nonlinear Circuits (CNC) is proposed. The proposed algorithm compute the optimal path using subgoal-based dynamic programming algorithm. In the algorithm, the optimal paths are computed regardless of the distance between the initial and the goal position. It begins to find subgoals starting from the initial position when the output of the initial cell becomes nonzero value. The suboal is set as the initial position to find the next subgoal until the final goal is reached. Simulations have been done considering the imprecise hardware fabrication and the limitation of the magnitude of input value.

• Journal of applied mathematics & informatics
• /
• v.9 no.1
• /
• pp.197-211
• /
• 2002

In this paper, we propose a multi-Criteria decision making approach to address the problem of finding the best possible solution in credit unions. Sensitivity analysis on the priority structure of the goals has been performed to obtain all possible solutions. The study uses the Euclidean distance method to measure distances of all possible solutions from the identified ideal solution. The possible optimum solution is determined from the minimum distance between the ideal solution and other possible solutions of the Problem.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.28 no.3
• /
• pp.98-108
• /
• 2005

The assembly line balancing problem has been focused by many research works because the efficient management of the assembly line might influence not only the quality of the products but also the working conditions for the workers. This paper deals with U-shape mixed-model assembly line balancing and considers both the processing time and the physical workloads. We suggest the goal programming approach for this situation and to overcome some difficulties of finding optimal solution, we adopt the genetic algorithm that is one of the most promising solution techniques. We tested several test problems and present the results that indicate some improvement for the line balancing as well as the stable performance of the algorithm.