Crew Scheduling Problem

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.

机组编排属于典型的组合优化问题，具有情况复杂、数据量大、优化目标和限制条件多等特点，通常采用分段解决。