상세 보기
초록
Scheduling is an important technique encompassing a wide application area. Because of the complex interrelations among the resources, knowledge and various other constraints, scheduling has many difficulties. The train scheduling problems are also difficult. Artificial Intelligence technology has been applied to solve the scheduling problems. These techniques are efficient in representing knowledge and rules for complex scheduling problems. We have applies the CSP (Constraints Satisfaction Problems) technique, one of AI techniques, to train scheduling. So the constraints and rules are represented and processed by logical language for effective scheduling and CSP technique is used for reducing the enormous searching space. The program processes domain filtering to efficiently satisfy mandatory and optional constraints. Therefore, the program recursively processes to find the near-optimal solution. In also the inactive program for more available scheduling is also presented. Now these two programs are separated ones but these are going to make into one program in time. It is possible to identify that the application of CSP technique to scheduling problems can be remarkably reduced the scheduling error by shuman and the scheduling time in case of comparing of the scheduling by human-expert. Also the interactive scheduling will be useful tool for effect analysis of constraints or other factors and supplemented tool for scheduling of human expert.
- 제목
- Interactive Simulation Program for Train Scheduling Using Advanced Expert System
- 저자
- JO GEUN SIK
- 학회명
- World Conference on Railway Research (WCRR) 99