• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.24 no.65
• /
• pp.89-102
• /
• 2001

In this paper, the aircraft route scheduling consists of two steps; the pairing generation and the aircraft assignment. The pairing generation is heuristic approach how flights construct pairings from and to the main base. The aircraft resource assignment which is to establish a aircraft route schedule is constructed by constraint satisfaction problem technique. ILOG solver and schedule is used to solve this problem. In addition, a aircraft route reschedule process against departure-arrival delay or aircraft maintenance schedule change is added by partial constraints satisfaction problem technique. Also, Gantt chart made by ILOG views is used to show aircraft route schedule results more easily.

• KIEE International Transaction on Electrical Machinery and Energy Conversion Systems
• /
• v.4B no.1
• /
• pp.29-35
• /
• 2004

Locomotive scheduling in railway systems experiences many difficulties because of the complex interrelations among resources, knowledge and various constraints. Artificial intelligence technology has been applied to solve these scheduling problems. These technologies have proved to be efficient in representing knowledge and rules for complex scheduling problems. In this paper, we have applied the CSP (Constraints Satisfaction Problems) programming technique, one of the AI techniques, to solve the problems associated with locomotive scheduling. This method is more effective at solving complex scheduling problems than available mathematical programming techniques. The advanced locomotive scheduling system using the CSP programming technique is realized based on the actual timetable of the Saemaul type train on the Kyong-bu line. In this paper, an overview of the CSP programming technique is described, the modeling of domain and constraints is represented and the experimental results are compared with the real-world existing schedule. It is verified that the scheduling results by CSP programming are superior to existing scheduling performed by human experts. The executing time for locomotive scheduling is remarkably reduced to within several decade seconds, something requiring several days in the case of locomotive scheduling by human experts.

• IE interfaces
• /
• v.16 no.3
• /
• pp.352-361
• /
• 2003

Vehicle manufacturing plant is a typical mixed-model production system. Generally it consists of three main shops including body shop, painting shop and assembly shop in addition to engine shop. Each shop contains diverse manufacturing processes, all of which are integrated in a form of flow line. Due to the high pressure from the market requesting small-volume large variety production, production planning becomes very critical for the competitiveness of automotive industry. In order to save costs and production time, production planning system is requested to meet some designated requirements for each shop: to balance the work load in body and assembly shops, and to minimize the number of color changes in painting shop. In this context, we developed a sequencing module for a vehicle production planning system using the ILOG Solver Library. It is designed to take into account all the manufacturing constraints at a time with meeting hard constraints in body shop, minimizing the number of soft constraints violated in assembly shop, and minimizing the number of color changes in painting shop.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.5S
• /
• pp.1687-1695
• /
• 2000

Recently, many researchers have tried to establish EC framework EC framework for automated contract and brokerage using agent technologies in electronic commerce. Traditional researches, however, often enforced the user's participations during the automated brokerage process of agents an did not supported the procedures and methodologies for satisfying various user's requirements. In this paper, we propose a brokerge framework based on multi-agent to overcome the defects of the previous researches. For the optimal brokerage, the proposed framework is divided into tow layers, which are called competition layer and constraint satisfaction layer. The Agents process behaviors of brokerage through two layers accroding to th proposed message driven communication protocol. W also apply CSP (Constraint Satisfaction Problems) techniques to brokerage process to satisfy various preferential requirements from the user. That is, e model the relationship between buyer agents and seller agents using CSP and propose efficient CSP models for the optimal brokerage as the types of brokerage. Finally, e implemented prototype systems applying the proposed framework and showed the efficiency of he proposed framwork with the experimental results.

• Journal of Korean Institute of Industrial Engineers
• /
• v.21 no.2
• /
• pp.207-216
• /
• 1995

Constructing a distributed management system has its own advantages in addressing the issue of implementing a quick responsive management system in dynamically changing environment of enterprise. We suggest a basic scheduling methodology applicable to a distributed production management system. A new concept of "flexible schedule" is introduced as a tool to accommodate dynamically changing situations of job shops. Then a search technique (referred to as CSP-CBA search) is presented to obtain such a schedule for the job shop scheduling problem, which is converted into a constraint satisfaction problem(CSP), by using the constraint based analysis(CBA). This approach is tested on more than 100 test problems. The results show that the suggested approach required shorter CPU time and solved more problems in given time than another fixed schedule method.

