• Journal of Korean Society of Transportation
• /
• v.22 no.4 s.75
• /
• pp.85-96
• /
• 2004

Given a Path represented by a sequence of link numbers in a transportation network, the reasonable path is defined as a path that any link is appeared multiple times in it. Application of the link labelmethod(LLM) to the shortest path algorithms(SPA) enables to model the reasonable path choice behavior in urban networks. This study aims at expanding the LLM to a Kth shortest path algorithms(KPSA), which adopts the node label setting method. The small-scaled network test demonstrated that the proposed algorithm works correctly and the revised Sioux fall network test showed that the path choice behaviors are reasonably reflected. In the large-scaled network based on the South Korea peninsula, drivers' route diversion perceptions are included as cost terms in total cost. The algorithm may be applied as an alternative route information tools for the deployment of ATIS.

• Proceedings of the KSR Conference
• /
• 2011.10a
• /
• pp.607-613
• /
• 2011

This paper reviews search methods of multiple reasonable paths to implement multimodal public transportation network of Seoul. Such a large scale multimodal public transportation network as Seoul, the computation time of path finding algorithm is a key and the result of path should reflect route choice behavior of public transportation passengers. Search method of alternative path is divided by removing path method and deviation path method. It analyzes previous researches based on the complexity of algorithm for large-scale network. Applying path finding algorithm in public transportation network, transfer and loop constraints must be included to be able to reflect real behavior. It constructs the generalized cost function based on the smart card data to reflect travel behavior of public transportation. To validate the availability of algorithm, experiments conducted with Seoul metropolitan public multimodal transportation network consisted with 22,109 nodes and 215,859 links by using the deviation path method, suitable for large-scale network.

• Journal of Korean Society of Transportation
• /
• v.8 no.1
• /
• pp.55-71
• /
• 1990

The behavioral mechanism underlying the traffic assignment model is a choice, or decision-making process of traveling paths between origins and destinations. The deterministic approach to traffic assignment assumes that travelers choose shortest path from their origin-destination pair. Although this assumption seems reasonable, it presumes that all travelers have perfect information regarding travel time, that they make consistently correct decision, and that they all behave in identical fashion. Stochastic user equilibrium assignment relaxes these presumptions by including a random component in traveler's perception of travel time. The objective of this study is to compare "A Model of Deterministic User Equilibrium Assignment" with "Models of Stochastic User Equilibrium Assignment" in the theoretical and practical aspects. Specifically, SUE models are developed to logit and probit based models according to discrete choice functions. The models were applied to sioux Falls net ork consisting of 24 zones, 24 nodes and 76 links. The distribution of perceived travel time was obtained by using the relationship between speed and traffic flow.

• 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.

• Journal of Navigation and Port Research
• /
• v.27 no.4
• /
• pp.479-484
• /
• 2003

In the case of the feeder bus route choice, it is more desirable to choose the route by treating as a single route linked from origin to destination than the whole network. This study is to establish a concept that frames the feeder bus route choice technique for the change of the existing single bus route or the creation of the new feeder bus route. The concept of the feeder bus route choice technique in this study is not to frame the whole bus network but to frame a single route to a unit O-D pair. So, this study has the assumption that does not consider the waiting and transfer time at the bus stop. This system technique consists of the following phases: I) limitation of the road network examined for the study, ii) enumeration of the appropriate candidate routes by the permissive route length, and iii) determination of the optimum bus route by the route evaluation value.

• Journal of Korean Society of Transportation
• /
• v.22 no.2 s.73
• /
• pp.131-143
• /
• 2004

