Exact and heuristic methods for a full-load, multi-terminal, vehicle scheduling problem with backhauling and time windows
暂无分享,去创建一个
[1] Jean-Yves Potvin,et al. The Vehicle Routing Problem with Time Windows Part I: Tabu Search , 1996, INFORMS J. Comput..
[2] Jacques Desrosiers,et al. Time Window Constrained Routing and Scheduling Problems: a Survey , 1987 .
[3] Robert A. Russell,et al. Hybrid Heuristics for the Vehicle Routing Problem with Time Windows , 1995, Transp. Sci..
[4] Richard F. Hartl,et al. New savings based algorithms for time constrained pickup and delivery of full truckloads , 2003, Eur. J. Oper. Res..
[5] Said Salhi,et al. A multi-level composite heuristic for the multi-depot vehicle fleet mix problem , 1997 .
[6] L. De Meulemeester,et al. Optimal sequencing of skip collections and deliveries , 1997 .
[7] Michel Gendreau,et al. Diversion Issues in Real-Time Vehicle Dispatching , 2000, Transp. Sci..
[8] Jacques Desrosiers,et al. Survey Paper - Time Window Constrained Routing and Scheduling Problems , 1988, Transp. Sci..
[9] Michael J. Todd,et al. Mathematical programming , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..
[10] Michel Gendreau,et al. A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows , 1997, Transp. Sci..
[11] W. Pierskalla,et al. A Transportation Location-Allocation Model for Regional Blood Banking , 1979 .
[12] Martin W. P. Savelsbergh,et al. The General Pickup and Delivery Problem , 1995, Transp. Sci..