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

Authors:
Elias Oliveira;Barbara M. Smith
Affiliations:
-;-
Venue:
EPIA '01 Proceedings of the10th Portuguese Conference on Artificial Intelligence on Progress in Artificial Intelligence, Knowledge Extraction, Multi-agent Systems, Logic Programming and Constraint Solving
Year:
2001

Citing 3
Cited 1

A fast heuristic for the train scheduling problem

Computers and Operations Research
Improving railroad on-time performance: models, algorithms and applications

Improving railroad on-time performance: models, algorithms and applications
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems

Single line train scheduling with ACO

EvoCOP'13 Proceedings of the 13th European conference on Evolutionary Computation in Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.