• 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 Transportation
• /
• v.27 no.4
• /
• pp.31-40
• /
• 2009

Some road charges toll to finance the cost or to manage traffic congestion. With a growth of PPI projects, toll roads would be increase continuously. Tolls have a considerable influence on user's route choice, and sometimes can affect to the departure time and even to mode choice. For modelling toll roads, user's WTP or VOT has an important role and it is general that VOT is equivalent to the wages of workers. The current way of modelling technique yields various toll price elasticity from low to high. When there exist few alternative routes, unrealistic result that all traffic assigned to some shortest path may occur. The toll price elasticity can be influenced by alternative route and congestion level, but some result shows nearly unrealistic patterns. The model to forecast more realistic toll road demand is very essential for estimating toll revenue, choice of optimal toll level & collecting location and establishing toll charge strategy. This paper reviewed some literatures about toll road modelling and tested case study about the assignment technique with different VOT. The case study shows that using different VOT yields more realistic result than the use of single VOT.

• Journal of Korean Society of Transportation
• /
• v.17 no.4
• /
• pp.71-84
• /
• 1999

The purpose of this study is to construct a dynamic traffic analysis model using the existing traffic flow theory in order to develope a dynamic traffic assignment technique. In this study the dynamic traffic analysis model was constructed using Daganzo's CELL TRANSMISSION THEORY which was considered more suitable to dynamic traffic assignment than the other traffic flow theories. We developed newly the diverging split module, the cost update module and the link cost function and defined the maximum waiting time decision function that Daganzo haven't defined certainly at his Papers. The output that resulted from the simulation of the dynamic traffic analysis model with test network I and II was shown at some tables and figures, and the analysis of the bottleneck and the HOV lane theory showed realistic outputs. Especially, the result of traffic assignment using the model doesn't show equilibrium status every time slice but showed that the average travel cost of every path maintains similarly in every time slice. It is considered that this model can be used at the highway operation and the analysis of traffic characteristics at a diverging section and the analysis of the HOV lane effect.

• Journal of Korean Society for Geospatial Information Science
• /
• v.20 no.1
• /
• pp.13-20
• /
• 2012

In this study, the change pattern of hydrological response function as development has been observed. The target watershed was selected Tanbu sub-Basin in the Bocheong Basin. The applied channel networks are composed of 10 cases that are channel networks by strahler's ordering scheme and cases of all grids channel or the hillslope in basin. To each case of grid in basin, channel and hillslope drainage path lengths to outlet of basin are calculated, and hydrological response function was calculated by Nash Model. As results of this analysis, the peak discharge of hydrological response function is increased and peak time is shortened as development of channel networks. And based on statistical characteristics of hydrological response function, mean (lag time) and variance of travel time are reduced exponentially.

• Journal of Korean Society of Transportation
• /
• v.27 no.5
• /
• pp.189-194
• /
• 2009

Transfer impedance is one of the most critical factors decreasing the competitive power of public transportation. Therefore, it is necessary to improve transfer impedance of KTX and rail station users in order to increase the usage of public transportation. Important factors influencing transfer decisions include exterior walking distance, interior walking distance, steps, and escalators. However, their comparative impedances are different. This study constructed a model for calculating transfer impedance based on bodily sensational transfer time in KTX and rail stations and calculated transfer impedance on major KTX and rail stations in Korea. The study results show that the addition of one escalator decreases travel time by one to three minutes. The calculated transfer impedance based on bodily sensational transfer time in this study can be utilized as objective criteria to compare transfer conditions of different KTX and rail stations and to prioritize them for facility improvement. The calculated transfer impedance also can be used as facility guidelines for designing a new transit center.

• Journal of Korean Society of Transportation
• /
• v.26 no.3
• /
• pp.233-243
• /
• 2008

Recognition for the importance and roles of public transportation is increasing because of traffic problems in many cities. In spite of this paradigm change, previous researches related with public transportation trip assignment have limits in some aspects. Especially, in case of multimodal public transportation networks, many characters should be considered such as transfers. operational time schedules, waiting time and travel cost. After metropolitan integrated transfer discount system was carried out, transfer trips are increasing among traffic modes and this takes the variation of users' route choices. Moreover, the advent of high-technology public transportation card called smart card, public transportation users' travel information can be recorded automatically and this gives many researchers new analytical methodology for multimodal public transportation networks. In this paper, it is suggested that the methodology for establishment of brand new multimodal public transportation networks based on computer programming methods using transportation card data. First, we propose the building method of integrated transportation networks based on bus and urban railroad stations in order to make full use of travel information from transportation card data. Second, it is offered how to connect the broken transfer links by computer-based programming techniques. This is very helpful to solve the transfer problems that existing transportation networks have. Lastly, we give the methodology for users' paths finding and network establishment among multi-modes in multimodal public transportation networks. By using proposed methodology in this research, it becomes easy to build multimodal public transportation networks with existing bus and urban railroad station coordinates. Also, without extra works including transfer links connection, it is possible to make large-scaled multimodal public transportation networks. In the end, this study can contribute to solve users' paths finding problem among multi-modes which is regarded as an unsolved issue in existing transportation networks.

