By Topic

Hybrid applications of constraint satisfaction and meta-heuristics to railway timetabling: a comparative study

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
M. T. Isaai ; Dept. of Comput., Univ. of Manchester Inst. of Sci. & Technol., UK ; M. G. Singh

The paper provides a discussion on the train scheduling algorithms developed to create predictive schedules for a fleet of passenger trains which travel along a primarily single-track railway with some double-track stretches. The algorithms are an object oriented constraint based heuristic and two hybrid methods, which represent combinations of the heuristic with tabu search and simulated annealing search control strategies. The data of infrastructures and working timetables of passenger trains of Iran's railway system are used to evaluate and compare the generated schedules. Three delay based performance measures, i.e., sum of weighted waiting times (SWWTs), average of unit waiting time (AUWT), and maximum ratio of waiting time to journey time (MRWJ), are used to evaluate the schedules and compare algorithms, where AUWT and MRWJ are introduced by the authors. Simulation experiments show the success of the three methods and the relative advantages and disadvantages of the algorithms are discussed

Published in:

IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews)  (Volume:31 ,  Issue: 1 )