• Journal of the Korean Institute of Intelligent Systems
• /
• v.6 no.3
• /
• pp.51-62
• /
• 1996

Electro sensitive traffic system can not consider passenger car unit, so it causes start up delay time and passenger waiting time. In this paper, it antecedently creates passenger car unit at the bottom intersection using neural network. But, sometimes it can make mistakes due to changes in car weight, car speed, and passing area. Therefore, it consequently reduces the car waiting time and start-up delay time using fuzzy control of feed-back data. Moreover, to prevent spillback, it can adapt control even though upper traffic intersection has a different saturation rate, road length, road slope and road width.

• Advances in aircraft and spacecraft science
• /
• v.9 no.4
• /
• pp.335-347
• /
• 2022

Airport operations are well-known as a bottleneck in the air traffic system, putting growing pressure on the world's busiest airports to schedule arrivals and departures as efficiently as possible. Effective planning and control are essential for increasing airport efficiency and reducing aircraft delays. Many algorithms for controlling the arrival/departure queuing area are handled, considering it as first in first out queues, where any available aircraft can take off regardless of its relative sequence with other aircraft. In the suggested system, this problem was compared to the problem of scheduling n tasks (plane takeoffs and landings) on a multiple machine (runways). The proposed technique decreases delays (via efficient runway allocation or allowing aircraft to be expedited to reach a scheduled time) to enhance runway capacity and decrease delays. The aircraft scheduling problem entails arranging aircraft on available runways and scheduling their landings and departures while considering any operational constraints. The topic of this work is the scheduling of aircraft landings and takeoffs on multiple runways. Each aircraft's takeoff and landing schedules have time windows, as well as minimum separation intervals between landings and takeoffs. We present and evaluate a variety of comprehensive concepts and solutions for scheduling aircraft arrival and departure times, intending to reduce delays relative to scheduled times. When compared to First Come First Serve scheduling algorithm, the suggested strategy is usually successful in reducing the average waiting time and average tardiness while optimizing runway use.

• Journal of Global Scholars of Marketing Science
• /
• v.12
• /
• pp.135-154
• /
• 2003

This study having purpose of promoting the convenience of medical service customer at medical service encounter have tried to know the influence of physical environment, perceived justice, and perceived waiting time to the intention of re-use of medical service through mediating variable such as service Quality evaluation and negative emotion. Particularly, this exploratory study have first tried to know what influence the physical environment and perceived justice have on negative emotion. Findings are; First, the physical environment affect positive influence to service Quality evaluation, and lower the negative emotion. Second, perceived justice have no influence to the service Quality evaluation and negative emotion. Third, the perceived waiting time lower the service Quality and increase the negative emotion. Fourth, the service Quality have positive influence to intention of re-use of medical service. However, the negative emotion have no influence to the intention of re-use of medical service. Therefore physical environment of medical service becomes more important and it is necessary to shorten the waiting time. In addition, even though negative emotion have no influence to the intention of re-use of medical service it is necessary to make the smallest of negative emotion. Because it is possible to separate once switching barner due to the medical service specificity is solved.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.12 no.3
• /
• pp.45-55
• /
• 2009

This study was intended to increase efficiency of traffic flow management on intersection. The result suggested to establish a left-turn at own risk lane to increase efficiency of traffic flow on intersection. The scope of the research was to investigate the geometric structure of a signal-controlled intersection, traffic volume(density) with respect to directions and traffic signal display, and to select a signalling intersection into which a car waiting for a traffic signal enters by adjusting the display sequence of traffic signal. The delay with respect to directions and for the whole intersection was compared for the current situation and an improvement plan. Using TSIS, a traffic analysis package, the traffic situation on an intersection was investigated. Based on the simulation result for Seok-Jeon intersection in Ma-San selected from the field investigation of intersections to which an improvement plans would be applicable, the waiting time in the direction without a entering traffic signal was decreased to be 78.6 seconds per car and that of the direction expecting the increase of waiting time was increased by 4 seconds per car only. It was confirmed that the waiting time for the whole intersection was improved.

• Journal of radiological science and technology
• /
• v.31 no.4
• /
• pp.337-346
• /
• 2008

