CAJ | 학술논문

公交车辆人员排班的主要问题就是在给定时间点和车次数的情况下，以最小代价覆盖所有的车次。与以往都是针对单类型车辆的人员排班不同，该文主要提供对多类型的车辆人员排班的支持。首先利用高效的Auction算法获取代价最小的车次分组并根据分组情况分配车辆的营运类型；然后使用遗传算法进行随机化搜索以获得最优解。实验表明，遗传算法应用于多类型的公交车辆人员排班具有很好的效果。
공교차량인원배반적주요문제취시재급정시간점화차차수적정황하，이최소대개복개소유적차차。여이왕도시침대단류형차량적인원배반불동，해문주요제공대다류형적차량인원배반적지지。수선이용고효적Auction산법획취대개최소적차차분조병근거분조정황분배차량적영운류형；연후사용유전산법진행수궤화수색이획득최우해。실험표명，유전산법응용우다류형적공교차량인원배반구유흔호적효과。
The main problem of the scheduling of the public transport vehicles and personnel is that, at a given time and number of vehicle cases, minimal cost cover all of the trips. With formerly was aimed at the single type of vehicles scheduling differently, this article mainly provides the support of multiple types of vehicles and personnel scheduling. Firstly, it use efficient Auction algo?rithms to obtain the least costly group trips, and assigned vehicle types according to the groupings;then use a random search of ge?netic algorithm to obtain the optimal solution. Experimental results show that it has very good results that the genetic algorithm is applied to multiple types of public vehicles and personnel scheduling.