| 期刊論文1. | Widmer, M.、Hertz, A.(1989)。A New Heuristic Method for the Flow Shop Sequencing Problem。European Journal of Operational Research,41,186-193。 | 2. | Volgenant, Ton、Jonker, Roy(1982)。A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation。European Journal of Operational Research,9,83-89。 | 3. | Laporte, G.(1992)。The Traveling Salesman Problem: An Overview of Exact and Approximate Algorithms。European Journal of Operational Research,59(2),231-247。 | 4. | Glover, F.(1986)。Future paths for integer programming and links to artificial intelligence。Computers and Operations Research,13(5),533-549。 | 5. | Hopfield, J. J.、Tank, D. W.(1985)。"Neural" computation of decisions in optimization problems。Biological Cybernetics,52(3),141-152。 | 6. | Glover, F.(1989)。Tabu Search。ORSA Journal on Computing,1,190-206。 | 7. | Glover, F.(1977)。Heuristics for integer programming using surrogate constraints。Decision Sciences,8(1),156-166。 | 8. | Taillard, E.(1991)。Robust taboo search for the quadratic assignment problem。Parallel Computing,17,443-455。 | 9. | 許志義、曾郁仁(1990)。多目標決策互動限制權重法之整合與運用。管理科學學報,7,203-211。 延伸查詢 | 10. | 彭泉、李穎勳(1994)。雙目標與多工具巡迴銷售員問題。東海學報:理,工,農學院,35,209-222。 延伸查詢 | 11. | 吳泰熙、張欽智(1997)。以禁忌搜尋法則求解推銷員旅行問題。大葉學報,6(1),87-99。 延伸查詢 | 12. | Aarts, E. H. L.、Korst, J.(1989)。Boltzmann machines for traveling salesman problems。European Journal of Operational Research,39,79-95。 | 13. | Flood, M. M.(1956)。The traveling salesman problem。Operations Research,4,61-75。 | 14. | Garfinkel, R. S.(1977)。Minimizing wallpaper waste, part i: a class of traveling salesman problem。Operations Research,25,741-751。 | 15. | Gerhard, Reinelt(1991)。TSPLIB - a traveling salesman problem library。ORSA Journal on Computing,3,376-384。 | 16. | Glover, F.(1990)。Tabu search: a tutorial。Interfaces,20,74-94。 | 17. | Glover, F.、Taillard, E.(1993)。A User's Guide to Tabu Search。Annals of Operations Research,41(1),1-28。 | 18. | Golden, B. L.(1977)。A Statistical Approach to the TSP。Networks,7(3),209-225。 | 19. | Knox, J.(1994)。Tabu Search Performance on the Symmetric TSP。Computers & Operations Research,21,867-876。 | 20. | Lai, Y. J.、Hwang, C. L.(1993)。A stochastic possibilistic programming model for bank hedging decision problems。Fuzzy Sets and Systems,57,351-363。 | 21. | Lin, S.(1965)。Computer solutions of the traveling salesman problem。Bell System Technology Journal,44,2245-2269。 | 22. | Muhlenbein, M. Gorges-Schleuter、Kramer, O.(1988)。Evolution algorithms in combinatorial optimization。Parallel Computing,7,65-85。 | 23. | Ratliff, H. Donald、Rosenthal, Arnon S.(1983)。Order-picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem。Operations Research,31(3),507-521。 | 會議論文1. | Boeres, M. C.、de Carvalho, L. A. V.(1992)。A faster elastic-net algorithm for the traveling salesman problem。沒有紀錄。II.215-II.220。 | 2. | Tzeng, Y. R.、Hsu, G. J. Y.(1989)。A new concept for noninferior set estimation of multiobjective programming: the CONWEIGHT algorithm。Bangkok, Thailand。1039-1051。 | 3. | Rosenkrantz, D.、Stearns, R.、Lewis, P.(1974)。Approximate algorithm for the traveling salesperson problem。沒有紀錄。33-42。 | 研究報告1. | Lenstra, J. K.、Rinnooy Kan, A. H. G.(1974)。Some simple applications of the traveling salesman problem。Amsterdam, Netherlands。 | 學位論文1. | Or, I.(1976)。Traveling Salesman-type Combinatorial Problems and Their Relation to the Logistics of Regional Blood Banking(博士論文)。Northwestern University,Evanston, IL。 | 2. | 戴光政(1988)。臺灣電力經濟多目標規劃模型之建立與應用,0。 延伸查詢 | 3. | 徐俊能(1994)。以遺傳基因演算法則解決多目標考量的推銷員旅行問題之研究,0。 延伸查詢 | 4. | 張治(1988)。多目標巡迴售貨員問題之規劃,0。 延伸查詢 | 圖書1. | 許志義(1994)。多目標決策。臺北:五南圖書出版有限公司。 延伸查詢 | 2. | Golden, B. L.、Stewart, W. R., Jr.(1985)。Empirical analysis of Heuristics。The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization。Chichester, UK。 | 3. | Steceer, R. Z.(1986)。Multiple Criteria Objective, Theory, Computation and Algorithms。Multiple Criteria Objective, Theory, Computation and Algorithms。沒有紀錄。 | |