• Korean Management Science Review
• /
• v.25 no.2
• /
• pp.57-71
• /
• 2008

We study factors that affect consumers' switching behaviors among service providers in Korean mobile telecommunications service market. For empirical analysis, quarterly time series data from the first quarter of 2004 through the second quarter of 2007 were used. We chose the number of switchers to each mobile service provider in each quarter as dependent variables. Independent variables include acquisition costs per subscriber, which play the role of subsidy to mobile handset, switching costs, time trend, structural change effect, and waiting demand effects. Through the empirical analysis, we found that each provider's churn-in customers are affected by different factors. Specifically, the number of churn-in customers into SK Telecom is explained mainly by SK Telecom's customer acquisition costs and waiting demand from KTF, while the number of customers switching into KTF is better explained by switching costs from the previous service provider and waiting demand from SK Telecom. Those who chose LG Telecom as their new provider, on the other hand, were mainly attracted by LG Telecom's high subscriber acquisition cost.

• Spatial Information Research
• /
• v.22 no.5
• /
• pp.65-75
• /
• 2014

Bus headway plays an important role not only in determining the passenger waiting time and bus service quality, but also in influencing the bus operation cost and passenger demand. Previous research on headway control has considered only an hourly difference in the distribution of ridership between peak and non-peak hours. However, this approach is too simple to help manage ridership demand fluctuations in a short time scale; thus passengers' waiting cost will be generated when ridership demand exceeds the supply of bus services. Moreover, bus ridership demand varies by station location and traffic situation. To address this concern, we propose a headway control algorithm for minimizing the waiting time cost by using Smart Card data. We also provide proof of the convergence of the algorithm to the desired headway allocation using a set of preconditions of political waiting time guarantees and available fleet constraints. For model verification, the data from the No. 143 bus line in Seoul were used. The results show that the total savings in cost totaled approximately 600,000 won per day when we apply the time-value cost of waiting time. Thus, we can expect that cost savings will be more pronounced when the algorithm is applied to larger systems.

• Journal of Korea Multimedia Society
• /
• v.23 no.3
• /
• pp.460-467
• /
• 2020

The medical service, accompanied by various disease and disease of modern people, must collect various information about patients through various tests, and demand continued to increase. As a result, interest in waiting time for medical services is rising, and various studies are underway to reduce waiting time. However, medical procedure is complex and diverse in the procedure of the services need to be conducted for each procedure. In this study, we are going to propose ways to improve the waiting time of the test procedures that are basically experienced by outpatients through the simulation experimental method. Based on the actual measurement data, the Arena Simulation program was used to implement the hospital's ophthalmic examination model and alternative model. Through this analysis, the waiting time of the examination procedure, the size of the queue, and density of the waiting room were analyzed.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.3
• /
• pp.919-940
• /
• 2012

Video on Demand (VOD) is a multimedia service which allows a remote user to select and then view video at his convenience at any time he wants, which makes the VOD become an important technology for many applications. Numerous periodic VOD broadcasting protocols have been proposed to support a large number of receivers. Broadcasting is an efficient transmission scheme to provide on-demand service for very popular movies. This paper proposes a new broadcasting scheme called Popularity Cushion Staggered Broadcasting (PCSB). The proposed scheme improves the Periodic Broadcasting (PB) protocols in the latest mobile VOD system, which is called MobiVoD system. It also, reduces the maximum waiting time of the mobile node, by partitioning the $1^{st}$ segment of the whole video and storing it in the Local Media Forwarder (LMF) exactly in the Pool of RAM (PoR), and then transmitting them when the mobile nodes miss the $1^{st}$ broadcasted segment. The results show that the PCSB is more efficient and better than the all types of broadcasting and caching techniques in the MobiVoD system. Furthermore, these results exhibits that system performance is stable under high dynamics of the system and the viewer's waiting time are less than the previous system.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.10
• /
• pp.2790-2796
• /
• 1999

In video-on-demand systems, the I.O bandwidth of video servers is the critical resource which contributes to increase in latency. Several approaches: bridging, piggybacking are used to reduce the I/O demand on the video server through sharing. Batching delays the requests for the different videos for a batching window so that more requests for the same video arriving during the current batching window may be served using the same stream. In this paper, we propose an adaptive reservation-based batching policy which dynamically reserves video server capacity for popoular videos according to video server loads. The performance of the proposed policy is evaluated through a simulation, and is compared with simple batching and static reservation-based batching policies. As the result, we know that the adaptive reservation-based batching policy more improves service ratio and average waiting time than simple batching and simple reservation-based batching policy more improves service ratio and average waiting time than simple batching and simple reservation-based batching polices.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.27 no.4
• /
• pp.122-130
• /
• 1999

