时间窗约束下的非满载车辆优化调度算法研究  

Algorithm Study on Optimization of Vehicle Dispatching Under the Time Windows and Vehicle Capacity Constraints

作　　者：许传达 高永攀[2] 刘军杰[2] 涂黎明[2] 

机构地区：[1]65639部队 [2]军事交通学院

出　　处：《物流科技》2008年第11期28-31,共4页Logistics Sci-Tech

摘　　要：在车辆优化调度问题上,文章将配送车辆根据任务的性质分成满载和非满载两类问题。针对时间窗约束下的非满载车辆优化调度问题,同时考虑特定的时间窗和车辆容量、行驶距离等约束条件,运用数学规划理论对其进行了研究。并在分析其数学模型的基础上,给出了实例分析,对提高物流配送效率和降低成本具有重要意义。On the problem of optimization of vehicle dispatching optimizing, this thesis studying on the distribution freight vehicle, analyses two problems named as full loaded vehiclescheduling problem and non-full loaded vehicle scheduling problem which are classed by the property of the task. ＂For resolving the OVD problem under the time windows and vehicle capacity constraints, as the same time, taking special restrictions such as time window, the capability of vehicle and the run distance into account, the theory of mathematical programming is used. By analyzing the mathematical model of the OVD, its practical example is given, and it is very important to improve the efficiency of logistics distribution and reduce cost.

关 键 词：时间窗 算法 车辆优化调度 

分 类 号：F224[经济管理—国民经济]