• Journal of the Society of Disaster Information
• /
• v.20 no.2
• /
• pp.257-269
• /
• 2024

Purpose: The purpose of this study is to explain the pivotal role of the travel forecasting process in urban transportation planning. This study emphasizes the use of travel forecasting models to anticipate future traffic. Method: This study examines the methodology used in urban travel demand modeling within transportation planning, specifically focusing on the Urban Transportation Modeling System (UTMS). UTMS is designed to predict various aspects of urban transportation, including quantities, temporal patterns, origin-destination pairs, modal preferences, and optimal routes in metropolitan areas. By analyzing UTMS and its operational framework, this research aims to enhance an understanding of contemporary urban travel demand modeling practices and their implications for transportation planning and urban mobility management. Result: The result of this study provides a nuanced understanding of travel dynamics, emphasizing the influence of variables such as average income, household size, and vehicle ownership on travel patterns. Furthermore, the attraction model highlights specific areas of significance, elucidating the role of retail locations, non-retail areas, and other locales in shaping the observed dynamics of transportation. Conclusion: The study methodically addressed urban travel dynamics in a four-ward area, employing a comprehensive modeling approach involving trip generation, attraction, distribution, modal split, and assignment. The findings, such as the prevalence of motorbikes as the primary mode of transportation and the impact of adjusted traffic patterns on reduced travel times, offer valuable insights for urban planners and policymakers in optimizing transportation networks. These insights can inform strategic decisions to enhance efficiency and sustainability in urban mobility planning.

• Journal of Korean Society of Transportation
• /
• v.17 no.5
• /
• pp.99-110
• /
• 1999

This study deals with the adaptability questions of O-D table estimation models. Its objectives are two-fold; (1) to estimate the characteristics of various O-D table estimation models(i.e. linear regression models. entropy models and statistic models) and (2) to find the model which estimates the O-D table with the best accuracy under the various data conditions. In Pursuing the above, this study gives the particular attentions to the test of the models, using the Sioux Falls network and equilibrium assignment method of MINUTP. The major findings are the followings. Firstly. it finds that the statistic models have the most goodness of fat among all models, if the required data are all Prepared. But it Presents that statistic models are the most sensitive against the underspecification and inconsistency problems of link data. Secondly, It shows that the linear regression models have the worst goodness of fat among all models. But the linear regression models are the most insensitive to the underspecification and inconsistency problems. Thirdly, THE/1 model of entropy model is sensitive against the underspecification and incon-sistency problems, but THE/2 model is insensitive. Finally, other informations like total volume, zonal Production and attraction volumes in 0-D table, help models to gain the better goodness of fit. Especially, in the statistic models. both the zonal production and attraction volume data are helpful to estimate the link volumes. It can be expected that the results dive some implications not only to the selection of optimal model under the various given data, but also to the development or modification of model.

• Journal of Korean Society of Transportation
• /
• v.20 no.4
• /
• pp.51-61
• /
• 2002

In this dissertation, We demonstrated the Travel Time forecasting model in the freeway of multi-section with regard of drives' attitude. Recently, the forecasted travel time that is furnished based on expected travel time data and advanced experiment isn't being able to reflect the time-lag phenomenon specially in case of long distance trip, so drivers don't believe any more forecasted travel time. And that's why the effects of ATIS(Advanced Traveler Information System) are reduced. Therefore, in this dissertation to forecast the travel time of the freeway of multi-section reflecting the time-lag phenomenon & the delay of tollgate, we used traffic volume data & TCS data that are collected by Korea Highway Cooperation. Also keep the data of mixed unusual to applicate real system. The applied model for forecasting is consisted of feed-forward structure which has three input units & two output units and the back-propagation is utilized as studying method. Furthermore, the optimal alternative was chosen through the twelve alternative ideas which is composed of the unit number of hidden-layer & repeating number which affect studying speed & forecasting capability. In order to compare the forecasting capability of developed ANN model. the algorithm which are currently used as an information source for freeway travel time. During the comparison with reference model, MSE, MARE, MAE & T-test were executed, as the result, the model which utilized the artificial neural network performed more superior forecasting capability among the comparison index. Moreover, the calculated through the particularity of data structure which was used in this experiment.

• Journal of Intelligence and Information Systems
• /
• v.19 no.4
• /
• pp.55-79
• /
• 2013

