[1] 行政院(2007),「我國長期照顧十年計畫」背景說明,擷取自行政院新聞局:http://info.gio.gov.tw/ct.asp?xItem=32293&ctNode=3764
[2] 中央健康保險局(2009),居家照護業務,擷取自http://www.nhitb.gov.tw/xhospital/personnel/business/family.asp?Leveldata=$4$424$427
[3] 內政部(2003),老人狀況調查摘要分析,擷取自內政部調查報告分析
[4] 方志成(2003),應用蟻群系統於自動化排程之研究,佛光人文社會學院資訊學研究所,碩士論文[5] 台灣長期照護專業協會(2009),認識台灣長期照護服務模式,擷取自http://www.ltcpa.org.tw/public/choose_01.html
[6] 吳淑瓊,江東亮(1995),台灣地區長期照護的問題與對策,中華衛誌[7] 李光廷,甘崇瑋,邱麒璋(2005),以多樣化就業型態發展居家照護市場的可近性及人力調查研究,社會暨健康政策的變動與創新趨勢
[8] 李美華(2007),獨居老人居家照護需求之探討,佛光大學社會教育學研究所,碩士論文
[9] 林添富(2002),從人口老化探討未來宜蘭地區長期照護機構發展研究(至2013年),佛光大學未來學研究所,碩士論文[10] 高雄榮民總醫院(2009),高榮家醫:一般居家照顧,擷取自高雄榮民總醫院: http://www.vghks.gov.tw/fm/homecare.htm
[11] Agha I, A., & Jeffery L, K., (1986), The asymmetric m-traveling salesman problem: A duality based branch-and-bound algorithm, Discrete Applied Mathematics, 13(2-3), 259–276.
[12] Akjiratikarl, C., Yenradee, P., & Drake, P. R., (2007), PSO-based algorithm for home care worker scheduling in the UK, Computers & Industrial Engineering, 53(4), 559-583.
[13] Bektas, T., (2006), The multiple traveling salesman problem: an overview of formulations and solution procedures, Omega, 34(3), 209-219.
[14] Bell, J. E., & McMullen, P. R., (2004), Ant colony optimization techniques for the vehicle routing problem, Advanced Engineering Informatics, 18(1), 41-48.
[15] Blum, C., (2005), Ant colony optimization: Introduction and recent trends, Physics of Life Reviews, 2(4), 353-373.
[16] Chaharsooghi, S. K., & Meimand Kermani, A. H., (2008), An effective ant colony optimization algorithm (ACO) for multi-objective resource allocation problem (MORAP), Applied Mathematics and Computation, 200(1), 167-177.
[17] Demirel, N. Ç., & ToksarI, M. D., (2006), Optimization of the quadratic assignment problem using an ant colony algorithm, Applied Mathematics and Computation, 183(1), 427-435.
[18] Dorigo, M., & Gambardella, L. M., (1997), Ant colonies for the travelling salesman problem, Biosystems, 43(2), 73-81.
[19] Dorigo, M., & Gambardella, L. M., (1997), Ant colony system: a cooperative learning approach to the traveling salesman problem, IEEE Transactions on Evolutionary Computation, 1(1), 53-66.
[20] Gajpal, Y., & Abad, P. L., (2009), Multi-ant colony system (MACS) for a vehicle routing problem with backhauls, European Journal of Operational Research, 196(1), 102-117.
[21] Hsu, C. Y., Tsai, M. H., & Chen, W. M., (1991), A study of feature-mapped approach to the multiple travelling salesmen problem, IEEE International Symposium on Circuits and Systems, 3, 1589-1592.
[22] Kara, I., & Bektas, T., (2006), Integer linear programming formulations of multiple salesman problems and its variations, European Journal of Operational Research, 174(3), 1449-1458.
[23] Katayama, K., Sakamoto, H., & Narihisa, H., (2000), The efficiency of hybrid mutation genetic algorithm for the travelling salesman problem, Mathematical and Computer Modelling, 31(10-12), 197-203.
[24] Kulkarni, R. V., & Bhave, P. R., (1985), Integer programming formulations of vehicle routing problems, European Journal of Operational Research, 20(1), 58-67.
[25] Laporte, G., Nobert, Y., & Taillefer, S., (1988), Solving a family of multi-depot vehicle routing and location-routing problems, Transportation Science, 22(3), 161-172.
[26] Russell, R. A., (1977), An effective heuristic for the m-tour traveling salesman problem with some side conditions, Operations Research, 25(3), 517-524.
[27] Shi, X. H., Liang, Y. C., Lee, H. P., Lu, C., & Wang, Q. X., (2007), Particle swarm optimization-based algorithms for TSP and generalized TSP, Information Processing Letters, 103(5), 169-176.
[28] Soheil, G., & Nikbakhsh, J., (2010), An ant colony algorithm for solving fixed destination multi-depot multiple traveling salesmen problems, Applied Soft Computing.
[29] Solnon, C., (2008), Combining two pheromone structures for solving the car sequencing problem with ant colony optimization, European Journal of Operational Research, 191(3), 1043-1055.
[30] Song, C. H., Lee, K., & Lee, W. D., (2003), Extended simulated annealing for augmented TSP and multi-salesmen TSP, Proceedings of the international joint conference on neural networks, 3(Journal Article), 2340-2343.
[31] Tang, L., Liu, J., Rong, A., & Yang, Z., (2000), A multiple traveling salesman problem model for hot rolling scheduling, European Journal of Operational Research, 124(2), 267-282.
[32] Wacholder, E., Han, J., & Mann, R. C., (1989), A neural network algorithm for the multiple traveling salesmen problem, Biological cybernetics, 61(1), 11-19.
[33] Yagmahan, B., & Yenisey, M. M., (2010), A multi-objective ant colony system algorithm for flow shop scheduling problem, Expert Systems with Applications, 37(2), 1361-1368.
[34] Yang, G. X., (1995), Transformation of multidepot multisalesmen problem to the standard travelling salesman problem, European Journal of Operational Research, 81(3), 557-560.
[35] Zhang, T. H., Gruve, W. A., & Smith, M. H., (1999), Team scheduling by genetic search, Proceedings of the Second International Conference on Intelligent Processing and Manufacturing of Materials, 2, 839-844.