• Journal of the Korean Home Economics Association
• /
• v.29 no.3
• /
• pp.153-174
• /
• 1991

The purpose of this study is to examine the leisure activities of housewives, to identify the factors that influence leisure activities, and to explore the factors contribute to their life satisfaction. So, this study analyses the effects of econo-demographic and socio-cultural variables and of leisure constraint factors on the leisure activities of housewives. And it deals with how these variables and the leisure activities influence life satisfaction of housewives. For these puoposes, 508 housewives residing in Seoul & Daegu were selected for interviews. For data analysis such statistical methods as ANOVA, t-test, Pearson's correlation, adn Multiple Regression Analysis can be summarised. The main findings of the research are as follows: 1. Leisure acivities are classified in Self-developmental, Home-oriented, Time-consuming, Social and Children-concerned types by the technique of factor analysis. The average particiation level was high in Time-consuming type, but low in Self-developmental type. 2. The participation level of leisure activities shows significant differences by selected variables: The Self-developmental type shows significant differences by housewife's education level, income, husband's occupation, role orientation, home management type and leisure constraints. And Children-concerned type was differed to number of family nember, number of children, age of housewife and age of housewife and age of the youngst child. 3. The preference level of leisure activities differ by housewife's education level, income, husband's occupation, home management type and leisure constraints in the Self-developmental and the Social type. And the preference level of Home-oriented leisure activities was high in the middle class of income and husband's occupation. 4. The preference and participation level of leisure activities show differences. And the variables affecting the differences were housewife's age, education level, home management type, role orientation, leisure constraint factors in the Self-developmental type, and were demographic variables such as number of family member, housewife's age in the Home-oriented type. 5. The variables which affected the level of life satisfaction independently were leisure space, income, the participation level of the Self-developmental and the Social type and the preference level of the Self-developmental type.

• Journal of Power System Engineering
• /
• v.7 no.4
• /
• pp.67-73
• /
• 2003

The entry guidance design involves trajectory optimization and generation of a drag acceleration profile as the satisfaction of trajectory conditions during the entry flight. The reference trajectory is parameterized and optimized as piecewise linear functions of the velocity. A regularization technique is employed to achieve desired properties of the optimal drag profile. The regularized problem has smoothness properties and the minimization of performance index then prevents the drag acceleration from varying too fast, thus eliminating discontinuities. This paper shows the trajectory control using the simple control law as well as the information of reference drag acceleration.

• IE interfaces
• /
• v.14 no.3
• /
• pp.218-226
• /
• 2001

Scheduling for shipbuilding processes has many alternative solutions since it has long time horizon and handles many jobs. This requests the scheduling system to generate and search feasible alternative solutions in short period of time. Among shipbuilding schedules, the ship erection schedule in a dock is the most important since the dock is the most critical resource in shipyard. In this research, we model the erection scheduling problem for shipbuilding and develop a new problem solving method using CST(Constraint Satisfaction Technique) and ILOG Scheduler. Experimental results show that the proposed scheduling method outperforms the existing manual scheduling methods in terms of schedule performance and required time.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.150.1-150
• /
• 2001

This paper introduces a real time inspecting and monitoring system by using wireless communication and image processing technique. The communication system is developed by using 80c196kc microprocessor and it has data acquisition function for several kinds of sensors such as pluviometer, temperature, tension meter, elinometer and so on. The image processing method adopts Lalacian of Gaussian operator and least square method to extract line features for the captured images and uses a relaxation matching algorithm based in global structure constraint satisfaction to distinguish the matching error for those features. When the algorithm is processed, motion parameters of displacement area and its direction are computed. Once movement is recognized ...

• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.999-1004
• /
• 1989

This paper discusses a new method of recognizing patterns employing consistent labeling. A consistent labeling problem is a generalized expression of constraint satisfaction problems. When a pattern is recognized by pattern matching, the matching between a reference pattern and an acquired pattern resolves itself into finding correspondence between the pixels on the former and those on the latter. This can be expressed as a consistent labeling problem. Pattern association, a variation of pattern recognition, is also described employing consistent labeling. The proposed technique is supported by experimental results, yet further studies need to be done before its practical use.