论文部分内容阅读
本文待区域公交车辆调度问题为“部分班次被一辆车完成”的集合划分问题,考虑车场容量、允许车辆加油及每辆车任务可靠度不低于某值等现实因素,建立以车辆数、车辆等待和空驶时间最小为目标的混合整数规划模型。根据问题特征,设计求解该问题的蚁群算法,在构建人工蚂蚁随机游走的图基础上定义解构建规则、信息素和启发式信息等。最后,通过一个算例验证模型和算法的正确性。
In this paper, the regional bus scheduling problem to be “part of the shift is completed by a car ” set division, taking into account the yard capacity, allow vehicles to refuel and each vehicle mission reliability is not less than a certain value and other realistic factors, the establishment of vehicles Number, vehicle waiting time and minimum driving time as the goal of the mixed integer programming model. According to the characteristics of the problem, the ant colony algorithm is designed to solve the problem, and the rules of deconstruction, pheromone and heuristic information are defined on the basis of building a random walk map of artificial ant. Finally, an example is used to verify the correctness of the model and algorithm.