• Journal of Korean Society of Transportation
• /
• v.21 no.5
• /
• pp.19-29
• /
• 2003

The purpose of this study is to analyse the effect of the parking information on the waiting time using the simulation method. Stated Preference survey has been implemented to construct the parking lot choice model. A queue simulation is carried out to investigate the effect of various parking information on the waiting time. The results show that providing parking information is likely to increase the utilization of parking place and to decease the waiting time of individual vehicle. Furthermore, as the parking demand increases, the detailed and quantitative parking information such as "5 minutes delay" is more effective than qualitative parking information such as "available".

• Proceedings of the KSR Conference
• /
• 2011.10a
• /
• pp.2422-2429
• /
• 2011

The main function of station is supplying the convenient environment to the passengers as a vehicle waiting place. Smart station is networked based on the station which has been combined with additional functions like effective operation and real time monitoring and power control. Smart station network for the operation has been concerning about the communication security and the data transmission distance between vehicle and station. Smart station can be useful for the ubiquitous data communication place where the people can use their personal communication instruments very easily and quickly. This is the smart station.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.26 no.2
• /
• pp.68-74
• /
• 2003

Modem automated manufacturing processes employ automated guided vehicles(AGVs) for material handling, which serve several machining centers(MCs) in a factory. Optimal scheduling of AGVs can significantly help to increase the efficiency of the manufacturing process by minimizing the idle time of MCs waiting for the raw materials. In this paper, we will analyse the requirements for an optimal schedule and then provide a mathematical framework for an efficient schedule of material delivery by an AGV. With this model, the optimal number of MCs to be utilized will also be determined. Finally, the material delivery schedule employing multiple journeys to the MCs by the AGV will be carried out. Through rigorous analysis and simulation experiments, we shall show that such a delivery strategy will optimize the overall performance.

• Journal of Korean Society of Transportation
• /
• v.22 no.7 s.78
• /
• pp.107-117
• /
• 2004

The growing demand for customer-response, made-to-order manufacturing and satisfactory delivery are stimulating the importance of commercial fleet management problem. Moreover, the rapid transformation to the customer-oriented multi-frequency, relatively small fleet, such as home delivery and Perishable goods, requiring prompt delivery and advanced real-time operation of vehicle fleets. In this paper we consider the vehicle routing problem(VRP) to minimize delivery completion time which is equal to the time that last customer wait for the vehicle in fleet operation. The mathematical formulation is different from those for the classical VRP which is minimizing cost/distance/time by running vehicles in manager's point of view. The key aspect of this model is not considering the return time from the last customer to depot in every vehicle path. Thereby, the vehicle dispatcher can afford to dynamically respond to customer demand and vehicle availability. The customer's position concerned with minimizing waiting time that may be applied for the delivery of product required freshness or delivery time. Extensive experiments are carried out to compare the performance of minimizing delivery completion time by using the ILOG Solver which has the advantage of solving quickly an interim solution very near an optimal solution. The experimental results show that the suggested model can easily find near optimal solution in a reasonable computational time under the various combination of customers and vehicles.

• Journal of Climate Change Research
• /
• v.8 no.3
• /
• pp.265-273
• /
• 2017

Recently the Paris Climate Change Accord has been officially put into effect, making global efforts to implement Greenhouse Gas (GHG) reductions, and also International environmental regulations in the automotive sector will be further strengthened. The electric vehicle, which minimizes the particulate matter generated by existing internal combustion engine automobiles, is evaluated as a representative eco-friendly automobile. However, charging the battery of an electric vehicle is not fully environment-friendly if it is fueled by electricity that is being generated by fossil fuels as an energy source. The energy generated by the photovoltaic power generation system, which is an infinite clean energy, can be used to charge an electric vehicle's battery. Currently, shortage of charging facilities, time of charging, and high battery prices are the problem of activating the supply of electric vehicles. This study is to build a conjunction between the EVBSS (Electric Vehicle Battery Supply System) and ESS (Energy Storage System), which can quickly supply the photovoltaic charged battery to the required demand. If the charged battery in the Battery Swapping Station (BSS) is swapped swiftly, it will dramatically shorten the waiting time for charging the battery. As a result, if the battery is rented when it is needed, electric vehicles can be sold without the cost of a battery, which accounts for a large portion of the total cost, then the supply of electric vehicles are expected to expand. Furthermore, it will be an important alternative to maneuver climate change by minimizing GHG emissions from internal combustion engine vehicles.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.8
• /
• pp.2473-2489
• /
• 2022

