Hybrid Approaches for the Vehicle Routing Problem with Time Windows in Logistics Management

摘要：

Based on the previous literature, the vehicle routing problem with time windows is considered in this paper. Here a hybrid algorithm for the proposed problem is designed to minimize the vehicle number and total travel distance. Performances are compared with other heuristics that appeared in the literature recently by the bench-mark data sets. The computational results show the proposed approaches produce high quality results within a reasonable computing time.

关键词： logistics management vehicle routing problem with time windows sweeping algorithm tabu search

作者: BigangHong

作者单位: Economics and Management Department Shaoyang University Shaoyang P.RXhina 422000

会议类型: 国际会议

会议名称: 2010 International Conference on Computer and Communication Technologies in Agriculture Engineering(计算机与通信技术在农业工程国际会议 CCTAE 2010)

会议地点: 成都

会议语种:英文

页码: 219-222

在线出版日期: 2010-06-12（万方平台首次上网日期，不代表论文的发表时间）