Author:
Okude Mariko,Taniguchi Eiichi
Reference21 articles.
1. Augerat, P., Belenguer, J.M., Benavent, E., Corberán, A., Naddef, D., and Rinaldi, G. (1995). Domputional results with a branch and cut code for the capacitated vehicle routing problem. Research Report 949-M, Université Joseph Fourier, Grenoble, France.
2. Badeau, P., Gendreau, M., Guertin, F., Potvin, J.Y. and Taillard, E.D. (1997). A parallel tabu search heuristic for the vehicle routing problem with time windows. Tranportation Research C: Emerging Techbologies, 5(2), 109-122.
3. Cerny, V. (1985). Thermodynamicl approach to the traveling salesman problem: An efficient simulation algorithm. Journal of Optimization Technology and Application, 45, 41-51.
4. Clarke, G. & Wright, J.W. (1964). Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 12, 568-581.
5. Croes, G.A. (1958). A method for solving travelling-salesman problems. Operations Research,, 6, 791-812.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献