| 期刊論文| 1. | Solomon, M. M.(1987)。Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints。Operations Research，35(2)，254-265。   | | 2. | Gambardella, L. M.、Taillard, E.、Dorigo, M.(1999)。Ant colonies for the Quadratic Assignment Problem。Journal of the Operational Research Society，50，167-176。 | | 3. | Bullnheimer, B.、Hartl, R. F.、Strauss, C.(1999)。An Improved Ant System for the Vehicle Routing Problem。Annals of Operations Research，89，319-328。 | | 4. | Chiang, W. C.、Russell, R. A.(1997)。A Reactive Tabu Search Metaheuristics for the Vehicle Routing Problem with Time Windows。INFORMS Journal on Computing，9，417-430。 | | 5. | Colomi, A.、Dorigo, M.、Maniezzo, V.、Trubian, M.(1994)。Ant System for Job-shop Scheduling。Belgian Journal of Operations Research, Statistics and Computer Science，34(1)，39-53。 | | 6. | Costa, D.、Hertz, A.(1997)。Ants Can Colour Graphs。Journal of the Operational Research Society，48，295-305。 | | 7. | Dorigo, M.、Gambardella, L. M.(1997)。Ant Colonies for the Traveling Salesman Problem。BioSystems，43，73-81。 | | 8. | Dorigo, M.、Gambardella, L. M.(1997)。Ant Colony System: A Cooperative Learning Approach for the Traveling Salesman Problem。IEEE Transactions on Evolutionary Computation，1，53-66。 | | 9. | Li, H.、Lim, A.(2003)。Local Search with Annealing-like Restarts to Solve the VRPTW。European Journal of Operational Research，150，115-127。 | | 10. | Homberger, J.、Gehring, H.(1999)。Two Evolutionary Metaheuristics for the Vehicle Routing Problem with Time Windows。INFOR，37，297-318。 | | 11. | Potvin, J. Y.、Bengio, S.(1996)。The Vehicle Routing Problem with Time Windows - Part II: Genetic Search。INFORMS Journal on Computing，8，165-172。 | | 12. | Taillard, E.、Badeau, P.、Gendreau, M.、Geurtin, F.、Potvin, J. Y.(1997)。A Tabu Search Heuristic for the Vehicle Routing Problem with Time Windows。Transportation Science，31，170-186。 | | 13. | Talbi, E. G.、Roux, O.、Fonlupt, C.、Robillard, D.(2001)。Parallel Ant Colonies for the Quadratic Assignment Problem。Future Generation Computer Systems，17(4)，441-449。 | | 14. | Tan, K. C.、Lee, L. H.、Ou, K.(2001)。Artificial Intelligence Heuristics in Solving Vehicle Routing Problems with Time Window Constraints。Engineering Applications of Artificial Intelligence，14，825-837。 | | 15. | Thangiah, S. R.、Osman, I. H.、Vinayagaoorthy, R.、Sun, T.(1994)。Algorithms for Vehicle Routing Problems with Time Deadlines。American Journal of Mathematical and Management Science，13，323-355。 | | 16. | Thangiah, S. R.、Potvin, J. Y.、Sun, T.(1996)。Heuristics Approaches to Vehicle Routing with Backhauls and Time Windows。Computers and Operations Research，23，1043-1057。 | | 17. | Ting, C. J.、Huang, C. H.(2005)。An Improved Genetic Algorithm for Vehicle Routing Problem with Time Windows。International Journal of Industrial Engineering，12(3)，216-226。 | | 18. | Desrochers, M.、Desrosiers, J.、Solomon, M. M.(1992)。A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows。Operations Research，40(2)，342-354。 | | 19. | Lin, S.(1965)。Computer Solution of the Traveling Salesman Problem。Bell System Technology Journal，44，2245-2269。 | | 20. | Dorigo, M.、Maniezzo, V.、Colorni, A.(1996)。The ant system: Optimizatoin by a colony of cooperating agents。IEEE Transactions on Systems, Man, and Cybernetics--Part B，26(1)，29-41。 | | 21. | Rochat, Yves、Taillard, Éric D.(1995)。Probabilistic Diversification and Intensification in Local Search for Vehicle Routing。Journal of Heuristics，1(1)，147-167。 | | 22. | Clarke, G. U.、Wright, J. W.(1964)。Scheduling of Vehicles from a Central Depot to a Number of Delivery Points。Operations Research，12(4)，568-581。 | 會議論文| 1. | Colorni, A.、Dorigo, M.、Maniezzo, V.(1991)。Distributed Optimization by Ant Colonies。The First European Conference on Artificial Life。Paris：Elsevier。134-142。 | | 2. | Czech, Z. J.、Czamas, P.(2002)。A Parallel Simulated Annealing for the Vehicle Routing Problem with Time Windows。l0th Euromicro Workshop on Parallel, Distributed and Network-based Processing。Canary Islands。376-383。 | | 3. | Rosenkrantz, D.、Sterans, R.、Lewis, P.(1974)。Approximate Algorithms for the Traveling Salesperson Problem。15th Annual IEEE Symposium of Switching and Automata Theory，33-42。 | 研究報告| 1. | Maniezzo, V.、Colorni, A.、Dorigo, M.(1994)。The Ant System Applied to the Quadratic Assignment Problem。Université Libre de Bruxelles。 | | 2. | Berger, J.、Barkaoui, M.、Braysy, O.(2001)。A Parallel Hybrid Genetic Algorithm for the Vehicle Routing Problem with Time Windows。 | | 3. | Gambardella, L. M.、Dorigo, M.(1997)。HAS-SOP: Hybrid Ant System for the Sequential Ordering Problem。Lugano：EDSIA。 | 圖書論文| 1. | Bullnheimer, B.、Hartl, R. F.、Strauss, C.(1998)。Applying the Ant System to the Vehicle Routing Problem。Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization。Boston, MA：Kluwer。 | | 2. | Gambardella, L. M.、Taillard, E.、Agazzi, G.(1999)。MACS-VRPTW: A Multiple Ant Colony System for Vehicle Routing Problems with Time Windows。New Ideas in Optimization。London：McGraw-Hill。 | | 3. | Sttitzle, T.、Dorigo, M.(1999)。ACO Algorithms for the Quadratic Assignment Problem。New Ideas in Optimization。McGraw-Hill。 | |