有软时窗约束带取送作业的车辆路径问题及其禁忌搜索算法研究  

Reseach on the Vehicle Routing Problem with Pickup and Delivery Soft Time Windows and Its Tabu Search Algorithm

作　　者：段凤华[1] 符卓[1] 

机构地区：[1]中南大学交通运输工程学院,湖南长沙410075

出　　处：《计算机工程与科学》2009年第3期68-70,74,共4页Computer Engineering & Science

基　　金：国家自然科学基金资助项目(70671108)

摘　　要：有软时窗约束带取送作业的车辆路径问题是在基本的车辆路径问题上增加了取送作业和时间窗约束的一种变化形式,是一个典型的NP-难问题。本文建立了问题模型,运用改进的禁忌搜索算法测试了根据实际状况构造的一个大规模算例。快速获得的高质量解验证了模型的正确性和算法性能的优良性。The vehicle routing problem with pickup and delivery soft time windows （VRPPDSTW） is a variation of the vehicle routing problem constrained by pickup and delivery soft time windows, which is a typical NP-hard problem. The mathematical model of the problem is built, and a large-scale example of the problem is constructed according to actual conditions, and a new improved TS is designed to solve the problem. The excellent computational results of examples obtained quickly show the correctness of the model and the excellence of the algorithm.

关 键 词：物流配送 车辆路径问题 软时间窗 禁忌搜索算法 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]