1.王國探，指導教授：韓復華，「巨集啟發式解法在求解大型規模旅行推銷員問題之研究」，中華民國第五屆運輸網路研討會論文集，逢甲大學，民國八十九年六月，頁195-204。
2.柯彥行，指導教授：張百棧，「以下限值為主應用在印刷電路板插件順序的啟發式方法的問題與檢討」，元智大學工業工程研究所碩士論文，民國八十四年六月。3.陳建緯，指導教授：韓復華，「大規模旅行推銷員問題之研究：鄰域搜尋法與巨集啟發式解法之應用」，國立交通大學運輸工程與管理研究所碩士論文，民國九十年五月。4.賀力行，汪光夏，「以同步工程為架構的彈性機器人組裝系統」，Proceedings of 1995 CIIE National Conference，頁60-66。
5.賀力行，張靖，李泰琳，「印刷電路板零件槽之幾何設計對降低插、取件成本之研究」，第十二屆全國自動化科技研討會論文集，國立虎尾技術學院，民國九十年五月，頁129-130。
6.賀力行，張靖，李泰琳，「印刷電路板零件槽幾何形狀對其安裝成本影響」，2001PCB製造技術研討會論文集，元智大學，民國九十年六月，頁81-89。
7.楊智凱，指導教授：韓復華，「以門檻接受法改善TSP與VRP路網成本之研究」，國立交通大學土木研究所運公館組碩士論文，民國八十七年六月。8.葉心蘋，指導教授：徐旭昇，「應用禁制搜尋法求解優先順序旅行推銷員問題之研究」，元智大學工業工程研究所碩士論文，民國八十八年六月。9.韓復華，張靖，「車輛路線問題研究：SA、TA、NM、SSS與交換型啟發式解法之綜合應用分析」，國立交通大學國科會專題研究計劃，計劃編號：NSC-85-2211-E-009-023，民國八十五年七月。
10.韓復華，卓裕仁，「巨集啟發式解法在TSP與VRP上之應用：參數設定與執行機制之探討」，中華民國第五屆運輸網路研討會論文集，逢甲大學，民國八十九年六月，頁72-82。
11.韓復華，楊智凱，「門檻接受法在TSP問題上之應用」，運輸計劃季刊，第25卷，第2期，民國八十四年，頁163-188。12.Althofer, I., & K.U. Koschnick, “On the Convergence of Threshold Accepting”, Ap plied Mathematics and Optimization, Vol. 24, 1991, pp.183-195.
13.Bazaraa, M. S., and M. D. Sherali（1980）.”Benders’ Partitioning Scheme Applied to A New Formulation of the Quadratic Assignment Problem”, Naval Research Logistics Quarterly 27,pp.29-41.
14.Burkard, R. E. and F. Rendl（1984）.”A thermodynamically Motivated Simulation Procedure for Combinatorial Optimization Problems”, European Journal of Operational of Operational Research 17, pp.169-174.
15.Bodin, L., B.L. Golden, A. Assad & M. Ball, “Routing and Scheduling of Vehicle and Crew： The State of Art”, Special Issue of Computers and Operations Research, Vol. 10, No.2, 1983, pp.63-211.
16.Collin Wang, Li-Hsing Ho, Hsin-Ilin Fu*,Yi-Chen Su,”A Magazine Assignment Heuristic For Robotic Assemble Using the Dynamic Pick-and place Approach”, International Journal of Industrial Engineering,4(1),24-33,1997.
17.Collin Wang, Li-Hsing Ho,David J. Cannon, ”Heuristics for Assembly Sequencing and Relative Magazine Assignment for Robotic Assembly”, Computers ind. Engnn Vol.00, No. 0,PP.1-9,1997.
18.Dueck, G. & T. Scheuer, ”Threshold Accepting：A General Purpose Optimization Algorithm Appearing Superior to Simulated Annealing”, Journal of Computational Physics, Vol.90, 1990, pp.161-175.
19.Glover. F. & C. Mcmillan, “The General Employee Scheduling Problem：An Integration of MS and AI”, Computers anf Operations Research, Vol.13, 1986, pp.563-573。
20.Golden B. L.,and Jr. W. R. Stewart, “Empirical Analysis of Heuristics”, in： E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys（eds.）, The Traveling Salesman Problem. A Guided Tour of Combinatorial Optimization, Wiley, Chichester, 1985,pp. 207-249.
21.Hansen. P., “The Steepest Ascent Mildest Descent Heuristic for Combinatorial Programming”, Comgress on Nimerical Methods in Combinatorial Optimization.
22.Holland. J.H.,” Adaptation in Natural & Artificial System”, University of Michigan Press, Ann Arbor, 1975.
23.Jonathan F. Bard, Raymond W. Clayton, Thomas A. Feo, “Machine Setup and Component Placement in Printed Circuit Board Assembly”, International Journal of Flexible Manufacturing Systems, 6(1994):5-31.
24.Karp R. M., “A Patch Algorithm For the Nonsymmetric Traveling Salesman Problem”, SLAM Jouranl on Computing, Vol.8, 1979, pp.561-573.
25.Katsuhisa Ohno, Zhihong Jn, Salah E. Elmaghraby,”An optimal assembly mode of multi-type printed circuit boards”, Computers & Industrial Engineering 36,451-471,1999.
26.Kirkpatrick. S., C.D. Gelatt & M.p. Vecchi, “Optimization by Simulated Annealing”, Science, Vol.220, 1983, pp.671-680.
27.Lin S., “Computer Solutions of the Traveling Salesman Problem”, Bell System Computer Journal, Vol.44, 1965, pp.2245-2269.
28.Mike Johnsson, Timo Leipälä, Olli Nevalainen,”Determing the
Manual Setting Order of Components on PC Boards”, Journal of Manufacturing Systems Vol.15/No.3,1996.
29.Maniezzo, V. and M. Dorigo（1995）,”Algodesk：An Experimental Comparison of Eight Evolutionary Heuristics Applied to the Quadratic Assignment Problem”, European Journal of Operational Research, 81, pp.188-204
30.Osman, I.H. & Kelly, J.P., “Meta-heuristics：an Overview”, in I.H. Osman and J.P. Kelly（eds.）,Meta-heuristics：Theory and Applications, Kluwer Academic Publishers, Massachusetts, 1996, pp.1-21.
31.Reinelt, G., “The Traveling Salesman：Computational Solutions for TSP Applications”, Springer-Verlag, Berlin, 1994.
32.Reinelt, G., “TSPLIB：A Traveling Salesman Problem Library”,
ORSA Journal on Computing, Vol.3, No.4, 1991, pp.376-384.
33.Reza H. Ahmadi and Panagiotis Kouvelis, “Staging Problem of a Dual Delivery Pick-And-Place Machine in Printed Circuit Card Assembly”, Operations Research, Vol.42, NO.1, 1992.
34.Rosenkrantz D.J., R. E. Stearns, and P. M. Lewis, Ⅱ, “An Analysis of Several Heuristics for the Traveling Salesman Problem”, SLAM Fournal in Computing, Vol.6, 1977, pp.563-581.
35.Skorin-Kapov, J.（1990）.”Tabu Search Applied to the QAP”, ORSA Journal on Computing,vol.2,No.1,Winter.pp 33-45.
36.Suryanarayanan, J. K.,B. L. Golden, and Q. Wang（1991）.”A New Heuristic for the Linear Placement Problem”, Computers Operations Research, Vol 18, No. 3, pp.255-262.
37.TSPLIB：http：//www.iwr.uni-heidelberg.de/iwr/comopt/
software/TSPLIB95/.
38.Timo LEIPALA and Oilli NEVALAINEN, ”Optimization of the
movements of a component placement machine”, European Journal of Operational Research 38,167-177,(1989)
39.Wilhelm, M. R. and T. L. Ward（1987）.”Solving Quadratic
Assignment Problem by Simulated Annealing”, IIE Transactions, pp. 107-119.