• International Journal of Highway Engineering
• /
• v.16 no.3
• /
• pp.119-129
• /
• 2014

PURPOSES : This investigational survey is to observe a proper spatial aggregation method for path travel time estimation using the hi-pass DSRC system. METHODS : The links which connect the nodes of section detectors location are used for path travel time estimation traditionally. It makes some problem such as increasing accumulation errors and processing times. In this background, the new links composition methods for spatial aggregation are considered by using some types of nodes as IC, JC, RSE combination. Path travel times estimated by new aggregation methods are compared with PBM travel times by MAE, MAPE and statistical hypothesis tests. RESULTS : The results of minimum sample size and missing rate for 5 minutes aggregation interval are satisfied except for JC link path travel time in Seoul TG~Kuemho JC. Thus, it was additionally observed for minimum sample size satisfaction. In 15, 30 minutes and 1 hour aggregation intervals, all conditions are satisfied by the minimum sample size criteria. For accuracy test and statistical hypothesis test, it has been proved that RSE, Conzone, IC, JC links have equivalent errors and statistical characteristics. CONCLUSIONS : There are some errors between the PBM and the LBM methods that come from dropping vehicles by rest areas. Consequently, this survey result means each of links compositions are available for the estimation of path travel time when PBM vehicles are missed.

• Journal of Korean Society of Transportation
• /
• v.33 no.3
• /
• pp.315-321
• /
• 2015

ATMS calculates section travel time using two-way communication system called DSRC(Dedicated Short Range Communications) which collects data of RSE (Road Side Equipment) and Hi-pass OBU (On-board Unit). Travel time estimation in urban area involves uncertainty due to the interrupted flow. This study not only analyzed real-time data but also considered pattern data. Baek-Je-Ro street in Jeon-Ju city was selected as a test site. Existing algorithm was utilized for data filtering and pattern data building. Analysis results repoted that travel time estimation with 20% of real-time data and 80% of pattern data mixture gave minimum average difference of 37.5 seconds compare to the real travel time at the 5% significant level. Results of this study recommend usage of intermixture between real time data and pattern data to minimize error for travel time estimation in urban area.

• Journal of Urban Science
• /
• v.10 no.1
• /
• pp.49-60
• /
• 2021

The purpose of this study is to analysis the impact on the inside of the new city when an incidents occurs on the Songdo International City connecting road, which has a limited access. The analysis data used KTDB's O/D and network data of the Seoul metropolitan area. In addition, the scenario composition applied a method of reducing the number of lanes on the road according to the situation of incidents, targeting bridges advancing from Songdo International City to the outside in the morning peak hours. The analysis method analyzed the traffic volume, total travel time, total travel kilometer, and route change in the new city based on the results of the traffic allocation model. As a result of the analysis, the range of influence was shown to two types. First, of the seven bridges, Aam 3, Aam 2, and Aam 1 were analyzed to have an impact only in some areas of the northwestern part of the new city. On the other hand, the remaining bridges were analyzed to affect the new city as a whole. The analysis results of this study are expected to be used as basic data to establish the scope of internal road network management when similar cases occur in the future.

• IE interfaces
• /
• v.11 no.1
• /
• pp.67-74
• /
• 1998

This study is to develop a vehicle scheduling system for the efficient delivery of goods to places of business. For gathering data and testing the system developed, we have chosen a company which is located in Taegu city and has more than 700 delivery points over Taegu city and Kyungbuk province. We consider multiple vehicle types, travel time restrictions on vehicles, vehicle acceptance restrictions at delivery points, and other operational restrictions. We divide the whole delivery points into 44 regions and generate a region-based shortest path tree. Based on the shortest path tree, we perform vehicle assignment sequentially for each vehicle used. Then vehicle routings are determined. We have implemented the whole procedure on computer system. The system developed is flexible enough to be applicable to other companies by just changing the standard data.

• The Transactions of the Korea Information Processing Society
• /
• v.13 no.6
• /
• pp.269-277
• /
• 2024

With the advancement of modern IT technologies, the operation of autonomous vehicles is becoming a reality, and route planning is essential for this. Generally, route planning involves proposing the shortest path to minimize travel distance and the quickest path to minimize travel time. However, the quality of these routes depends on the topological characteristics of the road network graph. If the connectivity structure of the road network is not rational, there are limits to the performance improvement that routing algorithms can achieve. Real drivers consider psychological factors such as the number of turns, surrounding environment, traffic congestion, and road quality when choosing routes, and they particularly prefer routes with fewer turns. This paper introduces a simple path algorithm that seeks routes with the fewest turns, in addition to the traditional shortest distance and quickest time routes, to evaluate the characteristics of road networks. Using this simple path algorithm, we compare and evaluate the connectivity characteristics of road networks in 20 major cities worldwide. By analyzing these road network characteristics, we can identify the strengths and weaknesses of urban road networks and develop more efficient and safer route planning algorithms. This paper comprehensively examines the quality of road networks and the efficiency of route planning by analyzing and comparing the road network characteristics of each city using the proposed simple path algorithm.

