带软时间窗的混合车队车辆路线问题的模型和算法研究  

Model and Algorithms for Mixed Fleet Vehicle Routing Problem with Soft Time Windows

作　　者：袁庆达[1] 杜文[1] 周再玲[1] 

机构地区：[1]西南交通大学交通运输学院,四川成都610031

出　　处：《西南交通大学学报》2001年第4期401-406,共6页Journal of Southwest Jiaotong University

摘　　要：将典型的车辆路线问题扩展为综合考虑了客户具有软时间窗约束和中央仓库拥有多种类型配送车辆的情况。在构造了问题的数学模型后，着重阐述了求解本问题的ＴＳ算法设计过程。最后结合适应性记忆过程给出了ＴＳ算法的伪代码描述和一个算法。The typical vehicle routing problem is expanded to the situation that customers have the restriction of soft time windows and a depot has various kinds of vehicles to distribute. After constructing a mathematical model for the problem, this paper focuses on the introduction of the design procedure of TS algorithm for solving the problem. And then, combined with the adaptive memory procedure, the pseudo-code description of rs algorithm and an example are presented.

关 键 词：货物流通 软时间窗 TS算法 适应性记忆过程 车辆配送路线 运筹学 

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