基于多车型多约束的动态车辆调度算法研究  

Research on Dynamic Vehicle Scheduling Algorithm Based on Multiple Vehicles and Multiple Constraints

作　　者：王阳明[1] 赵利[1] 

机构地区：[1]桂林电子科技大学信息与通信学院,广西桂林541004

出　　处：《计算机工程》2016年第9期305-309,314,共6页Computer Engineering

基　　金：2014年广西科技计划基金资助项目"基于北斗的物联网定位跟踪通信系统的研发及示范应用"(桂科攻14122007-11)

摘　　要：在基于北斗卫星导航的物流管理与运输调度系统中,低成本高效率地实现运输车辆的动态调度是一个重要问题。围绕多车型多约束的动态车辆调度问题优化的主题,在对该类问题进行分析与描述的基础上,通过建立相应的车辆调度问题的数学模型,提出硬性约束条件分类-综合目标函数最优的分阶段算法。仿真结果表明,该算法能够满足多车型的载重和体积硬性约束以及时间窗等约束条件,不仅可以取得较好的调度结果,而且具有寻优速度较快、收敛一致性好的特点。In the logistics management and transport scheduling system based on BeiDou navlgatlon satemte ~ys^em （BDS） ,how to achieve cost-effective dynamic schedulingof transport vehicles is an important issue. This paper focuses on the optimization of dynamic vehicle scheduling based on multiple vehicles and multiple constraints. After analyzing and describing the problem and through the establishment of appropriate mathematical models, this paper proposes staged algorithm of rigid constraint classification-objective function optimization. Simulation results show that the algorithm can fully meet the load and volume requirements of multiple vehicles as well as the time window requirement. It not only can get a good scheduling result but also has the characteristics of faster optimizaing speed and good convergence consistency.

关 键 词：物流管理 动态车辆调度 多车型 多约束 分阶段 

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