基于蚁群算法的车辆调度问题  

Research on Vehicle Scheduling Problem Based on Ant Colony Algorithm

作　　者：王建玲[1] 齐紫茜 何璐[1] 

机构地区：[1]上海海洋大学工程学院,上海201306

出　　处：《交通科技与经济》2014年第6期37-39,94,共4页Technology & Economy in Areas of Communications

摘　　要：根据蚁群算法的基本原理和数学模型算法,对实际配送问题进行分析,给出解决方案。选用matlab软件对实例进行仿真,仿真出无返回式的配送最短路径;将最短路径进行分区域优化,实现由路况信息和实际需要调配多辆车配送的动态问题。According to the basic principle and mathematical model of ant colony algorithm, we study on the delivery problem and give the solution. Using MATLAB software to simulate the example, no return type distribution of the shortest path is fined; the shortest path partitioned domain optimization, in order to realize of dynamic vehicle scheduling based on the road condition information and the actual needs.

关 键 词：车辆动态调度 蚁群算法 MATLAB仿真 

分 类 号：U492.22[交通运输工程—交通运输规划与管理]