Given a path represented by a sequence of link numbers in a graph, the vine is differentiated from the loop in a sense that any link number can be visited in the path no more than once, while more than once in the loop. The vine provides a proper idea on complicated travel patterns such as U-turn and P-turn witnessed near intersections in urban transportation networks. Application of the link label method(LLM) to the shortest Path algorithms(SPA) enables to take into account these vine travel features. This study aims at expanding the LLM to a K-th path search algorithm (KPSA), which adopts the node-based-label correcting method to find a group of K number of paths. The paths including the vine type of travels are conceptualized as drivers reasonable route choice behaviors(RRCB) based on non-repetition of the same link in the paths, and the link-label-based MPSA is proposed on the basis of the RRCB. The small-scaled network test shows that the algorithm sequence works correctly producing multiple paths satisfying the RRCB. The large-scaled network study detects the solution degeneration (SD) problem in case the number of paths (K) is not sufficient enough, and the (K-1) dimension algorithm is developed to prevent the SD from the 1st path of each link, so that it may be applied as reasonable alternative route information tool, an important requirement of which is if it can generate small number of distinct alternative paths.

• Journal of Korean Society of Transportation
• /
• v.22 no.6
• /
• pp.121-131
• /
• 2004

The K-shortest path algorithms are largely classified into two groups: oneis for finding loopless path (simple path), another loop paths. In terms of cimputational complexities, in general the loop-paths-finding ones are considered more efficient and easier to be handled than the loopless-paths-finding. The entire path deletion methods have been known as the best efficient algorithms among the proposed K-shortest path algorithms. These algorithms exploit the K-th network transformation to prevent the same path, which was already selected as the (K-1)th path, from being redetected. Nevertheless, these algorithms have a critical limitationto be applied in the practical traffic networks because the loops, in which the same modes and links can be unlimitedly repeated, are not preventable. This research develops a way to be able to selectively control loop-paths by applying link-label. This research takes an advantage of the link-based shortest path algorithms that since the algorithms can take care of two links simultaneouslyin the searching process, the generation of loops can be controlled in the concatenation process of the searched link and the preceded link. In concatenation of two links, since the precede link can be treated a sub-shortest to this link from the origination, whether both the node and the link of the searched link were already existed or not can be evaluated. Terefore, both the node-loopless path, in which the same node is not appeared, and the link-loopless, in which the same link is not appeared, can be separately controlled. Especially, the concept of the link-loopless path is expended to take into consideration reasonable route choice behaviors such as U-Turn, P-Turn, and Turn-Penalty, which are frequently witnessed in urban traffic network with intersections. The applicability of the proposed method is verified through case studies.

• Proceedings of the Korean Geotechical Society Conference
• /
• 2008.10a
• /
• pp.1167-1174
• /
• 2008

Vertical drain method, which is one of the soft ground improvement methods, shorten s drain path to accelerate consolidation process and is applied in many sites. At a recent, composite discharge capacity experiment that analyze discharge amount by consolidation behavior with overburden pressure of soft ground in laboratory, simulates similarly with actuality. Geotechnical engineering problems such a s soft ground improvement are solved by numerical analysis by development of computer and numerical analysis techniques. Numerical analysis does that result is contrary by user's inexperience for choice of constitution model and application of analysis method. Therefore, this thesis experiments on composite discharge capacity test and study discharge capacity of drain and consolidation behavior of soft ground installed prefabricated vertical drain boards. Also, This thesis studied reasonable input parameters and constitution model by compare results of composite discharge capacity test and numerical analysis using PLAXIS that is 2D finial element numerical analysis program.

• Archives of design research
• /
• v.16 no.2
• /
• pp.345-354
• /
• 2003

Digital TV broadcasting technology is recognized as a very encouraging technological development by koreans because of high-definition, multi-channel and interactive services which would broaden the viewers choice and promote people's prosperity. The technological development of digital TV service is a drastic change for people's convenience and would be a major media of‘e-government’in Korea. Digital TV Program UI will affect to people's esthetic sense and information efficiency. The information search pattern in TV is different from it of computer which has lead interactive media so far This research verifies the reasonable information display method through the usability test based on former related researches. For the case study, Interactive EPG design of SkyLife is selected and reviewed. This research includes the design development of interactive EPG of DVB-MHP.