论文信息 - A Combined Constraint-Based Search Method for Single-Track Railway Scheduling Problem

A Combined Constraint-Based Search Method for Single-Track Railway Scheduling Problem

In this paper we present a three-phase structrue algorithm devised within a constraint programming paradigm to solve real-life single-track railway scheduling instances of problems. The combination of a hill-climbing, easing the process of finding iteratively improved solutions, and a branch-and-bournd strategies allows us to solve 21 real-life problems in a reasonable time, 19 of them to optimality. In addition, this paper discusses a group of practical constraints, incorporated into the software, that arise in real-life problems to which little attention has hitherto been paid. Results comparing the gain on using this approach on large instances problems are also presented.

Elias Oliveira | Barbara M. Smith | Elias Oliveira | Barbara M. Smith

[1] Michael Pinedo,et al. Scheduling: Theory, Algorithms, and Systems , 1994 .

[2] Patrick T. Harker,et al. Improving railroad on-time performance: models, algorithms and applications , 1989 .

[3] Jan Karel Lenstra,et al. Job Shop Scheduling by Local Search , 1996, INFORMS J. Comput..

[4] Erhan Kozan,et al. Optimal scheduling of trains on a single line track , 1996 .

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

[6] Elias Silva Oliveira. Solving Single-Track Railway Scheduling Problem Using Constraint Programming , 2001 .