摘要
研究车辆调度优化问题,考虑时间能合理安排运输线路。针对传统的蚁群算法收敛速度慢、易陷于局部最优、影响优化调度线路识别等缺陷,提出了一种改进的蚂蚁算法车辆调度优化方法模型。对城市车辆调度建立优化数学模型,将车辆运行调度归并为制造系统中的FLOWSHOP调度问题,构建一种动态开放的车辆调度系统优化模型,并采用改进的蚂蚁算法对数学模型进行仿真。仿真结果表明,提出的新的算法不仅能有效的求解车辆调度优化模型,可以快速得到近似最优解,而且计算机复杂度较低,收敛速度较快,是一种有效地车辆调度优化手段。
Research on vehicle scheduling problems.Transportation costs and the traditional ant colony algorithm has the defects of low convergence speed and easy to trapped in local optimum.The authors gave an improved ant colony algorithm of vehicle routing optimization model.First,the urban vehicle scheduling optimization model was established,the actual scheduling of vehicles was from the city of departure,and the vehicle operation scheduling was incorporate into FLOWSHOP in manufacturing scheduling to build a dynamic and open vehicle scheduling system optimization model and the improved ant algorithm was used for solving the mathematical model.Simulation results show that the new algorithm can effectively build the vehicle scheduling optimization model and quickly get the approximate optimal solution,and the computer has low complexity,fast convergence and is an effective vehicle scheduling algorithm.
出处
《计算机仿真》
CSCD
北大核心
2011年第10期366-369,共4页
Computer Simulation
关键词
车辆调度
蚂蚁算法
优化模型
Vehicle scheduling
Ant algorithm
Optimization model
