车辆调度优化模型仿真研究  

Research on Transit Routes Network Design Based on Improved Genetic Algorithm

作　　者：宋维堂[1] 张淑梅[1] 

机构地区：[1]南京交通职业技术学院电子信息工程系,江苏南京211188

出　　处：《计算机仿真》2011年第9期346-349,共4页Computer Simulation

基　　金：江苏省教育厅2010年度高校哲学社会科学研究基金项目(2010SJB630036)

摘　　要：研究车辆调度优化问题,针对运输车辆的空间排放和时间安排等,要达到运输路径最短,费用最省的要求。为了实现城市车辆优化调度,节约运输成本,同时传统的车辆调度算法存在计算复杂度高,不利于实际应用等问题,提出了一种改进的车辆调度优化算法模型。首先对城市车辆调度建立优化数学模型,建立一种动态开放的车辆调度系统,并采用匈牙利算法对数学模型进行求解。仿真结果表明,提出的新的算法不仅能有效的求解车辆调度优化模型,而且计算机复杂度较低,计算效率较高,收敛速度较快,验证了算法的实用性和有效性。vehicle scheduling problems. In order to achieve optimal operation of city vehicles, saving transport costs, while there is the traditional vehicle scheduling algorithm with high computational complexity, and other issues not conducive to practical applications, an improved optimization algorithm for vehicle scheduling models. First, the establishment of urban vehicle scheduling optimization model, the establishment of a dynamic open vehicle dispatc- hing system, and using the Hungarian algorithm for solving the mathematical model. Simulation results show that the new algorithm can effectively solve the vehicle scheduling optimization model, and the computer low complexity, high computational efficiency, fast convergence to verify the practicability and effectiveness of the algorithm.

关 键 词：车辆调度 线性规划 仿真模型 匈牙利算法 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]