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

서지정보

ㆍ발행기관 : 한국산업경영시스템학회 ㆍ수록지정보 : 산업경영시스템학회지 / 38권 / 3호
ㆍ저자명 : 하제민, 문기주

목차

1. 서 론
2. TDVRP와 관련 해법
3. 구역분할 방법의 설계
3.1 K-Means Clustering 알고리즘
3.2 배송구역의 분할
4. 해법의 설계
4.1 초기 k위치의 결정방법
4.2 K-Means Clustering에 의한 구역분할
4.3 인접구역의 결정
5. 결 론
Acknowledgement
References

영어 초록

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.

참고 자료

없음