论文信息 - An object-oriented, constraint-based heuristic for a class of passenger-train scheduling problems

An object-oriented, constraint-based heuristic for a class of passenger-train scheduling problems

A constraint-based heuristic technique for predictive scheduling of passenger trains is presented in this paper. The algorithm, which is lookahead, has been designed using an object-oriented methodology and is suitable for a single-track railway with some double-track sections. It is shown that the heuristic tends to minimize total waiting time of the trains concerned. Simulation experiments with real data show the superiority of the schedules created to those by human experts with reference to data provided from predictive timetables and specifications of Iran Railways.

Madan G. Singh | Mohammad T. Isaai

[1] Philippe Baptiste. Disjunctive constraints for manufacturing scheduling: Principles and extensions , 1996 .

[2] Pascal Van Hentenryck,et al. A Generic Arc-Consistency Algorithm and its Specializations , 1992, Artif. Intell..

[3] A. I. Mees,et al. Railway scheduling by network optimization , 1991 .

[4] C. Le Pape,et al. Three mechanisms for managing resource constraints in a library for constraint-based scheduling , 1995 .

[5] Malachy Carey,et al. A model and strategy for train pathing with choice of lines, platforms, and routes , 1994 .

[6] A. J. Taylor,et al. A Structured Model for Rail Line Simulation and Optimization , 1982 .

[7] X. Cai,et al. A fast heuristic for the train scheduling problem , 1994, Comput. Oper. Res..

[8] Claude Le Pape,et al. Implementation of resource constraints in ILOG SCHEDULE: a library for the development of constraint-based scheduling systems , 1994 .