In this paper, we propose a hybrid genetic algorithm (HGA) approach to effectively solve the reverse logistics network with centralized centers (RLNCC). For the proposed HGA approach, genetic algorithm (GA) is used as a main algorithm. For implementing GA, a new bit-string representation scheme using 0 and 1 values is suggested, which can easily make initial population of GA. As genetic operators, the elitist strategy in enlarged sampling space developed by Gen and Chang (1997), a new two-point crossover operator, and a new random mutation operator are used for selection, crossover and mutation, respectively. For hybrid concept of GA, an iterative hill climbing method (IHCM) developed by Michalewicz (1994) is inserted into HGA search loop. The IHCM is one of local search techniques and precisely explores the space converged by GA search. The RLNCC is composed of collection centers, remanufacturing centers, redistribution centers, and secondary markets in reverse logistics networks. Of the centers and secondary markets, only one collection center, remanufacturing center, redistribution center, and secondary market should be opened in reverse logistics networks. Some assumptions are considered for effectively implementing the RLNCC The RLNCC is represented by a mixed integer programming (MIP) model using indexes, parameters and decision variables. The objective function of the MIP model is to minimize the total cost which is consisted of transportation cost, fixed cost, and handling cost. The transportation cost is obtained by transporting the returned products between each centers and secondary markets. The fixed cost is calculated by opening or closing decision at each center and secondary markets. That is, if there are three collection centers (the opening costs of collection center 1 2, and 3 are 10.5, 12.1, 8.9, respectively), and the collection center 1 is opened and the remainders are all closed, then the fixed cost is 10.5. The handling cost means the cost of treating the products returned from customers at each center and secondary markets which are opened at each RLNCC stage. The RLNCC is solved by the proposed HGA approach. In numerical experiment, the proposed HGA and a conventional competing approach is compared with each other using various measures of performance. For the conventional competing approach, the GA approach by Yun (2013) is used. The GA approach has not any local search technique such as the IHCM proposed the HGA approach. As measures of performance, CPU time, optimal solution, and optimal setting are used. Two types of the RLNCC with different numbers of customers, collection centers, remanufacturing centers, redistribution centers and secondary markets are presented for comparing the performances of the HGA and GA approaches. The MIP models using the two types of the RLNCC are programmed by Visual Basic Version 6.0, and the computer implementing environment is the IBM compatible PC with 3.06Ghz CPU speed and 1GB RAM on Windows XP. The parameters used in the HGA and GA approaches are that the total number of generations is 10,000, population size 20, crossover rate 0.5, mutation rate 0.1, and the search range for the IHCM is 2.0. Total 20 iterations are made for eliminating the randomness of the searches of the HGA and GA approaches. With performance comparisons, network representations by opening/closing decision, and convergence processes using two types of the RLNCCs, the experimental result shows that the HGA has significantly better performance in terms of the optimal solution than the GA, though the GA is slightly quicker than the HGA in terms of the CPU time. Finally, it has been proved that the proposed HGA approach is more efficient than conventional GA approach in two types of the RLNCC since the former has a GA search process as well as a local search process for additional search scheme, while the latter has a GA search process alone. For a future study, much more large-sized RLNCCs will be tested for robustness of our approach.

• Journal of the Society of Disaster Information
• /
• v.20 no.1
• /
• pp.199-205
• /
• 2024

Purpose: This study aims to improve the recognition rate of Auto People Counting (APC) in accurately identifying and providing information on remaining evacuees in disaster-vulnerable facilities such as nursing homes to firefighting and other response agencies in the event of a disaster. Methods: In this study, a baseline model was established using CNN (Convolutional Neural Network) models to improve the algorithm for recognizing images of incoming and outgoing individuals through cameras installed in actual disaster-vulnerable facilities operating APC systems. Various algorithms were analyzed, and the top seven candidates were selected. The research was conducted by utilizing transfer learning models to select the optimal algorithm with the best performance. Results: Experiment results confirmed the precision and recall of Densenet201 and Resnet152v2 models, which exhibited the best performance in terms of time and accuracy. It was observed that both models demonstrated 100% accuracy for all labels, with Densenet201 model showing superior performance. Conclusion: The optimal algorithm applicable to APC among various artificial intelligence algorithms was selected. Further research on algorithm analysis and learning is required to accurately identify the incoming and outgoing individuals in disaster-vulnerable facilities in various disaster situations such as emergencies in the future.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.6C
• /
• pp.476-482
• /
• 2012

In this paper, we analyze and compare several co-channel interference mitigation algorithms for WBAN application in 2.4 GHz ISM frequency bands. ML (Maximum Likelihood), OC (Optimal Combining) and MMSE (Minimum Mean Square Error) has been considered for the possible techniques for interference cancellation in view of the trade off between the performance and the complexity of implementation. Based on the channel model of IEEE 802.15.6 standard, simulation results show that ML and OC attains the lower BER performance than that of MMSE if we assume the perfect channel estimation. But, ML and OC have the additional requirement of implementation for his own and other users's channel estimation process, hence, besides the BER performance, the complexity of implementation and the sensitivity to channel estimation error should be considered since it requires the simple and small sized equipment for WBAN system application. In addition, the gap of detection BER performance between ML, OC and MMSE is much decreased under the imperfect channel estimation if we adopt real channel estimation process, therefore, in order to apply to WBAN system, the trade off between the BER performance and complexity of implemetation should be seriously considered to decide the best co-channel interference cancellation for WBAN system application.