• Journal of Korean Society of Transportation
• /
• v.22 no.7 s.78
• /
• pp.91-98
• /
• 2004

This study focuses on the development of dynamic assignment for evaluation and application for dynamic route guidance strategy. Travelers are classified according to information contents which they received pre/on trip. The first group have no traffic information, so they travel with fixed route. The second group have real-time shortest path and travel according to it. The last group have car navigation system or individual method(cellular phone, PDA-two way communication available) for traffic information on trip. And then they are assigned in accordance with the proposed multiclass dynamic assignment model. At this time the last group is gotten under control with DFS(decentralized feedback strategy). In use of this Process we expect that various traffic information strategy can be tested and also be the key factor for success of ITS, location of VMS(variable message sign), cycle of information, area of traffic information, etc).

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.22 no.2
• /
• pp.318-323
• /
• 2013

For fast and accurate motion of 6-axis articulated robot, more noble motion control strategy is needed. In general, the movement strategy of industrial robots can be divided into two kinds, PTP (Point to Point) and CP (Continuous Path). Recently, industrial robots which should be co-worked with machine tools are increasingly needed for performing various jobs, as well as simple handling or welding. Therefore, in order to cope with high-speed handling of the cooperation of industrial robots with machine tools or other devices, CP should be implemented so as to reduce vibration and noise, as well as decreasing operation time. This paper will realize CP motion (especially joint-linear) blending in 3-dimensional space for a 6-axis articulated (lab-manufactured) robot (called as "RS2") by using LabVIEW$^{(R)}$ (6) programming, based on a parametric interpolation. Another small contribution of this paper is the proposal of motion blending simulation technique based on Recurdyn$^{(R)}$ V7 and Solidworks$^{(R)}$, in order to figure out whether the joint-linear blending motion can generate the stable motion of robot in the sense of velocity magnitude at the end-effector of robot or not. In order to evaluate the performance of joint-linear motion blending, simple PTP (i.e., linear-linear) is also physically implemented on RS2. The implementation results of joint-linear motion blending and PTP are compared in terms of vibration magnitude and travel time by using the vibration testing equipment of Medallion of Zonic$^{(R)}$. It can be confirmed verified that the vibration peak of joint-linear motion blending has been reduced to 1/10, compared to that of PTP.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.4
• /
• pp.63-74
• /
• 2021

Location-based services (LBSs) are expected to process a large number of spatial queries, such as shortest path and k-nearest neighbor queries that arrive simultaneously at peak periods. Deploying more LBS servers to process these simultaneous spatial queries is a potential solution. However, this significantly increases service operating costs. Recently, batch processing solutions have been proposed to process a set of queries using shareable computation. In this study, we investigate the problem of batch processing moving k-nearest neighbor (MkNN) queries in dynamic spatial networks, where the travel time of each road segment changes frequently based on the traffic conditions. LBS servers based on one-query-at-a-time processing often fail to process simultaneous MkNN queries because of the significant number of redundant computations. We aim to improve the efficiency algorithmically by processing MkNN queries in batches and reusing sharable computations. Extensive evaluation using real-world roadmaps shows the superiority of our solution compared with state-of-the-art methods.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.29 no.6B
• /
• pp.551-560
• /
• 2009

This paper describes a newly developed pollutant transport model named ARPTM which was designed to simulate the transport and characteristics of pollutant materials after an accidental spill in upstream of river system up to a given position in the downstream. In particular, the ARPTM incorporated ADCP data to compute longitudinal dispersion coefficient and advection velocity which are necessary to apply one-dimensional advection-dispersion equation. ARPTM was built on top of the geographic information system platforms to take advantage of the technology's capabilities to track geo-referenced processes and visualize the simulated results in conjunction with associated geographic layers such as digital maps. The ARPTM computes travel distance, time, and concentration of the pollutant cloud in the given flow path from the river network, after quickly finding path between the spill of the pollutant material and any concerned points in the downstream. ARPTM is closely connected with a recently developed GIS-based Arc River database that stores inputs and outputs of ARPTM. ARPTM thereby assembles measurements, modeling, and cyberinfrastructure components to create a useful cyber-tool for determining and visualizing the dynamics of the clouds of pollutants while dispersing in space and time. ARPTM is expected to be potentially used for building warning system for the transport of pollutant materials in a large basin.