论文信息 - A GRASP/VND Heuristic for the Heterogeneous Fleet Vehicle Routing Problem with Time Windows - 字舞流文

A GRASP/VND Heuristic for the Heterogeneous Fleet Vehicle Routing Problem with Time Windows

Pablo Romero | Franco Robledo | Lucía Barrero | Rodrigo Viera

[1] George B. Dantzig,et al. The Truck Dispatching Problem , 1959 .

[2] Roberto Roberti,et al. An exact solution framework for a broad class of vehicle routing problems , 2010, Comput. Manag. Sci..

[3] Kien Ming Ng,et al. Vehicle routing problem with a heterogeneous fleet and time windows , 2014, Expert Syst. Appl..

[4] Petrica C. Pop,et al. A Variable Neighborhood Search Approach for Solving the Generalized Vehicle Routing Problem , 2014, HAIS.

[5] Tom Van Woensel,et al. A Vehicle Routing Problem with Flexible Time Windows , 2014, Comput. Oper. Res..

[6] Marius M. Solomon,et al. On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints , 1986, Networks.

[7] Ruslan Sadykov,et al. Enhanced Branch-Cut-and-Price algorithm for heterogeneous fleet vehicle routing problems , 2018, Eur. J. Oper. Res..

[8] Wout Dullaert,et al. A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows , 2010, Comput. Oper. Res..

[9] Michael Schneider,et al. A note on the time travel approach for handling time windows in vehicle routing problems , 2013, Comput. Oper. Res..