禁忌搜索算法解决VRP 学习攻略

第一步： 中文资料，简单了解什么是TS算法。

邢文训. 现代优化计算方法 [M]. 2nd ed. 北京: 清华大学出版社, 2007.

第二步：英文综述

Toth P., Vigo D. The vehicle routing problem [M]. Society for Industrial Mathematics, 2002.

有关metaheuristic一章

第三步：Gendreau的文献

1）禁忌搜索

Gendreau M., Hertz A., Laporte G. A tabu search heuristic for the vehicle routing problem [J]. Management Science, 1994: 1276-1290.

2）初始解的构造——GENIUS算法

 Gendreau M., Hertz A., Laporte G. New insertion and postoptimization procedures for the traveling salesman problem [J]. Operations research, 1992: 1086-1094.

第四步：TS for VRP with split delivery and time window

Ho S. C., Haugland D. A tabu search heuristic for the vehicle routing problem with time windows and split deliveries [J]. Computers & Operations Research, 2004, 31(12): 1947-1964.