Urban development has brought about the increasing saturation of urban traffic demand, and traffic congestion has become the primary problem in transportation. Roads are in a state of waiting in line or even congestion, which seriously affects people's enthusiasm and efficiency of travel. This paper mainly studies the discrete domain path planning method based on the flow data. Taking the traffic flow data based on the highway network structure as the research object, this paper uses the deep learning theory technology to complete the path weight determination process, optimizes the path planning algorithm, realizes the vehicle path planning application for the expressway, and carries on the deployment operation in the highway company. The path topology is constructed to transform the actual road information into abstract space that the machine can understand. An appropriate data structure is used for storage, and a path topology based on the modeling background of expressway is constructed to realize the mutual mapping between the two. Experiments show that the proposed method can further reduce the interpolation error, and the interpolation error in the case of random missing is smaller than that in the other two missing modes. In order to improve the real-time performance of vehicle path planning, the association features are selected, the path weights are calculated comprehensively, and the traditional path planning algorithm structure is optimized. It is of great significance for the sustainable development of cities.

• KIPS Transactions on Computer and Communication Systems
• /
• v.8 no.12
• /
• pp.277-286
• /
• 2019

The Unmanned Aerial Vehicle (UAV) is one of the most precious inventions of Internet of things (IOT). UAV faces the necessity to charge battery or replace battery from the charging stations during or between services. We propose scheduling algorithms for drone power charging (SADPC). The basic idea of algorithm is considering both a deadline (for increasing deadline miss ratio) and a charging time (for decreasing waiting time) to decide priority on charging station among drones. Our simulation results show that our power charging algorithm for drones are efficient in terms of the deadline miss ratio as well as the waiting time in general in compare to other conventional algorithms (EDF or SJF). Also, we can choose proper algorithms for battery charge scheduling and charge ready battery allocation according to system parameters and user requirements based on our simulation.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.22 no.1
• /
• pp.143-160
• /
• 2023

It is important to secure the golden time of emergency vehicles for quick responses in disaster situations, such as fire, rescue, and first aid. This study proposes plans Emergency Vehicle Preemption (EVP) based on the analysis of emergency vehicle operation to secure the golden time of emergency vehicles and increase driving safety. The emergency vehicle dispatch statistics, emergency vehicle traffic accident statistics, and survey were used for the analysis. As a result of the analysis, the frequency of dispatch of emergency vehicles and traffic accidents are increasing gradually, but the rate of securing the golden time of emergency vehicles is approximately half, indicating that improvement measures are urgent. In the questionnaire survey, most citizens consent to the necessity of introducing EVP. In addition, the criteria for the range of emergency vehicles that could provide EVP and the allowable time for waiting were derived. These results could be used to prepare EVP operation strategies, and it is expected to contribute to improving emergency vehicle operation safety and increasing the golden time securing rate through a rapid expansion of EVP.

• Journal of Korean Society of Transportation
• /
• v.25 no.2 s.95
• /
• pp.121-132
• /
• 2007

This paper addressed the issue of a generalized cost model for transit assignment. The model composed of walk time, waiting time (including transfer waiting time), line-haul time, transfer walk time, and fare. The weights of each component were supposed to be calculated using the stated preference (SP) data, which were collected prudently in order to reflect reality. The marginal rate of substitution and wage rate were applied to calculate the weights. The results showed that the weight of walking time per in-vehicle travel time (IVTT) was 1.507, the weight of waiting time (per IVTT) was 1.749, that of transfer time (per IVTT) was 1.474, and that of fare (per IVTT) was 1.476 for trips between inner-city areas in Seoul. Weights for each component were identified as 1.871, 1.967, 1.015, and 0.857, respectively, for trips between Seoul and Gyeonggi. Statistical significance existed between two cases and each variable was also statistically significant. Transit assignment using the relative weights estimated in this study was implemented to analyze the travel index in a macroscopic and quantitative basis. The results showed that average total travel times were 30.23 minutes and 63.29 minutes and average generalized costs were 2,510 won and 3,880 won for trips between inner-city areas in Seoul and between Seoul and Gyeonggi, respectively.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.3
• /
• pp.300-309
• /
• 2003

The Japanese developed the first Car navigation system in 1981 with the advent of Honda, which was known as the car inertial navigation system. Now days, It is possible to search the shortest route to and from places and arrival time using the internet via cell phone to the driver based on GIS and GPS. However, even with a good navigation system, it losses the shortest route when there is an average speed of the vehicle being between S-15 kilometers. Therefore, in order to improve the vehicle waiting time and average vehicle speed, we are suggesting an optimal green time algorithm using fuzzy adaptive control, where there are different traffic intersection lengths, and lanes. In this paper, to be able to assist the driver and forecast the optimal traffic information with regards to the road conditions; dangerous roads, construction work and estimation of arrival time at their destination using internet.