A questionaire survey was conducted for patients who had been examined at the Department of Radiology to investigate the items that need to be improved. Brainstorming was also conducted by team members to suggest the tactics that can efficiently perform the QI activity by selecting the most frequently answered topics for the reduction of waiting time of x-ray examination. From September 2006 to November 2007, number of patients before and after conducting QI was compared for 3 months by each category differentiated by types of detailed causes. A patient case was set as one shooting for one patient. After conducting QI, the waiting cases before conducting QI were evaluated for the method of improvement for 3 month through the QI team discussion and conducted by following the improvement method for the next 1 month and the waiting cases were measured and the difference before and after the QI activity was compared in percentage. 1. When patient waiting cases were compared before and after conducting QI activity against the causes of repetition, it resulted in 3.9% of reduction effect. 2. When patient waiting cases were compared before and after conducting QI activity against the causes for the lack of guiding, it resulted in 1.1% of reduction effect. 3. When patient waiting cases were compared before and after conducting QI activity against the causes of miss-inputting prescription, it resulted in 1.1% of reduction effect. 4. When patient waiting cases were compared before and after conducting QI activity against the causes for emergency patients, patients with acute pain and discomfort patients, it resulted in 12.0% of reduction effect. 5. When patient waiting cases were compared before and after conducting QI activity against the causes for shooting overlapping of outpatients and hospitalized patients, it resulted in 4.7% of reduction effect. There are many factors to reduce the patient waiting cases in radiography. The first step is for radiology department to find these factors through QI, to improve them, which is the reason why the QI team is organized to perform the QI activities.

• Journal of Korea Multimedia Society
• /
• v.9 no.2
• /
• pp.208-214
• /
• 2006

Participants of a NVE(networked virtual environment) may have different hardwares and network environments, and to guarantee the fairness, messages of participants should be synchronized. A solution for the synchronization problem is to wait for a certain amount of time until the server processes the message. It is not easy to determine a suitable waiting period because of the trade-off between the fairness and the responsiveness. In this paper we propose a method to decide a waiting period by considering only the participants with small network delays and perform experiments for the performance evaluation. Experiments show that the proposed method leads to significant improvement of responsiveness, while retaining fairness.

• Journal of Korea Game Society
• /
• v.5 no.4
• /
• pp.33-38
• /
• 2005

In the online game that thousands of participants connect to a game world by using Internet simultaneously, participants of the game world may have different hardwares and network environments, and messages of participants should be synchronization. A solution for the synchronization problem is to wait for a certain amount of time until the server processes the message. It is not easy to determine a suitable waiting period because of the trade-off between the fairness and the responsiveness. In this paper we propose a method to decide a waiting period by considering features of the MMOFPS game and the probability of interaction among participants. We implement the proposed method and perform experiments for the performance evaluation.

• Journal of Korean Society of Transportation
• /
• v.24 no.5 s.91
• /
• pp.77-88
• /
• 2006

The purpose of this study is to Propose the time dependent K-least time path algorithm applicable to a real-time based operation strategy in multi-modal transportation network. For this purpose, we developed the extended method based on entire path deletion method which was used in the static K-least time path algorithm. This method was applied to time dependent K-least time path algorithm to find k least time paths in order based on both time dependant mode-link travel time and transfer cost In particular, this algorithm find the optimal solution, easily describing transfer behavior, such as walking and waiting for transfer by applying a link-based time dependent label. Finally, we examined the verification and application of the Proposed algorithm through case study.

• Journal of KIISE:Computing Practices and Letters
• /
• v.12 no.2
• /
• pp.111-118
• /
• 2006

In this thesis, we analyze the efficiency of the algorithm to distribute the load in the clustered system, by comparing with the existed algorithm. PWLC algorithm detects each server's load in the system at weighted period, and following the detection of the loads, a set of weights is given to each server. The system allocates new loads to each server according to its weight. PWLC algorithm is compared with DWRR algorithm in terms of variance, waiting time by varying weighted Period. When the weighted period is too short, the system bears a heavy load for detecting load over time. On the other hand, when the weighted period is too long, the load balancing control of the system becomes ineffective. The analysis shows PWLC algorithm is more efficient than DWRR algorithm for the variance and waiting time.

• International Journal of Advanced Culture Technology
• /
• v.8 no.1
• /
• pp.56-61
• /
• 2020

Customer satisfaction in retail stores are considerably affected by checkout services. Self-checkout counters have been installed in order to reduce waiting times at checkout in retail stores. However, it is uncertain whether the self-checkout lanes actually decrease the average waiting time of customers. Rather, there are some problems associated with self-checkout lanes such as theft or service failure due to technological problems. This study analyzes comparison between self-checkout and regular staffed-checkout lanes, based on the dataset collected from a retail store in Poland. As a result, we observe that the average transaction times were longer at the self-checkout lanes though fewer products were purchased than at the staffed-checkout lanes. In addition, the customers who buy more products tend to use self-checkouts less frequently. We also check that transaction times are proportional to the number of products customers purchase, and that both the time to scan one item and the fixed time related to checkout are significantly longer at the self-checkout counters. As there has been very few research on the effectiveness of self-checkouts, this study can be the first step to investigate managerial insights on checkout services in retail stores.