參考文獻
[1]Dantzig, George Bernard; Ramser, John Hubert (October 1959). "The Truck Dispatching Problem". Management Science, Vol. 6, No. 1 (Oct., 1959), pp. 80-91.
[2]Bodin, L., Golden, B., Assad, A. and Ball, M., 1983, “Routing and scheduling of Vehicle es and crews: the state of the art”, Computers and Operations Research, Vol.10, pp.63-211.
[3]Fisher M. L. 1995,“Vehicle e Routing Network Routing, Handbooks in Operation Research and Management Science”, 8, 1-33.
[4]賴志豪，2004，「宅配路線規劃應用禁忌搜尋法之研究」，逢甲大學交通與工程學系碩士論文。[5]I. H. Osman “Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem” Annals of Operations Research, vol. 41, no. 4, pp. 421-451, 1993.
[6]A. V. Breedam“Improvement heuristics for the Vehicle Routing Problem based on simulated annealing” European Journal of Operational Research, vol. 86, no. 3, pp. 480-490, 1995.
[7]T. R. Moghaddam,N. SafaeiandY. Gholipour “A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length” Applied Mathematics and Computation, vol. 176,no. 2, pp. 445-454, 2006.
[8]S.W. Lin, Z.J. Lee, K.C. YingandC.Y. Lee “Applying hybrid meta-heuristics for capacitated vehicle routing problem” Expert Systems with Applications, vol. 36, no. 2, pp. 1505-1512, 2009.
[9]B. M. Baker and M. A. Ayechew “A genetic algorithm for the vehicle routing problem” Computers & Operations Research, vol. 30, no. 5, pp. 787-800, 2003.
[10]J. E. Belland P. R. McMullen ”Ant colony optimization techniques for the vehicle routing problem” Advanced Engineering Informatics, vol. 18, no. 1, pp. 41-48, 2004.
[11]Z. Liu and Y. Cai “Sweep based multiple ant colonies algorithm for capacitated vehicle routing problem” in Proc. IEEE International Conference on e-Business Engineering, pp. 387-394, 2005.
[12]C. H. Chen and C. J. Ting “An improved ant colony system algorithm for the vehicle” Journal of the Chinese Institute of Industrial Engineers, vol. 23, no. 2, pp. 115-126, 2006.
[13]Yi-Ting Huang ”A Hybrid ACO Algorithm for Capacitated Vehicle Routing Problems” Thesis for Master of Business Administration Department of Information Management Tatung University, July 2012.
[14] Yi-Fan Chang “ADiscrete BFO Algorithm for Capacitated Vehicle Routing Problems” Thesis for Master of Business Administration Department of Information Management Tatung University, July 2012.
[15]Ferani-Eva Zulvia，「混和粒子群最佳化與基因演算法於具模糊需求之容量限制車輛途程問題之解-以垃圾收集系統為例」，國立台灣科技大學工業管理系碩士學位論文，民國九十九年六月。
[16]陳建甫，「以基因搜尋法求解多桶格車輛途程問題」，南台科技大學工業管理研究所碩士學位論文，民國九十五年十二月。[17]許富雄，「以模擬退火法結合區域搜索法應用於載重限制車輛途程問題」，華梵大學資訊管理學系碩士學位論文，民國九十五年七月。[18]Huey-Shiuan Guo，「物流派車管理之研究」，靜宜大學資訊管理系碩士學位論文，民國九十三年七月。
[19]Bodin, L., Golden, B., Assad, A. and Ball, M., 1983, “Routing and scheduling of Vehicle es and crews: the state of the art”, Computers and Operations Research, Vol.10, pp.63-211.
[20]Goldberg, D. E., Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, MA, 1989.
[21]Baker, B. M., and Ayechew, M. A., “A Genetic Algorithm for the Vehicle e Routing Problem,” Computers & Operations Research, Vol. 30, pp. 787-800, 2003.
[22]Bentley, J. J., “Fast Algorithms for Geometric Traveling Salesman Problem,” ORSA Journal on Computing, Vol. 4, pp. 387-411, 1992.
[23]Schaffer, J. D., Caruana, R. A., Eshelman, L. J., and Das, R., “A Study of Control Parameters Affecting Online Performance of Genetic Algorithms for Function Optimization,” Proceedings of the third international conference on Genetic algorithms, pp. 51-60, 1989.
[24]Grefenstette, J., “Optimization of Control Parameters for Genetic Algorithms,” IEEE Transactions on System, Man and Cybernetics, Vol. 16, pp. 122-128, 1986.
[25]Shieh, H. M., and May, M. D., “Solving the Capacitated Clustering Problem with Genetic Algorithms,” Journal of the Chinese Institute of Industrial Engineers, Vol.18, pp. 1-12, 2001.
[26]Prins, C., “A Simple and Effective Evolutionary Algorithm for the Vehicle e Routing Problem,” Computer and Operations Research, Vol. 31, pp. 1985-2002, 2004.
[27]A. L. Chen, G. K. Yang and Z. M. Wu ”Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem” Journal of Zhejiang University SCIENCE A, vol. 7, no. 4, pp. 607-614, 2006.
[28]T. J. Ai and V. Kachitvichyanukul “Particle swarm optimization and two solution representations for solving the capacitated vehicle routing problem,” Computers & 45 Industrial Engineering, vol. 56, no. 1, pp. 380-387, 2009.
[29]B. I. Kim and S. J. Son “A probability matrix based particle swarm optimization” Journal of Intelligent Manufacturing, Published online:10 September 2010.
[30]Y. Kao and M. Chen “A hybrid PSO algorithm for the CVRP Problem” inProc. ECTA 2011 -International Conference on Evolutionary Computation Theory and Applications, Paris, France, pp. 539-543, 2011.
[31]B. F. Moghaddam, R. Ruiz and S. J. Sadjadi “Vehicle routing problem with uncertain demands: An advanced particle swarm algorithm” Computers & Industrial Engineering, vol. 62, no.1, pp. 306–317, 2012.
[32]R. C. Eberhart, J. Kennedy, “A new optimizer using particle swarm theory,” in: Proc. IEEE Int. Symposium on Micro Machine and Human Science, Nagoya, Japan, pp. 39-43, 1995.
[33]C. W. Reynolds, “Flocks, herds and schools: a distributed behavioral model,” Computer Graphics, 21(4):25-34, 1987.
[34]F. Heppner and U. Grenander, “A stochastic nonlinear model for coordinated bird flocks,” In S. Krasner, Ed, The Ubiquity of Chaos. AAAS Publications, Washington, DC, 1990.
[35]E. O. Wilson, “Sociobiology: the new synthesis,” Belknap Press, Cambridge, MA, 1975.
[36]R. C. Eberhart and Y. H. Shi, “Particle swarm optimization: developments, applications and resources,” in: Proc. IEEE Int. Cong. on Evolutionary Computation, vol. 1, pp. 81-86, Seoul, Korea, 2001.
[37]C. K. Zhang, H. Shao, and Y. Li, “Particle swarm optimization for evolving artificial neural network,” in: Proc. IEEE Int. Conf. on Systems, Man, and Cybernetics, vol. 4, pp. 2487-2490, Nashville, Tennessee, 2000.
[38]V. Tandon, H. El-Mounayri and H. Kishawy, “NC end milling optimization using evolutionary computation,” International Journal of Machine Tools & Manufacture 42, pp. 595-605, 2002.
[39]K.P. Wang, L. Huang, C.G. Zhou, and W. Pang, “Particle swarm optimization for traveling salesman problem,” in Proceedings of the Second International Conference on Machine Learning and Cybernetics, vol. 3, pp.1583-1585, Nov, 2003.
[40] Hu, Xiaohui, R. C. Eberhart, and Y. Shi, “Swarm intelligence for permutation optimization: a case study of n-queens problem,” Swarm Intelligence Symposim, The Proceedings of the 2003 on IEEE(SIS'03), pp. 243-246, Apr, 2003.
[41]Esmin, A.A.A., A.R. Aoki, G. Lambert-Torres, “Particle Swarm Optimization for Fuzzy Membership Functions Optimization,” IEEE International Conference, Vol. 3, 2002.
[42]J Salerno, “Using the particle swarm optimization technique to train a recurrent neural model,” In Proceedings of the Ninth IEEE International Conference on Tools with Artificial Intelligence, pp. 45-49, 1997.
[43]T. Sousa, A. Silva, and A. Neves, “Particle swarm based data mining algorithms for classification tasks,” ELSEVIER on Parallel Computing, NO.30, pp.767-783.
[44]Ayed Salman, Imtiaz Ahmad, and Sabah Al-Madani, “Particle swarm optimization for task assignment problem,” Microprocessors and Microsystems 26, pp. 363-371, 2002.
[45]I. H. Osman “Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem” Annals of Operations Research, vol. 41, no. 4, pp. 421-451, 1993.
[46]Fatma Pinar Goksal, Ismail Karaoglan, Fulya Altiparmak, “A hybrid discrete particle swarm optimization for vehicle routing problem with simultaneous pickup and delivery”, Computers & Industrial Engineering, Volume 65, Issue 1, May 2013, Pages 39–53.