Author:
Delgado Serna Cristina R.,Pacheco Bonrostro Joaquín
Publisher
Springer Berlin Heidelberg
Reference45 articles.
1. Bentley, J.L. (1992). Fast algorithms for geometric traveling salesman problems. ORSA Journal on Computing 4, 387–411.
2. Bodin, L.D. and B.L. Golden (1981). Classification in vehicle routing and scheduling. Networks 11, 97–108.
3. Bullnheimer, B., R.F. Hartl, and C. Strauss (1999). Applying the ant system to the vehicle routing problem. In S. Voß, S. Martello, I.H. Osman, and C. Roucairol (Eds.), Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, Kluwer, Boston, 285–296.
4. Campos, V. and E. Mota (2000). Heuristic procedures for the capacitated vehicle routing problem. Computational Optimization and Applications 16, 265–277.
5. de Backer, B., V. Furnon, P. Shaw, P. Kilby, and P. Prosser (2000). Solving vehicle routing problems using constraint programming and metaheuristics. Journal of Heuristics 6, 501–523.
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献