A multi-phase constructive heuristic for the vehicle routing problem with multiple trips
暂无分享,去创建一个
[1] Said Salhi,et al. A multi-level composite heuristic for the multi-depot vehicle fleet mix problem , 1997 .
[2] Hans Kellerer,et al. Knapsack problems , 2004 .
[3] Yves Rochat,et al. Probabilistic diversification and intensification in local search for vehicle routing , 1995, J. Heuristics.
[4] Said Salhi,et al. Improvements to Vehicle Routeing Heuristics , 1987 .
[5] Paolo Toth,et al. The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.
[6] Alan Mercer,et al. The multi-trip vehicle routing problem , 1998, J. Oper. Res. Soc..
[7] G. Clarke,et al. Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .
[8] Gilbert Laporte,et al. An adaptive memory heuristic for a class of vehicle routing problems with minmax objective , 1997, Comput. Oper. Res..
[9] Alan Mercer,et al. A tabu search algorithm for the multi-trip vehicle routing and scheduling problem , 1997, Eur. J. Oper. Res..
[10] Michel Gendreau,et al. Vehicle Routeing with Multiple Use of Vehicles , 1996 .
[11] P. C. Yellow,et al. A Computational Modification to the Savings Method of Vehicle Scheduling , 1970 .
[12] Marshall L. Fisher,et al. Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees , 1994, Oper. Res..