참고문헌
- 김병인, "클러스터링을 이용한 주기적 차량운행 경로 문제 해법", 한국경영과학회/대한산업공학회 춘계공동학술대회, 2005.
- Arthur, D. and S. Vassilvitskii, "k-means++: The Advantages of Careful Seeding," SODA, 2007.
- Beltrami, R.J. and L.D. Bodin, "Networks and Vehicle routing for Municipal Waste Collection," Networks, Vol.4(1974), pp.65-94. https://doi.org/10.1002/net.3230040106
- Brandao, J., "A deterministic Tabu search algorithm for the fleet size and mix vehicle routing problem," European Journal of Operational Research, 2008.
- Chao, I.M., B.L. Golden, and E.A. Wasil, "An improved heuristic for the period vehicle routing problem," Networks, Vol.26(1995), pp.25- 44. https://doi.org/10.1002/net.3230260104
- Choi, E.J. and D.W. Tcha, "A column generation approach to the heterogeneous fleet vehicle routing problem," Computer and Operation Research, 2005.
- Cordeau, J.F., M. Gendreau, and G. Laporte, "A tabu search heuristic for periodic and multi- depot vehicle routing problems," Networks, Vol.30(1997), pp.105-119. https://doi.org/10.1002/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G
- Dantzig, G.B. and J.H. Ramser, "The Truck Dispatching Problem," Management Science, Vol.6(1959), pp.80-91. https://doi.org/10.1287/mnsc.6.1.80
- Desrochers, M. and J.W. Verhoog, "A new heuristic for the fleet size and mix vehicle routing problem," Computer and Operations Research, 1991.
- Eilon, S., C.D.T. Watson-Gandy, and N. Christofides, "Distribution Management:Mathematical Modeling and Practical Analysis," Griffin, London, 1971.
- Golden, B., A. Assad, L. Levy, and F.G. Gheysens, "The Fleet size and Mix Vehicle Routing Problem," Computer and Operations Research, Vol.11(1984), pp.49-66. https://doi.org/10.1016/0305-0548(84)90007-8
- Hemmelmayr, V.C. and K.F. Doerner, "A variable neighborhood search heuristic for periodic routing problem," European Journal of Operational Research, Vol195, No.3(2009), pp.791-802. https://doi.org/10.1016/j.ejor.2007.08.048
- Imran, A., S. Salhi, and N.A. Wassan, "A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem," European Journal of Operational Research, 2008.
- Lin, S., "Computer Solution of the Traveling Salesman Problem," Bell System Tech, Vol. 44(1965), pp.2245-2269. https://doi.org/10.1002/j.1538-7305.1965.tb04146.x
- Lin, S.B. and W. Kernighan, "An Effective Heuristic Algorithm for Traveling Salesman Problem," Operations Research, Vol.21(1973), pp.498-516. https://doi.org/10.1287/opre.21.2.498
- MacQueen, J.B., "Some Methods for Classification and Analysis of Multivariate Observations," Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, Vol.1(1967), pp.281-297.
- Prikwieser, S. and G.R. Raidl, "A variable neighborhood search for the periodic vehicle routing problem with time windows," In C. Prodhon et al., editors, Proceedings of the 9th EU/MEeting on Metaheuristics for Logistics and Vehicle Routing, Troyes, France, 2008.
- Russell, R. and W. Igo, "An Assignment Routing Program," Networks, Vol.9(1979), pp.1-17. https://doi.org/10.1002/net.3230090102
- Taillard, E.D., "A heuristic column generation method for heterogeneous fleet," CRT, Vol.3(1996).