• KIPS Transactions on Software and Data Engineering
• /
• v.9 no.1
• /
• pp.17-24
• /
• 2020

The traveling salesman problem is an algorithmic problem tasked with finding the shortest route that a salesman visits, visiting each city and returning to the started city. Due to the exponential time complexity of TSP, it's hard to implement on cases like amusement park or delivery. Also, TSP is hard to meet user's demand that is associated with multi-dimensional attributes like travel time, interests, waiting time because it uses only one attribute - distance between nodes. This paper proposed Top-n Skyline-Multi Dimension TSP to resolve formerly adverted problems. The proposed algorithm finds the shortest route faster than the existing method by decreasing the number of operations, selecting multi-dimensional nodes according to the dominance of skyline. In the simulation, we compared computation time of dynamic programming algorithm to the proposed a TS-MDT algorithm, and it showed that TS-MDT was faster than dynamic programming algorithm.

• Journal of Korean Society of Rural Planning
• /
• v.11 no.1 s.26
• /
• pp.1-8
• /
• 2005

The purpose of this study is to develop a simulation model of rural road path for infrastructure of green-tourism and public service in rural areas. This study makes an objective function for moving cost minimization considering car travel time according to road characteristics, which can route the optimal shortest road paths between the center places and all rear villages, based on GIS coverages of road-village network for connecting between center places and rural villages as input data of the model. In order to verify the model algorithm, a homogeneous hexagonal network, assuming distribution of villages with same population density and equal distance between neighborhood villages on a level plane area, was tested to simulate the optimal paths between the selected center nodes and the other rear nodes, so that the test showed reasonable shortest paths and road intensity defined in this study. The model was also applied to the actual rural area, Ucheon-myun, which is located on Hoengsung-gun, Kangwon-do, with 72 rural villages, a center village (Uhang, 1st center place) in the area, a county conte. (Hoengsung-eup, 2nd center place), and a city (Wonju, 3rd center place), as upper settlement system. The three kinds of conte. place, Uhang, Hoengsung-eup, and Wonju, were considered as center places of three scenarios to simulate the optimal shortest paths between the centers and rural villages, respectively. The simulation results on the road-village network with road information about pavement and width of road show that several spans having high intensity of road are more important that the others, while some road spans have low intensity of road.

• Journal of Korean Society for Geospatial Information Science
• /
• v.5 no.2 s.10
• /
• pp.131-144
• /
• 1997

Traffic jam densified day by day is phenomenon to occur lack of the road capacity in comparison with traffic density, but lack of the road cannot be concluded by main cause of traffic ism. Because the central function of a city would be concentrated upon the downtown and traffic demand would not be evenly distributed by the classification of an hour. Therefore, this study based on the fact that each driver will select the route generating traffic delay very low when path choice from origin to destination in travel plan estimating the quality of passage could be maintained the speed he want will approach to a characteristic grasp of a road, traffic, driver changing every moment by traffic-demand of road increased as a geometrical series with analysis a classification of a street, a intersection along the path on traffic density and highway capacity analysis the path using GIS techniques about complex street network, also will get the path of actual optimum for traffic delay trend creating under various condition the classification per a hour, a day of week and an incident through network such as analysis for traffic generation zone adjacent about street, intersection, afterward will expect the result increasing efficiency of the road-use through a good distribution of traffic by optimum-path choice, accordingly will prepare the scientific, objective, appropriate basis to decide the reasonable time of a road-widen and expansion through section analysis along a rate of traffic volume vs. road capacity.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.36 no.1
• /
• pp.105-114
• /
• 2016

With approximately 20 million transportation card data entries of the metropolitan districts being generated per day, application of the data to management and policy interventions is becoming an issue of interest. The research herein attempts a model of the possibility of dynamic demand change predictions and its purpose is thereby to construct a Dynamic Passengers Trip Assignment Model. The model and algorithm created are targeted at city rail lines operated by seven different transport facilities with the exclusion of travel by bus, as passenger movements by this mode can be minutely disaggregated through card tagging. The model created has been constructed in continuous time as is fitting to the big data characteristic of transport card data, while passenger path choice behavior is effectively represented using a perception parameter as a function of increasing number of transfers. Running the model on 800 pairs of metropolitan city rail data has proven its capability in determining dynamic demand at any moment in time, in line with the typical advantages expected of a continuous time-based model. Comparison against data measured by the eye of existing rail operating facilities to assess changes in congestion intensity shows that the model closely approximates the values and trends of the existing data with high levels of confidence. Future research efforts should be directed toward continued examination into construction of an integrated bus-city rail system model.