• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.41 no.5
• /
• pp.571-580
• /
• 2021

When constructing railway stations, gates shall be located in appropriate locations for convenient use. However, to reduce construction costs, the number of gates was minimized and the location was not appropriately placed to the direction of many users. This study proposed a method to calculate the benefits of additional gate installations using the improvement of pedestrian traffic flow, occupied area and travel time as economic effects. In particular, a method of estimating the percentage of people using certain gates and the number of people by route within the station was proposed. This method was applied to analyze the effect of additional gates to Gwang-myeong Station on the Shinansan Line, which is to be opened in 2025. The effect has only improved in mobility. The first year of its opening was estimated at 5.91 billion won for mobility and 75.8 billion won for cost, and the B/C was 1.21 for 30 years after its opening. It is expected that this method will be applied to systematic effect analysis when additional gates are installed at unopened railway stations as well as existing railway stations.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.41 no.6
• /
• pp.715-725
• /
• 2021

When constructing railway stations, gates shall be located in appropriate locations for convenient use. However, to reduce construction costs, the number of gates was minimized and the location was not appropriately placed to the direction of many users. This study proposed a method to calculate the benefits of additional gate installations using the improvement of pedestrian traffic flow, occupied area and travel time as economic effects. In particular, a method of estimating the percentage of people using certain gates and the number of people by route within the station was proposed. This method was applied to analyze the effect of additional gates to Gwang-myeong Station on the Shinansan Line, which is to be opened in 2025. The effect has only improved in mobility. The first year of its opening was estimated at 5.91 billion won for mobility and 75.8 billion won for cost, and the B/C was 1.21 for 30 years after its opening. It is expected that this method will be applied to systematic effect analysis when additional gates are installed at unopened railway stations as well as existing railway stations.

• Management Science and Financial Engineering
• /
• v.5 no.1
• /
• pp.1-25
• /
• 1999

There is a worldwide trend to automate the handling operations in port container terminals in an effort to improve productivity and reduce labor cost. This study iscusses how to apply an AGV(automated guided vehicle) system to the handling of containers in the yard of a port container ter-minal. The main issue of this paper is how to assign tasks of container delivery to AGVs during ship operations in an automated port container terminal. A dual-cycle operation is assumed in which the loading and the discharging operation can be performed alternately. Mixed integer linear program-ming formulations are suggested for the dispatching problem. The completion time of all the dis-charging and loading operations by a quayside crane is minimized, and the minimization of the total travel time of AGVs is also considered as a secondary objective. A heuristic method using useful properties of the dispatching problem is suggested to reduce the computational time. The perfor-mance of the heuristic algorithm is evaluated in light of solution quality and computation time.

• Journal of Korean Society of Transportation
• /
• v.26 no.1
• /
• pp.127-135
• /
• 2008

Generally, optimum shortest path algorithms adopt single attribute objective among several attributes such as travel time, travel cost, travel fare and travel distance. On the other hand, multi-objective shortest path algorithms find the shortest paths in consideration with multi-objectives. Up to recently, the most of all researches about multi-objective shortest paths are proceeded only in single transportation mode networks. Although, there are some papers about multi-objective shortest paths with multi-modal transportation networks, they did not consider transfer problems in the optimal solution level. In particular, dynamic programming method was not dealt in multi-objective shortest path problems in multi-modal transportation networks. In this study, we propose a multi-objective shortest path algorithm including dynamic programming in order to find optimal solution in multi-modal transportation networks. That algorithm is based on two-objective node-based label correcting algorithm proposed by Skriver and Andersen in 2000 and transfer can be reflected without network expansion in this paper. In addition, we use non-dominated paths and tree sets as labels in order to improve effectiveness of searching non-dominated paths. We also classifies path finding attributes into transfer and link travel attribute in limited transit networks. Lastly, the calculation process of proposed algorithm is checked by computer programming in a small-scaled multi-modal transportation network.

• Journal of Korean Society of Transportation
• /
• v.23 no.7 s.85
• /
• pp.77-86
• /
• 2005

Level of service(LOS) is a quantify measure describing operational conditions within a traffic stream, generally, in terms of such service measures as speed, travel time, freedom to measures, traffic interruptions, comfort and convenience. The LOS is leveled by highway facilities according to measure of effectiveness(MOE) and then used to evaluate performance capacity. The current evaluation of a urban road is performed by only a aspect of traffic operation without any concepts of safety. Therefore, this paper presents a method for evaluation of risk order for urban road with new MOE, user cost analysis, considering both smooth traffic operation(congestion) and traffic safety(accident). The user coat is included traffic accident cast by traffic safety and traffic congestion cost by traffic operation. First of all, a number of traffic accident and accident rate by highway geometric is inferred from urban road traffic accident prediction model (Poul Greibe(2001)) Secondly, a user cost is inferred as traffic accident cast and traffic congestion cost is putting together. Thirdly, a method for evaluation of a urban road is inferred by user cost analysis. Fourthly a accident rate by segment predict with traffic accidents and data related to the accidents in $1996{\sim}1998$ on 11 urban road segments, Gwang-Ju, predicted accident rate. Traffic accident cost predict using predicted accident rate, and, traffic congestion cost predict using predicted average traffic speed(KHCM). Fifthly, a risk order are presented by predicted user cost at each segment in urban roads. Finally, it si compared and evaluated that LOS of 11 urban road segments, Gwang-Ju, by only a aspect of traffic operation without any concepts of safety and risk order by a method for evaluation of urban road in this paper.

