• KSCE Journal of Civil and Environmental Engineering Research
• /
• 제28권5D호
• /
• pp.649-654
• /
• 2008

In the definition of non additive path, the sum of travel costs of links making up the path is not equal to the path cost. There are a variety of cases that non-additivity assumption does not hold in transportation fields. Nonetheless, traffic equilibrium models are generally built up on the fundamental hypothesis of additivity assumption. In this case traffic equilibrium models are only applicable within restrictive conditions of the path cost being linear functions of link cost. Area-wide road pricing is known as an example of realistic transportation situations, which violates such additivity assumption. Because travel fare is charged at the moment of driver's passing by exit gate while identified at entry gate, it may not be added linearly proportional to link costs. This research proposes a novel Wordrop type of traffic equilibrium model in terms of area-wide road pricing schemes. It introduces binary indicator variable for the sake of transforming non-additive path cost to additive. Since conventional shortest path and Frank-Wolfe algorithm can be applied without route enumeration and network representation is not required, it can be recognized more generalized model compared to the pre-proposed approaches. Theoretical proofs and case studies are demonstrated.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• 제8권5호
• /
• pp.1-11
• /
• 2009

TCS Data imply characteristics of traffic conditions. However, there are outliers in TCS data, which can not represent the travel time of the pertinent section, if these outliers are not eliminated, travel time may be distorted owing to these outliers. Various travel time can be distributed under the same section and time because the variation of the travel time is increase as the section distance is increase, which make difficult to calculate the representative of travel time. Accordingly, it is important to grasp travel time characteristics in order to compute the representative of travel time using TCS Data. In this study, after analyzing the variation ratio of the travel time according to the link distance and the level of congestion, the outlier elimination model and the smoothing model for TCS data were proposed. The results show that the proposed model can be utilized for estimating a reliable travel time for a long-distance path in which there are a variation of travel times from the same departure time, the intervals are large and the change in the representative travel time is irregular for a short period.

• IE interfaces
• /
• 제2권1호
• /
• pp.37-45
• /
• 1989

Guide path design is the most important factor in planning automated guided vehicle systems(AGVS) in manufacturing shop environments. This paper studies a heuristic procedure to design an optimal bi-directional guide path with the objective of the minimum total travel time of the vehicles. An example is solved to validate the procedure developed.

• Journal of Korean Institute of Industrial Engineers
• /
• 제19권2호
• /
• pp.43-51
• /
• 1993

This paper describes the flow path design of unidirectional automated guided vehicle systems. The objective is to find the flow path which will minimize total travel time of unloaded as well as loaded vehicles. The allocation of unloaded vehicles is determined by applying the transportation simplex method. The problem is solved using a branch-and-bound technique. A simple illustrative example is discussed to demonstrate the procedure.

• Journal of the Korean Operations Research and Management Science Society
• /
• 제34권1호
• /
• pp.61-83
• /
• 2009

This study developed a variable demand traffic assignment model by stable dynamics. Stable dynamics, suggested by Nesterov and do Palma[19], is a new model which describes and provides a stable state of congestion in urban transportation networks. In comparison with the user equilibrium model, which is based on the arc travel time function in analyzing transportation networks, stable dynamics requires few parameters and is coincident with intuitions and observations on congestion. It is therefore expected to be a useful analysis tool for transportation planners. In this study, we generalize the stable dynamics into the model with variable demands. We suggest a three stage optimization model. In the first stage, we introduce critical travel times and dummy links and determine variable demands and link flows by applying an optimization problem to an extended network with the dummy links. Then we determine link travel times and path flows in the following stages. We present a numerical example of the application of the model to a given network.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• 제3권1호
• /
• pp.31-44
• /
• 2004

