• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Journal of Intelligent Manufacturing >Personnel scheduling in a complex logistic system: a railway application case
【24h】

Personnel scheduling in a complex logistic system: a railway application case

机译：复杂物流系统中的人员调度：铁路应用案例

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In complex logistic systems, such as transportation systems, dealing with personnel scheduling is a non-trivial task. Duties have to be created and assigned to workers in a way to optimize a certain objective function. In this paper, in particular, we consider the case of scheduling train drivers on a railway subnetwork. Train driver scheduling involves the construction of feasible duties from a set of trips to be carried out by a number of train drivers. Each duty consists of a sequence of trips to be carried out by a single train driver on a single day. The duties should be such that: each trip is covered by at least one duty, each duty satisfies feasibility constraints, additional constraints involving the complete schedule are satisfied, one or several objectives are met. In this paper we focus on minimizing the number of duties and on maximizing the robustness of the obtained schedule for outside disruptions. We present an implicit column generation solution approach. We describe a heuristic procedure to find an initial feasible solution together with a heuristic branch-and-price algorithm based on a dynamic programming algorithm for the pricing-out of columns. We tested our approach on the timetable of the Intercity train series 500, 700, 1600 and 1700 of NS Reizigers, the largest Dutch operator of passengers trains.
机译：在诸如运输系统之类的复杂物流系统中，处理人员调度是一项不小的任务。必须以优化某个目标功能的方式创建职责并将其分配给工人。特别是在本文中，我们考虑了在铁路子网中调度火车司机的情况。火车驾驶员的日程安排涉及由许多火车驾驶员执行的一系列行程中的可行职责的构建。每个任务包括一系列旅行，由一位火车司机在一天之内完成。这些职责应满足以下条件：每次旅行至少要承担一项职责，每个职责都满足可行性约束，满足完整时间表的其他约束，满足一个或多个目标。在本文中，我们专注于最大程度地减少职责数量，并最大化所获得的外部干扰时间表的稳健性。我们提出一种隐式列生成解决方案方法。我们描述了一种启发式程序，以找到初始可行的解决方案，以及基于列定价的动态规划算法的启发式分支价格算法。我们在荷兰最大的旅客列车运营商NS Reizigers的城际列车500、700、1600和1700系列的时间表上测试了我们的方法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号