醫院的運輸部門在運送病人的過程中，為了滿足病人的運輸需求以及其他相關檢驗部門的時間，必須要做出最佳運輸路線的決策，以往並未有學者對這類問題詳加探討。而現今各大型醫學中心的運輸中心個數不一，如何決定運輸中心的最適個數來讓整個運輸時間以及運輸成本為最小是本研究的重點。
運輸路線、運輸中心的設置和個數的決定屬於車輛途程問題（VRP；Vehicle Routing Problem），而車輛途程問題一般包含三個部分，第一為決定場站的位置與個數，第二為決定使用車輛的大小與數量，第三為決定車輛的路線，此三部份各有其困難與複雜的地方。本研究考慮第一與第三部份，將車輛途程問題應用在醫院的運輸部門來研究，以傳統的路線問題為骨幹，加上考慮運輸中心個數、時窗限制來建立數學模式，再以雙層矩陣染色體編碼方式的遺傳演算法來求解，並且對結果法做相對的比較分析，以求得一個最佳的運輸中心個數，作為日後醫院設置運輸中心時參考的指標。

none

1. 李玉雯（2000），「軟性時窗限制下醫院運輸部門車輛途程問題之研究」，成功大學工業管理研究所，碩士論文。
2. 敖君瑋（1999），「禁忌搜尋法於軟性時窗限制之車輛途程問題研究」，元智大學工業工程研究所，碩士論文。
3. 黃文志（1993），「用基因遺傳演算法解集合涵蓋問題」，台灣大學資訊工程學研究所，碩士論文。
4. 蔡輝昇（1985），「配送中心位置和運輸路線問題聯立最佳解之研究」，運輸計劃季刊，第14卷第1期，頁117-128。
5. 簡世釗（2001），「時窗與容量限制下車輛途程問題之研究」，成功大學工業管理研究所，碩士論文。
6. Bodin, L., B. Golden, A. Assad and M. Ball（1983）,“Routing and Scheduling of Vehicle and Crews: The state of the Art,”Computers and Operation Research, 10, pp.63-211.
7. Chao, I. M., et al（1993）,“A New Heuristic for the Multi-Depot Vehicle Routing Problem That Improve Upon Best-Known Solutions,”Am. J. Math. Mgmt. Sci., 13, pp.371-406.
8. Clark, G. and J. Wright（1964）,“Scheduling of Vehicles from a Central Depot to Number of Delivery Points,”Operation Research, 12, pp.568-581.
9. Coit, D. W.（1996）,“Penalty Guided Genetic Search for Reliability Design Optimization,”Computers Industrial Engineering, 30(4), pp.895-904.
10. Cordeau, J. F., et al（2001）,“A Unified Tabu Search Heuristic for Vehicle-Routing Problems with Time Windows,”Journal of the Operational Research Society, 52(8), pp.928-936.
11. Dantzig, G. and J. H. Ramser（1959）,“The Truck Dispatching Problem,”Management Science, 6, pp.80-91.
12. Falkenauer, E. and Bouffouix, S.（1991）,“A Genetic Algorithm for Job Shop,”Proceedings of the 1991 IEEE International Conference on Robotics and Automation, Sacramento, Califomia, pp.824-829.
13. Fisher, M. L.（1995）,“Vehicle Routing,”Chapter 1 in M. Ball, T. Magnati, C. Monma, and G. Nemhauser (eds), Network Routing, Handbooks in Operations Research and Management Science, Vol.8, pp.1-33.
14. Fisher, M. L., and Jaikumar, R.（1981）,“A Generalize Assignment Heuristic for Vehicle Routing Problems,”Networks, 11, pp.109-124.
15. G. Laporte, et al（1988）,“Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems,”Transportation Science, 23(3), pp.161-172.
16. Gen, M., and L. Miller（1997）,“Foundation of Genetic Algorithms,”Genetic Algorithms＆ Engineering Design, pp.1-41.
17. Gillett, B., and L. Miller（1974）,“A Heuristic Algorithm for the Vehicle Dispatch Problem,”Operation Research, 22, pp.340-349.
18. Glover, F. and Greenberg, H.（1989）,“New Approaches for Heuristic Search: A Bilateral Linkage with Artificial Intelligence,”European Journal of Operational Research, 39, pp.119-130.
19. Golden, B. L., T. L. Magnanti and H. Q. Nguyen（1977）,“Implementing Vehicle Routing Algorithm,”Networks, 7(2), pp.113-148.
20. Kolen, A., J. Rinnooy, and H. Trienekens（1987）,“Vehicle Routing with Time Windows,”Operation Research, 35(2), pp.266-273.
21. Koskosidis, Y. A., Powell, W. B., and Soloman, M. M.（1992）,“An Optimization-Based Heuristics for Vehicle Routing and Scheduling with soft Time Window Constraints,”Transportation Science, 26(2), pp.65-85.
22. Liepins, G., et al（1990）,“Genetic Algorithms Application to set Covering and Traveling Salesman Problems,”in Brown, editor, OR/AI: The Integration of Problem Solving Strategies.
23. Lin, S.（1965）, “Computer Solutions of the Traveling Salesman Problem,”Bell System Technical Journal, 44, pp.2245-2269.
24. Lin, S., and B. Kernighan（1973）,“An Efficient Heuristic Algorithm for the Traveling Salesman Problem,”Operation Research, 21, pp.498-516.
25. Potvin, J. Y., and J. M. Rousseau（1993）,“A Parallel Route Building Algorithm for the Vehicle Routing and Scheduling Problem with Time Windows,”European Journal of Operational Research, 66(3), pp.331-340.
26. Potvin, J. Y., and S. Bengio（1996）,“The Vehicle Routing Problem with Time Windows－PartⅡ: Genetic Search,”INFORMS Journal on Computing, 8(2), pp.165-172.
27. Renaud, J., et al（1996）,“A Tabu Search Heuristic for The Multi-Depot Vehicle Routing Problem,”Computer ＆Operations Research, 23(3), pp.229-235.
28. Roberto, W. C.（2000）,“A New Heuristic for the Traveling Salesman Problem with Time Windows,”Transportation Science, 34(1), pp 113-124.
29. Russell, R., A.（1995）,“Hybrid Heuristics for the Vehicle Routing Problem with Time Windows,”Transportation Science, 29(2), pp156-166.
30. Soloman, M. M.（1987）,“Algorithms foe the Vehicle Routing and Scheduling Problems with Time Window Constrains,”Operation Research,35, pp.254-265.
31. Taillard, et al（1997）,“A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows,”Transportation Science, 31(2), pp.170-186.
32. Tillman, F. A.（1969）,“The Multiple Terminal Delivery Problem with Probabilistic Demands,”Transportation Science, 3(3), pp.192-204.
33. Yeh, C. H.（1996）, “A Literature Review on the Components Improvement of Genetic Algorithms,” Journal of Taiwan Water Conservancy, 44(1), pp95-105.