The study of Estimation model for the short-term travel time prediction. There is a different solution which has predicted the link travel time to solve this problem. By using this solution, the link travel time is predicted based on link conditions from time to time. The predicated link travel time is used to search the shortest path. Before providing a dynamic shortest path finding, the prediction model should be verified. To verify the prediction model, three models such as Kalman filtering, Stochastic Process, ARIMA. The ARIMA model should adjust optimal parameters according to the traffic conditions. It requires a frequent adjustment process of finding optimal parameters. As a result of these characteristics, It is difficult to use the ARIMA model as a prediction. Kalman Filtering model has a distinguished prediction capability. It is due to the modification of travel time predictive errors in the gaining matrix. As a result of these characteristics, the Kalman Filtering model is likely to have a non-accumulative errors in prediction. Stochastic Process model uses the historical patterns of travel time conditions on links. It if favorably comparable with the other models in the sense of the recurrent travel time condition prediction. As a result, for the travel time estimation, Kalman filtering model is the better estimation model for the short-term estimation, stochastic process is the better for the long-term estimation.

• Journal of Distribution Science
• /
• 제18권6호
• /
• pp.25-35
• /
• 2020

Purpose:Travel agencies have use digital tools in order to shift the paradigm in how business is conducted. Online travel agencies provide the same services as a normal travel agency, including hotels, transportation, guided tours, reservations, and related services, but using an "online platform. Travelers planning a trip can use a lot of forms to collect information and have access to a larger amount of information, so the factors that influence the user's behavioral intention are very important. This research has the conducted to find what factors lead to the attitudes of consumers in using OTA using the UTAUT model. Research design, data and methodology: The object of this study were respondents of a google survey using convenient sample extraction method, chosen among consumers who gathered information, or purchased a product. A total of 217 of the 235 questionnaires Google survey answered were used in the final analysis, excluding insincere responses. Using PSS v.21 and AMOS v.21, frequency analysis, feasibility and reliability analysis, path analysis was performed. Results: UTAUT affects OTA use satisfaction and trust, and OTA satisfaction and trust affect behavior intention. Conclusions: Research was conducted using the UTAUT model to explore factors that affect the attitudes of users of online travel agencies (OTA).

• Proceedings of the KSR Conference
• /
• 한국철도학회 2011년도 정기총회 및 추계학술대회 논문집
• /
• 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.

• Transactions on Electrical and Electronic Materials
• /
• 제7권5호
• /
• pp.252-256
• /
• 2006

When a partial discharge takes place at the stator of a generator, the electrical pulse will propagate along the stator bars and the capacitor chains formed by the end part of the stator winds. On the first path, the pulse propagates as a travel wave at slow speed. On the second path, the pulse propagates at quick speed. Based on the data of the experiments on a real 50 MW steam generator, the author has found the pulses can propagate by magnetic field of the stator winding. It was studied that how to locating the partial discharge by signals coming from the different paths, including the features of signals on the two paths at time domain and frequency domain, the measurement frequency rang of the signals, the blind area, the advantage and disadvantage of this method.

• Proceedings of the Korean Society for Agricultural Machinery Conference
• /
• 한국농업기계학회 2000년도 THE THIRD INTERNATIONAL CONFERENCE ON AGRICULTURAL MACHINERY ENGINEERING. V.III
• /
• pp.707-714
• /
• 2000

For self-guiding track-type orchard sprayer, a low-cost steering controller was developed using two ultrasonic sensors, two DC motors and 80196kc microprocessor. The operating principle of controller was to travel the sprayer between artificial targets such as wood stick placed every 1 m along both sides of the demanded path of speed sprayer. Measuring distances to both targets ahead with the ultrasonic sensors mounted on the front end of sprayer, the controller could determine how much offset the position of sprayer was laterally. Then the steering angle was calculated to actuate DC motors connected to the steering clutches, where the fuzzy control algorithm was used. Equipped with the controller developed in this research, the sprayer could be traveled along demanded path, the centerline between targets, at speeds of up to 0.4m/sec with an accuracy of ${\pm}$20cm.