• Journal of the Korean Vacuum Society
• /
• v.6 no.S1
• /
• pp.89-95
• /
• 1997

A new type of piexoelectric membrane traveling wave motor has been designed and forbricated. The small motor is composed by the stator which is the combination of annular/circular membrane and metal elastic base using as the common electrode at some time and the rotor which is placed on the metal elastic body. Thus the motor structure is simple and easy to fabricate. The material of a piezoelectric membrane is fabricated by sol-gel method or wear-down method. A piezoelectric traveling wave motor has been fabricated with the stator diameter 8mm The total thickness of the stator is 350$\mu$m. Under the alternative excitation voltage 10-12V the revolving speed of the rotor is more than 100RPM.

• Proceedings of the KIEE Conference
• /
• 2001.05a
• /
• pp.226-229
• /
• 2001

The combined transmission lines with the underground power cables are continuously expanded in power systems. So the fault of combined transmission line is increased every year as the complication of underground transmission line. In this paper. traveling wave theory and DWT wavelet transform are used for fast and accurate detection of fault location at the combined transmission line. Traveling wave travels to each bus like surge and repeats reflection and transmission till transient signal is completely disappeared. When fault is occurred on overhead and underground tine, the fault location detecting algorithm was performed with using continuous peak value time-delay of traveling wave reflected from A bus.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.28 no.2
• /
• pp.129-138
• /
• 2003

The traveling salesman problem (TSP) is an NP-hard problem. As the number of nodes increases, it takes a lot of time to find an optimal solution. Instead of considering all arcs, if we select and consider only some arcs more likely to be included in an optimal solution, we can find efficiently an optimal solution. Arc candidate set is a group of some good arcs. For the Lack of study in the asymmetric TSP. it needs to research arc candidate set for the asymmetric TSP systematically. In this paper, we suggest a regression function determining arc candidate set for the asymmetric TSP. We established the function based on 2100 experiments, and we proved the goodness of fit for the model through various 787problems. The result showed that the optimal solutions obtained from our arc candidate set are equal to the ones of original problems. We expect that this function would be very useful to reduce the complexity of TSP.

• Electrical & Electronic Materials
• /
• v.9 no.1
• /
• pp.51-58
• /
• 1996

This report describes thick traveling-wave electrode formation and microwave transmission characteristics of the fabricated electrodes. Effective refractive indices of the microwave in the 5 micron CPW type traveling-wave electrodes is around 2.45 according to the results of time domain S parameter measurements. The bandwidth of the electrodes is about 10 GHz and could be extended to 15 GHz through optimization of the process. The developed process technique that enables plating of micropatterns upto 20 micron can be applied to broadband optical intensity modulators.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.18 no.12
• /
• pp.1286-1292
• /
• 2008

In this paper, we estimated the degree of pipe thinning by using two accelerometers. It uses measured velocity of flexural wave traveling along the pipes. If the thickness of the wall decreases because of pipe thinning, flexural stiffness of the pipes decreases and accordingly, traveling velocity of flexural wave decreases. Thus, if we install two vibration sensors outside of the pipes and measures traveling velocity of flexural waves regularly, we can estimate and monitor the degree of pipe thinning quickly. In order to test the method we experimented with pipes, and get the result that group velocity varies according to the degree of pipe thinning. It verified this method can be used to monitor the pipe thinning.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.23 no.59
• /
• pp.1-10
• /
• 2000

The traveling salesman problem is a representative NP-Complete problem. It needs lots of time to get a solution as the number of city increase. So, we need an efficient heuristic algorithm that gets good solution in a short time. Almost edges that participate in optimal path have somewhat low value cost. This paper discusses the property of nearest neighbor and 3-opt. This paper uses nearest neighbor's property to select candidate edge. Candidate edge is a set of edge that has high probability to improve cycle path. We insert edge that is one of candidate edge into intial cycle path. As two cities are connected. It does not satisfy hamiltonian cycle's rule that every city must be visited and departed only one time. This paper uses 3-opt's method to sustain hamiltonian cycle while inserting edge into cycle path. This paper presents a highly efficient heuristic algorithm verified by numerous experiments.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.18 no.33
• /
• pp.29-37
• /
• 1995

