• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.49 no.12
• /
• pp.608-613
• /
• 2000

This paper describes a fault location technique using wavelets in underground transmission power cable system. Estimation of fault location is performed using data smapled at two ends underground system. In the case of 50% fault of total underground transmission line, fault location is calculated using sampled single-end data in underground transmission line. Traveling wave is utilized in capturing the travel time of the transients along the monitored lines between the relay and the fault point. This traveling time information is provided by the wavelet. Simulation was performed using EMTP, ATP Draw and MATLAB. The results of fault location shown in this paper will be evaluated as an effective suggestion for fault location in real underground transmission line.

• Journal of Korean Institute of Industrial Engineers
• /
• v.36 no.2
• /
• pp.78-86
• /
• 2010

The traveling purchaser problem(TPP) is a generalization of the well-known traveling salesman problem(TSP), which has many real-world applications such as purchasing the required raw materials for the manufacturing factories and the scheduling of a set of jobs over some machines, and many others. TPP also could be extended to the vehicle routing problem(VRP) by incorporating additional constraints such as multi-purchaser, capacity, distance and time restrictions. In the last decade, TPP has received some attention of the researchers in the operational research area. However it has not received the equivalent interest as much as TSP and VRP. Therefore, there does not exist a review of the TPP. The purpose of this paper is to review the TPP and to describe solution procedures proposed for this problem. We also introduce the ILP formulation for the multiple TPP(mTPP) which is generalized type of TPP. We compare the system performance according to change from TPP to mTPP.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.41 no.4
• /
• pp.41-47
• /
• 2004

In this paper, we analyze the microwave characteristics of traveling-wave electro-absorption modulator (TW-EAM) considering the microwave feedline and the impedance mismatch. The TW-EAM is analyzed by using the equivalent circuit model. The capacitance and the inductance of the equivalent circuit are evaluated by using 3-dimensional finite difference time domain (FDTD) method, while the microwave feedline is analyzed by momentum method. In a viewpoint of microwave characteristics, we present the effect of the structure and the length of microwave feedline.

• Journal of Korean Institute of Industrial Engineers
• /
• v.27 no.1
• /
• pp.18-24
• /
• 2001

This paper presents a model and a heuristic algorithm for the Traveling Salesman Problem with Time Windows(TSPTW). The main difference of our model compared with the previous ones lies in that the time windows we are concerned are more flexible and realistic than the previous ones. In the typical TSPTW, the service at a node must begin within the time grid called the time window that is defined by the earliest and the latest time to start the service at each node. But, in real business practice, a lateness cost is usually penalized rather than the service is prohibited at all when a vehicle arrives after the latest time. Considering this situation, we develop a model with a new time window that allows an arrival after the latest time and penalizes the late arrival by charging a lateness cost. A two-phased heuristic algorithm is proposed for the model and is extensively tested to verify the accuracy and efficiency of the algorithm.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.22 no.53
• /
• pp.13-22
• /
• 1999

This paper presents a model and dynamic programming based algorithm for the Traveling Salesperson Problem with Time Windows (TSPTW). The main difference of our model compared with the previous ones lies in that the time windows we are concerned are far more flexible and realistic. In the typical TSPTW, the service at a node must begin within the time grid called the time window that is defined by the earliest and the latest time to start the service at the node. But, in real business practices, a lateness cost is usually penalized rather than the service is prohibited at all when a vehicle arrives after the latest time. Considering this situation, we propose a model with a new time window that allows an arrival after the latest time and penalizes the late arrival by charging a lateness cost. An algorithm introduced for the model is extensively tested to verify the accuracy and efficiency.

• Journal of the Korean Society for Precision Engineering
• /
• v.16 no.12
• /
• pp.126-132
• /
• 1999

The paper presents the modeling and optimal control for the reduction of transverse vibration of simply supported beam under a moving mass. The equations of motion are derived by using assumed mode method. The coriolis and centripetal accelerations are accommodated in the equations of motion to account for the dynamic effect of the traveling mass. In order to reduce the transverse vibration of the beam, an optimal controller with full state feedback is designed based on the linearized equations of motion. The optimal actuator locations are determined with the evaluation of an optimal cost functional defined by the worst initial condition with the trade-off of controlled mode performance. Numerical simulations are performed with respect to various velocities and different traveling masses. Even if the velocity of the traveling mass reaches to the critical speed which can cause the resonance of the beam, the controller with two piezoelectric actuators shows the excellent performance under severe time-varying disturbances of the system.

