Journal of the Korea Convergence Society (한국융합학회논문지)

Korea Convergence Society (한국융합학회)
권호 표지
DOI QR코드

DOI QR Code

Search Algorithm for Efficient Optimal Path based on Time-weighted

시간 가중치 기반 효율적인 최적 경로 탐색 기법 연구

  • Her, Yu-sung (Department of Computer Science, Sejong University) ;
  • Kim, Tae-woo (Department of Computer Science, Sejong University) ;
  • Ahn, Yonghak (Department of Computer Science, Sejong University)
  • 허유성 (세종대학교 컴퓨터공학과) ;
  • 김태우 (세종대학교 컴퓨터공학과) ;
  • 안용학 (세종대학교 컴퓨터공학과)
  • Received : 2019.10.28
  • Accepted : 2020.02.20
  • Published : 2020.02.28
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, we propose an optimal path search algorithm between each node and midpoint that applies the time weighting. Services for using a location of mid point usually provide a mid point location-based on the location of users. There is a problem that is not efficient in terms of time because a location-based search method is only considered for location. To solve the problem of the existing location-based search method, the proposed algorithm sets the weights between each node and midpoint by reflecting user's location information and required time. Then, by utilizing that, it is possible to search for an optimum path. In addition, to increase the efficiency of the search, it ensures high accuracy by setting weights adaptively to the information given. Experimental results show that the proposed algorithm is able to find the optimal path to the midpoint compared with the existing method.

본 논문에서는 시간 가중치를 적용하여 각 노드들 간의 중간지점까지의 최적 경로 탐색 기법을 제안한다. 중간지점을 이용하는 서비스들은 주로 사용자들의 위치를 기반으로 하여 제공한다. 위치 기반 탐색 방법은 단순히 위치에 대해서만 고려하기 때문에 시간의 측면에서 효율적이지 못하다는 문제점이 있다. 제안된 방법은 기존의 위치 기반 탐색 방법의 문제점을 해결하기 위해 사용자들의 위치와 중간지점까지의 소요시간을 반영함으로써 각 노드와 중간지점까지의 가중치를 설정하고, 이를 활용하여 최적의 경로를 탐색할 수 있다. 또한, 탐색의 효율성을 증대하기 위해 주어지는 정보들에 적응적으로 가중치를 설정함으로써 높은 정확성을 갖도록 한다. 실험 결과, 제안된 방법은 기존 방법에 비해 중간지점까지의 최적 경로를 효과적으로 찾을 수 있음을 확인하였다.

Keywords

References

  1. H. J. Bae, J. N. Song, Y. J. Lee & J. W. Lee. (2015). The Implementation of a User Location and Preference-based Appointed Place Recommendation Mobile Application. KIISE Transaction on Computing Practices, 21(6), 403-411. https://doi.org/10.5626/KTCP.2015.21.6.403
  2. C. Y. Wang, P. S. Jang & H. H. Kim. (2019). A Study on the Characteristics of the Seasonal Travel Path of Individual Chinese Travellers in Korea. Journal of the Korea Convergence Society, 10(7), 23-31. https://doi.org/10.15207/jkcs.2019.10.7.023
  3. S. H. Bae. (2006). Development of a Method for Partial Searching Technique for Optimal Path Finding in the Long Journey Condition. Journal of The Korea Society of Civil Engineers D, 26(3D), 361-366.
  4. G. S. Nam, B. H. Jeong, J. H. No, J. W. Choi & Y. S. Kim. (1995, Mar). Development of An Optimal Path Finding System(X-Path) : An Interim Report. Symposium of The Korea Society of Management information Systems, 486-505.
  5. S. T. Park & Y. K. Kim. (2019). A Study on Deriving an Optimal Route for Tourists through the Analysis of Big Data. Journal of Convergence for Information Technology, 9(10), 56-63. https://doi.org/10.22156/cs4smb.2019.9.10.056
  6. S. H. Hong. (2018). Research on Security Model and Requirements for Fog Computing : Survey. Journal of the Korea Convergence Society, 9(5), 27-32. DOI : 10.15207/JKCS.2018.9.5.027
  7. E. Y. Jeong. (2009). Master dissertation. Analytic proofs of theorems in the plane geometry using homogeneous barycentric coordinates on triangles. Konkuk University, Seoul.
  8. P. Mitura, I. Simecek & I. Kotenkov. (2017). Effective Construction of Convex Hull Algorithms. 2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2017 19th International Symposium on, 105-112. DOI : 10.1109/SYNASC.2017.00028
  9. G. Ronald. (1972). An efficient algorithm for determining the convex hull of a finite planar set. Info. Pro. Lett. 1. 132-133. https://doi.org/10.1016/0020-0190(72)90045-2
  10. V. Tereshchenko, Y. Tereshchenko & D. Kotsur. (2015). Point triangulation using Graham's scan. Fifth International Conference on Innovative Computing Technology (INTECH 2015). DOI : 10.1109/INTECH.2015.7173370
  11. F. M. Chowdhury et al. (2005). The Unidirectional Edge Method: A New Approach for Solving Point Enclosure problem for Arbitary Polygon. Asian Journal of Information Technology, 4(5), 537-540.
  12. D. Kularathne & L. Jayarathne. (2018, Oct). Point in Polygon Determination Algorithm for 2-D Vector Graphics Applications. 2018 National Information Technology Conference(NITC). Colombo : IEEE
  13. O. Rakhmanov. A new approach (extra vertex) and generalization of Shoelace Algorithm usage in convex polyon (Point-in-Polygon). (2019). 2018 14th International Conference on Eclectronics Computer and Computation(ICECCO). DOI : 10.1109/ICECCO.2018.8634725
  14. C. W. Huang et al. (1997). On the complexity of point-in-polygon algorithms. Computer& Geosciences, 23(1), 109-118. https://doi.org/10.1016/S0098-3004(96)00071-4
  15. P. Bourke. (1987, Nov). Determining if a point lies interior of Polygon. Polygons and meshes [Online]. http://paulbourke.net/geometry/polygonmesh
  16. H. J. Kang & H. C. Kim. (2013). Dynamic Resource Assignment in the Multi-layer Networks. Journal of The Korea Society of Information Assurance, 13(6), 77-82
  17. Y. T. Kim & Y. S. Jeong. (2015). Optimization Routing Protocol based on the Location, and Distance information of Sensor Nodes. Journal of Digital Convergence, 13(2), 127-133 DOI : 10.14400/JDC.2015.13.2.127
  18. K. A. Yu. (2010). Implementation of Tactical Path-finding Integrated with Weight Learning. Journal of The Korea Society for Simulation, 19(2), 91-98
  19. K. I. Jung, B. I. Ahn, J. J. Kim & K. J. Han. (2014). Location Recommendation System based on LBSNS. Journal of Digital Convergence, 12(6), 277-287 DOI : 10.14400/JDC.2014.12.6.277