Crew Roster Scheduling Based on Constraint Logic
Takashi SAKAGUCHI, Naotugu NOZUE
One of the most difficult problems with regard to railway
transportation is to systematize operation planning such as
crew scheduling, car rostering, etc. Especially for crew roster
scheduling, several approaches have been tried but failed to
offer practical solutions because of many complicated constraints
such as labor agreement and so forth.
Our approach is to apply the techniques of constraint logic in
order to solve such problems efficiently. This algorithm is suitable
to solve optimization problems which involve many complicated
constraints. We have developed a prototype of crew roster scheduling
system based on constraint logic, and proved it to provide good solutions.