Clarke, G, J WWright.Scheduling of Vehi cles from a Central Depot to a Number of Delivery Points ［J］.Operat ions Research, 1964, 12 :568 -581.
[2]
Golden, B, Assad A, Levy L, Gheysens F.The Fleet Size and Mix Vehicle Routing Problem ［J］.Computers and Operations Research,1984, 11 :49 -66.
[3]
Desrochers, M, Verhoog, T W.A New Heuristic for the Fleet Size andMix Vehicle Routing Problem ［J］.Computers and Operations Research, 1991, 18 :263 -274.
[4]
Fisher, M, Jaikumar M.A Generaliz-ed Assignment Heuristic for Vehicle Routing ［J］.Networks, 1981, 11:109 -124.
[5]
Gheysens, F, Golden B, Assad A.A Comparison of Techniques for Solving The Fleet Size and Mix Vehicle Rout ing Problem ［J］.Operations research Spektrum, 1984, 6 :207-216.
[6]
R Netwon, W Thomas.Bus Routing in A Multi-school System ［J］.Computers and Operations Research, 1974, 1 :213 -222.
[7]
B Goldon, L Bodin, T Doyle, WStewart.Approximate Traveling Salesman Algorithms ［J］.Operations Research, 1980, 28:694 -711.
[8]
Gendreau, M, Laporte G, Musaraganyi Ch, Tail lard E.A Tabu Search Heuristi c for The Heterogeneous Fleet Vehi cle Routing Problem ［J］.Computers and Operations Research, 1999, 26 :1153 -1173.
[9]
M Gendreau, A Hertz,.Laporte.New Insertion and Postoptimization Procedures for The Traveling Salesman Problem ［J］.Operations Research, 1992, 40 :1086 -1094.
[10]
Taillard E D.A heuri stic Column Generation Method for Heterogeneous Fleet ［J］.Recherche-Operationnelle, 1999, 33 :1 -14.
