Railway Crew Rostering Algorithm With Multiple Groups―ensuring Required Number of Holidays and Consideration of Levelling Indicators Between Groups―

View Full Paper

Ask AI

Bookmark

Share

Key Points

The aim is to develop an algorithm for creating railway crew schedules that ensure required holidays and balance workloads across multiple groups.
Propose an automated scheduling method focusing on crew rotations for multiple groups.
Incorporate conditions for ensuring necessary holidays in crew schedules.
Utilize a two-stage method to efficiently find feasible solutions for the scheduling problem.
Model the problem based on the multiple traveling salesman problem.
Confirmed the algorithm can generate crew schedules within practical time limits even for large-scale issues.
Validated using real route data from domestic railways to demonstrate effectiveness.

Algorithmically generates crew schedules while ensuring holidays and balancing workloads among groups, highlighting efficiency.

No abstract yet. The journal hasn't published one we can show.

No takes yet. Share an insight, caveat, or question.

Kato et al. (2026) studied this question.

View Full Paper

Ask AI

Bookmark

Share