• Journal of Korean Society of Coastal and Ocean Engineers
• /
• v.28 no.5
• /
• pp.277-283
• /
• 2016

Tetrapod is one of the most widely used concrete armor units for rubble mound breakwaters. The calculation of the stability number of Tetrapods is necessary to determine the optimal weight of Tetrapods. Many empirical formulas have been developed to calculate the stability number of Tetrapods, from the Hudson formula in 1950s to the recent one developed by Suh and Kang. They were developed by using the regression analysis to determine the coefficients of an assumed formula using the experimental data. Recently, software engineering (or machine learning) methods are introduced as a large amount of experimental data becomes available, e.g. artificial neural network (ANN) models for rock armors. However, these methods are seldom used probably because they did not significantly improve the accuracy compared with the empirical formula and/or the engineers are not familiar with them. In this study, we propose an explicit method to calculate the stability number of Tetrapods using the weights and biases of an ANN model. This method can be used by an engineer who has basic knowledge of matrix operation without requiring knowledge of ANN, and it is more accurate than previous empirical formulas.

• Journal of Korea Water Resources Association
• /
• v.30 no.5
• /
• pp.441-447
• /
• 1997

Rainfall observation using rain gage network or satellites includes the sampling error depending on the observation methods or plans. For example, the sampling using rain gages is continuous in time but discontinuous in space, which is nothing but the source of the sampling error. The sampling using satellites is the reverse case that continuous in space and discontinuous in time. The sampling error may be quantified by use of the temporal-spatial characteristics of rainfall and the sampling design. One of recent works on this problem was done by North and Nakamoto (1989), who derived a formulation for estimating the sampling error based on the temporal-spatial rainfall spectrum and the design scheme. The formula enables us to design an optimal rain gage network or a satellite operation plan providing the statistical characteristics of rainfall. In this paper the formula is reviewed and applied for the sampling error problems using several multi-dimensional precipitation models. The results show the limitation of the formulation, which cannot distinguish the model difference in case the model parameters can reproduce similar second order statistics of rainfall. The limitation can be improved by developing a new way to consider the higher order statistics, and eventually the probability density function (PDF) of rainfall.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.42 no.1
• /
• pp.9-26
• /
• 2005

In the pursuit of ever higher levels of performance, recent computer systems have made use of deep pipeline, dynamic scheduling and multi-issue superscalar processor technologies. In this situations, branch prediction schemes are an essential part of modem microarchitectures because the penalty for a branch misprediction increases as pipelines deepen and the number of instructions issued per cycle increases. In this paper, we propose a novel branch prediction scheme, direction-gshare(d-gshare), to improve the prediction accuracy. At first, we model a neural network with the components that possibly affect the branch prediction accuracy, and analyze the variation of their weights based on the neural network information. Then, we newly add the component that has a high weight value to an original gshare scheme. We simulate our branch prediction scheme using Simple Scalar, a powerful event-driven simulator, and analyze the simulation results. Our results show that, compared to bimodal, two-level adaptive and gshare predictor, direction-gshare predictor(d-gshare. 3) outperforms, without additional hardware costs, by up to 4.1% and 1.5% in average for the default mont of embedded direction, and 11.8% in maximum and 3.7% in average for the optimal one.

• KIPS Transactions on Computer and Communication Systems
• /
• v.11 no.10
• /
• pp.373-380
• /
• 2022

This paper presents a deep learning based group synchronization that supports networked immersive interactions between remote users. The goal of group synchronization is to enable all participants to synchronously interact with others for increasing user presence Most previous methods focus on NTP-based clock synchronization to enhance time accuracy. Moving average filters are used to control media playout time on the synchronization server. As an example, the exponentially weighted moving average(EWMA) would be able to track and estimate accurate playout time if the changes in input data are not significant. However it needs more time to be stable for any given change over time due to codec and system loads or fluctuations in network status. To tackle this problem, this work proposes the Deep Group Synchronization(DeepGroupSync), a group synchronization based on deep learning that models important features from the data. This model consists of two Gated Recurrent Unit(GRU) layers and one fully-connected layer, which predicts an optimal playout time by utilizing the sequential playout delays. The experiments are conducted with an existing method that uses the EWMA and the proposed method that uses the DeepGroupSync. The results show that the proposed method are more robust against unpredictable or rapid network condition changes than the existing method.