• KIPS Transactions on Software and Data Engineering
• /
• v.9 no.1
• /
• pp.17-24
• /
• 2020

The traveling salesman problem is an algorithmic problem tasked with finding the shortest route that a salesman visits, visiting each city and returning to the started city. Due to the exponential time complexity of TSP, it's hard to implement on cases like amusement park or delivery. Also, TSP is hard to meet user's demand that is associated with multi-dimensional attributes like travel time, interests, waiting time because it uses only one attribute - distance between nodes. This paper proposed Top-n Skyline-Multi Dimension TSP to resolve formerly adverted problems. The proposed algorithm finds the shortest route faster than the existing method by decreasing the number of operations, selecting multi-dimensional nodes according to the dominance of skyline. In the simulation, we compared computation time of dynamic programming algorithm to the proposed a TS-MDT algorithm, and it showed that TS-MDT was faster than dynamic programming algorithm.

• Journal of the Korean Society for Precision Engineering
• /
• v.18 no.10
• /
• pp.116-126
• /
• 2001

This paper suggests a numerical method to find optimal geometric path and minimum-time motion for a spatial 6-link manipulator arm (PUMA 560 type). To find a minimum-time motion, the optimal geometric paths minimizing 2 different dynamic performance indices are searched first, and the minimum-time motions are searched on these optimal paths. In the algorithm to find optimal geometric paths, the objective functions (performance indices) are selected to minimize joint velocities, actuator forces or the combinations of them as well as to avoid one static obstacle. In the minimum-time algorithm the traveling time is expressed by the power series including 21 terms. The coefficients of the series are obtained using nonlinear programming to minimize the total traveling time subject to the constraints of velocity-dependent actuator forces.

• Journal of Drive and Control
• /
• v.19 no.4
• /
• pp.19-28
• /
• 2022

This paper introduces an automatic steering system for straight traveling capable of being mounted on drivable agricultural machinery which user can handle it such as a tractor, a transplant, etc. The modular automatic steering device proposed in the paper is composed of RTK GNSS, IMU, HMI, hydraulic valve, and wheel sensor. The path generation method of the automatic steering system is obtained from two location information(latitude and longitude on each point) measured by GNSS in advance. From HMI, a straight path(AB line) can be created by connecting latitude and longitude on each point and the device makes the machine able to follow the path. During traveling along the reference path, it acquires the real time position data every sample time(0.1s), compares the reference with them and calculates the lateral deviation. The values of deviation are used to control the steering angle of the machine using hydraulic valve mounted on the axle of front wheel. In this paper, Pure Pursuit algorithm is applied used in autonomous vehicles frequently. For the analysis of traveling characteristics, field tests were executed about these conditions: velocity of 2, 3, 4km/h which is applied to general agricultural work and ground surface of solid(asphalt) and weak condition(soil) such as farmland. In the case of weak ground state, two experiments were executed about no-load(without work) and load(with work such as plowing). The maximum average deviations were presented 2.44cm, 7.32cm, and 11.34cm during traveling on three ground conditions : asphalt, soil without load and with load(plowing).

• Nuclear Engineering and Technology
• /
• v.49 no.6
• /
• pp.1157-1164
• /
• 2017

The Monte Carlo criticality simulation of decoupled systems, as for instance in large reactor cores, has been a challenging issue for a long time. In particular, due to limited computer time resources, the number of neutrons simulated per generation is still many order of magnitudes below realistic statistics, even during the start-up phases of reactors. This limited number of neutrons triggers a strong clustering effect of the neutron population that affects Monte Carlo tallies. Below a certain threshold, not only is the variance affected but also the estimation of the eigenvectors. In this paper we will build a time-dependent diffusion equation that takes into account both spatial correlations and population control (fixed number of neutrons along generations). We will show that its solution obeys a traveling wave dynamic, and we will discuss the mechanism that explains this biasing of local tallies whenever leakage boundary conditions are applied to the system.