Journal of Korean Society of Industrial and Systems Engineering (산업경영시스템학회지)

Society of Korea Industrial and System Engineering (한국산업경영시스템학회)
권호 표지
DOI QR코드

DOI QR Code

An Application of k-Means Clustering to Vehicle Routing Problems

K-Means Clustering의 차량경로문제 적용연구

  • Ha, Je-Min (Dept. of Industrial and Management Systems Engineering, Dong-A University) ;
  • Moon, Geeju (Dept. of Industrial and Management Systems Engineering, Dong-A University)
  • 하제민 (동아대학교 산업경영공학과) ;
  • 문기주 (동아대학교 산업경영공학과)
  • Received : 2015.08.06
  • Accepted : 2015.09.02
  • Published : 2015.09.30
Download PDF
⟨ Previous Next ⟩

Abstract

This research is to develop a possible process to apply k-means clustering to an efficient vehicle routing process under time varying vehicle moving speeds. Time varying vehicle moving speeds are easy to find in metropolitan area. There is a big difference between the moving time requirements of two specific delivery points. Less delivery times are necessary if a delivery vehicle moves after or before rush hours. Various vehicle moving speeds make the efficient vehicle route search process extremely difficult to find even for near optimum routes due to the changes of required time between delivery points. Delivery area division is designed to simplify this complicated VRPs due to time various vehicle speeds. Certain divided area can be grouped into few adjacent divisions to assume that no vehicle speed change in each division. The vehicle speeds moving between two delivery points within this adjacent division can be assumed to be same. This indicates that it is possible to search optimum routes based upon the distance between two points as regular traveling salesman problems. This makes the complicated search process simple to attack since few local optimum routes can be found and then connects them to make a complete route. A possible method to divide area using k-means clustering is suggested and detailed examples are given with explanations in this paper. It is clear that the results obtained using the suggested process are more reasonable than other methods. The suggested area division process can be used to generate better area division promising improved vehicle route generations.

Keywords

References

  1. Donati, A.V., Montemanni, R., Casagrande, N., Rizzoli, A.E., and Gambardella, L.M., Time dependent vehicle routing problem with a multi ant colony system. European Journal of Operation Research, 2006, Vol. 185, No. 3, pp. 1174-1191. https://doi.org/10.1016/j.ejor.2006.06.047
  2. Haghani, A. and Jung, S., A dynamic vehicle routing problem with time-dependent travel times. Computers and Operations research, 2005, Vol. 32, No. 11, pp. 2959-2986. https://doi.org/10.1016/j.cor.2004.04.013
  3. Jabali, O., Van Woensel, T., de Kok, A.G., Lecluyse, C., and Peremans, G., Time-dependent vehicle routing subject to time delay perturbations. IIE Transactions, 2009, Vol. 42, pp. 1049-1066.
  4. Kenyon, A.S. and Morton, D.P., Stochastic vehicle routing with random travel times. Transportation Science, 2003, Vol. 37, No. 1, pp. 69-82. https://doi.org/10.1287/trsc.37.1.69.12820
  5. Kuo, Y., Using simulated annealing to minimize fuel consumption for the time-dependent vehicle routing problem. Computers and Industrial Engineering, 2010, Vol. 59, No. 1, pp. 157-165. https://doi.org/10.1016/j.cie.2010.03.012
  6. Kuo, Y., Wang, C.C., and Chuang, P.Y., Optimizing goods assignment and the vehicle routing problem with time-dependent travel speeds. Computer and Industrial Engineering, 2008, Vol. 57, pp. 1385-1392.
  7. Lloyd, S.P., Least square quantization in PCM. IEEE Transactions on Information Theory, 1957, Vol. 28, No. 2, pp. 129-137. https://doi.org/10.1109/TIT.1982.1056489
  8. MacQueen, J.B., Some methods for classification and analysis of multivariate observations. Proceedings of 5th Berkeley Symposium on Mathematical Statistics and Probability, 1967, pp. 281-297.
  9. Malandraki, C. and Daskin, M.S., Time Dependent Vehicle Routing Problems : Formulations, Properties and Heuristic Algorithm. Transportation Science, 1992, Vol. 26, No. 3, pp. 185-200. https://doi.org/10.1287/trsc.26.3.185
  10. Moon, G. and Park, S., Analysis and reconstruction of vehicle speeds to design an efficient time dependent VRP heuristic. Journal of the Society of Korea Industrial and Systems Engineering, 2012, Vol. 35, No. 1, pp. 140-147.
  11. Moon, G. and Park, S., A Possible heuristic for variable speed vehicle routing problem with 4 time zone. Journal of the Society of Korea Industrial and Systems Engineering, 2012, Vol. 35, No. 4, pp. 171-178. https://doi.org/10.11627/jkise.2012.35.4.171