Dynamic and Stochastic Aspects in Vehicle Routing-A Literature Survey
暂无分享,去创建一个
[1] Randolph W. Hall,et al. The Fastest Path through a Network with Random Time-Dependent Travel Times , 1986, Transp. Sci..
[2] Roberto Montemanni,et al. An exact algorithm for the robust shortest path problem with interval data , 2004, Comput. Oper. Res..
[3] Chelsea C. White,et al. Optimal vehicle routing with real-time traffic information , 2005, IEEE Transactions on Intelligent Transportation Systems.
[4] Gilbert Laporte,et al. Waiting strategies for the dynamic pickup and delivery problem with time windows , 2004 .
[5] George M. Giaglis,et al. Minimizing logistics risk through real‐time vehicle routing and mobile technologies: Research to date and future trends , 2004 .
[6] Giovanni Righini,et al. Modelling and optimizing dynamical dial-a-ride problems , 2001 .
[7] Michel Gendreau,et al. Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching , 1999, Transp. Sci..
[8] Jian Yang,et al. Real-Time Multivehicle Truckload Pickup and Delivery Problems , 2004, Transp. Sci..
[9] Mark S. Daskin,et al. Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms , 1992, Transp. Sci..
[10] Martin W. P. Savelsbergh,et al. Drive: Dynamic Routing of Independent Vehicles , 1998, Oper. Res..
[11] Michel Gendreau,et al. Vehicle dispatching with time-dependent travel times , 2003, Eur. J. Oper. Res..
[12] Russell Bent,et al. Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers , 2004, Oper. Res..
[13] Bernhard Fleischmann,et al. Time-Varying Travel Times in Vehicle Routing , 2004, Transp. Sci..
[14] Ali Haghani,et al. A dynamic vehicle routing problem with time-dependent travel times , 2005, Comput. Oper. Res..
[15] Roberto Montemanni,et al. Integration of a robust shortest path algorithm with a time dependent vehicle routing model and applications , 2003, The 3rd International Workshop on Scientific Use of Submarine Cables and Related Technologies, 2003..
[16] Marius M. Solomon,et al. Partially dynamic vehicle routing—models and algorithms , 2002, J. Oper. Res. Soc..
[17] Bernhard Fleischmann,et al. Dynamic Vehicle Routing Based on Online Traffic Information , 2004, Transp. Sci..
[18] L. B. Fu,et al. Expected Shortest Paths in Dynamic and Stochastic Traf c Networks , 1998 .
[19] Oli B. G. Madsen,et al. A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives , 1995, Ann. Oper. Res..
[20] Gilbert Laporte,et al. Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem , 2004, Parallel Comput..
[21] Chelsea C. White,et al. Anticipatory Route Selection , 2004, Transp. Sci..
[22] Liping Fu,et al. Scheduling dial-a-ride paratransit under time-varying, stochastic congestion , 2002 .
[23] Martin W. P. Savelsbergh,et al. Efficient feasibility testing for dial-a-ride problems , 2002, Oper. Res. Lett..
[24] Mark E. T. Horn,et al. Fleet scheduling and dispatching for demand-responsive passenger services , 2002 .
[25] Michel Gendreau,et al. Exploiting Knowledge About Future Demands for Real-Time Vehicle Dispatching , 2006, Transp. Sci..
[26] Gilbert Laporte,et al. Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows , 2004 .