TS算法视域下物流配送车辆优化调度问题研究  

A TS Algorithm Perspective on Optimal Dispatching of Distribution Vehicles

作　　者：陈晓明[1] 

机构地区：[1]广东司法警官职业学院,广东广州510520

出　　处：《物流技术》2012年第6期86-88,共3页Logistics Technology

基　　金：广东省自然科学基金项目(101754539192000000)

摘　　要：针对传统TS算法的全局寻优能力受限于初始解的质量的缺陷,提出了一种基于改进TS算法并采用C-W算法获得初始解来解决物流配送车辆优化调度问题。首先,定义了车辆调度问题的数学模型,在此基础上提出了一种采用C-W算法来求初始解的方法,在此基础上定义了禁忌算法的禁忌表结构、禁忌长度以及领域的构造,从而定义了一种改进的TS算法。仿真实验证明该方法能有效地解决带时间窗的车辆调度问题,且与传统的TS算法相比,本方法在求解质量和寻优效率上有大幅提高。In view that the global optimizing ability of the traditional TS algorithm is restricted by the quality of the initial solution, we have proposed in this paper an improved version of the TS algorithm and adopted the C-W algorithm to calculate the initial solution of the optimal vehicle dispatching problem. First of all we have defined the mathematical model of the vehicle dispatching problem, on the basis of which we used the C-W algorithm to obtain its initial solution, defined the table, length and structure of the tabu of the tabu algorithm and formulated the improved TS algorithm. A simulated experiment demonstrated that this method could effectively solve the vehicle dispatching problem with time window and was more efficient in solution and optimization than the traditional TS approach.

关 键 词：车辆调度 禁忌算法 时间窗约束 

分 类 号：F570.6[经济管理—产业经济]