Heurístico para los problemas de rutas con carga y descarga en sistemas LIFO
暂无分享,去创建一个
[1] Joaquín Antonio Pacheco Bonrostro. Problemas de rutas con carga y descarga en sistemas lifo: soluciones exactas , 1995 .
[2] Richard M. Karp,et al. The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..
[3] François Soumis,et al. Implantation et complexité des techniques de programmation dynamique dans les méthodes de confection de tournées et d'horaires , 1991 .
[4] Charlotte Diane Jacobs. The vehicle routing problem with backhauls , 1987 .
[5] Arthur V. Hill,et al. An algorithm for the traveling salesman problem with pickup and delivery customers , 1985 .
[6] Paolo Toth,et al. State-space relaxation procedures for the computation of bounds to routing problems , 1981, Networks.
[7] Lawrence Bodin,et al. Approximate Traveling Salesman Algorithms , 1980, Oper. Res..
[8] Marius M. Solomon,et al. Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..
[9] Bruce L. Golden,et al. VEHICLE ROUTING WITH BACKHAULS: MODELS, ALGORITHMS, AND CASE STUDIES. VEHICLE ROUTING: METHODS AND STUDIES. STUDIES IN MANAGEMENT SCIENCE AND SYSTEMS - VOLUME 16 , 1988 .
[10] Shen Lin. Computer solutions of the traveling salesman problem , 1965 .
[11] K. Nurmi. Travelling salesman problem tools for microcomputers , 1991, Comput. Oper. Res..
[12] M M Solomon,et al. VEHICLE ROUTING AND SCHEDULING PROBLEMS WITH TIME WINDOW CONSTRAINTS: EFFICIENT IMPLEMENTATIONS OF SOLUTION IMPROVEMENT PROCEDURES , 1988 .
[13] Richard M. Karp,et al. The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..
[14] H. Psaraftis. An Exact Algorithm for the Single Vehicle Many-to-Many Dial-A-Ride Problem with Time Windows , 1983 .
[15] M. Goetschalckx,et al. The vehicle routing problem with backhauls , 1989 .
[16] R. Jonker,et al. A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation , 1982 .