Path inference implementing the cluster path covering method

Authors : Kadir Akgöl, Emre Demir, Ibrahim Aydoğdu

Pages : 53-62

View : 35 | Download : 42

Publication Date : 2024-02-29

Article Type : Research Paper

Abstract :Determination of the optimal route in transportation activities is one of the major problems in transportation. Therefore, efficient techniques deserve our utmost attention to detect optimal routes. In this study, a novel method called Cluster Path Covering (CPC) has been developed and introduced to identify a route based on a sequence of location points on a network. There are already models to minimize the total path cost between the pair of nodes following a kind of sequence. However, our method aims to minimize the path cost, including the neighbourhood accessibility of the path nodes on the network. One of the major challenges for the new model is to reveal the accessibility costs between the nodes. The methodology presents the CPC method clustering the location points on a network and indicating the optimum point for each cluster. Then, the CPC method generates the best path by connecting the specific location points representing the clusters. Moreover, the shortest covering of the neighbourhood path problem (SCNPP) is introduced in this study. The novel CPC method is utilized for SCNPP, a distinctive version of the shortest covering path problem (SCPP). The performance of the CPC method is then tested on two different benchmark networks. According to the results, it provides robust and efficient outcomes for decreasing the routes\' transportation costs (e.g., distances). The issues that can be solved via the CPC method include the accessibility costs of public transportation paths and the locations of stops by minimizing the costs.
Keywords : Yol ağ tasarımı, Kaplayan yol, K means, Kentsel planlama