第五章 結論與建議
5.2 建議
目前尚有繼續探討之議題，期許可供未來相關研究之參考：
1. 目前路線集合未有任何刪除動作，若執行次數提升，對於求解時間產生多於負 荷，建議發展出動態之調整路線集合之機制，保留有效之路線使得求解效率提升。
2. 以原演算法模式延伸發展，可探討具有時間窗限制之 VRPPC，相信可以有不錯 之效果。因為在產生新路線中，具有時間窗限制之可行路線數量較少，可避免由 於過多路線而導致演算效率緩慢之情況。或是考慮多車種之情況，使得在實務之 應用上更具代表性。
3. 多加嘗試設定演算法中使用參數不同數值，期望加快求解效率，並在穩定求解品 質與速度上做權衡。
4. 將 Code 進行最佳化以進行測試，可以更短之執行時間藉以突顯本研究之成效，
甚至可使用較低階之程式語言撰寫，已獲得更佳執行時間。
參考文獻
1. Agarwal, Y., Mathur, K. and Salkin, H.M., “ A set-partition-based exact algorithm for the vehicle routing problem”, Networks, Vol. 19, pp. 731-749, (1989).
2. Ball, M.O., Golden, B.L., Assad, A.A. and Bodin, L.D. , “ Planning for truck fleet size in the presence of a common-carrier option”, Decision Sciences, Vol. 1, pp. 103-120, (1983).
3. Balinsk, M. and Quandt, R., “On an integer program for a delivery problem”, Operations Research, Vol. 12, pp. 300-304, (1964).
4. Barnhart, C., Johnson, E.L., Nemhauser, G.L., Savelsbergh, M.W.P. and Vance, P.H.,
“Branch-and-price: Column generation for solving huge integer programs”, Operations Research, Vol. 46, pp. 316-329, (1998).
5. Beasley, J.E., “A lagrangian heuristic for set-covering problems”, Naval Research Logistics, Vol. 37, pp. 151-164, (1990).
6. Bixby, R.E., Gregory, J.W., Lustig, L.J., Marsten, R.E. and Shanno, D.F., “Very large-scale linear programming: A case study in combining interior point and simplex methods”, Operations Research, Vol. 40, pp. 885-897, (1992).
7. Bolduc, M.C, Renaud, J. and Boctor, F. F., “A heuristic for the routing and carrier selection problem”, European Journal of Operational Research, Vol. 183, pp. 926–932, (2007).
8. Bolduc, M.C, Renaud, J., Boctor, F.F. and Laporte, G., “A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers”, Journal of the Operational Research Society, Vol. 59, pp. 776 –787, (2008).
9. Caprara, A., Fischetti, M. and Toth, P., “A heuristic method for the set covering problems”, Operation Research, Vol. 47, pp. 730-743, (1999).
10. Cattrysse, D.G., Salomon, M., Kuik, R. and Van Wassenhove, L.N.,” A dual ascent and column generation heuristic for the discrete lotsizing and scheduling problem with setup times”. Management Science, Vol. 39, pp. 477-486, (1993).
11. Cattrysse, D.G., Salomon, M. and Van Wassenhove, L.N., “A set partitioning heuristic for the generalized assignment problem”, European Journal of Operational Research, Vol. 72, pp. 167-174, (1994).
12. Christofides, N., Mingozzi, A. and Toth, P., “The vehicle routing problem. in combinational optimization : Christofides, N., Mingozzi, A., Toth, P., and Sandi, C.
(eds)”, Combinatorial Optimization. Wiley, pp. 315-338. (1979).
13. Chu, C.W., “A heuristic algorithm for the truckload and less-than-truckload problem”, European Journal of Operational Research, Vol. 3, pp. 657-667, (2005).
14. Clarke, G, and Wright, J., “Scheduling of vehicles from a central depot to a number of delivery point”, Operation Research, Vol. 12, pp. 568-581, (1964).
15. Cordeau, J.F., Gendreau, M., Laporte, G., Potvin, J.Y. and Semet, F., “A guide to vehicle routing heuristics”, The Journal of the Operational Research Society, Vol. 53, pp.
512-522, (2002).
private fleet andcommon carrier”, European Journal of Operational Research, Vol. 198, pp. 464-469, (2009).
17. Dantzig, G.B. and Ramser, J.H., “The truck dispatching problem”, Management Sciences, Vol. 6, pp. 80–91, (1959).
18. Desaulniers, G., Desrosiers, J., Solomon, M.M., (Eds.), “Column generation”, Springer.
(2005).
19. Diaby, M. and Ramesh, R., “The distribution problem with carrier service: a dual based penalty approach”, ORSA Journal on Computing, Vol. 7, pp. 24–35, (1995).
20. Euchi, J. and Chabchoub, H., “A hybrid genetic algorithm for the vehicle routing problem with private fleet and common carrier”, working paper, Roadef, Nacy, 10-12 février, pp. 243-245, (2009).
21. Euchi, J. and Chabchoub, H., “Heuristic search technique to solve the vehicle routing with private fleet and common carrier”, International Journal of Universal Computer Sciences, Vol. 1, pp. 10-18, (2010).
22. Fischetti, M. and Toth, P., “A polyhedral approach to the asymmetric traveling salesman problem”, Management Science, Vol. 43, pp. 1520-1536, (1997).
23. Fisher, M.L., “The Lagrangian relaxation method for solving integer programming problems”, Management Science, Vol. 27, pp. 1-18, (1981).
24. Fisher, M.L., “A polynomial algorithm for the degree constrained K-tree problem”, Operations Research, Vol. 42, pp. 775-779, (1994).
25. Fisher, M.L., “Vehicle routing, Chapter 1 in Ball, M.O., Magnanti, T.L., Monma, C. L.
and Nemhauser, G.L.”, Handbooks in operations research and management science, Vol.
8: Network routing, (1995).
26. Geoffrion, A.M., “Lagrangean relaxation for integer programming”, Mathematical Programming Study, Vol. 2, pp. 82-114, (1974).
27. Ghiani, G., Laporte, G. and Musmanno, R., “Introduction to Logistics Systems Planning and Control“, Wiley, (2004).
28. Held, M., Karp, R.M., “The traveling salesman problem and minimum spanning trees”, Operations Research, Vol. 18, pp. 1138-1162, (1970).
29. Hitiart-Urruty, J.B. and Lemarechal, C., “Conuex analysis and minimization algorithms”, Vols. 1 and 2, Springer Verlag, Berlin, Germany, (1993).
30. Jans, R. and Degraeve, Z., “An industrial extension of the discrete lot sizing and scheduling problem”, HE Transactions, Vol. 36, pp. 47-58, (2004).
31. Kara, I., Laporte, G. and Bektas, T., ”A note on the lifted Miller–Tucker–Zemlin subtour elimination constraints for the capacitated vehicle routing problem” European Journal of Operational Research, Vol. 158, pp. 793–795, (2004).
32. Kelly, J.P. and Xu, J., “A Set-partitioning-based heuristic for the vehicle routing problem”, INFORMS Journal on Computing, Vol. 11, pp. 161-162, (1999).
33. Klincewicz, J.G., Luss, H. and Pilcher, M.G., “Fleet size planning when outside carrier services are available”, Transportation Science, Vol. 3, pp. 169-182, (1990).
34. Laporte, G. and Semet, F., “Classical heuristics for the vehicle routing problem, In: Toth,
Mathematics and Applications. SIAM Publishing, Philadelphia, PA, pp. 109–128, (2001).
35. Lenstra, J. and Rinnooy, K.A., “Complexity of vehicle routing and scheduling problems”,Networks, Vol. 11, pp. 221–227, (1981).
36. Löbel, A., “Vehicle scheduling in public transit and Lagrangian pricing”, Management Science, Vol. 44, pp. 1637-1649, (1998).
37. Qureshi, A.G., Taniguchi, E. and Yamada, T., “Column generation-based heuristic for vehicle routing problem with soft time windows”, Vol. 7, Proceedings of the Eastern Asia Society for Transportation Studies, (2009).
38. Jans, R., Degraeve, Z., “Improved lower bounds for the capacitated lot sizing problem with setup times”, Operational Research, Vol. 32, pp. 185-195, (2004).
39. Sol, M., “Column generation techniques for pickup and delivery problems”, Ph.D Thesis, Eindhoven University of Technology, (1994).
40. Solomon, M.M., “Algorithms for the vehicle routing and scheduling problem with time windows constraints”, Operation Research, Vol. 35, pp. 254-265, (1987).
41. Toth, P. and Vigo, D., “Models, relaxations and exact approaches for the capacitated vehicle routing problem”, Discrete Applied Mathematics, Vol. 123, pp. 487-512, (2002).
42. Toth, P. and Vigo, D., (eds)., “The Vehicle Routing Problem” SIAM Monographs on Discrete Mathematics and Applications . SIAM publishing: Philadelphia, PA, (2001).
43. Umetani, S., Yagiura, M., “Relaxation heuristics for the Set Covering Problem”, Journal of the Operational Research Society of Japan, Vol. 50, pp. 350–375, (2007).
44. Wu, T. and Huang, K., “A heuristic based on modified Lafrangian relaxation for the vehicle routing problem”, Journal of the Eastern Asia Society for Transportation Studies, Vol. 7, pp. 1056-1069 (2007).
45. Zhao, X., Luh, P.B. and Wang, J., “Surrogate gradient algorithm for lagrangian relaxation”, Journal of Optimization Theory and Applications, Vol. 100, pp. 699–712, (1999).
46. 林欣誼，結合自有車對與委外貨運的車輛路線問題，國立交通大學，碩士論文，民 國 96 年
附 錄
本研究各題最佳結果之成本及路線詳細資料
例題：CE-01 文獻已知最佳解：1119.47 本研究最佳解：1121.33 (0.17％) 顧客數：50 車輛容量：160 車輛固定成本：120
委外運輸顧客 25,18,47,12,5
路徑編號 經過節點順序
1 0,1,22,31,28,3,36,35,20,29,2,32,46,0 2 0,27,48,8,26,7,23,43,24,14,6,0
3 0,4,13,41,40,19,42,44,45,33,15,37,17,0 4 0,11,16,50,21,34,30,39,10,49,9,38,0
例題：CE-02 文獻已知最佳解：1814.52 本研究最佳解：1846.98 (1.79％) 顧客數：75 車輛容量：140 車輛固定成本：100
委外運輸顧客 4,75,51,67,46
路徑編號 經過節點順序
1 0,11,66,59,14,35,0 2 0,26,58,10,38,65,53,7,0 3 0,17,40,9,39,31,72,12,0 4 0,3,44,24,18,50,55,25,32,0 5 0,63,43,42,64,41,56,23,49,16,0 6 0,74,28,62,22,1,73,33,6,0 7 0,30,48,47,21,61,2,68,0
8 0,57,15,20,70,60,71,69,36,37,5,29,0 9 0,34,52,8,19,54,13,27,45,0
例題：CE-03 文獻已知最佳解：1920.90 本研究最佳解：1988.55 (3.52％) 顧客數：100 車輛容量：200 車輛固定成本：140
委外運輸顧客 53,28,52,18,96,58,89,97,13,94,12,95,87,5,100
路徑編號 經過節點順序
1 0,40,4,56,23,67,39,25,55,54,24,29,68,80,0 2 0,76,77,3,79,78,34,35,65,71,9,51,81,33,50,0 3 0,27,69,1,70,30,20,66,32,90,63,10,62,88,31,0 4 0,7,82,48,47,19,11,64,49,36,46,8,45,83,60,0 5 0,6,99,93,61,84,17,86,16,91,85,98,37,92,59,0 6 0,26,21,73,72,74,75,22,41,15,43,38,44,14,42,57,2,0
例題：CE-04 文獻已知最佳解：2512.64 本研究最佳解：2610.37 (3.89％) 顧客數：150 車輛容量：200 車輛固定成本：120
委外運輸顧客 27,112,28,146,53,105,132,96,52,111,89,13,94,1,147,76,138,97,50,87, 95,33,118,31,85
路徑編號 經過節點順序
1 0,127,88,148,62,107,11,64,49,143,36,19,123,7,106,0 2 0,18,82,48,47,124,46,45,125,8,114,83,0
3 0,60,5,84,17,113,86,141,16,61,93,99,104,6,0
4 0,117,144,57,15,43,42,142,14,38,140,44,119,91,100,98,37,92,59,0 5 0,58,137,2,115,145,41,22,133,75,74,72,73,21,40,26,0
6 0,149,54,130,55,25,67,23,56,39,139,4,110,0
7 0,116,77,3,79,129,121,29,24,134,68,80,150,109,12,0 8 0,78,34,135,35,136,65,71,103,9,120,81,102,0
9 0,69,101,70,30,122,51,20,66,128,131,32,90,63,126,108,10,0
例題：CE-05 文獻已知最佳解：3097.67 本研究最佳解：3263.29 (5.35％) 顧客數：199 車輛容量：200 車輛固定成本：100
委外運輸顧客 156,112,105,28,27,53,167,132,152,183,58,147,52,89,111,50,137,69,1 76,94,1,115,95,101,87,31,162,190,5,68,59,85
路徑編號 經過節點順序
1 0,149,179,165,55,25,170,67,39,187,139,155,4,110,0 2 0,154,12,109,177,150,80,163,24,134,130,54,195,0 3 0,76,196,77,3,158,79,129,169,29,121,116,184,138,0 4 0,185,78,34,164,35,135,120,81,33,157,102,0
5 0,51,9,103,161,71,136,65,66,188,20,128,122,0 6 0,70,30,160,131,32,181,64,63,126,90,108,10,189,0 7 0,127,88,148,62,159,11,175,107,19,123,182,146,0 8 0,106,194,7,48,168,47,49,143,36,46,124,82,153,0 9 0,18,114,8,174,45,125,199,83,60,118,166,0
10 0,84,173,17,113,86,140,38,14,119,192,100,37,97,117,13,0 11 0,92,151,98,193,91,191,44,141,16,61,93,99,104,96,6,0 12 0,73,171,133,22,41,145,57,15,43,142,42,172,144,178,2,0 13 0,26,180,198,197,56,186,23,75,74,72,21,40,0
例題：CE-06 文獻已知最佳解：1207.47 本研究最佳解：1208.33 (0.17％) 顧客數：50 車輛容量：160 車輛固定成本：120
委外運輸顧客 47,5,12,25,18
路徑編號 經過節點順序
1 0,1,22,31,28,3,36,35,20,29,2,32,46,0 2 0,27,48,8,26,7,23,43,24,14,6,0
3 0,4,13,41,40,19,42,44,45,33,15,37,17,0 4 0,11,16,50,21,34,30,39,10,49,9,38,0
例題：CE-07 文獻已知最佳解：2004.53 本研究最佳解：2038.99 (1.72％) 顧客數：75 車輛容量：140 車輛固定成本：120
委外運輸顧客 51,46,67,4,75
路徑編號 經過節點順序
1 0,11,66,59,14,35,0 2 0,26,58,10,38,65,53,7,0 3 0,17,40,9,39,31,72,12,0 4 0,3,44,24,18,50,55,25,32,0 5 0,63,43,42,64,41,56,23,49,16,0 6 0,74,28,62,22,1,73,33,6,0 7 0,30,48,47,21,61,2,68,0
8 0,57,15,20,70,60,71,69,36,37,5,29,0 9 0,34,52,8,19,54,13,27,45,0
例題：CE-08 文獻已知最佳解：2052.05 本研究最佳解：2126.55 (3.63％) 顧客數：100 車輛容量：200 車輛固定成本：160
委外運輸顧客 13,94,12,95,87,5,100,53,28,52,18,96,58,89,97
路徑編號 經過節點順序
1 0,40,4,56,23,67,39,25,55,54,24,29,68,80,0 2 0,76,77,3,79,78,34,35,65,71,9,51,81,33,50,0 3 0,27,69,1,70,30,20,66,32,90,63,10,62,88,31,0 4 0,7,82,48,47,19,11,64,49,36,46,8,45,83,60,0 5 0,6,99,93,61,84,17,86,16,91,85,98,37,92,59,0 6 0,26,21,73,72,74,75,22,41,15,43,38,44,14,42,57,2,0
例題：CE-09 文獻已知最佳解：2425.26 本研究最佳解：2518.06 (3.83％) 顧客數：150 車輛容量：200 車輛固定成本：120
委外運輸顧客 146,53,112,28,105,52,147,40,89,94,118,59,85
路徑編號 經過節點順序
1 0,27,69,101,70,30,20,128,131,32,90,63,126,108,10,31,0 2 0,127,88,148,62,107,11,64,49,143,36,19,123,7,106,0 3 0,18,82,48,47,124,46,45,125,8,114,83,60,0
4 0,6,96,104,99,93,98,61,16,86,113,17,84,5,0
5 0,95,92,37,100,91,141,44,119,140,38,14,43,15,142,42,97,117,0 6 0,58,21,73,74,133,22,41,145,115,2,57,144,87,137,13,0
7 0,72,75,56,23,67,39,139,25,4,110,149,0
8 0,26,109,54,130,55,134,24,29,121,68,80,150,12,138,0 9 0,76,116,77,3,79,129,78,34,81,33,102,50,111,0 10 0,132,1,122,51,103,66,71,65,136,35,135,120,9,0
例題：CE-10 文獻已知最佳解：3386.08 本研究最佳解：3561.28 (5.17％) 顧客數：199 車輛容量：200 車輛固定成本：120
委外運輸顧客 115,95,101,87,31,162,190,5,68,59,85,156,112,105,28,27,53,167,132, 152,183,58,147,52,89,111,50,137,69,176,94,1
路徑編號 經過節點順序
1 0,149,179,165,55,25,170,67,39,187,139,155,4,110,0 2 0,154,12,109,177,150,80,163,24,134,130,54,195,0 3 0,76,196,77,3,158,79,129,169,29,121,116,184,138,0 4 0,185,78,34,164,35,135,120,81,33,157,102,0
5 0,51,9,103,161,71,136,65,66,188,20,128,122,0 6 0,70,30,160,131,32,181,64,63,126,90,108,10,189,0 7 0,127,88,148,62,159,11,175,107,19,123,182,146,0 8 0,106,194,7,48,168,47,49,143,36,46,124,82,153,0 9 0,18,114,8,174,45,125,199,83,60,118,166,0
10 0,84,173,17,113,86,140,38,14,119,192,100,37,97,117,13,0 11 0,92,151,98,193,91,191,44,141,16,61,93,99,104,96,6,0 12 0,73,171,133,22,41,145,57,15,43,142,42,172,144,178,2,0 13 0,26,180,198,197,56,186,23,75,74,72,21,40,0
例題：CE-11 文獻已知最佳解：2330.94 本研究最佳解：2403.41 (3.11％) 顧客數：120 車輛容量：200 車輛固定成本：180
委外運輸顧客 81,102,105,88,106,120,86,82,92,101,119,87,103,116,99,98
路徑編號 經過節點順序
1 0,111,112,85,89,91,90,18,118,108,12,8,109,115,97,94,93,96,95,0 2 0,110,40,43,45,48,51,50,49,47,46,44,41,42,39,38,37,0
3 0,52,54,57,59,65,61,62,64,66,63,60,56,58,55,53,100,0 4 0,104,73,76,68,77,79,80,78,72,75,74,71,67,70,69,107,0 5 0,84,113,83,5,6,7,9,10,11,13,14,15,4,3,1,2,117,0
6 0,114,21,20,26,23,25,28,31,35,32,29,36,34,33,30,27,24,22,19,16,17,0
例題：CE-12 文獻已知最佳解：1952.86 本研究最佳解：1976.68 (1.22％) 顧客數：100 車輛容量：200 車輛固定成本：120
委外運輸顧客 21,62,22,30,63,25,74
路徑編號 經過節點順序
1 0,20,24,27,29,52,49,47,50,51,48,46,45,44,40,41,42,43,0 2 0,81,78,76,71,70,73,77,79,80,72,61,64,68,69,0
3 0,23,26,28,10,8,9,6,7,3,4,2,1,75,0
4 0,67,66,65,90,87,86,83,82,84,85,88,89,91,0 5 0,34,36,39,38,37,35,31,33,32,0
6 0,5,99,100,97,93,92,94,95,96,98,0 7 0,17,18,19,16,14,12,15,13,11,0 8 0,57,59,60,58,56,53,54,55,0
例題：CE-13 文獻已知最佳解：2858.94 本研究最佳解：2947.29 (3.09％) 顧客數：120 車輛容量：200 車輛固定成本：260
委外運輸顧客 120,119,102,88,105,99,101,86,115,106,103,87,95,116,89,98
路徑編號 經過節點順序
1 0,82,81,117,83,2,1,3,4,5,6,108,118,18,90,91,92,93,94,96,0 2 0,97,109,8,12,13,14,15,11,10,9,7,113,84,112,85,111,0
3 0,114,21,20,23,26,28,31,35,32,29,36,34,33,30,27,24,22,25,19,16,17,0 4 0,110,40,43,45,48,51,50,49,47,46,44,41,42,39,38,37,0
5 0,52,54,57,59,65,61,62,64,66,63,60,56,58,55,53,100,0 6 0,104,73,76,68,77,79,80,78,75,72,74,71,70,69,67,107,0
例題：CE-14 文獻已知最佳解：2213.02 本研究最佳解：2247.54 (1.56％) 顧客數：100 車輛容量：200 車輛固定成本：140
委外運輸顧客 21,20,6,22,7,67,65,75,62,28,24,63,8,66,2,25,74,13
路徑編號 經過節點順序
1 0,23,26,27,29,52,51,48,50,49,47,46,45,44,42,40,41,43,0 2 0,81,78,76,71,70,73,77,79,80,72,61,64,68,69,0
3 0,5,3,4,91,89,88,85,84,82,83,86,87,90,0 4 0,30,17,18,19,15,16,14,12,9,11,10,0 5 0,1,99,100,97,93,92,94,95,96,98,0 6 0,32,33,31,35,37,38,39,36,34,0 7 0,57,55,54,53,56,58,60,59,0