The main purpose of this project is to improve the funeral and grave culture which has brought about many social problems, and to fix the crematory culture as the future funeral ceremony in our country. In this study, we first investigated the actual condition of cremation culture. Second, we survey three representative crematorium as an object of study and investigated similar sample buildings in Japan, we analyzed the problem of existing crematorium. Finally, we arranged the basics to approach the space program and design criteria of this project. 1. The entrance of vehicles has been commonly concentrated to the opening time of crematorium. therefore, Peak time has come out as circulation of cremation and waiting time is increasing, also it is difficult to manage the congestion normally. 2. The whole problem of crematorium is poor environment, inferior buildings, noise, unsatisfactory ventilation and privacy, insufficient convenience facilities. 3. The user demand on the crematorium facilities is a private family room for waiting area, a farewell room for family members in a direct line, an outdoor rest area, and the various service facilities, and so on. 4. For improvement of the funeral and grave culture, it is necessary that crematorium is not a hatred facilities, as the conversion of consciousness, and to new shape of charnel as it wore family tomb.

• KEPCO Journal on Electric Power and Energy
• /
• v.6 no.1
• /
• pp.59-64
• /
• 2020

Scheduling of electric vehicles and optimizing for charging waiting time have been critical. Meanwhile, it is challengeable to exploit the fluctuating data from electric vehicles in real-time. We introduce an optimal routing algorithm and a simulator with electric vehicles obeying the Poisson distribution of the observed information about time, space and energy-demand. Electric vehicle routing is updated in every cycle even it is already set. Also, we suggest an electric vehicle routing algorithm for minimizing total trip time, considering a threshold of the waiting time. Total trip time and charging waiting time are decreased 34.3% and 86.4% respectively, compared to the previous algorithm. It can be applied to the information service of charging stations and utilized as a reservation service.

• Journal of Korean Society of Transportation
• /
• v.14 no.1
• /
• pp.69-80
• /
• 1996

In most cities, travel demand is distributed along long corridors and its destinations tend to concentrate in a central business district. For this kind of many-to-one or one-to-many travel demand pattern, a zonal operation of buses can be an efficient bus operation technique in which a long bus-demand corridor is divided into service zones and each service zone is provided with its own bus route connecting the service zone and single destination separately. This paper develops models of the total transportation costs for a single-zone operation and 2-zonal operation of buses for a long demand corridor with single destination in terms of various cost parameters, demand density, bus operation speeds, and location of the boundary between two service zones. In this study the total transportation cost is assumed to consist of the bus operation cost, passenger waiting cost and passenger travel time cost. It was proved that a zonal operation of buses can be more efficient than a single-zone operation for certain circumstances of the system and an boundary condition between two operation techniques was obtained. Also, several case studies were performed for various values of the cost parameters.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.21 no.1
• /
• pp.17-34
• /
• 2022

This paper develops a model for dynamic station assignment to optimize the Demand Responsive Transit (DRT) operation. In the process of optimization, we use the bus travel time as a variable for DRT management. In addition, walking time, waiting time, and delay due to detour to take other passengers (detour time) are added as optimization variables and entered for each DRT passenger. Based on a network around Anaheim, California, reserved origins and destinations of passengers are assigned to each demand responsive bus, using K-means clustering. We create a model for selecting the dynamic station and bus route and use Non-dominated Sorting Genetic Algorithm-III to analyze seven scenarios composed combination of the variables. The result of the study concluded that if the DRT operation is optimized for the DRT management, then the bus travel time and waiting time should be considered in the optimization. Moreover, it was concluded that the bus travel time, walking time, and detour time are required for the passenger.

• Journal of the Korean Society of Marine Environment & Safety
• /
• v.25 no.5
• /
• pp.519-526
• /
• 2019

This study proposes a methodology for estimating the appropriate capacity of anchorage for ports requiring the establishment of waiting anchorage and then applying the methodology to the ports in Jinhae Bay to compare it with the anchorage capacity of major ports in Korea. To estimate the appropriate anchorage capacity, the "Anchorage Capacity Index" was used, which was calculated from the "Total Gross Tonnage" and "Simultaneous Anchoring Capacity". The calculations were made according to the anchorage capacity index of 0.89 of the target harbors. The adequate anchorage capacity index for the new waiting anchorage was analyzed at a level of 6.0. If the concept of anchorage capacity index suggested in this study is reflected as a new design criteria of waiting anchorage, it will be helpful for the safety of berth, safety of anchorage and effective operation of harbor.