| 期刊論文| 1. | Taillard, É.D.(1993)。Parallel Iterative Search Methods for Vehicle Routing Problem。Networks，23，661-673。   | | 2. | Gaskell, T. J.(1967)。Basis for Vehicle Fleet Scheduling。Operational Research Quarterly，18，281。 | | 3. | Lin, S.(1965)。Computer Solution of the Traveling Salesman Problem。Bell System Technology Journal，44，2245-2269。 | | 4. | Osman, I. H.(1993)。Metastrategy Simulated Annealing and Tabu Search Algorithm for the Vehicle Routing problem。Annals of Operations Reseach，41，421-451。 | | 5. | Gendreau, M.、Hertz, A.、Laporte, G.(1994)。A Tabu Search Heuristic for the Vehicle Routing Problem。Management Science，40，1276-1290。 | | 6. | Xu, J.、Kelly, J. P.(1996)。A Network Flow-based Tabu Search Heuristic for the Vehicle Routing Problem。Transportation Science，30，379-393。 | | 7. | Lin, S.、Kernighan, B. W.(1973)。An effective heuristic algorithm for the traveling salesman problem。Operations Research，21(2)，498-516。 | | 8. | Min, H.(1989)。The multiple vehicle routing problem with simultaneous delivery and pick-up points。Transportation Research Part A: General，23(5)，377-386。 | | 9. | Salhi, S.、Nagy, G.(1999)。A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling。Journal of the Operational Research Society，50(10)，1034-1042。 | | 10. | Christofides, N.、Eilon, S.(1969)。An Algorithm for the Vehicle Dispatching Problems。Operational Research Quarterly，20，309-318。 | | 11. | Rochat, Yves、Taillard, Éric D.(1995)。Probabilistic Diversification and Intensification in Local Search for Vehicle Routing。Journal of Heuristics，1(1)，147-167。 | | 12. | 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。 | | 13. | Laporte, G.、Gendreau, M.、Potvin, J. Y.、Semet, F.(2000)。Classical and modern heuristics for the vehicle routing problem。International Transactions in Operational Research，7(4/5)，285-300。 | | 14. | Christofides, N.,(1981)。“Exact Algorithms for the Vehicles Routing Problems, Based on Spanning Tree and Shortest Path Relaxations,”。Math. Prog.，vol. 20，255-282。 | | 15. | Laporte, G., Nobert, Y. and Desrochers, M.,(1985)。“Optimal Routing Under Capacity and Distance Restriction,”。CACM，33，1015-1073。 | | 16. | Nagy, G.、Salhi, S.(2005)。“Heuristic Algorithms for Single and Multiple and Depot Vehicle Routing Problem with Pickups and Deliveries,”。European Journal of Operational Research，162，126-141。 | | 17. | Psaraftis, H.N.,(1999)。“A Dynamic Programming Solution to the Single Vehicle Many-to-many Immediate Request Dial-a-ride Problem,”。Transportation Science，14，130-154。 | | 18. | Schruben, L., and Clifton, R,(1968)。“The Lockset Method of Sequential Programming Applied to Routing Delivery and Pickup Trucks,”。American Journal of Agricultural Economics，50，854-867。 | | 19. | Yellow, P.,(1970)。“A Computational Modification to the Savings Method of Vehicle Scheduling,”。Operational Research Quarterly，21，281-283。 | 圖書| 1. | Kindervater, G.A.P., and Savelsbergh, M.W.P.,(1997)。“Vehicle Routing: Handling Edge Exchanges.。Local Search in Combinatorial Optimization。Wiley。 | 圖書論文| 1. | Christofides, N.、Mingozzi, A.、Toth, P.(1979)。The Vehicle Routing Problem。Combinatorial Optimization。Wiley。 | | 2. | Rego, C.、Roucairol, C.(1996)。A Parallel Tabu Search Algorithm Using Ejection Chains for Vehicle Routing Problem。Meta-Heuristics: Theory and Applications。Boston：Kluwer。 | |