A heuristic for the pickup and delivery traveling salesman problem
暂无分享,去创建一个
[1] Martin Grötschel,et al. Solution of large-scale symmetric travelling salesman problems , 1991, Math. Program..
[2] Shen Lin. Computer solutions of the traveling salesman problem , 1965 .
[3] Arthur V. Hill,et al. An algorithm for the traveling salesman problem with pickup and delivery customers , 1985 .
[4] Gerhard Reinelt,et al. TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..
[5] Giovanni Rinaldi,et al. A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems , 1991, SIAM Rev..
[6] Michel Gendreau,et al. The Traveling Salesman Problem with Backhauls , 1996, Comput. Oper. Res..
[7] Gilbert Laporte,et al. New Insertion and Postoptimization Procedures for the Traveling Salesman Problem , 1992, Oper. Res..
[8] Harilaos N. Psaraftis. Analysis of an O(N2) heuristic for the single vehicle many-to-many Euclidean dial-a-ride problem , 1983 .
[9] M. Savelsbergh. An efficient implementation of local search algorithms for constrained routing problems , 1990 .
[10] Gilbert Laporte,et al. A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem , 1996, INFORMS J. Comput..
[11] Geoffrey Zweig. An Effective Tour Construction and Improvement Procedure for the Traveling Salesman Problem , 1995, Oper. Res..
[12] Harilaos N. Psaraftis,et al. k-Interchange procedures for local search in a precedence-constrained routing problem , 1983 .
[13] Martin W. P. Savelsbergh,et al. The General Pickup and Delivery Problem , 1995, Transp. Sci..
[14] P. Healy,et al. A new extension of local search applied to the Dial-A-Ride Problem , 1995 .
[15] Harilaos N. Psaraftis,et al. A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem , 1980 .