Technical Note - Optimizing the Schedule for a Fixed Vehicle Path with Convex Inconvenience Costs
暂无分享,去创建一个
[1] Jacques Desrosiers,et al. A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows , 1984 .
[2] Jacques Desrosiers,et al. Survey Paper - Time Window Constrained Routing and Scheduling Problems , 1988, Transp. Sci..
[3] L. Bodin. ROUTING AND SCHEDULING OF VEHICLES AND CREWS–THE STATE OF THE ART , 1983 .
[4] Jacques Desrosiers,et al. THE MULTIPLE VEHICLE DIAL-A-RIDE PROBLEM , 1988 .
[5] Alexander H. G. Rinnooy Kan,et al. Vehicle Routing with Time Windows , 1987, Oper. Res..
[6] Jacques Desrosiers,et al. Routing with time windows by column generation , 1983, Networks.
[7] Martin Desrochers,et al. Optimal urban bus routing with scheduling flexibilities , 1984 .
[8] Mwp Martin Savelsbergh,et al. VEHICLE ROUTING WITH TIME WINDOWS: OPTIMIZATION AND APPROXIMATION. VEHICLE ROUTING: METHOD AND STUDIES. STUDIES IN MANAGEMENT SCIENCE AND SYSTEMS - VOLUME 16 , 1987 .
[9] H. Psaraftis. An Exact Algorithm for the Single Vehicle Many-to-Many Dial-A-Ride Problem with Time Windows , 1983 .