科研之友
微信
新浪微博
Facebook
分享链接
摘要
The vehicle routing problem with backhauls (VRPB) is considered in this paper, and an effective tabu search is proposed for VRPB to minimize the used vehicle number and total travel distance. The proposed approach is compared with the greedy randomised adaptive memory programming search published recently for the same purpose, the results show the high performance and effectiveness of our approach.
- 出版日期2011
- 单位湖南商学院
