中文部份:
1.吳亮瑩 (1999),單一物流中心配送車輛途程問題之研究--以遺傳演算法求解,碩士論文,國立成功大學,工業管理研究所。2.簡世釗 (2001),時窗與容量限制下車輛途程問題之研究,碩士論文,國立成功大學,工業管理研究所。3.曾國雄、邱華凱 (2004),模糊決策系統,李允中、王小璠、蘇木春編著,模糊理論及其應用,第11章,全華科技圖書股份有限公司。
4.周鵬程 (2002),遺傳演算法原理與應用,全華科技圖書股份有限公司。
英文部份:
1.Y. Agarwal, K. Mathur, and H.M. Salkin (1989), A set-partitioning-based exact algorithm for the vehicle routing problem, Networks 19, 731749.
2.R.K. Ahuja, T.L. Magnanti and J.B. Orlin (1993), Network Flows: Theory, Algorithms, and Applications, Prentice-Hall, Englewood Cliffs, New Jersey.
3.A.S. Alfa, S.S. Heragu and M. Chen (1991), A 3-opt based simulated annealing algorithm for vehicle routing problems, Computers and Industrial Engineering 21 (1), 635639.
4.K. Altinkermer and B. Gavish (1991), Parallel savings based heuristics for the delivery problem, Operations Research 39 (3), 456469.
5.M. Balinski and R. Quandt (1964), On an integer program for a delivery problem, Operations Research 12 (2), 300304.
6.M.O. Ball et al. (eds.) (1995), Handbooks in Operations Research and Management Science, Volume 8: Network Routing, Elsevier Science, Amsterdam,
7.B.M. Baker and M.A. Ayechew (2003), A genetic algorithm for the vehicle routing problem, Computers and Operations Research 30 (5), 787800.
8.B.M. Baker and J. Sheasby (1999), Extensions of the generalized assignment heuristic for vehicle routing, European Journal of Operational Research 119 (1), 147157.
9.J.C. Bean (1994), Genetic algorithms and random keys for sequencing and optimization, ORSA Journal on Computing 6 154-160.
10.J.E. Beasley (1983), Route-first cluster-second methods for vehicle routing. Omega 11 , 403-408.
11.G. Barbarosoglu and D. Ozgur (1999), A tabu search algorithm for the vehicle routing problem, Computers and Operations Research 26 (3), 255270.
12.R. Bent and P.Van Hentenryck (2004), A two-stage hybrid local search for the vehicle routing problem with time windows. Transportation Science 38(4), 515-530.
13.J. Berger, M. Barkaoui and O. Braysy (2003), A route-directed hybrid genetic approach for the vehicle routing problem with time windows. Inform Systems Operations Research 41, 179-194.
14.J. Berger and M. Barkaoui (2004), A parallel hybrid genetic algorithm for the vehicle routing problem with time windows, Computers and Operations Research 31 (12), 20372053.
15.J. Bramel and D. Simichi-Levi (1996), A new generation of vehicle routing research Robust algorithms addressing uncertainty. Operations Research 44 (3), 286-304.
16.J. Bramel and D. Simichi-Levi (2002), Set-covering-based algorithms for the capacitated VRP, in: P. Toth and D. Vigo (eds.), The Vehicle Routing Problem, 85108, Society for Industrial and Applied Mathematics, Philadelphia.
17.O. Braysy (2003), Fast local searches for the vehicle routing problem with time windows. Inform. Systems Operations Research 41, 179-194.
18.O. Braysy and M. Gendreau (2005a), Vehicle routing problem with time windows, Part I: Route construction and local search algorithms, Transportation Science 39 (1), 104118.
19.O. Braysy and M. Gendreau (2005b), Vehicle routing problem with time windows, Part II: Metaheuristics, Transportation Science 39 (1), 119139.
20.B. Bullnheimer, R.F. Hartl and C. Strauss (1998), Applying the ant system to the vehicle routing problem, in: S. Voss et al. (eds.), Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, 109120, Kluwer, Boston, MA.
21.B. Bullnheimer, R.F. Hartl and C. Strauss (1999), An improved ant system for the vehicle routing problem, Annals of Operations Research 89, 319328.
22.A. Colorni, M. Dorigo and V. Maniezzo (1991), Distributed optimization by ant colonies, in: F. Varela and P. Bourgine (eds.), Proceedings of the European Conference on Artificial Life, Elsevier, Amsterdam.
23.N. Christofides (1976), Worst case analysis of a new heuristic for the travelling salesman problem, Research Report, Carnegie-Mellon University, Pittsburgh.
24.N. Christofides (1985), Vehicle routing, in: E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D. Shmoys (eds.), The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, 431448, John Wiley & Sons, Chichester.
25.N. Christofides, A. Mingozzi, and P. Toth (1979), The vehicle routing problem, in: N. Christofides, A. Mingozzi, P. Toth and C. Sandi (eds.), Combinatorial Optimization, 315338, Wiley, Chichester, UK.
26.N. Christofides, A. Mingozzi, and P. Toth (1981), Exact algorithms for the vehicle routing problem based on the spanning tree and shortest path relaxations, Mathematical Programming 20, 255282.
27.G. Clarke and J. Wright (1964), Scheduling of vehicles from a central depot to a number of delivery points, Operations Research 12 (4), 568581.
28.J.-F. Cordeau, G. Desaulniers, J. Desrosiers, M.M. Solomon, and F. Soumis (2002), VRP with Time Windows, in: P. Toth and D. Vigo (eds.), The Vehicle Routing Problem, 157186, Society for Industrial and Applied Mathematics, Philadelphia.
29.G. Crose (1958), A method for solving traveling salesman problems. Operations Research, 6, 791-812.
30.G.B. Dantzig and J.H. Ramser (1959), The truck dispatching problem, Management Science 6 (1), 8091.
31.M. Desrochers, J. Desrosiers, and M. Solomon (1992), A new optimization algorithm for the vehicle routing problem with time windows, Operations Research 40 (2), 342354.
32.M. Desrochers, J.K. Lenstra, and M. Savelsberg (1990), A classification scheme for vehicle routing and scheduling problems, Journal of the Operational Research Society 46 (3), 322332.
33.J. Desrosiers, F. Soumis, and M. Desrochers (1984), Routing with time windows by column generation, Networks 14 (5), 545565.
34.M. Desrochers and T.W. Verhooh (1989), A matching based savings algorithm for the vehicle routing problem, Technical Report Cahiers du GERAD G-89-04.
35.M. Dorigo and L.M. Gambardella (1997), Ant colony system: A cooperative learning approach for the traveling salesman problem, IEEE Transactions on Evolutionary Computation 1 (1), 5366.
36.M. Dorigo, V. Maniezzo and A. Colorni (1996), Ant system: Optimization by a colony of cooperating agents, IEEE Transactions on Systems, Man and Cybernetics B26 (1), 2941.
37.G. Dueck (1993), New optimization heuristics: The great deluge algorithm and the record-to-record travel, Journal of Computational Physics 104 (1), 8692.
38.G. Dueck and T. Scheurer (1990), Threshold accepting: A general purpose optimization algorithm, Journal of Computational Physics 90 (1), 161175.
39.R. Durbin and D. Willshaw (1987), Genetic and hybrid algorithms for graph coloring, Annals of Operations Research 63 (3), 437461.
40.M.L. Fisher and R. Jaikumar (1981), A generalized assignment heuristic for the vehicle routing problem, Networks 11 (1), 109124.
41.M. Fisher (1995), Vehicle routing, in: M.O. Ball, T.L. Magnanti, C.L. Monma, and G.L. Nemhauser (eds.), Handbooks in Operations Research and Management Science, Volume 8: Network Routing, 133, Elsevier Science, Amsterdam.
42.B.A. Foster and D.M. Ryan (1976), An integer programming approach to the vehicle scheduling problem, Operations Research 27 (2), 367384.
43.M.R. Garey and D.S. Johnson (1979), Computers and Intractability: A Guide to the Theory of NPCompleteness, W.H. Freeman, San Francisco.
44.T.J. Gaskell (1967), Bases for vehicle fleet scheduling, Operational Research Quarterly 18 (3), 281295.
45.M. Gen and R. Cheng (1997), Genetic Algorithms and Engineering Design, John Wiley & Sons, New York.
46.M. Gendreau, A. Hertz and G. Laporte (1994), A tabu search heuristic for the vehicle routing problem, Management Science 40 (10), 12761290.
47.H. Ghaziri (1993), Algorithms connexionnistes pour 1’optimization combinatoire, These de doctorat, Ecole Polytechnique Federale de Lausanne, Switzerland,
48.D.E. Goldberg (1989), Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, Reading, Massachusetts.
49.D.E. Goldberg and R. Lingle (1985), Loci and the traveling salesman problem, in Grefenstette 186, 154-159.
50.B.L. Golden and A.A. Assad (eds.) (1988), Vehicle Routing: Methods and Studies, Elsevier Science Publisher B.V., North-Holland.
51.M. Gendreau, G. Laporte and J. Yves-Potvin (2002), Metaheuristics for the capacitated VRP, in: P. Toth and D. Vigo (eds.), The Vehicle Routing Problem, 129149, Society for Industrial and Applied Mathematics, Philadelphia.
52.B.E. Gillett and L.R Miller (1974), A heuristic algorithm for the vehicle dispatch problem, Operations Research 22 (2), 340349.
53.J.Han and M.Kamber (2001), Data Mining: Concepts and Techniques, Morgan Kaufmann Publishers, San Francisco.
54.M. Haimovich and A.H.G. Rinnooy Kan (1985), Bounds and heuristics for capacitated routing problems, Mathematics of Operations Research 10 (4), 527542.
55.H.S. Hwang (2002), An improved model for vehicle routing problem with time constraint based on genetic algorithm, Computers and Industrial Engineering 42 (2), 361369.
56.J.H. Holland (1975), Adaptation in Natural and Artificial Systems, The University of Michigan Press, Ann Arbor, Michigan.
57.J. Hopfield and H. Gehring (2005) A two-phase hybrid metaheuristic for the vehicle routing problem with time windows. European Journal of Operational Research 162 220-238.
58.J.J. Hopfield and D.W. Tand (1985), “Neural” computation of decisions in optimization problems, Biological Cybernetics 52 (3), 141152.
59.E. Horowitz, S. Sahni, and S. Rajasrkaran (1997), Computer Algorithms/C++, Computer Science Press, New York.
60.T. Ibaraki, S. Imahori, M. Kubo, T. Masuda, T. Uno, M. Yagiura (2002), Effective local search algorithms for routing and scheduling problems with general time window constraints. Transportation Science. Forthcoming.
61.A. Jaszkiewicz and P. Kominek (2003), Genetic local search with distance preserving recombination operator for a vehicle routing problem, European Journal of Operational Research 151 (2), 352364.
62.H. Kawamura, M. Yamamoto, T. Mitamura, K. Suzuki, and A. Ohuchi. (1998), Cooperative search on pheromone communication for vehicle routing problems, IEEE Transactions on Fundamentals E81-A, 10891096.
63.N. Kohl, J. Desrosiers, O.B.G. Madsen, M.M. Solomon, and F. Soumis (1999), 2-path cuts for the vehicle routing problem with time windows, Transportation Science 33 (1), 101116.
64.T. Kohonen (1988), Self-Organization and Associative Memory, Springer, Berlin.
65.A.W.J. Kolen, A.H.G. Rinnooy Kan and H.W.J.M. Trienekens (1987), Vehicle routing with time windows, Operations Research 35 (2), 266273.
66.G. Laporte (1992), The vehicle routing problem: an overview of exact and approximate algorithms, European Journal of Operational Research 59 (3), 345358.
67.G. Laporte (1997), Vehicle routing, in: M. Dell’Amico, M. Maffioli, and S. Martello (eds.), Annotated Bibliographies in Combinatorial Optimization, Wiley, Chichester, UK.
68.G. Laporte and Y. Nobert (1987), Exact algorithms for the vehicle routing problem, in: S. Martello, G. Laporte, M. Minoux, and C. Ribeiro (eds.), Surveys in Combinatorial Optimization (as Annals of Discrete Mathematics 31), 147184, North-Holland, Amsterdam.
69.G. Laporte and I.H. Osman (1995), Routing problems: A bibliography, Annals of Operations Research 61, 227262.
70.G. Laporte and F. Semet (2002), Classical heuristics for the capacitated VRP, in: P. Toth and D. Vigo (eds.), The Vehicle Routing Problem, 109126, Society for Industrial and Applied Mathematics, Philadelphia.
71.H.C. Lau, M. Sim, and K.M. Teo (2003), Vehicle routing problem with time windows and a limited number of vehicles, European Journal of Operational Research 148 (3), 559569.
72.E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D. Shmoys (eds.)(1985), The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, John Wiley & Sons, Chichester.
73.S. Lin (1965), Computer solutions of the traveling salesman problem, Bell System Technical Journal 44, 22452269.
74.K. Maekawa, N. Mori, H. Tamaki, H. Kita, and Y. Nishikawa (1996), A genetic solution for the traveling salesman problem by means of a thermodynamically selection rule, Proceedings of the Third IEEE International Conference on Evolutionary Computation, 529534.
75.J. Malmborg (1996), A genetic Algorithm for service level based vehicle scheduling, European Journal of Operational Research 93 (1), 121134.
76.P. Merz and B. Freisleben (1997), Genetic local search for the TSP: New results, Proceedings of the 1997 IEEE International Conference on Evolutionary Computation, 159164.
77.Z. Michalewicz (1996), Genetic Algorithms + Data Structures = Evolution Programs, Third, revised and extended edition, Springer, Berlin.
78.R.H. Mole and S.R. Jameson (1976), A sequential route-building algorithm employing a generalized savings criterion. Operational Research Quarterly 27 (2), Part 2, 503511,
79.R.H. Myers and D.C. Montgomery (2002), Response Surface Methodology, Second edition, John Wiley & Sons, New York.
80.D. Naddef and G. Rinaldi (2002), Branch-and-cut algorithms for the capacitated VRP, in: P. Toth and D. Vigo (eds.), The Vehicle Routing Problem, 5384, Society for Industrial and Applied Mathematics, Philadelphia.
81.K.E. Nygard, P. Greenberg, W.E. Bolkan, and E.J. Swenson (1988), Generalized assignment methods for the deadline vehicle routing problem, in: B.L. Golden and A.A. Assad (eds.), Vehicle Routing: Methods and Studies, Elsevier Science Publisher B.V., North-Holland.
82.I.H. Osman (1993), Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem, Annals of Operations Research 41 (4), 421451.
83.J.-Y. Potvin and S. Bengio (1996), The vehicle routing problem with time windows, Part II: Genetic search, INFORMS Journal on Computing 8 (2), 165172.
84.J.Y. Potvin and D. Dube (1994), Improving a vehicle routing heuristic, Proceedings of the First IEEE Conference on Evolutionary Computation, 194199.
85.R.C.Prim (1957), Shortest connection networks and some generalizations, Bell System Technical Journal 36, 1389-1401.
86.C. Prins (2004), A simple and effective evolutionary algorithm for the vehicle routing problem, Computers and Operations research 31 (12), 19852002.
87.V.M. Pureza and P.M. Franca (1991), Vehicle routing problems via tabu search metaheuristic, Technical Report CRT-347, Centre for Research on Transportation, Montreal, Canada.
88.C. Rego (1998), A subpath ejection method for the vehicle routing problem, Management Science 44 (10), 14471459.
89.C. Rego and C. Roucairol (1996), A parallel tabu search algorithm using ejection chains for the vehicle routing problem, in: I.H. Osman and J.P. Kelly (eds.), Meta-Heuristics: Theory and Applications, 661675, Kluwer, Boston, MA.
90.G. Reinelt (1994), The Traveling Salesman: Computational Solutions for TSP Applications, Springer-Verlag, Berlin.
91.F. Robuste, C.F. Daganzo and R. Souleyrette (1990), Implementing vehicle routing models, Transportation Research B24 (2), 263286.
92.Y. Rochat and E.D. Taillard (1995), Probabilistic diversification and intensification in local search for vehicle routing, Journal of Heuristics 1 (1), 147167.
93.S. Ronald (1995), Routing and scheduling problems, in: L. Chambers (ed.), Practical Handbook of Genetic Algorithms, Volume 1: Applications, 367430, CRC Press, Boca Raton.
94.R.A. Russell (1995), Hybrid heuristics for the vehicle routing problem with time windows. Transportation Science 29, 156-166.
95.M. Savelsbergh (1985), Local search in routing problems with time windows, Operations Research 33 (2), 285305.
96.L.J. Schmitt (1994), An empirical computational study of genetic algorithms to solve order based problems: An emphasis on TSP and VRPTC. Ph.D. dissertation, Fogelman College of Business and Economics, University of Memphis, TN.
97.L.J. Schmitt (1995), An evaluation of a genetic algorithmic approach to the vehicle routing problem. Working paper, Department of Information Technology Management, Christian Brothers University, Memphis, TN.
98.M.M. Solomon (1987), Algorithms for the vehicle routing and scheduling problems with time windows constraints, Operations Research 35 (2), 254265.
99.E.D. Taillard (1993), Parallel iterative search methods for vehicle routing problems, Networks 23, 661673.
100.H. Tamaki, H. Kita, N. Shimizu, K. Maekawa, and Y. Nishikawa (1994), A comparison study of genetic codings for the traveling salesman problem, Proceedings of the First IEEE Conference on Evolutionary Computation, 16.
101.S.R. Thangiah and A.V. Gubbi (1993), Effect of genetic sectoring on vehicle routing problems with time windows, Proceedings of the IEEE International Conference on Developing Managing Intelligent System Projects, 146153.
102.S.R. Thangiah, J.-Y. Potvin, and T. Sun (1993), Heuristic approaches to vehicle routing with backhauls and time windows, Computers and Operations Research 23 (11), 10431057.
103.P.M. Thompson and H.N. Psaraftis (1993), Cyclic transfer algorithms for multi-vehicle routing and scheduling problems, Operations Research 41 (5), 935946.
104.P. Toth and D. Vigo (2002a), Models, relaxations and exact approaches for the capacitated vehicle routing problem, Discrete Applied Mathematics 123 (3), 487512.
105.P. Toth and D. Vigo (eds.) (2002b), The Vehicle Routing Problem, Society for Industrial and Applied Mathematics, Philadelphia, PA.
106.A.Van Breedam (1994), An Analysis of the Behavior of Heuristics for the Vehicle Routing Problem for a Selection of Problems with Vehicle-Related, Customer-Related, and Time-Related Constraints, Ph.D. Dissertation, University of Antwerp.
107.A.Van Breedam (1996), Improvement heuristics for the vehicle routing problem based on simulated annealing, European Journal of Operational Research 86 (3), 480490.
108.A. Van Breedam (2001), Comparing descent heuristics and metaheuristics for the vehicle routing problem, Computers and Operations Research 28 (4), 289315.
109.D. Vigo (1996), A heuristic algorithm for the asymmetric capacitated vehicle routing problem. European Journal of Operational Research 89 (1), 108126.
110.U. Xu and J.P. Kelly (1996), A network flow-based tabu search heuristic for the vehicle routing problem, Transportation Science 30 (3), 379393.
111.P. Yellow (1970), A computational modification to the savings method of vehicle scheduling, Operations Research 21 (2), 281283.
112.J.A.G. Willard (1989), Vehicle Routing Using r-Optimal Tabu Search, M.S. Thesis, The Management School, Imperial College, London,