An effective meta-heuristics for the vehicle routing problem with time windows

摘要：

The vehicle routing problem with time windows (VRPTW) is a well-known and complex combinatorial problem, which has received considerable attention in recent years. In this paper, an effective meta-heuristics for VRPTW was designed to minimize the vehicle number and total travel distance. Performances are compared with other heuristics appeared in the literature recently by the bench-mark data sets. The computational results show that the proposed approaches produce high quality results within a reasonable computing time.

关键词： vehicle routing problem with time windows meta-heuristics optimization

作者: Shan-liang Hu

作者单位: Economics and Trade College Hunan University Hunan China, 410079

会议类型: 国际会议

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

会议地点: 成都

会议语种:英文

页码: 156-159

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