求解区域公交车辆调度问题的蚁群算法研究  

Ant Colony Algorithm for Regional Bus Scheduling Problem

作　　者：魏明[1] 靳文舟[1] 孙博[1] 

机构地区：[1]华南理工大学土木与交通学院,广东广州510640

出　　处：《公路交通科技》2011年第6期141-145,152,共6页Journal of Highway and Transportation Research and Development

基　　金：国家高技术研究发展计划(八六三计划)项目(2007AA11Z201);国家自然科学基金项目(50878089);华南理工大学中央高校基本科研业务费项目(2009ZM0275)

摘　　要：本文待区域公交车辆调度问题为"部分班次被一辆车完成"的集合划分问题,考虑车场容量、允许车辆加油及每辆车任务可靠度不低于某值等现实因素,建立以车辆数、车辆等待和空驶时间最小为目标的混合整数规划模型。根据问题特征,设计求解该问题的蚁群算法,在构建人工蚂蚁随机游走的图基础上定义解构建规则、信息素和启发式信息等。最后,通过一个算例验证模型和算法的正确性。Regional bus scheduling,treated as a ＂part of trips completed by a vehicle＂ set-partitioning problem,was formulated as a mixed integer programming model where some side constraints such as depot capacity,fuelling and a high reliability of bus task,etc.were considered to minimize number of buses,total waiting and deadhead time for all vehicles.According to the features of bus scheduling,the ant colony algorithm for solving the abovementioned problem was designed,new heuristic information,pheromone and transition rules,etc.based on graph for artificial ants randomized walks were defined.Finally,an example verified the model and its algorithm＇ correctness and effectiveness.

关 键 词：交通工程 区域公交车辆调度问题 蚁群算法 车辆任务可靠度 集合划分问题 

分 类 号：U491[交通运输工程—交通运输规划与管理]