• Proceedings of the Korea Society for Simulation Conference
• /
• 1998.10a
• /
• pp.17-20
• /
• 1998

The purpose of this paper is to develop a port simulation program for Inchon Port. The arrival and departure data from Inchon Port are analyzed, several probability density functions for the interval time and service time are estimated, and the berthing rules are constructed based on experts experiences. The port simulation program is written in visual basic considering the interarrival p.d.f., service rate p.d.f., berthing rules, and dual-dock system, and is used to analyze the effects of the changes in ship arrival rate and service rate upon the demurrage. It is expected that we can use the simulation results in order to prepare proper service level and to evaluate the appropriate investment strategy to be planned.

• 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 Korean Society of Industrial and Systems Engineering
• /
• v.30 no.1
• /
• pp.33-40
• /
• 2007

A multi-server queueing system with finite buffer is considered. The input flow is the BMAP (Batch Markovian Arrival Process). The service time has the PH (Phase) type distribution. Customers from the BMAP enter the system according to the discipline of partial admission. Besides ordinary (positive) customers, the Markovian flow (MAP) of negative customers arrives to the system. A negative customer can delete an ordinary customer in service if the state of its PH-service process belongs to some given set. In opposite case the ordinary customer is considered to be protected of the effect of negative customers. The stationary distribution and the main performance measures of the considered queueing system are calculated.

• Journal of the Korea Society for Simulation
• /
• v.13 no.1
• /
• pp.41-50
• /
• 2004

The purpose of this paper is to analyse the manager's policy to maximize the profit in a multiple-server queueing facility with a limited queue capacity. We assume that the level of advertizing effects on the arrival rate of customers to the facility. The model without ‘word of mouth effect’ is assumed that the arrival rate is independent on the qualify of service level. We estimate the service quality by the balking rate of customers from system. We extend this to the model with ‘word of mouth effect’. To achieve the maximum profit, the most important factor is the considerably high utilization of facility for both models. Given service rate, we should maintain an effective arrival rate to some extent. To this end, among the available options, an increase of advertizing effort is more desirable than reducing the fee if the service value of customers remains unchanged. We also investigate whether the variability of service time has a significant impact on determining the optimal policy. The cost of service variability is not so expensive as that in a single server model due to the reduced variability of service times in a multiple-server model.

• Journal of Convergence for Information Technology
• /
• v.10 no.9
• /
• pp.15-21
• /
• 2020

This paper presents the outlier detection algorithm in the estimation method of a source location and velocity based on two-step weighted least-squares method using time difference of arrival(TDOA) and frequency difference of arrival(FDOA) data. Since the accuracy of the estimated location and velocity of a moving source can be reduced by the outliers of TDOA and FDOA data, it is important to detect and remove the outliers. In this paper, the method to find the minimum inlier data and the method to determine whether TDOA and FDOA data are included in inliers or outliers are presented. The results of numerical simulations show that the accuracy of the estimated location and velocity is improved by removing the outliers of TDOA and FDOA data.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.9
• /
• pp.746-756
• /
• 2013

The emitter geolocation method using the time difference of arrival (TDOA) and the frequency difference of arrival (FDOA) has more accurate performance comparing to the single TDOA or FDOA based method. The estimation performance varies with the sensor paring strategies, the deployment and velocities of the sensors. Therefore, to establish effective strategy on the electronic warfare system, it is required to analyze the relation between the estimation accuracy and the operational condition of sensors. However, in the conventional non-iterative method, the restriction of the deployment of sensors and the reference sensor exists. Therefore, we derive the emitter geolocation method based on a Gauss-Newton method which is available to apply to any various sensor pairs and the deployment and velocities of the sensors. In addition, simulation results are included to compare the performance of geolocation method according to the used measurements: the combined TDOA/FDOA, TDOA, and FDOA. Also, we present that the combined TDOA/FDOA method outperforms over single TDOA or FDOA on the estimation accuracy with the CEP plane.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.6B
• /
• pp.895-900
• /
• 2010

As the diverse telecommunication services have been developed, network designers need to prevent congestion which may be caused by properties of timecorrelation and burstiness, and unpredictable statistical fluctuation of traffic streams. This paper considers the leaky bucket scheme with combined control of arrival and token rates, in which the arrival rate and the token generation interval are controlled according to the queue length. By using the embedded Markov chain and the supplementary variable methods, we obtain the queue length distribution as well as the loss probability and the mean waiting time.

• Proceedings of the KSR Conference
• /
• 2010.06a
• /
• pp.1861-1867
• /
• 2010

This paper described the positioning algorithm of partial discharge in insulation oil by acoustic method for the application of an on-line diagnosis in oil-immersed transformers. In the experiment, five AE sensors having the resonant frequency of 150 kHz were used, and a signal conditioner was fabricated. A needle-plane electrode system which is composed of a needle with a curvature radius of $10{\mu}m$ and a plane electrode with a diameter of 60 mm was installed to simulate partial discharges in insulation oil. From the time difference of arrival (TOA) of acoustic signal, we calculated the location of partial discharge in insulation oil. In the experiment, an algorithm of positioning of PD occurrence by the time difference of arrival was proposed. From the experimental results, the positioning error of PD calculated by three AE sensors was within 4%.

• Current Optics and Photonics
• /
• v.1 no.6
• /
• pp.573-578
• /
• 2017

Position estimation of a sound source based on time difference of arrival at an array of three acousto-optic sensors is introduced. Each sensor consists of a Mach-Zehnder interferometer including a sensing part in one arm that is a piece of fiber surrounded by membrane in order to enhance the acousto-optic effect. Estimation error of a recorded gunshot sound signal was evaluated with the theoretically calculated values for two different locations.

• Journal of the Korea Society for Simulation
• /
• v.12 no.3
• /
• pp.31-40
• /
• 2003

This paper studies an optimal policy for a certain class of (s, S) inventory control systems, where the demands are characterized by the renewal arrival process. To minimize the average cost over a simulation period, we apply a stochastic optimization algorithm which uses the gradients of parameters, s and S. We obtain the gradients of objective function with respect to ordering amount S and reorder point s via a combined perturbation method. This method uses the infinitesimal perturbation analysis and the smoothed perturbation analysis alternatively according to occurrences of ordering event changes. The optimal estimates of s and S from our simulation results are quite accurate. We consider that this may be due to the estimated gradients of little noise from the regenerative system simulation, and their effect on search procedure when we apply the stochastic optimization algorithm. The directions for future study stemming from this research pertain to extension to the more general inventory system with regard to demand distribution, backlogging policy, lead time, and inter-arrival times of demands. Another direction involves the efficiency of stochastic optimization algorithm related to searching procedure for an improving point of (s, S).