By Topic

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

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
$31 $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)
Isaai, M.T. ; Dept. of Comput., Manchester Univ., UK ; Singh Madan, G.

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

Published in:

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