乘务计划问题（Crew Scheduling Problem）是各种交通方式均需面临的问题， 如航空、公交、铁路运输、城市轨道交通等，如何快速高效地获取合理优化的乘 务计划是许多专家学...
基于20个网页-相关网页
This essay based with the recent study of crew scheduling problem. First of all, the essay introduces the flow of crew scheduling, it also analyses the key point and technology to solve the problem.
本文在分析国内外研究的基础上,首先详细论述了机组排班的主要流程,分析了机组配对、人员分组和机组指派等关键环节和技术。
参考来源 - 航班机组自动编排研究及实现·2,447,543篇论文数据，部分数据来源于NoteExpress
Crew pairing is one sub-problem of crew scheduling which finds one flight route and cover all flights, the most important is that the problem requires the lowest operation cost.
机组任务配对是机组排班问题中主要的一个子问题，发现一组往返飞行航线并且覆盖所有的航班，最重要的是要求运营成本最低。
Crew scheduling is always an important problem in the field of transportation, railway airways urban transportation departments have been searching for the reasonable methods of crew scheduling.
乘务计划编制在交通运输领域始终是一个重要问题，铁路、航空、城市交通部门不断寻找合理的乘务计划编制方法。
The crew scheduling belongs to the typical combination-optimization problem and has some traits such as complexity, huge data, multi-aims and multi-restriction. It is usually solved by subsection.
机组编排属于典型的组合优化问题，具有情况复杂、数据量大、优化目标和限制条件多等特点，通常采用分段解决。
应用推荐