Browse > Article
http://dx.doi.org/10.5392/JKCA.2021.21.01.541

Development of the Shortest Path Algorithm for Multiple Waypoints Based on Clustering for Automatic Book Management in Libraries  

Kang, Hyo Jung (제주대학교 컴퓨터교육과)
Jeon, Eun Joo (제주대학교 컴퓨터교육과)
Park, Chan Jung (제주대학교 컴퓨터교육과)
Publication Information
The Journal of the Korea Contents Association / v.21, no.1, 2021 , pp. 541-551 More about this Journal
Abstract
Among the numerous duties of a librarian in a library, the work of arranging books is a job that the librarian has to do one by one. Thus, the cost of labor and time is large. In order to solve this problem, the interest in book-arranging robots based on artificial intelligence has recently increased. In this paper, we propose the K-ACO algorithm, which is the shortest path algorithm for multi-stops that can be applied to the library book arrangement robots. The proposed K-ACO algorithm assumes multiple robots rather than one robot. In addition, the K-ACO improves the ANT algorithm to create K clusters and provides the shortest path for each cluster. In this paper, the performance analysis of the proposed algorithm was carried out from the perspective of book arrangement time. The proposed algorithm, the K-ACO algorithm, was applied to a university library and compared with the current book arrangement algorithm. Through the simulation, we found that the proposed algorithm can allocate fairly, without biasing the work of arranging books, and ultimately significantly reduce the time to complete the entire work. Through the results of this study, we expect to improve quality services in the library by reducing the labor and time costs required for arranging books.
Keywords
Routing Algorithm; Clustering; Library Management; Automation Technology; Artificial Intelligence;
Citations & Related Records
연도 인용수 순위
  • Reference
1 https://www.suwonlib.go.kr/bkid/html/01_guide/guide0303.asp
2 J. L. Deneubourg, S. Goss, N. Franks, A. Sendova-Franks, C. Detrain, and L. Chretien. 1991. The Dynamics of Collective Sorting Robot-like Ants and Ant-like Robots. In Proceedings of the First International Conference on Simulation of Adaptive Behavior on From Animals to Animats, MIT Press, Cambridge, MA, USA, pp. 356-363, 1990.
3 R. S. Parpinelli, H. S. Lopes, and A. A. Freitas, "Data Mining With an Ant Colony Optimization Algorithm," IEEE Transactions on Evolutionary Computation, Vol.6, No.4, pp.321-332, 2002.   DOI
4 R. Li, Z. Huang, E. Kurniawan, and C. K. Ho, "AuRoSS: An Autonomous Robotic Shelf Scanning system," 2015 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), Hamburg, 2015, pp.6100-6105, doi: 10.1109/IROS.2015.7354246.
5 https://www.naverlabs.com/aircart
6 https://www.naverlabs.com/storyList?storySeq=&keyword=AROUND
7 카일 루든, C로 구현한 알고리즘, 한빛미디어, p.564, 2000.
8 임재걸, 이강재, "여행지 최적 경로를 제공하는 웹 시스템의 설계와 구현," 한국컴퓨터정보학회논문지, 제12권, 제5호, pp.19-27, 2007.
9 양성봉, 알기 쉬운 알고리즘, 생능출판사, p.256, 2013.
10 김희영, 배송 순서 알고리즘에 바탕을 둔 모바일 택배 배송 시스템의 설계 및 구현, 서울여자대학교 일반대학원, 석사학위논문, 2014.
11 이영해, 이태연, 조동원, "시간 종속 재고 경로 문제를 위한 최적화 모델," 교통연구, 제19권, 제1호, pp.39-56, 2012.
12 이성열, 박영한, 이정민, "개미 알고리즘을 이용한 택배 배송 최단 경로 탐색 시범 시스템의 개발," 한국산업정보학회논문지, 제12권, 제4호, pp.89-96, 2007.
13 M. Ester, H. P. Kriegel, J. Sander, and X. Xu, "A density-based algorithm for discovering clusters in large spatial databases with noise," In Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD'96). AAAI Press, pp.226-231, 1996.
14 정강훈, 노태학, 최일, "사회적 기능과 역할변화에 따른 공공도서관의 공간구성 특성에 관한 연구," 대한건축학회 학술발표대회 논문집, pp.333-336, 2006.
15 https://www.jjan.Kr/news/articleView.html?idxno=2047170
16 http://www.libsta.go.Kr
17 김혜주, 안인자, 박미영, 김호연, "국내 도서관 자원 봉사자 활동 현황 분석 - 공공도서관 및 학교도서관을 중심으로," 한국비블리아학회지, 제20권, 제1호, pp.5-7, 2009.
18 윤희윤, "공공도서관 직원 배치 기준 개정안 연구," 한국문헌정보학회지, 제46권, 제1호, pp.2-7, 2012.
19 S. Liu, Z. T. Dou, F. Li, and Y. L. Huang, "A New Ant Colony Clustering Algorithm Based on DBSCAN," Proceedings of 2004 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.04EX826), Shanghai, China, pp.1491-1496, Vol.3, doi: 10.1109/ICMLC.2004.1382009, 2004.
20 T. Kanungo, D. M. Mount, N. S. Netanyahu, C. D. Piatko, R. Silverman, and A. Y. Wu, "An Efficient K-means Clustering Algorithm: Analysis and Implementation," IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol.24, No.7, pp.881-892, 2002.   DOI
21 D. U. Pizzagalli, S. F. Gonzalez, and R. Krause, "A shortest-path based clustering algorithm for joint human-machine analysis of complex datasets," arXiv preprint arXiv: 1812.11850, 2018.
22 H. T. T. Binh, P. D Thanh, and T. B. Thang, "New Approach for Solving The Clustered Shortest-Path Tree Problem Based on Reducing The Search Space of Evolutionary Algorithm," Knowledge-Based Systems, pp.12-25, 2019.
23 Y. Song, T. Jeon, J. Ahn, and D. H. Im, "Design and Implementation Algorithm of Efficient Travel Time for Mobility Groups Using Hierarchy Clusters," 2020 온라인 추계학술발표대회 논문집, 제27권, 제2호, pp.777-780, 2020.
24 O. M. Jafar and R. Sivakumar, "Ant-Based Clustering Algorithms: A Brief Survey," International Journal of Computer Theory and Engineering, Vol.2, No.5, p.787, 2010.
25 M. Kang and Y. Choi, "Ant Colony Hierarchical Cluster Analysis," Journal of Internet Computing and Services (JICS), Vol.15, pp.95-105, 2014.
26 심규석, 이희상, 김윤배, 박진수, 김재범, "탐색개미-일개미 군집화 알고리즘," 대한산업공학회 춘계공동학술대회 논문집, pp.313-319, 2006.
27 T. N. Reddy and K. P. Supreethi, "Optimization of K-means Algorithm: Ant Colony Optimization," 2017 International Conference on Computing Methodologies and Communication (ICCMC), Erode, pp.530-535, doi:10.1109/ICCMC. 2017.8282522, 2017.