一、中文部份
1.夏承永(2003),「以遺傳演算法求解多車種多倉庫之車輛途程問題」,國立清華大學碩士論文。2.陳建良(2002),「以啟發式演算法求解時窗限制車輛途程問題」,私立中原大學碩士論文。
3.鄧宇佑(2002),「求解醫院運輸部門運輸中心個數最佳化之研究」,國立成功大學碩士論文。4.劉曄(2005),「整合同時收送貨與選擇貨運公司服務之車輛途程問題」,國立台灣海洋大學碩士論文。5.謝伯昂(2002),「考慮收送貨與選擇貨運公司服務的車輛途程問題」,國立台灣海洋大學碩士論文。二、英文部份
1.Ball, M.O., Golden, A, Assad, A. and Bodin, L.D. (1983), “Planning for Truck Fleet Size in the Presence of a Common-Carrier Option,” Decision Sciences, 14, pp. 103-120.
2.Bodin, L., B. Golden, A. Assad and M. Ball (1983),“ Routing and Scheduling of Vehicle and crews: The State of the Art,” Computers & Operations Research, 10, pp. 62-212.
3.Casco, D. and Golden, B. and Wasil, E. (1988), “Vehicle Routing with Backhauls: Models Algorithm and Case-studies. In Vehicle Routing: Methods and Studies,” Studies in management Science and Systems, North Holland, Amsterdam, wd. B. Golden, A. Assad, Vol. 16.
4.Christofides, N. and Eilon, S. (1969), “An Algorithm for the Vehicle Dispatching Problems,” Operational Research Quarterly, 20, pp. 309-318.
5.Christofides, N., (1981),“Exact Algorithms for the Vehicles Routing Problems, Based on Spanning Tree and Shortest Path Relaxations,” Math. Prog., Vol. 20, pp. 255-282.
6.Christofides, N., Mingozzi, A., and Toth, P., (1979), “The Vehicle Routing Problem,” Combinatorial Optimization, Wiley, Chichester, pp. 315-338.
7.Chu, C. W., (2005), “A Heuristic Algorithm for The Truckload and Less_than_truckoad Problem,” European Journal of Operational Research , 113, pp. 528-543.
8.Clarke, G. and Wright, J. (1964), “ Scheduling of Vehicles from a Central Depot to a Number of Delivery Points,” Operational Research ,12, pp. 568-581.
9.Gaskell, T.J., (1967), “Basis for Vehicle Fleet Scheduling,” Operational Research Quarterly, 18, pp. 281-295.
10.Golden, E. B. and Alfaro, J. and Schagger, J., (1985), “The Vehicle Routing Problem with Backhauling: Two Approache,” Proceedings of the XII Annual Meeting of S.E.TIMS, Myrtle Beach, S.C, pp. 90-92.
11.Gillett, B. and Miller, L., (1974), “A Heuristic Algorithm for the Vehicle Dispatch Problem,” Operational Research, 22, pp. 340-349.
12.Glover, F., (1977) “Heuristic for Integer Programming Using Surrogate constraints,” Decision Science, 8, pp. 156-166.
13.Golden, B., Assad, A., and Arjang, A., (1988), Vehicle Routing: Methods and Studies, North-Holland, pp. 7-45.
14.Held, M. and Karp, R., (1962),“A Dynamic Programming Approach to Sequencing Problem,” SIAM Journal Applied mathematics, 10, pp. 196-210.
15.Jacques Renaud, Gilbert Laporte and Fayez F. Boctor., (1996), “A Tabu Search Heuristic for the Multi-Depot Vehicle Routing Problem,” Computers & Operations research, 23, pp. 229-235
16.Kindervater, G.A.P., and Savelsbergh, M.W.P., (1997), “Vehicle Routing: Handling Edge Exchanges. In: Aarts, E.H., Lenstra, J.K. (Eds.),” Local Search in Combinatorial Optimization. Wiley, Chichester, 1997.
17.Laporte, G., Nobert, Y. and Desrochers, M., (1985), “Optimal Routing Under Capacity and Distance Restriction,” CACM, 33, pp. 1015-1073
18.Laporte, G., Gendreau, M., Potvin, J-Y, and Semet, F., (2000), “Classical and Modern Heuristics for the Vehicle Routing Problem,” International Transactions in Operational Research, 7, pp. 285-300.
19.Lin, S., (1965), “Computer Solution of the Traveling Salesman Problem,” Bell System Technology Journal, 44, pp. 2245-2269.
20.Lin, S. and Kernighan, B., (1973), “An Effective Heuristic Algorithm for the Traveling Salesman Problem,” Operational Research, 21, pp. 498-516.
21.Miller, C. E., (1960), “Integer Programming Formulation of Traveling Salemen Problems,” Journal of Association for Computing Machinery, 7, pp. 326-329.
22.Min, H., (1989), “The Multiple Vehicle Routing Problem with Simultaneous Delivery and Pick-up Points,” 23, pp. 377-386.
23.Mole, R. and Jameson, S., (1976), “A Sequential Route-Building Algorithm Employing A Generalized Savings Criterion,” Operational Research Q., 27, pp. 498-516.
24.Nagy, G. and Salhi, S. (2005), “Heuristic Algorithms for Single and Multiple and Depot Vehicle Routing Problem with Pickups and Deliveries,” European Journal of Operational Research, 162, pp. 126-141.
25.Psaraftis, H.N., (1980), “A Dynamic Programming Solution to the Single Vehicle Many-to-many Immediate Request Dial-a-ride Problem,” Transportation Science, 14, pp. 130-154.
26.Salhi, S., Nagy, G., (1999), “A Cluster Insertion Heuristic for Single and Multiple Depot Vehicle Routing Problem with Backhauling,” Journal of the Operational Research Society, 50, pp. 1034-1042.
27.Schruben, L., and Clifton, R, (1968), “The Lockset Method of Sequential Programming Applied to Routing Delivery and Pickup Trucks,” American Journal of Agricultural Economics, 50, pp. 854-867.
28.Stewart, W. and Golden, B., 1979,“A Vehicle Routing Algorithm Based on Generalized Lagrane Mutipliers,” Proceedings of the AIDS 1979 Annual Convention, Moore, L., Monore, K., Taylor B. Eds.,
29.Van Breedam, A. (2001), “Comparing Descent Heuristics and Metaheuristics for the Vehicle Routing Problem,” Computers & Operations Research, 28, pp. 289-315.
30.Yellow, P., (1970), “A Computational Modification to the Savings Method of Vehicle Scheduling,” Operational Research Quarterly, 21, pp. 281-283.