公交站场选址布局优化模型和算法

现有研究没有将公交站场选址和线路车辆停放调度作为一个整体，无法发挥整个公交系统的最大效率.针对此缺陷，根据不同线路的首末站在时间和空间上的停车需求不平衡性，综合考虑车场能力、建设成本和最大里程等现实因素，以极小化所有公交车的行驶里程为目标，建立一种公交站场选址布局优化模型，确定站场的最佳位置和泊位数，将各线路的所有车辆安排至相应站场.根据问题特征，设计求解该问题的两阶段启发式算法，给出了具体求解流程，并分析其计算复杂性.最后，结合一个算例，计算最佳的公交站场选址方案，分析参数灵敏性对其布局的影响程度，从而验证模型和算法的有效性.

Model and Algorithm for Bus Parking Site Layout Optimization Problem

Existing studies have not integrated bus station parked vehicle location and route scheduling as a whole, which cannot maximize the efficiency of the entire transit system. For the imbalance in time and space of number of parking vehicles belonged to all of start- end stops, this paper studies a mixed integer programming model for bus parking site layout optimization problem. The model involves how to determine the best location and the number of parking station, and arrange all vehicles belong to each route to the appropriate parking station. The objective is to minimize a total of round- trip mileages for all buses from start-end stops to parking stations, where some realistic constraints such as station' s capacity, construction costs and maximum mileage etc are considered. According to characteristic of the model, a two-stage heuristic algorithm, which gives specific solving process and analyzes its computational complexity, is proposed to obtain the model' s non-inferior solutions. Finally, a numerical example is taken to calculate its best scheme and analyze influence of parameters' sensitivity on them, which shows model and its algorithm' correctness and effectiveness.