首页 | 本学科首页   官方微博 | 高级检索  
     

有软时窗约束带取送作业的车辆路径问题及其禁忌搜索算法研究
引用本文:段凤华,符卓.有软时窗约束带取送作业的车辆路径问题及其禁忌搜索算法研究[J].计算机工程与科学,2009,31(3).
作者姓名:段凤华  符卓
作者单位:中南大学交通运输工程学院,湖南,长沙,410075
摘    要:有软时窗约束带取送作业的车辆路径问题是在基本的车辆路径问题上增加了取送作业和时间窗约束的一种变化形式,是一个典型的NP-难问题.本文建立了问题模型,运用改进的禁忌搜索算法测试了根据实际状况构造的一个大规模算例.快速获得的高质量解验证了模型的正确性和算法性能的优良性.

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

Reseach on the Vehicle Routing Problem with Pickup and Delivery Soft Time Windows and Its Tabu Search Algorithm
DUAN Feng-hua,FU Zhuo.Reseach on the Vehicle Routing Problem with Pickup and Delivery Soft Time Windows and Its Tabu Search Algorithm[J].Computer Engineering & Science,2009,31(3).
Authors:DUAN Feng-hua  FU Zhuo
Affiliation:School of Traffic and Transportation Engineering;Central South University;Changsha 410075;China
Abstract: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 e...
Keywords:pickup and delivery  vehicle routing problem  soft time windows  tabu search algorithm  
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号