• Journal of Korean Society of Transportation
• /
• v.30 no.5
• /
• pp.71-82
• /
• 2012

Some previous studies adopted a method statistically based on the observed traffic volumes and travel times to estimate the parameters. Others tried to find an optimal set of parameters to minimize the gap between the observed and estimated traffic volumes using, for instance, a combined optimization model with a traffic assignment model. The latter is frequently used in a large-scale network that has a capability to find a set of optimal parameter values, but its appropriateness has never been demonstrated. Thus, we developed a methodology to estimate a set of parameter values of BPR(Bureau of Public Road) function using Harmony Search (HS) method. HS was developed in early 2000, and is a global search method proven to be superior to other global search methods (e.g. Genetic Algorithm or Tabu search). However, it has rarely been adopted in transportation research arena yet. The HS based transportation network calibration algorithm developed in this study is tested using a grid network, and its outcomes are compared to those from incremental method (Incre) and Golden Section (GS) method. It is found that the HS algorithm outperforms Incre and GS for copying the given observed link traffic counts, and it is also pointed out that the popular optimal network calibration techniques based on an objective function of traffic volume replication are lacking the capability to find appropriate free flow travel speed and ${\alpha}$ value.

• Journal of the Korean Society for Railway
• /
• v.11 no.6
• /
• pp.581-587
• /
• 2008

This paper presents a railway network design problem (RNDP), which can be formulated as a bi-level program. In bi-level program upper level program is to minimize total travel cost including the construction cost of the railway facilities, whilst lower one describes the railway route choice behavior of passengers. We also propose a heuristic method for solving the program because it is a kind of NP-hard problem. From two numerical railway examples, we confirm that the RNDP and its algorithm produce a reasonable solution and that it is applicable to real world.

• Journal of Korean Society of Transportation
• /
• v.34 no.6
• /
• pp.570-579
• /
• 2016

This study proposes a concept of Stepwise Transfer Coefficient(STC) which implies greater transfer cost with increasing the number of transfers. Thus, the public transport information system provides the choice sets of travel routes by the consideration of not only transportation time but also the optimum number of transfers. However, path choice problems that involve STC are found to include non additive cost, which requires additional route enumeration works. Discussions on route enumeration in actual transportation networks is very complicated, thereby warranting a theoretical examination of route search considering STC. From these points of view, this study results in a probability based transit trip assignment model including STC. This research also uses incoming link based entire route deletion method. The entire route deletion method proposed herein simplifies construction of an aggregation of possible routes by theoretically supporting the process of enumeration of the different routes from origin to destination. Conclusively, the STC reflected route based logit model is proposed as a public transportation transit trip assignment model.

• Journal of the Korea Society for Simulation
• /
• v.27 no.2
• /
• pp.71-81
• /
• 2018

Forklifts in a shipyard lift and transport heavy objects. Tasks occur dynamically and the rate of the task occurrence changes over time. Especially, the rate of the task occurrence is high immediately after morning and afternoon business hours. The weight of objects varies according to task characteristic, and a forklift also has the workable or allowable weight limit. In this study, we propose an online forklift dispatching algorithm based on nearest-neighbor dispatching rule using minimal cost assignment approach in order to attain the efficient operations. The proposed algorithm considers various types of forklift and multiple jobs at the same time to determine the dispatch plan. We generate dummy forklifts and dummy tasks to handle unbalance in the numbers of forklifts and tasks by taking their capacity limits and weights. In addition, a method of systematic forklift selection is also devised considering the condition of the forklift. The performance indicator is the total travel distance and the average task waiting time. We validate our approach against the priority rule-based method of the previous study by discrete-event simulation.

• Journal of Korean Society of Transportation
• /
• v.27 no.6
• /
• pp.147-156
• /
• 2009

We present a methodology for modeling and solving the transit frequency design problem with variable demand. The problem is described as a bi-level model based on a non-cooperative Stackelberg game. The upper-level operator problem is formulated as a non-linear optimization model to minimize net cost, which includes operating cost, travel cost and revenue, with fleet size and frequency constraints. The lower-level user problem is formulated as a capacity-constrained stochastic user equilibrium assignment model with variable demand, considering transfer delay between transit lines. An efficient algorithm is also presented for solving the proposed model. The upper-level model is solved by a gradient projection method, and the lower-level model is solved by an existing iterative balancing method. An application of the proposed model and algorithm is presented using a small test network. The results of this application show that the proposed algorithm converges well to an optimal point. The methodology of this study is expected to contribute to form a theoretical basis for diagnosing the problems of current transit systems and for improving its operational efficiency to increase the demand as well as the level of service.