| 期刊論文| 1. | Lim, A.、Wang, F.(2005)。Multi-Depot Vehicle Routing Problem: A One-Stage Approach。IEEE Transactions on Automation Science and Engineering，2(4)，397-402。   | | 2. | Nawaz, Muhammad、Enscore, E. Emory Jr.、Ham, Inyong(1983)。A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem。OMEGA: The International Journal of Management Science，11(1)，91-95。 | | 3. | Albayraka, M.、Allahverdib, N.(2011)。Development A New Mutation Operator to Solve the Traveling Salesman Problem by Aid of Genetic Algorithms。Expert Systems with Applications，38(3)，1313-1320。 | | 4. | Belloso, J.、Juan, A. A.、Faulin, J.、Serrano, A.(2015)。Using Multi-Start Biased Randomization of Heuristics to Solve The Vehicle Routing Problem with Clustered Backhauls。Lecture Notes in Management Science，7，15-20。 | | 5. | Bortfeldta, B.、Hahnb, T.、Mannela, D.、Monch, L.(2015)。Hybrid Algorithms for The Vehicle Routing Problem with Clustered Backhauls and 3D Loading Constraints。European Journal of Operational Research，243(1)，82-96。 | | 6. | Jarvis, R. A.(1973)。On The Identification of The Convex Hull of A Finite Set of Points in The Plane。Information Processing Letters，2，18-21。 | | 7. | Lai, M.、Battarra, M.、Francesco, M. D.、Zuddas, P.(2015)。An Adaptive Guidance Meta-Heuristic for The Vehicle Routing Problem with Splits and Clustered Backhauls。Journal of the Operational Research Society，66(7)，1222-1235。 | | 8. | Menger, K.(1932)。Das Botenproblem。Ergebnisse Eines Mathematischen Kolloquiums，2，11-12。 | | 9. | Min, H.、Current, J.、Schilling, D.(1992)。The Multiple Depot Vehicle Routing Problemwith Backhauling。Journal of Business Logistics，13(1)，280-282。 | | 10. | Osman, I. H.(1993)。Metastrategy Simulated Annealing and Tabu Search Algorithms for the Vehicle Routing Problem。Journal Annals of Operations Research--Special issue on Tabu search，41(1-4)，421-451。 | | 11. | Xing, L. N.、Chen, Y. W.、Yang, K. W.、Hou, F.、Shen, X. S.、Cai, H. P.(2008)。A Hybrid Approach Combining An Improved Genetic Algorithm and Optimization Strategies for The Asymmetric Traveling Salesman Problem。Engineering Applications of Artificial Intelligence，21(8)，1370-1380。 | | 12. | Goetschalckx, M.、Jacobs-Blecha, C.(1989)。The Vehicle Routing Problem with Backhauls。European Journal of Operational Research，42(1)，39-51。 | | 13. | 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。 | 會議論文| 1. | Asadpour, A.、Goemans, M.、Madry, A.、Gharan, S. O.、Saberi, A.(2010)。An O(log n/log log n)--Approximation Algorithm for the Asymmetric Traveling Salesman Problem。21st Annual ACM-SIAM Symposium on Discrete Algorithms，379-389。 | | 2. | Chen, R. M.、Hsieh, F.-R.、Wu, D. S.(2012)。Heuristics based Ant Colony Optimization for Vehicle Routing Problem。2012 7th IEEE Conference on Industrial Electronics and Applications，1039-1043。 | | 3. | Karaboga, D.、Gorkemli, B.(2011)。A Combinatorial Artificial Bee Colony Algorithm for Traveling Salesman Problem。2011 International Symposium on Innovations in Intelligent Systems and Applications。 | | 4. | Li-xia, R.(2009)。Algorithm Study of Multiple-Depot Vehicle Routing Problem based on Fuzzy Simulation。2009 International Conference on Industrial Mechatronics and Automation。 | | 5. | Lysgaard, J.(2015)。A New Sparse Transformation and Exact Algorithm for The Clustered Traveling Salesman Problem。VEROLOG 2015。 | | 6. | Tunjongsirigul, B.、Pongchairerks, P.(2010)。A Genetic Algorithm for a Vehicle Routing Problem on a Real Application of Bakery Delivery。2010 2nd International Conference on Electronic Computer Technology。 | |