1 |
Goldberg, D. and Lingle, R., "Alleles, Loci, and The Traveling Salesman Problem", Proceedings of the First International Conference on Genetic Algorithms and Their Applications, pp. 154-159, 1985.
|
2 |
Holland, J. H., "Adaption in Natural and Artificial Systems", University of Michigan Press, 1975.
|
3 |
Lenstra, J. K. and Rinnooy Kan, A. H. G., "Complexity of Vehicle Routing and Scheduling Problems", Networks, Vol. 11, No. 2, pp. 221-227, 1981.
DOI
|
4 |
Magnanti, T. L., "Combinatorial Optimization and Vehicle Fleet Planning: Perspectives and Prospects", Networks, Vol. 11, No. 2, pp. 179-213, 1981.
DOI
|
5 |
Potvin, J. Y. and Bengio, S., "A Genetic Approach to the Vehicle Routing Problem with Time Windows", Technical Report CRT-953, Centre de Recherche sur les Transports, University of Montreal, 1994.
|
6 |
Reimann, M., Doerner, K. and Hartl, R. F., "D-ants : Savings Based Ants Divide and Conquer the Vehicle Routing Problem", Computer and Operations Research, Vol. 31, No. 4, pp. 563-591, 2004.
DOI
ScienceOn
|
7 |
Solomon M. M., "Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints", Operations Research, Vol. 35, No. 2, pp. 254-265, 1987.
DOI
ScienceOn
|
8 |
국방부, 국방 군수 용어사전, 2008.
|
9 |
Brandao, J. and Mercer, A., "A Tabu Search Algorithm for the Multi-trip Vehicle Routing and Scheduling Problem", European Journal of Operational Research, Vol. 100, No. 1, pp. 180-191, 1996.
|
10 |
Bullnheimer, B., Hartl, R. F. and Strauss, C., "Applying the Ant System to the Vehicle Routing Problem", 2nd International Conference on Metaheuristics, 1997.
|
11 |
Chiang, W. C. and Russell, R. A., "Simulated Annealing Metaheuristics for the Vehicle Routing Problem with Time Windows", Annals of Operations Research, Vol. 63, No. 1, pp. 3-27, 1996.
DOI
|
12 |
Christofides, N. and Elion, S., "An Algorithm for the Vehicle Dispatching Problem", Operational Research Quarterly, Vol. 20, No. 3, pp. 309-318, 1969.
DOI
|
13 |
Clark, G. and Wright, J. W., "Scheduling of Vehicles from a Central Depot to a Number of Delivery Points", Operations Research, Vol. 12, No. 4, pp. 568-581, 1964.
DOI
ScienceOn
|
14 |
Gendreau, M., Hertz, A. and Laporte, G., "New Insertion and Postoptimization Procedures for the Traveling Salesman Problem", Operations Research, Vol. 40, No. 6, pp. 1086-1094, 1992.
DOI
ScienceOn
|
15 |
Cook, W. and Rich, J. L., "A Parallel Cutting-Plane Algorithm for the Vehicle Routing Problem with Time Windows", Technical Report, Computational and Applied Mathematics, Rice University, 1999.
|
16 |
Dantzig, G. B. and Ramser, J. H., "The Truck Dispatching Problem", Management Science, Vol. 6, No. 1, pp. 80-91, 1959.
DOI
ScienceOn
|
17 |
Garey, M. and Johnson, D., Computers and Intractability; A Guide to the Theory of NPCompleteness, W. H. Freeman and Company, San Francisco, 1976.
|