[1] Dantzing G, Ramser J. The Truck Dispatching Problem[J]. Manage- ment Science, 1959, 10(6): 80-91.
[2] Emmanouil E Z, Christos D T, Chris T K. A Hybrid Metaheuristic Algorithm for the Vehicle Routing Problem with Simultaneous Delivery and Pick-up Service[J]. Expert Systems with Applications, 2009, 36(2): 1070-1081.
[3] Berbeglia G, Cordeau J F, Laporte G. Dynamic Pickup and Delivery Problems[J]. European Journal of Operational Research, 2010, 202(1): 8-15.
[4] Wang Zhiwu, Wang Zhengguo. A Novel Two-phase Heuristic Method for Vehicle Routing Problem with Backhauls[J]. Computers and Mathematics with Applications, 2009, 57(11): 1923-1928.
[5] 吴 斌, 邵建峰, 方叶祥. 基于客户满意度的开放式车辆路径问题研究[J]. 计算机工程, 2009, 35(17): 193-194.
[6] Iori M, Salazar G J, Vigo D. An Exact Approach for the Vehicle Routing Problem with Two-dimension Loading Constraints[J]. Transportation Science, 2007, 41(2): 253-264.
[7] Gendreau M, Iori M, Laporte G, et al. A Tabu Search Heuristic for the Vehicle Routing Problem with Two-dimensional Loading Constraints[J]. Networks, 2008, 51(1): 4-18.
[8] Zachariadis E E, Tarantilis C D, Kiranoudis C T. A Guided Tabu Search for the Vehicle Routing Problem with Two-dimensional Loading Constraints[J]. European Journal of Operational Research, 2009, 195(3): 729-743.
[9] Fuellerer M, Doerner K F, Hartl R F, et al. Ant Colony Optimization for the Two-dimensional Loading Vehicle Routing Problem[J]. Computer & Operations Research, 2009, 36(3): 655- 673.
|