• 대한안전경영과학회지
• /
• 제6권2호
• /
• pp.141-154
• /
• 2004

The objective of this paper is to develop the efficient heuristic method for solving the minimum makespan problem of the job shop scheduling. The proposed heuristic method is based on a constraint satisfaction problem technique and a improved randomizing search algorithm. In this paper, ILOG programming libraries are used to embody the job shop model, and a constraint satisfaction problem technique is developed for this model to generate the initial solution. Then, a improved randomizing search algorithm is employed to overcome the increased search time of constrained satisfaction problem technique on the increased problem size and to find a improved solution. Computational experiments on well known MT and LA problem instances show that this approach yields better results than the other procedures.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 1997년도 춘계학술대회 논문집
• /
• pp.589-594
• /
• 1997

We have already presented the constraint satisfaction algorithm which could solve the losed loop problem in constraint network by using local constraint propagation, variable elimination and constraint modularization. With this algorithm, we have implemented a knowledge-based system (intelligent CAD) for supporting machine design interactively. In this paper, we present newer constraint satisfaction algorithm which can solve inequalities or under-constrained problems in constraint network, interactively and efficiently. This algorithm is a hybrid type of using both declarative description (constraint represention) and optimization algorithm (Simulated Annealing), simultaneously. The under-constrained problems are represented by constraint networks and satisfied completely with this algorithm. The usefulness of our algorithm will be illustrated by the application to a gear design.

• 대한안전경영과학회:학술대회논문집
• /
• 대한안전경영과학회 2004년도 춘계학술대회
• /
• pp.49-49
• /
• 2004

• Structural Engineering and Mechanics
• /
• 제7권5호
• /
• pp.485-502
• /
• 1999

Using the continuous Hopfield network model as the basis to solve the general crisp and fuzzy constrained optimization problem is presented and examined. The model lies in its transformation to a parallel algorithm which distributes the work of numerical optimization to several simultaneously computing processors. The method is applied to different structural engineering design problems that demonstrate this usefulness, satisfaction or potential. The computing algorithm has been given and discussed for a designer who can program it without difficulty.

• 전기학회논문지
• /
• 제56권9호
• /
• pp.1521-1526
• /
• 2007

This paper presents the application of Adaptive Evolutionary Algorithm (AEA) to search an optimal setting of overcurrent relay coordination to protect ring distribution systems. The AEA takes the merits of both a genetic algorithm (GA) and an evolution strategy (ES) in an adaptive manner to use the global search capability of GA and the local search capability of ES. The overcurrent relay settings and coordination requirements are formulated into a set of constraint equations and an objective function is developed to manage the overcurrent relay settings by the Time Coordination Method. The domain of overcurrent relays coordination for the ring-fed distribution systems is a non-linear system with a lot of local optimum points and a highly constrained optimization problem. Thus conventional methods fail in searching for the global optimum. AEA is employed to search for the optimum relay settings with maximum satisfaction of coordination constraints. The simulation results show that the proposed method can optimize the overcurrent relay settings, reduce relay mis-coordinated operations, and find better optimal overcurrent relay settings than the present available methods.

• International Journal of Internet, Broadcasting and Communication
• /
• 제11권4호
• /
• pp.71-75
• /
• 2019

Sleep apnea is a disease that causes various complications, and the polysomnography is expensive and difficult to measure. The purpose of this study is to develop an unrestricted wearable monitoring system so that patients can be examined in a familiar environment. We used a method to detect sleep apnea events and to determine sleep satisfaction by non-constrained method using SpO2 measurement sensor and 3-axis acceleration sensor. Heart rate and SpO2 were measured at the finger using max30100. After acquiring the SpO2 data of the user in real time, the apnea measurement algorithm was used to transmit the number of apnea events of the user to the mobile phone using Bluetooth (HC-06) on the wrist. Using the three-axis acceleration sensor (mpu6050) attached to the upper body, the number of times of tossing and turning during sleep was measured. Based on this data, this algorithm evaluates the patient's tossing and turning during sleep and transmits the data to the mobile phone via Bluetooth. The power source used 9 volts battery to operate Arduino UNO and sensors for portability and stability, and the data received from each sensor can be used to check the various degree between sleep apnea and sleep tossing and turning on the mobile phone. Through thisstudy, we have developed a wearable sleep apnea measurement system that can be easily used at home for the problem of low sleep efficiency of sleep apnea patients.