參考文獻 |
1. 王元鵬(2006),仿水流離散優化演算法,國立台灣大學工業工程研究所碩士論文,台北。
2. 王文鴻(2003),基因演算法結合模糊切割應用於配送路徑之研究,中華大學資訊工程學系碩士論文,新竹。
3. 王保元(2000),物流中心冷凍食品配送模式之研究,朝陽科技大學工業工程管理學系碩士論文,台中。
4. 何秉珊(2008),道路緊急搶修車輛途程問題之研究,國立中央大學土木工程學系碩士論文,中壢。
5. 李佳蓮(2006),車輛途程問題的廣域搜尋法,國立成功大學土木工程學系碩士論文,台南。
6. 邱仕銘(2006),同時收送貨車輛配送問題之研究,長榮大學經營管理研究所碩士論文,台南。
7. 高世昌(2002),考量同時送貨及收貨之多場站車輛途程問題,逢甲大學工業工程學系碩士論文,台中。
8. 莊英群(2003),應用禁忌搜尋法於混合送收貨之車輛途程問題,逢甲大學工業工程學系碩士論文,台中。
9. 許家筠(2008),時窗限制虛擬場站接駁補貨車輛途程問題之研究,國立中央大學土木工程學系碩士論文,中壢。
10. 陳惠國(2009),網路分析課程講義,國立中央大學,中壢。
11. 陳惠國、黃炳霖(2008),仿水流優化演算法之應用與改良-以旅行推銷員為例,第十六屆模糊理論及其應用研討會,中壢。
12. 彭冠儒(2002),考量同時送貨及收貨之車輛途程問題,逢甲大學工業工程學系碩士論文,台中。
13. 彭冠儒、陳正芳(2002),「混合送貨、收貨的車輛途程問題」,2002年產業電子化運籌管理學術暨實務研討會論文集,pp. 150-157,桃園。
14. 曾惠鈺(2002),即時行車資訊下物流配送作業規劃之研究,淡江大學運輸管理學系碩士論文,台北。
15. 馮正民、邱裕鈞(2004),研究分析方法,建都文化事業股份有限公司,新竹,pp. 339-358。
16. 黃信穎(2005),同時處理收貨與送貨業務之配送路線規劃,立德管理大學應用資訊研究所碩士論文,台南。
17. 楊雅斐(2005),使用改良式遺傳演算法求解車輛途程問題,立德管理大學應用資訊研究所碩士論文,台南。
18. 楊馥豪(2005),時窗限制下混合收送貨之配送路線規劃,立德管理大學應用資訊研究所碩士論文,台南。
19. 廖雯慈(1997),應用基因演算法求解優先順序旅行推銷員問題,元智大學工業工程學系碩士論文,中壢。
20. 謝伯昂(2002),考慮收送貨與選擇貨運公司服務的車輛途程問題,國立海洋大學航運管理學系碩士論文,基隆。
21. Apte, U.M., Mason, F.M., (2006), “Analysis and Improvement of Delivery Operations at the San Francisco Public Library,” Journal of Operations Management, Vol. 24, pp. 325-346.
22. Bodin, L., Golden, B., Assad, A., Ball, M., (1983), “Routing and Scheduling of Vehicles and Crews,” Computers and Operations Research, Vol. 10, pp. 63-211.
23. Clarke, G., Wright, J.W., (1964), “Scheduling of Vehicles from a Central Depot to a Number of Delivery Points,” Operations Research Quarterly, Vol. 12, No. 4, pp. 568-581.
24. Danzig, G.B., Ramser, R.H., (1959), “The Truck Dispatching Postman,” Management Science, Vol. 6, pp. 80-91.
25. Dorigo, M., Maniezzo, V., Colorni, A., (1991), “Positive Feedback as a Search Strategy,” Technical Report, Milano, Italy.
26. Dueck, G., (1993), “New Optimization Heuristics: The Great Deluge Algorithm and the Record-to-Record Travel,” Journal of Computational Physics, Vol.104, pp. 86-92.
27. Dueck, G., Scheuer, T., (1990), “Threshold Accepting: A General Purpose Optimization Algorithm Appeared Superior to Simulated Annealing,” Journal of Computational Physics, Vol. 90, pp. 161-175.
28. Fisher, M.L., Jaikumar, R., (1981), “A Generalized Assignment Heuristic for Vehicle Routing,” Networks, Vol. 11, pp. 109-124.
29. Garey, M.R., Johnson, D.S., (1979), Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, W.H. and Company, New York, NY, USA.
30. Gillett, B., Miller, L., (1974), “A Heuristic Algorithm for the Vehicle Dispatch Problem,” Operations Research, Vol. 22, No. 2, pp. 340-349.
31. Glover, F., (1989), “Tabu Search-Part I,” ORSA Journal on Computing, Vol. 1, No. 3, pp. 190-206.
32. Glover, F., (1990), “Tabu Search-Part II,” ORSA Journal on Computing, Vol. 2, No. 1, pp. 4-32.
33. Ho, W., Ho, T.S.G., Ji, P., Lau, C.W.H., (2008), “A Hybrid Genetic Algorithm for the Multi-Depot Vehicle Routing Problem,” Engineering Applications of Artificial Intelligence, Vol. 21, pp. 548-557.
34. Holland, J.H., (1975), Adaptation in Natural and Artificial System, University of Michigan Press, Ann Arbor, Michigan, USA.
35. Hsueh, C.F., Chen, H.C., Chou, H.W., (2008), “Vehicle Routing for Rescue Operation in Natural Disasters,” In Caric, T., Gold, H.(Eds), Vehicle Routing Problem, I-Tech Education and Publishing KG, Vienna, Austria, pp. 71-84.
36. Hwang, H.S., (2002), “An Improved Model for Vehicle Routing Problem with Time Constraint Based on Genetic Algorithm,” Computers and Industrial Engineering, Vol. 42, pp. 361-369.
37. Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P., (1983), “Optimization by Simulated Annealing,” Science, Vol. 220, pp. 671-680.
38. Lin, S., (1965), “Computer Solution of the Traveling Salesman Problem,” Bell System Technical Journal, Vol. 44, pp. 2245-2269.
39. Min, H., (1989), “The Multiple Vehicle Routing Problem with Simultaneous Delivery and Pick-up Points,” Transportation Research, Part A. Vol. 23, pp. 377-386.
40. Or, I., (1976), Traveling Salesman-Type Combinatorial Problems and Their Relation to the Logistics of Blood Banking, Ph.D. Thesis, Department of Industrial Engineering and Management Science, Northwestern University, Evanston, Illinois, USA.
41. Potvin, J.Y., Kervahut, T., Garcia, B.L., Rousseau, J.M., (1996), “The Vehicle Routing Problem with Time Windows Part I: Tabu Search,” INFORMS Journal on Computing, Vol. 8, No. 2, pp. 158-164.
42. Potvin, J.Y., Rousseau, J.M., (1995), “An Exchange Heuristic for Routing Problems with Time Windows,” Journal of the Operational Research Society, Vol. 46, pp. 1433-1446.
43. Psaraftis, H.N., (1995), “Dynamic Vehicle Routing: Status and Prospect,” Annals of Operations Research, Vol. 61, pp. 143-164.
44. Savelsbergh, M.W.P., (1992), “The Vehicle Routing Problem with Time Windows: Minimizing Routing Duration,” ORSA Journal on Computing, Vol. 4, No. 2, pp. 146-154.
45. Schruben, L.W., Clifton, R.E., (1968), “The Lockset Method of Sequential Programming Applied to Routing Delivery and Pickup Trucks,” American Journal of Agricultural Economics, Vol. 50, No. 4, pp. 854-867.
46. Solomon, M.M., (1986), “On the Worst-case Performance of Some Heuristics for the Vehicle Routing and Scheduling Problem with Time Windows Constraints,” Networks, Vol. 16, pp. 161-174.
47. Solomon, M.M., (1987), “Algorithm for the Vehicle Routing and Scheduling Problems with Time Windows Constraints,” Operations Research, Vol. 35, pp. 254-265.
48. Solomon, M.M., Desrosiers, J., (1988), “Time Windows Constrained Routing and Scheduling Problems,” Transportation Science, Vol. 22, pp. 1-13.
49. Syswerda, G., (1989), “Uniform Crossover in Genetic Algorithms,” In Schaffer, J.D.(Ed), Proceedings of the Third International Conference on Genetic Algorithms, Morgan Kaufmann Publishers Incorporate, San Francisco, CA, USA, pp. 2-9.
50. Wang, C.H., Lu, J.Z., (2009), “A Hybrid Genetic Algorithm that Optimizes Capacitated Vehicle Routing Problem,” Expert System with Applications: An International Journal, Vol. 36, pp. 2921-2936.
|