參考文獻 |
〔1〕 Dantzig, G. B. & Ramser, J. H., “The truck dispatching problem”,Management Science
Vol 6, pp. 80–91, October 1959.
〔2〕 Bodin, L., et al., “Routing and scheduling of vehicles and crews:the state of the art”,
Computers & Operations Research, Vol 10, pp. 63–211, 1983.
〔3〕 Fisher, M.L., and Jaikumar, R., “A generalize assignment heuristic for vehicle routing”
Networks, Vol 11, pp.109-124, 1981.
〔4〕 Lin, C. H., et al, "Survey of Green Vehicle Routing Problem: Past and future trends",
Expert Systems with Applications, Vol 41-4, pp. 1118-1138, 2014.
〔5〕 Russell, R., “An effective heuristic for the M-Tour traveling salesman problem with
some side conditions” Operations Research, Vol 25, pp. 517–524, 1977.
〔6〕 Wilson, H., & Weissberg, H, Advanced dial-a-ride algorithms research project: final
report, Technical Report. R76-20, Department of Civil Engineering, MIT, Cambridge,
MA., 1967.
〔7〕 Parragh, S. N., et al., “A survey on pickup and delivery problems. Part I: transportation
between customers and depot”, Journal für Betriebswirtschaft, Vol 58, pp. 21–51,
2008.
〔8〕 Tillman, F. A., “The multiple terminal delivery problem with probabilistic demands.”,
Transportation Science, Vol 3, pp.192–204. 1969.
〔9〕 Beltrami, E. J., & Bodin, L. D, ” Networks and vehicle routing for municipal waste
collection”, Networks, Vol 4, pp. 65–94, 1974.
〔10〕 Zhong, Y. & Cole, M., "A vehicle routing problem with backhauls and time windows :
a guided local search solution”, Transportation Research Part E: Logistics and
Transportation Review, Vol 41, issue 2, pp. 131-144, 2005.
〔11〕 Gillett, B. & Miller L., “A Heuristic for the Vehicle Dispatching Problem”, Operations
Research, Vol 22, pp. 340-349, 1974.
〔12〕 Prins, C., “The route-first cluster-second principle in vehicle routing”, Institute
Charles Delaunay, University of Technology of Troyes, France, 2008.
〔13〕 Mole, R.H., & Jameson, S.R.,“A Sequential Route-Building Algorithm Employing
Generalized Saving Criterion”, Operation Research Quarterly, Vol 27, pp.503-527,
1976.
〔14〕 柯景文,「禁制搜尋法於動態車輛巡迴路線問題之研究」,逢甲大學,碩士論文,
民國91年。
〔15〕 呂英志,「即時資訊下車輛路線問題之研究」,逢甲大學,碩士論文,民國90年。
〔16〕 游紹強,「物流業靜態車輛路線問題之研究」,萬能科技大學,碩士論文,民國
97年。
〔17〕 Held, M., & Karp, R., “The Traveling Salesman Problem and Minimum Spanning
Trees Part II”, Mathematical Programming, Vol 1, pp. 6-25, 1971.
〔18〕 鄭志宏、林義隆:Global Optimization Technique,取自
http://jjcommons.csie.isu.edu.tw/research/research.htm。
〔19〕 Metropolis, N., et al., “Equations of state calculations by fast computing machines,”
Journal of Chemical Physics, Vol 21, pp. 1087-1092, 1953.
〔20〕 Kirkpatrick, S., et al., “Optimization by simulated annealing,” Science, Vol 220, pp.
671-680, 1983.
〔21〕 李世炳,鄒忠毅,「簡介導引模擬退火法及其應用」,中央研究院物理研究所,物
理雙月刊,第廿四卷第二期,Pages 307-319,民國91年。
〔22〕 黃衍明:「基因演算法之基本概念、方法與國內相關研究概況」,成功大學,取自
http://myweb.ncku.edu.tw/~ftlin/course/CAAD/frame.htm。
〔23〕 Holland, J. H.,” Adaptation in natural and artificial systems: An introductory analysis
with applications to biology, control, and artificial intelligence.”, Oxford, England: U
Michigan, 1975.
〔24〕 莊政杰 (2013),「在考量尖峰時間下具時窗限制之多趟次車輛途程問題」,雲林
科技大學,碩士論文,民國102。
〔25〕 Glover, F., “Tabu Search-PartⅠ", ORSA Journal on Computing, Vol 1, pp. 190-206,
1989.
〔26〕 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.
〔27〕 李洪鑫,「含時間窗車輛途程問題各演算法適用範圍之探討」,東海大學
,碩士論文,民國89年。
〔28〕 Colorni, A., & Dorigo M., & Maniezzo, V., “Distributed optimization by antcolonies,”
Proceedings of the 1st European Conference on Artificial Life, pp. 134-142, Paris,
1991.
〔29〕 Dorigo, M., et al., ”The Ant System : Optimization by a colony of cooperating agents“
IEEE Transactions on Systems, Man, and Cybernetics-Part B, Vol 26, pp. 1-13, 1996.
〔30〕 曹修源,MANAGEMENT SCIENCE,淡江大學,管理科學講義,民國98年。
〔31〕 Taillard, E., et al., "Vehicle Routing with Multiple Use of Vehicles", Journal of the
Operational Research Society, Vol 47, pp. 1065-1070, 1996.
〔32〕 Rasmussen, R., “TSP in spreadsheets—A fast and flexible tool”. Omega, Vol 39-1, pp.
51-63, 2011.
〔33〕 Davendra, D., Traveling Salesman Problem, Theory and Applications, InTech,
December 2010. |