1G. Laporte, Y. Nohert and D. Arpin. Optimal Solutions to capacitated vehicle routing problems[J]. Congressus Numerantium 1984, 44: 283～292.
2G. Laporte, Y. Nohert and S. Taillefer, Solving a family of multi-depot vehicle routing and location-routing problems[J]. Transp. Sci. 1988, 22: 161～172.
3F. A. Tillman. The multiple terminal delivery problem with probabilistic demands[J]. Transp.Sci. 1969, (3): 192～204.
4A. Wren and A. Holliday. Computer scheduling of vehicles from one or more depots to a number of delivery points[J]. Opns Res. Q. 1972, 23: 333～344.
5B. L. Golden, T. L. Magnanti and H. Q. Nguyen. Implementing vehicle routing algorithms[J].Networks, 1973, (7): 113～148.
6I. M. Chao, B. L. Golden and E. Wasil. A new heuristic for the multi-depot vehicle routing problem that improves upon best-known solutions[J]. Am, J, Math, Mgmt. Sci. 1983, 13:371～406.
7O. M. Raft. A modular algorithm for an extended vehicle scheduling problem[J]. Eur. J. Opl Res. 1982, (11): 67～76.
