考虑时间公平性的铁路乘务员排班问题

Railway crew planning with fairness over time

European Journal of Operational Research · 2024
被引 10
ABS 4

中文导读

针对荷兰铁路公司NS在运营排班中实现个体公平性的需求,提出滚动时域与罚分反馈机制结合的列生成启发式方法,在包含572名乘务员的实际案例中平均满足95.2%员工的公平规则。

Abstract

Passenger railway operators typically employ large numbers of drivers and guards, and are interested in providing them with fair and attractive working conditions. At Netherlands Railways (NS), the largest passenger railway operator in The Netherlands, this challenge is addressed through the use of Sharing-Sweet-and-Sour rules, which specify a fair allocation of sweet (attractive) and sour (unattractive) work over the different crew bases. While these rules are currently implemented at the crew base level and in the tactical planning phase, NS is considering formulating these rules at the individual level, in the operational planning phase, and with respect to a given planning period. This gives rise to a new problem, which we call the railway crew planning problem with fairness over time. We propose a rolling horizon approach with a penalty-based feedback mechanism and a column generation heuristic to solve this problem. On several real-life instances from NS, including up to 572 unique guards, this method is able to satisfy the individual rules for on average 95.2% of the employees.

铁路运营排班优化公平性列生成启发式