An Automated Storage/Retrieval Systems(AS/RS) has been gradually emphasized because of the change of production and distribution environment. This paper develops algorithm and Shortest Distance Model that can reduce the traveling time of a stacker crane for efficient operation of AS/RS. In order to reduce the traveling time of a stacker crane, we determine the order processing and then the sequencing of storage/retrieval for each item. Order processing is determined based on the SPT(Shortest Processing Time) concept considering a criterion of retrieval coordinate. The sequencing of storage/retrieval is determined based on the Shortest Distance Model by using a modified SPP(Shortest Path Problem) of network problem. A numerical example is provided to illustrate the developed algorithm and Shortest Distance Model.

• Journal of Korean Institute of Industrial Engineers
• /
• v.32 no.1
• /
• pp.61-73
• /
• 2006

This paper deals with traveling salesman problem(TSP) with the stochastic travel time. Practically, the travel time between demand points changes according to day and time zone because of traffic interference and jam. Since the almost pervious studies focus on TSP with the deterministic travel time, it is difficult to apply those results to logistics problem directly. But many logistics problems are strongly related with stochastic situation such as stochastic travel time. We need to develop the efficient solution method for the TSP with stochastic travel time. From the previous researches, we know that Q-learning technique gives us to deal with stochastic environment and neural network also enables us to calculate the Q-value of Q-learning algorithm. In this paper, we suggest an algorithm for TSP with the stochastic travel time integrating Q-learning and neural network. And we evaluate the validity of the algorithm through computational experiments. From the simulation results, we conclude that a new route obtained from the suggested algorithm gives relatively more reliable travel time in the logistics situation with stochastic travel time.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.4
• /
• pp.131-140
• /
• 2012

The shortest path search algorithm of navigation is generally based on Dijkstra algorithm and considers only the distance using the weight. Dijkstra algorithm based on the distance mainly ought to perform the 'number of nodes 1' and requires a lot of memory, for it is to start from the starting node and to decide the shortest path for all the nodes. Also, it searches only the same identical path in case of any bottleneck due to an accident nearby, since it is based only on the distance, and hence does not have a system that searches the detour road. In order to solve this problem, this paper considers only the travelling time per road (travelling speed * distance), without applying speed criteria (smoothness, slow speed, stagnation and accident control) or road class (express road, national road and provincial road). This provides an advantage of searching the detour, considering the reality that there are differences in time take for the car to travel on different roads with same distance, due to any accident, stagnation, or repair construction. The suggested algorithm proves that it can help us to reach the destination within the shortest time, making a detour from any congested road (outbreak) on providing an information on traveling time continuously(real-time) even though there is an accident in a particular road.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.11
• /
• pp.119-126
• /
• 2019

The partial inverse optimization problem is an interesting variant of the inverse optimization problem in which the given instance of an optimization problem need to be modified so that a prescribed partial solution can constitute a part of an optimal solution in the modified instance. In this paper, we consider the traveling salesman problem defined on the line (TSP on the line) which has many applications such as item delivery systems, the collection of objects from storage shelves, and so on. It is worth studying the partial inverse TSP on the line, defined as follows. We are given n requests on the line, and a sequence of k requests that need to be served consecutively. Each request has a specific position on the real line and should be served by the server traveling on the line. The task is to modify as little as possible the position vector associated with n requests so that the prescribed sequence can constitute a part of the optimal solution (minimum Hamiltonian cycle) of TSP on the line. In this paper, we show that the partial inverse TSP on the line and its variant can be solved in polynomial time when the sever is equiped with a specific internal algorithm Forward Trip or with a general optimal algorithm.