第五章 結論與建議
5.2 建議
本研究經過實驗測試的過程之後，提出以下幾點建議供未來可能的相關研究參考：
1. 兩極跳躍法在面臨局部最佳解時，能夠反向操作增加廣度搜尋以跳脫局部最佳解。
本研究利用此概念來對BATA 做改良，且證明求解績效有所改善。未來可以嘗試利
用兩極跳躍法的概念與其他巨集啟發式解法做結合探討其求解績效。
2. 本研究僅以對起始解改善較佳的六組交換改善法順序作為測試時鄰域搜尋改善模 組，然而對起始解改善較佳並不代表會使整個巨集啟發式解法求得較好之結果。未
來可針對鄰域搜尋模組與MBATA 中核心交換法的執行排列順序做更多不同的搭配
設計，探討其求解之績效。
3. 經過本研究的測試之後，發現改良型可回溯式門檻接受法為一相當有效的巨集啟發 式方法，未來可以嘗試應用於其他車輛路線相關問題上。
參考文獻
1. Anily, S., “The Vehicle Routing Problem with Delivery and Backhaul Options,” Naval Research Logistics, Vol. 43, pp. 415-434, 1996.
2. Bodin, L., Golden, B., Assad, A. and Ball, M., “Routing and scheduling of vehicle and crew: the state of art,” Special Issue of Computers and Operations Research, Vol.10, No.2, pp. 63-211, 1983.
3. Brandao, J., “A new tabu search algorithm for the vehicle routing problem with backhauls,” European Journal of Operational Research, Vol. 173, pp. 540-555, 2006.
4. Braysy, O. and Gendreau, M., “Vehicle Routing Problem with Time Windows, Part I:
Route Construction and Local Search Algorithms,” Transportation Science, Vol. 39, pp.
104-118, 2005.
5. Braysy, O. and Gendreau, M., “Vehicle Routing Problem with Time Windows, Part II:
Metaheuristics,” Transportation Science, Vol. 39, pp. 119-139, 2005.
6. Casco, D. O., Golden, B. L. and Wasil, E. A., “Vehicle Routing with Backhauls: Models, Algorithms, and Case Studies,” in: Golden, B. and A. Assad (Eds.), Vehicle Routing:
Methods and Studies, North-Holland, Amsterdam, pp. 127-147, 1988.
7. Clarke, G. and Wright, J. W., “Scheduling of Vehicles form a Central Depot to a Number of Delivery Points,” Operations Research, Vol. 12, No. 4, pp. 568-581, 1964.
8. Cordeau, J-F., Laporte, G., Savelsbergh, M.W.P. and Vigo, D., “Vehicle routing,” in: C.
Barnhart and Laporte, G. (eds), Handbooks in Operations Research and Management Science: Transportation, Vol.14, Elsevier B.V., 2005.
9. Crispim, J. and Brandao, J., “Reactive Tabu Search and Variable Neighborhood Descent Applied to the Vehicle Routing Problem with Backhauls,” MIC’2001 4th Metaheuristic International Conference, Porto, Portugal, 2001.
10. Daniel, O., Golden, B. L. and Wasil, E. A., “Vehicle Routing with Backhauls: Models, Algorithms, and Case Studies,” in Golden, B. and Assad, A (eds.), Vehicle Routing:
Methods and Studies, North-Holland, Amsterdam, pp.127-147, 1988.
11. Deif, I. and Bodin, L. D., “Extension of the Clarke and Wright Algorithm for Solving the Vehicle Routing Problem with Backhauling,” Proceedings of the Babson College Conference on Software Uses in Transportation and Logistic Management, pp. 75-96, 1984.
12. Dueck, G., “New Optimization Heuristics: The Great Deluge Algorithm and the Record-to-Record Travel,” Journal of Computational Physics, Vol.104, pp.86-92, 1993.
13. Dueck, G. and Scheuer, T., “Threshold Accepting: A General Purpose Optimization Algorithm Appearing Superior to Simulated Annealing,” Journal of Computational Physics, Vol.90, pp.161-175, 1990.
14. Gajpal, Y. and Abad P. L., “Multi-ant colony system (MACS) for a vehicle routing problem with backhauls,” European Journal of Operational Research, 2009, Vol. 196, pp. 102-117.
15. Gendreau, M., Hertz, A. and Laporte, G., “New insertion and postoptimization procedures for the traveling salesman problem,” Operations Research, Vol. 40, pp.
1086-1094, 1992.
16. Goetschalckx, M. and Jacobs-Blecha, C., “The Vehicle Routing Problem with Backhauls,” European Journal of Operational Research, Vol. 42, pp. 39-51, 1989.
17. Goetschalckx, M. and Jacobs-Blecha, C., “The Vehicle Routing Problem with Backhauls: Properties and Solution Algorithms,” Technical report MHRC-TR-88-13, Georgia Institute of Technology, Atlanta, 1993.
18. Ioannou, G., Kritikos, M. and Prastacos, G., “A greedy look-ahead heuristic for the vehicle routing problem with time windows” Journal of the Operational Research Society, vol. 52, pp. 523 - 537, 2001.
19. Kirkpatrick, S., Gelatt, C. and Vecchi, M., “Optimization by Simulated Annealing,”
Science, Vol.220, pp.671-680, 1983.
20. Lin, S., “Computer solutions of the traveling salesman problem,” The Bell System Technical Journal, pp.2245-2269, 1965.
21. Mingozzi, A., Giorgi, S. and Baldacci, R., “An Exact Method for the Vehicle Routing Problem with Backhauls,” Transportation Science, Vol. 33, No.3, pp.315-329, 1999.
22. Potvin, J. Y. and J. M. Rousseau, “A Parallel Route Building Algorithm for the Vehicle Routing and Scheduling Problem with Time Windows” European Journal of
Operational Rearch, Vol. 66, pp. 331-341, 1993.
23. Or, I., Traveling Salesman-type Combinatorial Problems and Their Relation to the Logistics of Regional Blood Banking, Ph.D. Dissertation, Northwestern University, 1976.
24. Osman, I. H., “Metastrategy Simulated Annealing and Tabu Search Algorithms for the Vehicle Routing Problem,” Annals of Operations Research, Vol.41, pp.421-451, 1993.
25. Osman, I. H. and Wassan, N. A., “A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls,” Journal of Scheduling, Vol. 5, pp. 263-285, 2002.
26. Prins, C., “A simple and effective evolutionary algorithm for the vehicle routing problem,” Computers and Operations Research, Vol. 31, pp. 1985-2002, 2004.
27. Ropke, S. and Pisinger, D., “A unified heuristic for a large class of Vehicle Routing Problems with Backhauls,” European Journal of Operational Research, Vol. 171, pp.
750-775, 2006.
28. Rosenkrantz, D., Sterns, R. and Lewis, P., “An analysis of several heuristics for the traveling salesman problem,” SIAM Journal of Computing, Vol. 6, pp.563-581, 1977.
29. Solomon, M. M., “Vehicle Routing and Scheduling with Time Window Constraints:
Models and Algorithms,” Ph.D. Dissertation, Dept. of Decision Sciences, University of Pennsylvania, 1983.
30. Tarantilis, C.D. and Kiranoudis, C.T., “A meta-heuristic algorithm for the efficient distribution of perishable foods,” Journal of Food Engineering, Vol.50, pp. 1-9, 2001.
31. Tavakkoli-moghaddam, R., Saremi, A. R. and Ziaee, M. S., “A memetic algorithm for a vehicle routing problem with backhauls,” Applied Mathematics and Computation, Vol.
181, pp. 1049-1060, 2006.
32. Toth, P. and Vigo, D., “A Heuristic Algorithm for the Symmetric and Asymmetric Vehicle Routing Problems with backhauls,” European Journal of Operational Research, Vol. 113, pp. 528-543, 1999.
33. Toth, P. and Vigo, D., “A Heuristic Algorithm for the Vehicle Routing Problems with Backhauls,” in: Banoco, L. and P. Toth (Eds.), Advanced Methods in Transportation Analysis, Springer-Verlag, Berlin, pp. 585-608, 1996.
34. Toth, P. and Vigo, D., “VRP with Backhauls,” in: Toth, P. and D. Vigo (Eds.), The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications 9, SIAM, Philadelphia, Chapter 8, pp. 195-221, 2002.
35. Toth, P. and Vigo, D., “An Exact Algorithm for the Vehicle Routing Problem with Backhauls,” Transportation Science, Vol. 31, No. 4, pp. 372-385, 1997.
36. Wassan, N., “Reactive tabu adaptive memory programming search for the vehicle routing problem with backhauls,” Journal of the Operational Research Society, Vol. 58, pp. 1630-1641, 2007.
37. Goetschalckx Marc’s Homepage:
http://www2.isye.gatech.edu/people/faculty/Marc_Goetschalckx/
2008/08/12.
38. 王生德，「以巨集啟發式方法求解時窗限制回程取貨車輛路線問題(VRPBTW)之研 究」，中華大學，碩士論文，民國93 年。
39. 王春鎰，「混合演化巨集啟發式解法應用於具時間窗車輛路線問題之研究」，國立 交通大學，碩士論文，民國97 年。
40. 何昆諭，「以巨集啟發式解法求解時間窗車輛路線問題」，國立交通大學，碩士論 文，民國95 年。
41. 卓裕仁，「以巨集啟發式方法求解多車種與週期性車輛路線問題之研究」，國立交 通大學，博士論文，民國90 年。
42. 卓裕仁、朱佑旌，「兩階段回溯式門檻接受法求解時窗限制回程取貨車輛路線問題 之研究」，運輸計畫季刊，第三十七卷，第四期，頁405-430，民國 97 年。
43. 陳仲豪，「應用時窗離散策略與可回溯式門檻接受法求解VRPBTW 問題之研究」，
國立交通大學，碩士論文，民國97 年。
44. 陳國清，「成本擾動法(NM)與兩極跳躍法(FF)在 TSP 問題應用之研究」，國立交通
大學，運輸工程與管理學系畢業專題研究報告，民國85 年。
45. 陳國清，「GDA 與 RRT 啟發式解法在 VRP 問題上之應用」，國立交通大學，碩士 論文，民國87 年。
46. 楊智凱，「以門檻接受法改善TSP 與 VRP 路網成本之研究」，國立交通大學，碩士 論文，民國84 年。
47. 廖昱傑，「應用可回溯式門檻接受法結合GENIUS 求解 VRP 問題之研究」，國立交 通大學，碩士論文，民國96 年。
48. 鄭佳琳，「結合門檻接受法與螞蟻演算法於求解車輛路線問題之研究」，中華大學，
碩士論文，民國96 年。
附錄
A 五種交換法不同順序排列對起始解之交換改善率編號 順序 平均 改善
率
編號 順序 平均 改善率 編號 順序 平均 改善率
誤差率 誤差率 誤差率
NS-001 45312 10.01% 16.76% NS-041 14325 10.75% 16.08% NS-081 51234 11.29% 15.58%
NS-002 35142 10.05% 16.72% NS-042 14235 10.76% 16.06% NS-082 23451 11.34% 15.52%
NS-003 31425 10.06% 16.68% NS-043 14532 10.76% 16.07% NS-083 45123 11.36% 15.53%
NS-004 31245 10.07% 16.68% NS-044 32145 10.76% 16.05% NS-084 21354 11.37% 15.54%
NS-005 31254 10.12% 16.63% NS-045 43251 10.76% 16.08% NS-085 54231 11.41% 15.45%
NS-006 31542 10.12% 16.63% NS-046 43521 10.76% 16.08% NS-086 41235 11.42% 15.45%
NS-007 35124 10.12% 16.66% NS-047 35214 10.77% 16.06% NS-087 23514 11.45% 15.42%
NS-008 45321 10.14% 16.66% NS-048 32415 10.79% 16.02% NS-088 41352 11.49% 15.39%
NS-009 31452 10.16% 16.58% NS-049 54312 10.79% 16.04% NS-089 42531 11.49% 15.37%
NS-010 31524 10.23% 16.53% NS-050 32154 10.80% 16.01% NS-090 23145 11.51% 15.35%
NS-011 35412 10.26% 16.54% NS-051 32541 10.80% 15.94% NS-091 42135 11.51% 15.83%
NS-012 34512 10.32% 16.46% NS-052 15423 10.81% 16.02% NS-092 54123 11.52% 15.34%
NS-013 13542 10.33% 16.49% NS-053 53124 10.85% 15.95% NS-093 23154 11.55% 15.31%
NS-014 43512 10.38% 16.41% NS-054 35241 10.86% 15.98% NS-094 24135 11.55% 15.32%
NS-015 35421 10.40% 16.41% NS-055 45132 10.87% 16.00% NS-095 41523 11.55% 15.32%
NS-016 34521 10.42% 16.39% NS-056 54321 10.88% 15.95% NS-096 45213 11.59% 15.31%
NS-017 12435 10.44% 16.39% NS-057 32514 10.89% 15.94% NS-097 21543 11.62% 15.28%
NS-018 13245 10.44% 16.39% NS-058 53214 10.98% 15.83% NS-098 23415 11.62% 15.25%
NS-019 34125 10.44% 16.36% NS-059 12453 10.99% 15.86% NS-099 41253 11.62% 15.24%
NS-020 13452 10.45% 16.38% NS-060 42351 11.00% 15.85% NS-100 41325 11.64% 15.24%
NS-021 15432 10.45% 16.37% NS-061 51423 11.02% 15.86% NS-101 21453 11.65% 15.26%
NS-022 13425 10.47% 16.35% NS-062 53421 11.02% 15.83% NS-102 24531 11.67% 15.19%
NS-023 34152 10.47% 16.32% NS-063 15243 11.03% 15.82% NS-103 54213 11.75% 15.14%
NS-024 51342 10.47% 16.36% NS-064 41532 11.04% 15.81% NS-104 52143 11.77% 15.16%
NS-025 15342 10.50% 16.33% NS-065 42315 11.04% 15.80% NS-105 21534 11.80% 15.12%
NS-026 15324 10.52% 16.31% NS-066 54132 11.06% 15.78% NS-106 42153 11.81% 15.08%
NS-027 34215 10.52% 16.28% NS-067 15234 11.09% 15.77% NS-107 24153 11.85% 15.04%
NS-028 43152 10.53% 16.27% NS-068 45231 11.09% 15.78% NS-108 42513 11.86% 15.05%
NS-029 12345 10.54% 16.30% NS-069 14253 11.14% 15.71% NS-109 52134 11.90% 15.03%
NS-030 51324 10.56% 16.28% NS-070 24351 11.14% 15.70% NS-110 24513 11.97% 14.93%
NS-031 13254 10.57% 16.25% NS-071 12534 11.15% 15.71% NS-111 25143 12.03% 14.90%
NS-032 13524 10.58% 16.25% NS-072 24315 11.15% 15.65% NS-112 25134 12.15% 14.78%
NS-033 34251 10.58% 16.23% NS-073 21435 11.16% 15.73% NS-113 52314 12.24% 14.65%
NS-034 43125 10.59% 16.21% NS-074 51243 11.16% 15.72% NS-114 52341 12.28% 14.51%
NS-035 51432 10.68% 16.19% NS-075 14523 11.17% 15.69% NS-115 52413 12.30% 14.58%
NS-036 53142 10.69% 16.10% NS-076 12543 11.18% 15.67% NS-116 25314 12.44% 14.43%
NS-037 12354 10.70% 16.15% NS-077 53412 11.18% 15.67% NS-117 25431 12.44% 14.44%
NS-038 43215 10.71% 16.13% NS-078 53241 11.24% 15.61% NS-118 25341 12.49% 14.37%
NS-039 32451 10.72% 16.10% NS-079 21345 11.27% 15.63% NS-119 25413 12.51% 14.39%
NS-040 14352 10.73% 16.11% NS-080 23541 11.28% 15.56% NS-120 52431 12.54% 14.34%
註：本表之鄰域搜尋改善法順序中各交換改善法以數字代號表示：1 代表 1-0 交換法; 2 代表 2-Opt 交換法;3 代表 2-Opt*交換法;4 代表 1-1 交換法；5 代表 Or-Opt 交換法。由左而右分別為執行之順序。
附錄
B 本研究各題最佳結果之成本及路線詳細資料例題編號 A1
文獻已知最佳解成本 229,885.65
本研究之最佳解成本 229,885.65
路線編號 經過節點順序 1 0, 9, 20, 17, 5, 0 2 0, 16, 14, 4, 0 3 0, 21, 7, 18, 0 4 0, 11, 0 5 0, 24, 22, 1, 0 6 0, 23, 19, 6, 0 7 0, 15, 8, 2, 0
8 0, 13, 25, 12, 10, 3, 0
例題編號 A2
文獻已知最佳解成本 180,119.21
本研究之最佳解成本 180,119.21
路線編號 經過節點順序 1 0, 11, 25, 13, 17, 5, 0 2 0, 16, 21, 14, 10, 12, 3, 4, 0 3 0, 9, 24, 20, 22, 1, 0
4 0, 23, 19, 6, 7, 18, 0 5 0, 15, 8, 2, 0
例題編號 A3
文獻已知最佳解成本 163,405.38
本研究之最佳解成本 163,405.38
路線編號 經過節點順序 1 0, 17, 5, 0
2 0, 18, 23, 19, 6, 7, 16, 21, 14, 4, 0 3 0, 9, 24, 20, 22, 1, 0
4 0, 11, 15, 8, 13, 25, 12, 10, 3, 2, 0
例題編號 A4
文獻已知最佳解成本 155,796.41
本研究之最佳解成本 155,796.41
路線編號 經過節點順序
1 0, 18, 23, 19, 6, 7, 16, 21, 14, 4, 0 2 0, 11, 15, 8, 13, 25, 12, 10, 3, 2, 5, 0 3 0, 17, 9, 24, 20, 22, 1, 0
例題編號 B1
文獻已知最佳解成本 239,080.16
本研究之最佳解成本 239,080.16
路線編號 經過節點順序 1 0, 27, 26, 1, 0
2 0, 16, 11, 20, 10, 8, 0 3 0, 14, 24, 21, 4, 3, 0 4 0, 12, 17, 15, 19, 5, 0 5 0, 25, 30, 29, 9, 6, 0 6 0, 13, 28, 0
7 0, 22, 23, 18, 2, 7, 0
例題編號 B2
文獻已知最佳解成本 198,047.77
本研究之最佳解成本 198,047.77
路線編號 經過節點順序
1 0, 16, 25, 30, 11, 20, 10, 8, 0 2 0, 14, 19, 5, 0
3 0, 13, 28, 24, 21, 4, 3, 0
4 0, 12, 17, 15, 22, 23, 18, 2, 7, 0 5 0, 26, 27, 29, 9, 6, 1, 0
例題編號 B3
文獻已知最佳解成本 169,372.29
本研究之最佳解成本 169,372.29
路線編號 經過節點順序
1 0, 12, 17, 15, 14, 19, 22, 18, 23, 7, 2, 9, 6, 1, 0 2 0, 26, 27, 29, 30, 25, 16, 11, 20, 10, 4, 3, 8, 0 3 0, 21, 13, 28, 24, 5, 0
例題編號 C1
文獻已知最佳解成本 250,556.77
本研究之最佳解成本 250,556.77
路線編號 經過節點順序 1 0, 28, 38, 27, 37, 1, 0 2 0, 32, 24, 36, 19, 3, 8, 4, 0 3 0, 22, 40, 31, 6, 9, 20, 0 4 0, 34, 25, 30, 13, 18, 12, 10, 0 5 0, 26, 29, 17, 5, 11, 0
6 0, 21, 35, 23, 2, 7, 15, 0 7 0, 39, 33, 16, 14, 0
例題編號 C2
文獻已知最佳解成本 215,020.23
本研究之最佳解成本 215,020.23
路線編號 經過節點順序
1 0, 21, 32, 24, 36, 19, 3, 8, 4, 15, 0 2 0, 27, 37, 31, 40, 23, 2, 20, 9, 6, 0 3 0, 22, 35, 34, 25, 30, 13, 18, 12, 7, 10, 0 4 0, 26, 29, 17, 5, 0
5 0, 28, 38, 39, 33, 1, 16, 14, 11, 0
例題編號 C3
文獻已知最佳解成本 199,345.96
本研究之最佳解成本 199,345.96
路線編號 經過節點順序
1 0, 22, 27, 37, 31, 40, 23, 35, 2, 20, 9, 6, 0 2 0, 29, 24, 36, 19, 3, 8, 4, 0
3 0, 28, 38, 39, 33, 1, 11, 14, 16, 5, 17, 0 4 0, 26, 0
5 0, 21, 32, 34, 25, 30, 13, 18, 12, 7, 10, 15, 0
例題編號 C4
文獻已知最佳解成本 195,366.63
本研究之最佳解成本 195,366.63
路線編號 經過節點順序
1 0, 29, 24, 36, 19, 3, 8, 4, 0
2 0, 21, 32, 34, 25, 30, 13, 18, 12, 7, 10, 15, 0 3 0, 22, 27, 37, 31, 40, 23, 35, 2, 20, 9, 6, 0 4 0, 26, 28, 38, 39, 33, 1, 11, 14, 16, 5, 17, 0
例題編號 D1
文獻已知最佳解成本 322,530.13
本研究之最佳解成本 322,530.13
路線編號 經過節點順序 1 0, 19, 35, 38, 2, 0 2 0, 20, 26, 32, 6, 3, 0 3 0, 33, 25, 10, 0 4 0, 28, 16, 9, 0 5 0, 12, 27, 17, 1, 0 6 0, 14, 30, 11, 0 7 0, 29, 36, 22, 0 8 0, 13, 24, 8, 0 9 0, 31, 23, 5, 4, 0 10 0, 15, 0
11 0, 34, 18, 7, 0 12 0, 21, 37, 0
例題編號 D2
文獻已知最佳解成本 316,708.86
本研究之最佳解成本 316,708.86
路線編號 經過節點順序 1 0, 31, 23, 5, 4, 0 2 0, 19, 35, 38, 0 3 0, 13, 24, 8, 0 4 0, 33, 18, 34, 7, 0 5 0, 28, 10, 25, 0
6 0, 12, 20, 26, 32, 6, 3, 0 7 0, 15, 0
8 0, 11, 9, 16, 2, 0 9 0, 37, 14, 30, 0 10 0, 22, 36, 29, 0 11 0, 21, 27, 17, 1, 0
例題編號 D3
文獻已知最佳解成本 239,478.63
本研究之最佳解成本 239,478.63
路線編號 經過節點順序 1 0, 29, 34, 18, 7, 0 2 0, 10, 28, 16, 9, 11, 2, 0 3 0, 19, 35, 38, 25, 33, 0 4 0, 30, 14, 21, 37, 15, 0 5 0, 20, 26, 32, 22, 36, 0 6 0, 31, 23, 13, 24, 8, 5, 4, 0 7 0, 12, 27, 17, 1, 6, 3, 0
例題編號 D4
文獻已知最佳解成本 205,831.94
本研究之最佳解成本 205,831.94
路線編號 經過節點順序
1 0, 33, 25, 19, 35, 38, 10, 28, 0 2 0, 22, 36, 31, 23, 13, 24, 8, 5, 4, 0 3 0, 37, 21, 14, 30, 11, 9, 16, 2, 0 4 0, 15, 12, 27, 17, 20, 26, 32, 6, 3, 1, 0 5 0, 29, 34, 18, 7, 0
例題編號 E1
文獻已知最佳解成本 238,879.58
本研究之最佳解成本 238,879.58
路線編號 經過節點順序
1 0, 23, 17, 38, 18, 10, 11, 5, 15, 0
2 0, 33, 21, 37, 24, 39, 30, 6, 12, 4, 1, 14, 0 3 0, 28, 31, 45, 35, 41, 25, 3, 7, 9, 0
4 0, 44, 0
5 0, 19, 36, 16, 27, 0 6 0, 32, 40, 22, 43, 0
7 0, 34, 42, 26, 20, 29, 8, 2, 13, 0
例題編號 E2
文獻已知最佳解成本 212,263.11
本研究之最佳解成本 212,263.11
路線編號 經過節點順序
1 0, 27, 16, 36, 19, 31, 45, 35, 41, 25, 3, 7, 9, 0 2 0, 44, 43, 17, 38, 18, 10, 11, 5, 15, 0
3 0, 28, 34, 33, 23, 21, 37, 24, 39, 30, 6, 12, 4, 1, 14, 0 4 0, 22, 32, 40, 42, 26, 20, 29, 8, 2, 13, 0
例題編號 E3
文獻已知最佳解成本 206,659.17
本研究之最佳解成本 206,659.17
路線編號 經過節點順序
1 0, 28, 31, 19, 36, 16, 27, 17, 38, 18, 10, 11, 5, 15, 1, 14, 4, 12, 6, 0 2 0, 44, 0
3 0, 34, 43, 22, 32, 40, 42, 26, 20, 29, 8, 2, 13, 0 4 0, 33, 23, 21, 37, 24, 39, 30, 35, 45, 41, 25, 3, 7, 9, 0
例題編號 F1
文獻已知最佳解成本 263,173.96
本研究之最佳解成本 267,060.43
路線編號 經過節點順序
1 0, 37, 46, 43, 44, 26, 16, 11, 9, 0
2 0, 54, 59, 60, 32, 49, 50, 5, 8, 27, 14, 13, 6, 0 3 0, 31, 58, 33, 35, 39, 19, 15, 25, 12, 4, 2, 0 4 0, 56, 36, 52, 40, 10, 23, 28, 17, 22, 0 5 0, 47, 41, 57, 34, 29, 30, 20, 1, 0
6 0, 55, 42, 48, 51, 53, 45, 38, 7, 3, 18, 24, 21, 0
例題編號 F2
文獻已知最佳解成本 265,214.16
本研究之最佳解成本 265,214.16
路線編號 經過節點順序
1 0, 31, 33, 35, 39, 15, 19, 17, 22, 9, 0
2 0, 55, 42, 48, 51, 53, 45, 38, 18, 24, 21, 20, 0 3 0, 43, 54, 44, 58, 26, 16, 11, 0
4 0, 59, 60, 32, 49, 50, 5, 13, 6, 0 5 0, 47, 41, 57, 34, 29, 2, 12, 4, 30, 1, 0 6 0, 56, 40, 36, 52, 25, 10, 23, 28, 0 7 0, 37, 46, 14, 8, 27, 7, 3, 0
例題編號 F3
文獻已知最佳解成本 241,120.77
本研究之最佳解成本 241,969.77
路線編號 經過節點順序
1 0, 43, 54, 59, 60, 32, 49, 50, 5, 8, 27, 7, 14, 13, 6, 0 2 0, 31, 33, 58, 44, 35, 39, 15, 19, 26, 16, 11, 0 3 0, 56, 40, 36, 52, 25, 10, 23, 28, 17, 22, 9, 0 4 0, 55, 47, 41, 57, 34, 29, 2, 12, 4, 30, 20, 1, 0 5 0, 46, 37, 38, 45, 53, 51, 48, 42, 21, 24, 18, 3, 0
例題編號 F4
文獻已知最佳解成本 233,861.84
本研究之最佳解成本 235,175.20
路線編號 經過節點順序
1 0, 55, 47, 34, 57, 41, 42, 48, 51, 53, 45, 38, 7, 3, 18, 24, 21, 20, 1, 0 2 0, 31, 33, 58, 44, 35, 39, 19, 15, 10, 23, 28, 17, 22, 9, 0
3 0, 37, 46, 43, 54, 59, 60, 32, 49, 50, 5, 8, 27, 14, 13, 6, 16, 26, 11, 0 4 0, 56, 40, 36, 52, 25, 12, 4, 30, 29, 2, 0
例題編號 G1
文獻已知最佳解成本 306,305.40
本研究之最佳解成本 306,492.34
路線編號 經過節點順序
1 0, 14, 32, 44, 50, 49, 11, 0 2 0, 37, 29, 23, 39, 42, 2, 0 3 0, 24, 45, 21, 55, 31, 0 4 0, 19, 0
5 0, 26, 40, 27, 35, 7, 9, 0
6 0, 51, 30, 36, 28, 17, 5, 10, 6, 4, 0 7 0, 43, 54, 56, 25, 41, 16, 0
8 0, 53, 34, 52, 18, 0
9 0, 46, 48, 33, 38, 22, 12, 1, 3, 0 10 0, 15, 47, 13, 20, 57, 8, 0
例題編號 G2
文獻已知最佳解成本 245,440.99
本研究之最佳解成本 245,660.11
路線編號 經過節點順序
1 0, 46, 57, 32, 14, 29, 37, 23, 39, 42, 2, 0 2 0, 13, 20, 44, 50, 49, 47, 15, 11, 8, 0 3 0, 24, 45, 21, 55, 31, 16, 41, 56, 19, 0 4 0, 27, 35, 33, 38, 48, 22, 1, 12, 3, 0 5 0, 43, 53, 34, 52, 18, 25, 54, 0
6 0, 40, 26, 51, 30, 36, 28, 17, 5, 10, 6, 4, 7, 9, 0
例題編號 G3
文獻已知最佳解成本 229,507.48
本研究之最佳解成本 229,507.48
路線編號 經過節點順序
1 0, 16, 41, 52, 34, 18, 25, 56, 54, 19, 0 2 0, 43, 53, 13, 20, 44, 50, 49, 47, 15, 11, 8, 0 3 0, 26, 40, 27, 35, 33, 38, 48, 22, 1, 12, 3, 0 4 0, 46, 57, 32, 14, 29, 37, 23, 39, 42, 2, 0
5 0, 51, 24, 21, 31, 55, 45, 30, 36, 28, 17, 5, 10, 6, 4, 7, 9, 0
例題編號 G4
文獻已知最佳解成本 232,521.25
本研究之最佳解成本 233,319.76
路線編號 經過節點順序
1 0, 19, 16, 41, 52, 18, 25, 56, 54, 43, 0
2 0, 51, 24, 21, 31, 55, 45, 30, 36, 28, 17, 5, 10, 6, 4, 7, 9, 0 3 0, 26, 40, 27, 35, 33, 38, 48, 22, 12, 1, 3, 0
4 0, 57, 32, 14, 29, 37, 23, 39, 42, 2, 0 5 0, 46, 0
6 0, 53, 34, 15, 13, 20, 44, 50, 49, 47, 11, 8, 0
例題編號 G5
文獻已知最佳解成本 221,730.35
本研究之最佳解成本 221,730.35
路線編號 經過節點順序 1 0, 46, 0
2 0, 53, 54, 56, 41, 25, 18, 52, 34, 13, 15, 47, 49, 11, 8, 0 3 0, 57, 20, 44, 50, 32, 14, 29, 37, 23, 39, 42, 2, 0
4 0, 43, 19, 16, 31, 55, 21, 45, 24, 30, 36, 28, 17, 5, 10, 6, 4, 7, 9, 0 5 0, 51, 26, 40, 27, 35, 33, 38, 48, 22, 1, 12, 3, 0
例題編號 G6
文獻已知最佳解成本 213,457.45
本研究之最佳解成本 213,457.45
路線編號 經過節點順序
1 0, 19, 54, 56, 41, 16, 31, 55, 21, 45, 24, 30, 36, 28, 17, 5, 10, 6, 4, 7, 9, 0 2 0, 43, 53, 25, 18, 52, 34, 15, 13, 20, 44, 50, 49, 47, 11, 8, 0
3 0, 46, 57, 32, 14, 29, 37, 23, 39, 42, 2, 0 4 0, 51, 26, 40, 27, 35, 33, 38, 48, 22, 1, 12, 3, 0
例題編號 H1
文獻已知最佳解成本 268,933.06
本研究之最佳解成本 268,933.06
路線編號 經過節點順序
1 0, 42, 66, 45, 30, 54, 41, 32, 29, 43, 11, 17, 23, 21, 5, 10, 0 2 0, 33, 31, 55, 37, 59, 47, 65, 53, 68, 2, 20, 6, 4, 13, 0 3 0, 64, 35, 57, 27, 67, 25, 39, 24, 0
4 0, 48, 40, 38, 46, 52, 36, 8, 9, 7, 14, 18, 15, 0 5 0, 51, 49, 60, 63, 28, 61, 0
6 0, 44, 62, 26, 58, 56, 50, 34, 3, 22, 16, 1, 12, 19, 0
例題編號 H2
文獻已知最佳解成本 253,365.50
本研究之最佳解成本 253,365.50
路線編號 經過節點順序
1 0, 60, 63, 42, 66, 45, 30, 54, 41, 32, 29, 43, 11, 17, 23, 21, 5, 10, 0 2 0, 51, 49, 28, 61, 0
3 0, 33, 31, 55, 48, 40, 37, 59, 47, 65, 53, 68, 2, 20, 6, 4, 13, 0 4 0, 64, 35, 57, 24, 27, 67, 25, 56, 50, 34, 3, 22, 16, 1, 12, 19, 0 5 0, 44, 39, 62, 58, 26, 46, 38, 52, 36, 8, 9, 7, 14, 18, 15, 0
例題編號 H3
文獻已知最佳解成本 247,449.04
本研究之最佳解成本 247,449.04
路線編號 經過節點順序
1 0, 51, 33, 31, 55, 48, 40, 37, 59, 47, 65, 53, 68, 2, 20, 6, 4, 13, 0
2 0, 28, 49, 60, 63, 42, 66, 45, 30, 54, 41, 32, 29, 43, 11, 17, 23, 21, 5, 10, 0 3 0, 61, 64, 35, 57, 24, 27, 67, 25, 56, 50, 34, 3, 22, 16, 1, 12, 19, 0
4 0, 44, 39, 62, 58, 26, 46, 38, 52, 36, 8, 9, 7, 14, 18, 15, 0
例題編號 H4
文獻已知最佳解成本 250,220.77
本研究之最佳解成本 250,220.77
路線編號 經過節點順序 1 0, 61, 0
2 0, 51, 33, 31, 55, 48, 40, 37, 59, 47, 65, 53, 68, 2, 20, 6, 4, 13, 0 3 0, 64, 35, 57, 24, 27, 67, 25, 56, 50, 34, 3, 22, 16, 1, 12, 19, 0
4 0, 28, 49, 60, 63, 42, 66, 45, 30, 54, 41, 32, 29, 43, 11, 17, 23, 21, 5, 10, 0 5 0, 44, 39, 62, 58, 26, 46, 38, 52, 36, 8, 9, 7, 14, 18, 15, 0
例題編號 H5
文獻已知最佳解成本 246,121.31
本研究之最佳解成本 246,121.31
路線編號 經過節點順序
1 0, 61, 28, 49, 60, 63, 42, 66, 45, 30, 54, 41, 32, 29, 43, 11, 17, 23, 21, 5, 10, 0 2 0, 51, 33, 31, 55, 48, 40, 37, 59, 47, 65, 53, 68, 2, 20, 6, 4, 13, 0
3 0, 64, 35, 57, 24, 27, 67, 25, 56, 50, 34, 3, 22, 16, 1, 12, 19, 0 4 0, 44, 39, 62, 58, 26, 46, 38, 52, 36, 8, 9, 7, 14, 18, 15, 0
例題編號 H6
文獻已知最佳解成本 249,135.32
本研究之最佳解成本 249,135.32
路線編號 經過節點順序
1 0, 51, 28, 49, 60, 63, 42, 66, 45, 30, 54, 41, 32, 29, 43, 11, 17, 23, 21, 5, 10, 0 2 0, 33, 31, 55, 48, 40, 37, 59, 47, 65, 53, 68, 2, 20, 6, 4, 13, 0
3 0, 61, 0
4 0, 44, 39, 62, 58, 26, 46, 38, 52, 36, 8, 9, 7, 14, 18, 15, 0 5 0, 64, 35, 57, 24, 27, 67, 25, 56, 50, 34, 3, 22, 16, 1, 12, 19, 0
例題編號 I1
文獻已知最佳解成本 350,245.28
本研究之最佳解成本 350,245.28
路線編號 經過節點順序
1 0, 71, 62, 70, 90, 76, 2, 29, 15, 19, 6, 0 2 0, 51, 67, 53, 77, 83, 13, 44, 12, 25, 16, 0 3 0, 54, 88, 38, 28, 23, 32, 0
4 0, 81, 46, 86, 20, 36, 34, 45, 11, 0 5 0, 78, 79, 50, 82, 3, 35, 18, 0
6 0, 80, 48, 73, 59, 63, 57, 33, 9, 7, 30, 1, 0 7 0, 75, 74, 69, 58, 61, 52, 37, 43, 22, 40, 0 8 0, 55, 85, 89, 87, 49, 56, 72, 41, 10, 39, 4, 14, 0 9 0, 64, 47, 65, 66, 68, 60, 42, 26, 8, 5, 21, 24, 0 10 0, 84, 31, 17, 27, 0
例題編號 I2
文獻已知最佳解成本 309,943.84
本研究之最佳解成本 309,943.84
路線編號 經過節點順序
1 0, 54, 88, 64, 47, 65, 66, 68, 60, 42, 26, 8, 5, 21, 32, 24, 0 2 0, 55, 85, 51, 89, 87, 49, 56, 72, 41, 39, 6, 19, 34, 45, 18, 0 3 0, 75, 74, 69, 58, 61, 52, 37, 43, 22, 40, 16, 31, 0
4 0, 78, 79, 50, 82, 3, 35, 38, 28, 23, 0
5 0, 84, 67, 53, 77, 83, 13, 44, 12, 25, 17, 27, 0
6 0, 80, 46, 48, 73, 59, 63, 57, 33, 9, 7, 30, 20, 36, 1, 0 7 0, 81, 71, 62, 70, 90, 86, 76, 2, 29, 15, 10, 4, 14, 11, 0
例題編號 I3
文獻已知最佳解成本 294,507.38
本研究之最佳解成本 294,507.38
路線編號 經過節點順序
1 0, 78, 79, 50, 82, 80, 46, 48, 73, 59, 63, 57, 33, 9, 7, 30, 20, 36, 1, 3, 35, 0 2 0, 55, 85, 51, 89, 87, 67, 84, 53, 77, 83, 13, 44, 12, 25, 41, 4, 14, 11, 0 3 0, 54, 88, 64, 47, 65, 66, 68, 60, 42, 26, 8, 5, 21, 28, 38, 23, 18, 0
4 0, 81, 71, 49, 72, 56, 62, 70, 90, 86, 76, 2, 29, 15, 10, 39, 6, 19, 34, 45, 0 5 0, 75, 74, 69, 58, 61, 52, 37, 43, 22, 40, 16, 31, 17, 24, 32, 27, 0
例題編號 I4
文獻已知最佳解成本 295,988.44
本研究之最佳解成本 296,271.32
路線編號 經過節點順序
1 0, 55, 85, 51, 89, 87, 49, 56, 72, 41, 4, 14, 11, 0
2 0, 84, 67, 53, 77, 83, 13, 22, 44, 12, 25, 16, 40, 31, 17, 27, 0 3 0, 75, 74, 69, 58, 61, 52, 37, 43, 8, 26, 5, 21, 32, 24, 0 4 0, 54, 88, 64, 47, 65, 66, 68, 60, 42, 38, 28, 23, 18, 0
5 0, 81, 71, 62, 70, 90, 86, 76, 29, 2, 15, 10, 39, 6, 19, 34, 45, 0
6 0, 78, 79, 50, 82, 80, 46, 48, 73, 59, 63, 57, 33, 9, 7, 30, 20, 36, 1, 3, 35, 0
例題編號 I5
文獻已知最佳解成本 301,236.00
本研究之最佳解成本 301,236.00
路線編號 經過節點順序
路線編號 經過節點順序