Improved modeling and solution methods for the multi-resource routing problem
暂无分享,去创建一个
Guangming Zhang | Peter Francis | Karen R. Smilowitz | K. Smilowitz | Guangming Zhang | Peter Francis
[1] Roberto Baldacci,et al. The Rollon-Rolloff Vehicle Routing Problem , 2000, Transp. Sci..
[2] Moshe Dror,et al. Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW , 1994, Oper. Res..
[3] Jacques Desrosiers,et al. The Pickup and Delivery Problem with Time Windows , 1989 .
[4] BräysyOlli,et al. Vehicle Routing Problem with Time Windows, Part II , 2005 .
[5] Philippe Flajolet,et al. Mathematics and Computer Science Iii: "Algorithms, Trees, Combinatorics And Probabilities" , 2004 .
[6] Jonathan F. Bard,et al. A GRASPTM for a difficult single machine scheduling problem, , 1991, Comput. Oper. Res..
[7] H. D. Ratliff,et al. Set partitioning based heuristics for interactive routing , 1981, Networks.
[8] J. Wesley Barnes,et al. Solving the Pickup and Delivery Problem with Time Windows Using Reactive Tabu Search Transportation , 2000 .
[9] Barry L. Nelson,et al. Two-Stage Multiple Comparisons with the Best for Computer Simulation , 1995, Oper. Res..
[10] Sigurdur Olafsson,et al. Simulation optimization , 2002, Proceedings of the Winter Simulation Conference.
[11] Barrie M. Baker,et al. A Grasp Interactive Approach to the Vehicle Routing Problem with Backhauls , 2002 .
[12] Martin Desrochers,et al. A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..
[13] L. De Meulemeester,et al. Optimal sequencing of skip collections and deliveries , 1997 .
[14] David J. Goodman,et al. Personal Communications , 1994, Mobile Communications.
[15] Michel Gendreau,et al. Vehicle Routing Problem with Time Windows, Part II: Metaheuristics , 2005, Transp. Sci..
[16] Zhi-Long Chen,et al. Solving a Practical Pickup and Delivery Problem , 2003, Transp. Sci..
[17] Martin W. P. Savelsbergh,et al. Drive: Dynamic Routing of Independent Vehicles , 1998, Oper. Res..
[18] Brian Kallehauge,et al. The Vehicle Routing Problem with Time Windows , 2006, Vehicle Routing.
[19] M. Resende,et al. A probabilistic heuristic for a computationally difficult set covering problem , 1989 .
[20] Sigurdur Ólafsson,et al. Simulation optimization: simulation optimization , 2002, WSC '02.
[21] E. K. Morlok,et al. Approaches to improving drayage in rail-truck intermodal service , 1995, Pacific Rim TransTech Conference. 1995 Pacific Rim TransTech Conference Proceedings. A Ride into the Future.
[22] Martin W. P. Savelsbergh,et al. The General Pickup and Delivery Problem , 1995, Transp. Sci..
[23] Lawrence Bodin,et al. PLANNING FOR TRUCK FLEET SIZE IN THE PRESENCE OF A COMMON‐CARRIER OPTION , 1983 .
[24] Martin W. P. Savelsbergh,et al. Efficient Insertion Heuristics for Vehicle Routing and Scheduling Problems , 2004, Transp. Sci..
[25] James T. Moore,et al. A Hybrid Tabu Search/Set Partitioning Approach to Tanker Crew Scheduling , 2004 .
[26] M. Silaghi,et al. A new optimization algorithm , 2000 .
[27] Prabhakant Sinha,et al. The Multiple-Choice Knapsack Problem , 1979, Oper. Res..
[28] Leyuan Shi,et al. An Integrated Framework For Deterministic And Stochastic Optimization , 1997, Winter Simulation Conference Proceedings,.
[29] Karen Renee Smilowitz,et al. Multi-resource routing with flexible tasks: an application in drayage operations , 2006 .
[30] Moshe Dror,et al. Complexity issues for a redistribution problem , 2000 .
[31] Andrew Lim,et al. SOLVING THE PICKUP AND DELIVERY PROBLEM WITH TIME WINDOWS USING iSSQUEAKY WHEELli OPTIMIZATION WITH LOCAL SEARCH , 2002 .
[32] Jonathan F. Bard,et al. A GRASP for the Vehicle Routing Problem with Time Windows , 1995, INFORMS J. Comput..
[33] Philip Kilby,et al. Vehicle Routing Problem with Time Windows , 2004 .