共 32 条
- [1] Dantzig G.B., Ramser J.H., The truck dispatching problem, Management Science, 6, 1, pp. 80-91, (1959)
- [2] Fischetti M., Toth P., Vigo D., A branch-and-bound algorithm for the capacitated vehicle routing problem on directed graphs, Operations Research, 42, 5, pp. 846-859, (1994)
- [3] Fisher M.L., Optimal solution of vehicle routing problems using minimum K-trees, Operations Research, 42, 4, pp. 626-642, (1994)
- [4] Christofides N., Mingozzi A., Toth P., Space state relaxation procedures for the computation of bounds to routing problems, Networks, 11, 2, pp. 145-164, (1981)
- [5] Clarke G., Wright J.W., Scheduling of vehicles from a central depot to a number of delivery points, Operations Research, 12, 4, pp. 568-581, (1964)
- [6] Bramel J., Simchi-Levi D., A location based heuristic for general routing problems, Operations Research, 43, 4, pp. 649-660, (1995)
- [7] Osman I.H., Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem, Annals of Operations Research, 41, 4, pp. 421-451, (1993)
- [8] Bullnheimer B., Hartl R.F., Strauss C., An improved ant system algorithm for the vehicle routing problem, Annals of Operations Research, 89, 1, pp. 319-328, (1999)
- [9] Barker B.M., Ayechew M.A., A genetic algorithm for the vehicle routing problem, Computers & Operations Research, 30, 5, pp. 787-800, (2003)
- [10] Marinakis Y., Iordanidou G., Marinaki M., Particle swarm optimization for the vehicle routing problem with stochastic demands, Applied Soft Computing, 13, 4, pp. 1693-1704, (2013)