论文部分内容阅读
校车服务有单校、多校不混载和多校混载等多种运营模式,规划路径时考虑的约束条件和目标不同衍生出多种校车路径问题(SBRP)的应用场景.SBRP属于NP问题,中大规模的应用基本都是采用启发式算法求解.在分析SBRP问题模型的基础上,总结元启发算法的特征,设计一个针对SBRP的元启发算法框架.该框架能够支持三种运营模式、不同的约束条件、单目标或多目标问题求解.最后利用框架直接构建具体应用的元启发求解算法,采用国际标准案例库对算法进行验证.结果表明基于框架可以快速地实现不同应用场景下SBRP的元启发算法.
School bus service has many operating modes, such as single school, multi-school unmixed and multi-school mixed, and the SBRP scenarios derived from the constraints and goals considered when planning the path.SBRP belongs to the NP problem , Large and medium-sized applications are basically solved by heuristic algorithm.Based on the analysis of the SBRP problem model, this paper summarizes the characteristics of meta-heuristic algorithm and designs a meta-heuristic algorithm framework for SBRP.This framework can support three operating modes, Different constraints, single-objective or multi-objective problem solving.Finally, we use the framework to construct a meta-heuristic solution algorithm for specific applications and validate the algorithm by using the international standard case base.The results show that SBRP can be quickly implemented in different application scenarios based on the framework Meta-inspired algorithm.