论文部分内容阅读
研究一类随机旅行时间的区域公交车辆调度问题,将该问题看作为“部分班次被一辆车完成”的集合划分问题,考虑不同车场容量和补充燃料等约束因素,建立以营运费用最小为目标的机会约束规划数学模型。将该模型转化为一类确定性数学模型,设计求解该问题的改进遗传算法,根据问题特征定义染色体编码、产生初始种群的启发式算法、交叉和变异操作等。最后,通过一个算例验证了模型和算法的正确性。
This paper studies a class of regional bus scheduling problem with random travel time and considers the problem as a set division of “partial shifts completed by one car”. Considering constraints such as different yard capacity and supplementary fuel, As the goal of the mathematical model of opportunity constraints planning. The model is transformed into a deterministic mathematical model, and an improved genetic algorithm is designed to solve the problem. Chromosomal coding is defined according to the characteristics of the problem, heuristic algorithm to generate initial population, crossover and mutation operations, and so on. Finally, an example is used to verify the correctness of the model and the algorithm.