• Proceedings of the KOR-KST Conference
• /
• 1999.10a
• /
• pp.65-70
• /
• 1999

• Proceedings of the KOR-KST Conference
• /
• 1999.10a
• /
• pp.483-488
• /
• 1999

• Journal of Korean Society of Transportation
• /
• v.21 no.2
• /
• pp.95-105
• /
• 2003

Because the basic assumptions of deterministic user equilibrium assignment that all network users have perfect information of network condition and determine their routes without errors are known to be unrealistic, several stochastic assignment models have been proposed to relax this assumption. However. it is not easy to solve such stochastic assignment models due to the probability distribution they assume. Also. in order to avoid all path enumeration they restrict the number of feasible path set, thereby they can not preciously explain the travel behavior when the travel cost is varied in a network loading step. Another problem of the stochastic assignment models is stemmed from that they use heuristic approach in attaining optimal moving size, due to the difficulty for evaluation of their objective function. This paper presents a logit-based stochastic assignment model and its solution algorithm to cope with the problems above. We also provide a stochastic user equilibrium condition of the model. The model is based on path where all feasible paths are enumerated in advance. This kind of method needs a more computing demand for running the model compared to the link-based one. However, there are same advantages. It could describe the travel behavior more exactly, and too much computing time does not require than we expect, because we calculate the path set only one time in initial step Two numerical examples are also given in order to assess the model and to compare it with other methods.

• 한국ITS학회:학술대회논문집
• /
• 2008.11a
• /
• pp.25-28
• /
• 2008

• Journal of Korean Society of Transportation
• /
• v.21 no.6
• /
• pp.89-99
• /
• 2003

Considering a path represented by a sequence of link numbers in a network, the vine is differentiated from the loop in a sense that any link number can be appeared in the path only once, while more than once in the loop. The vine provides a proper idea how to account for complicated travel patterns such as U-turn and P-turn witnessed nearby intersections in urban roads. This paper proposes a new algorithm in which the vine travel pattern can be considered for finding K number of sequential paths. The main idea of this paper is achieved by replacing the node label of the existing Yen's algorithm by the link label technique. The case studies show that the algorithm properly represent the vine travel patterns in searching K number of paths. A noticeable result is that the algorithm may be a promising alternative for ITS deployment by enabling to provide reasonable route information including perceived traveler costs.

• Journal of Korean Society of Transportation
• /
• v.19 no.5
• /
• pp.85-97
• /
• 2001

In this study, the purpose behind this research is to propose index to be used for classification of functional the urban streets and to select the feasible length of special management link by the index. This special management link help decision makers found a transportation policy. In order to perform functional classification, index such as average traveled distance, link VKT and VKT per length-lane are use at the study. Average traveled distance index is average traveled distance divided by length of Path k and VKT per length-lane is trip volume characteristic considering lanes and length of Path k. Special management links on which major part of the vehicle are selected with using Path-VKT which represents how many long-distance touring vehicles are on the arterial road. The selection of special management links are performed with network composed of 14 paths (arterial roads) in seoul The total distance of special management links resulted from the above analysis is 141km(35.0% of the whole paths length) and total VKT of the special management links is 4,152,475 VKT(45.2% of the whole paths VKT)

• Journal of the Korean Society for Railway
• /
• v.18 no.2
• /
• pp.149-156
• /
• 2015

It is necessary to determine real path for urban railway users in order to allocate revenues between urban railway organizations. Out of several algorithms used to determine optimal routes, the k-path algorithm based on link-label has been utilized. However, this k-path algorithm has certain flaws. For example, optimal route can change depending on the travel and walking time, transfer penalty, and so on. Also, this algorithm cannot take into account the characteristics of users, who prefer express train to normal trains. In this paper, an algorithm is proposed to determine one single optimal route based on the traffic card data. This method also can search for an optimal path in conjunction with the railway timetable.

• Journal of the Korean Society of Hazard Mitigation
• /
• v.11 no.3
• /
• pp.49-56
• /
• 2011

This paper deals with a methodology for searching optimal route of hazard material (hazmat) vehicles. When we make a decision of hazmat optimal paths, there is a conflict between the public aspect which wants to minimize risk and the private aspect which has a goal of minimizing travel time. This paper presents Efficient Vector Labeling algorithm as a methodology for searching optimal path of hazmat transportation, which is intrinsically one of the multi-criteria decision making problems. The output of the presented algorithm is a set of Pareto optimal paths considering both risk and travel time at a time. Also, the proposed algorithm is able to identify non-dominated paths which are significantly different from each other in terms of links used. The proposed Efficient Vector Labeling algorithm are applied to test bed network and compared with the existing k-shortest path algorithm. Analysis of result shows that the proposed algorithm is more efficient and advantageous in searching reasonable alternative routes than the existing one.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.36 no.6
• /
• pp.1083-1091
• /
• 2016

This research uses public transportation card data to analyze the inter-regional transfer times, transfer frequencies, and transfer resistance that passengers experience during transit amongst the metropolitan public transportation modes. Currently, mode transfers between bus and rail are recorded up to five times during one transit movement by Trip Chain, facilitating greater comprehension of intermodal movements. However, lack of information on what arises during these transfers poses a problem in that it leads to an underestimation of transfer resistances on the Trip Chain. As such, a path choice model that reflects passenger movements during transit activities is created, which attains explanatory power on transfer resistance through its inclusion of transfer times and frequencies. The methodology adopted in this research is to first conceptualize the idea of metropolitan public transportation transfer, and in the case that mode transfers include the city-rail, to newly conceptualize the idea of transfer resistance using transportation card data. Also, the city-rail path choice model within the Trip Chain is constructed, with transfer time and frequency used to reevaluate transfer resistance. Further, in order to align bus and city-rail station administrative level small-zone coordinates to state and regional level mid-zone coordinates, the big node methdod is utilized. Finally, case studies on trip chains using at least one transfer onto the city-rail is used to determine the validity of the results obtained.

• Journal of Korean Society of Transportation
• /
• v.26 no.3
• /
• pp.17-29
• /
• 2008

A volume-delay function(VDF) has been used to describe the relation between traffic volumes and delay experienced by travelers on the roads traveling from origin to destination, which has been usually adopted in traffic assignment. For the purpose of more precise description of traffic pattern, we have to estimate the parameters of VDF in advance. This paper presents a methodology for estimating the parameters, which combined with golden section method. By using the method we have estimated the parameters with real data based on KTDB(2006), and validated them. Compared to the existing values of the parameters, newly estimated values are found to be closer to real world.