基于乘务广义费用的城市轨道交通排班

以上海城市轨道交通为背景,研究了城市轨道交通乘务排班软件的优化方法.在引入乘务广义费用实现多目标优化的基础上,将实际的城市轨道交通乘务排班优化问题分为日班和夜班两部分解决.夜班归结为一个简单二分双向匹配问题,用Hungarian算法求解.主要讨论了日班在总费用最小的目标下,用禁忌搜索法（TS）求解.对乘务作业段的定义与划分、乘务广义费用的计算、TS算法和计算过程等,都进行了详细的阐述.

An Optimal Wide Crew-Related Costs-Based Scheduling for Crew of Urban Rail Transportation

Based on a study of Shanghai urban rail transit, this paper investigates an optimization appreach to crew scheduling by adopting the concept of wide crew-related costs for multiple optimization objectives. The approach involves a bipartite matching problem solved by Hungarian algorithm for the generation of evening duties and a minimizing problem solved by Tabu search optimization method for the generation of day duties. Comparatively speaking, solving the generation of evening duties is fairy easy, so the paper mainly discusses the optimization problem of day duties. At the same time, work- piece defining and cutting and the calculation of wide crew-related costs, and the process of Tabu search optimization method are discussed in details.