〔1〕 Bui T. N. and Moon B. R., "A New Genetic Approach for the Traveling Salesman Problem," in Proceedings of the First IEEE Conference on Evolutionary Computation, vol.1, pp.7-12, 1994.
〔2〕 Chyu C. C. and Yeh H. P., "A Tabu Search Heuristic for the Traveling Salesman Problem with Precedence Constraints," Automation ''98 and ICPR Asia Meeting, A2-2, pp.1-6, 1998.
〔3〕 Crefenstette J. J., Gopal R., Rosmaita B. J., and Gucht D. Van, "Genetic Algorithms for the Traveling Salesman Problem," In Proceedings of the International Conference on Genetic Algorithms and Their Applications, pp.160-168,1985.
〔4〕 Davis L., Handbook of Genetic Algorithms, Van Nostrand Reinhold, New York, 1991.
〔5〕 Davis L., "Job shop scheduling with genetic algorithms and their applications," In Proceedings of the International Conference on Genetic Algorithms and Their Applications, pp.136-140,1985.
〔6〕 Escudero L. F., Guignard M., and Malik K., "A Lagrangean relax-and cut approach for the sequential ordering problem with precedence constraints," Annals of Operations Research, Vol.50, pp.219-237, 1994.
〔7〕 Fox B. R. and McMahon M. B., "Genetic Operators for Sequencing Problems," Foundations of Genetic Algorithms, Morgan Kaufmann Publishers, 1991.
〔8〕 Forrest S., "Genetic Algorithms: Principles of Natural Selection Applied to Computation," Science, Vol.261, pp.872-878, 1993.
〔9〕 Goldberg D. E., Genetic Algorithms In Search, Optimization and Machine Learning, Addison-Wesley, Reading, MA, 1989.
〔10〕 Goldberg D. and Lingle R., "Alleles, Loci, and the Traveling Salesman Problem," In Proceedings of the International Conference on Genetic Algorithms and Their Applications, pp.154-159,1985.
〔11〕 Gambardella L. and Dorigo M., "Hybrid Ant System for the Sequential Ordering Problem," Technical Report IDSIA 11-97,1997.
〔12〕 Mingozzi A., Bianco L., and Ricciardelli S., "Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints," Operations Research, Vol. 45, No. 3, 1997.
〔13〕 Oliver I. M., Smith D. J., and Holland J.R.C., "A Study of Permutation Crossover Operations on the Traveling Salesman Problem," In Proceedings of the International Conference on Genetic Algorithms and Their Applications, pp.224-230, 1987.
〔14〕 Shang Y. and Li G., "New Crossover Operation In Genetic Algorithms," IEEE International Conference on Tools for AI, pp.150-153, 1991.
〔15〕 Tamaki H. , Kita H. , and Shimizu N. , "A Comparison Study of Genetic Codings for the Traveling Salesman Problem," in Proceedings of the First IEEE Conference on Evolutionary Computation, vol.1, pp.1-6, 1994.
〔16〕 Whitley D., "The Genitor Algorithm and Selection Pressure: Why Rank-Based Allocation of Reproductive," In Proceedings of the International Conference on Genetic Algorithms and Their Applications, pp.116-121, 1989.
〔17〕 陳建志,「應用遺傳演算法求解最佳機器人路徑及工件位置」,國立中央大學,碩士論文,民國82年。〔18〕 徐俊能,「以遺傳基因演算法則解決多目標考量的旅行推銷員問題之研究」,私立大葉工學院,碩士論文,民國83年。〔19〕 楊宗銘,「遺傳演算法在在多途程排程問題之探討」,私立中原大學,碩士論文,民國84年。〔20〕 施得旭,「淺談田口式品質工程(上)」,工業材料,117期,pp.93-96,民國85年。〔21〕 施得旭,「淺談田口式品質工程(下)」,工業材料,119期,pp.100-102,民國85年。〔22〕 陳柏宏,「應用基因演算法於水火力發電排程問題之研究」,國立台灣工業技術學院,碩士論文,民國85年。〔23〕 蔡世鵬,「應用基因演算法於微波濾波器之最佳化設計」,國立交通大學,碩士論文,民國85年。〔24〕 楊家豪,「以遺傳演算法應用於電腦輔助裝配程序規劃問題之研究」,國立台灣大學,碩士論文,民國86年。〔25〕 蘇朝墩,產品穩健設計 田口品質工程方法的介紹和應用,中華民國品質學會,台北,民國86年6月。
〔26〕 蘇木春、張孝德,機器學習 類神經網路、模糊系統以及基因演算法則,全華科技圖書,台北,民國86年12月。
〔27〕 于正之,「優生遺傳演算法應用於解旅行推銷員問題」,國立中興大學,碩士論文,民國86年。〔28〕 吳育庭,「應用基因演算法於機組最佳維修平排程」,國立台灣大學,碩士論文,民國86年。〔29〕 王日昌,「基因演算法在多目標組合最佳化問題之研究」, 國立交通大學,博士論文,民國86年。