Branchini R M,Armentano V A. Adaptive granular local search heuristic for a dynamic vehicle routing problem[J]. Computers & Operations Research, 2009, 36(11): 2955- 2968.
[3]
Müller J. Approximative solutions to the bicriterion vehicle routing problem with time windows [J]. European Journal of Operational Research, 2010, 202(1): 223-231.
[4]
Schǒnberger J, Kopfer H. Online decision making and automatic decision model adaptation[J].Computers & Operations Research, 2009, 36(6): 1740-1750.
[5]
Novoa C, Storer R. An approximate dynamic programming approach for the vehicle routing problem with stochastic demands [J].European Journal of Operational Research, 2009, 196(2): 509-515.
Narayanan A,Moore M. Quantum-inspired genetic algorithms[C].Proceedings of IEEE International Conference on Evolutionary Computation. Piscataway:IEEE Press, 1996.
Subramanian A, Penna P H V, Uchoa E,et al. A hybrid algorithm for the heterogeneous fleet vehicle routing problem [J].European Journal of Operational Research, 2012, 3(7):1021-1032.
[20]
Brandao J. A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem [J].Computers & Operations Research, 2008, 38(1): 140-151.
[21]
Li Xiangyong, Tian Peng. An adaptive memory programming meta heuristic for the heterogeneous fixed fleet vehicle routing problem[J].Transportation Research Part E-Logistics and Transportation Review, 2010, 46(6): 1111-1127.
[22]
Pessoa A,Uchoa E. A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem [J].Networks, 2009, 54(4): 167-177.
[23]
Yazgi T G. An interactive GRAMPS algorithm for the heterogeneous fixed fleet vehicle routing problem with and without backhauls[J].European Journal of Operational Research, 2009, 201(20): 593-600.
[24]
Repoussis P P,Tarantilis C D.Solving the fleet size and mix vehicle routing problem with time windows via adaptive memory programming [J].Transportation Research Part C, 2010, 18(5): 695-712.