本研究以供應鏈上游作為基礎作了對設施定址問題的探討，並從中結合了服務權分派和車隊指派問題作副問題。本研究提出一個啓發式巢式基因演算法來對目標問題作總成本之最小化求解，其中考量成功包括設施建設成本，運輸成本以及車輛租借成本。同時也把駕駛員的工作時數限制加入考量以達到高度合乎現實狀況。另外本研究也提出了一組實驗來對所提出的巢式基因演算法作效率以及穩定度方面的詳細探討。

The proposed work examined an integrated model to determine strategic capacitated facility location based on the view of distribution center management in the upstream supply chain. The model also incorporates sub-problems of service allocation and vehicle dispatching. The current work proposed a heuristic nested genetic algorithm, which minimizes the total cost of facility setup cost, transportation cost and vehicle dispatching cost while incorporating working time limitation of vehicle drivers. An experimental application was also applied to examine the efficiency and stability of the proposed algorithm.

1. Aksen, D. and Altinkemer, K., A location-routing problem for the conversion to the ‘‘click-and-mortar’’ retailing: The static case, European Journal of operating research, 186, pp. 554-575, 2008.
2. Chu, C. K. and Chu, L., A modeling framework for hospital location and service allocation, International Transaction in Operational Research, 7, pp.539-568, 2000.
3. Cunha, C. B. and Sliva, M. R., A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil, European Journal of Operational Research, 179, pp.747-758, 2007.
4. Duhamel, C., Lacomme, P., Prins, C. and prodhon, C., A GRASP×ELS approach for the capacitated location-routing problem, Computers & Operation Research, 37, pp.1912-1923, 2010.
5. Feng, C. W., Cheng, T. M. and Wu, H. T., Optimizing the schedule of dispatching RMC trucks through genetic algorithms, Automation in Construction, 13, pp.327-340, 2004.
6. He, S., Song, R. and Chaudhry, S. S., Fuzzy dispatching model and genetic algorithms for railyards operations, European Journal of Operational Research, 124, pp.307-331, 2000.
7. Ho, W., Ho, T. S., Ji, P. and Lau, C. W., A hybrid genetic algorithm for the multi-depot vehicle routing problem, Engineering Applications of Artificial Intelligence, 21, pp. 548–557, 2008.
8. Holland, J., Adaptation in Natural and Artificial Systems, the University of Michigan Press, Ann Arbor, MI, 1975.
9. Jaramillo, J. H., Bhadury, J. and Batta, R., On the use of genetic algorithms to solve location problems, Computers & Operations Research, 29, pp.761-779, 2002.
10. Klose, A. and Drexl, A., Facility location model for distribution system, European Journal of Operational Research, 162, pp.4-29, 2005.
11. Leclerc, F. and Potvin, J. Y., Genetic Algorithm for Vehicle Dispatching, International Transactions in Operational Research, 4(5, 6), pp.391-400, 1997.
12. Lin, X. H., Kwok, Y. K. and Lau, K. N., A genetic algorithm based approach to route selection and capacity flow assignment, Computer communications, 26, pp.961-974, 2003.
13. Mak, K. L., Wong, Y. S. and Chan, F. T. S., A genetic algorithm for facility layout problems, Computer Integrated Manufacturing System, 2(1, 2) , pp.113-127, 1998.
14. Melkote, S. and Daskin, M. S., An integrated model of facility location and transportation network design, Transportation Research Part A, 35, pp.515-538, 2001.
15. Prins, C., Prodhon, C. and Wolfler-Calvo, R., Solving the Capacitated Location-Routing Problem by a GRASP complemented by a Learning Process and a Path Relinking, 4OR - A Quarterly Journal of Operations Research, 4(3), pp. 221-238, 2006.
16. Prins, C., Prodhon, C. and Wolfler-Calvo, R., A Memetic Algorithm with Population Management (MAjPM) for the Capacitated Location-Routing Problem, in J. Gottlieb et G.R. Raidl (éd.), Lecture Notes in Computer Science, 3906, pp. 183-194, 2006.
17. Prins, C., Prodhon, C., Soriano, P., Ruiz, A. and Wolfler-Calvo, R., Solving the Capacitated LRP by a Cooperative Lagrangean Relaxation-Granular Tabu Search Heuristic, Transportation Science, 41(4), pp. 470-483, 2007.
18. Syam, S. S., A multiple server location–allocation model for service system design, Computer & Operations Research, 35, pp.2248-2265, 2008.
19. Tan, K. K. and Tang, K. Z., Vehicle dispatching system based on Taguchi-tuned fuzzy rules, European Journal of Operational Research, 128, pp.545-557, 2001.
20. Taylor, G. D., Whicker, G. L. and Usher, J. S., Multi-zones dispatching in truckload trucking, Transportation Research Part E, 37, pp.375-390, 2001.
21. Tuzun, D. and Burke, L., A two-phase tabu search approach to the location routing problem, European Journal of Operational Research, 116, pp.87–99, 1997.
22. Wu, H., Chu, C. X., Wang, Y. and Yan, W., A genetic algorithm for cellular manufacturing design and layout, European Journal of Operational Research, 181, pp.156-167, 2007.
23. Wu, L.Y., Zhang, X.S., Zhang, J.L., Capacitated facility location problem with general setup cost, Computer Operation Research, 33, pp.1226-1241, 2006.
24. Yu, F., Lin, S. W., Lee, W. and Ting, C. J., A simulated annealing heuristic for the capacitated location routing problem, Computers & Industrial Engineering, 58, pp.288–299 2010.
25. Yu, B., Yang, Z. and Cheng, C., Optimizing the distribution of shopping centers with parallel genetic algorithm, Engineering Applications of Artificial Intelligence, 20, pp.215–223, 2007.
26. Zhu, Z., Chu, F. and Sun, L., The capacitated plant location problem with customers and suppliers matching, Transportation Research Part E, 46(3), pp.469-480, 2009.