• Journal of Ocean Engineering and Technology
• /
• v.18 no.2
• /
• pp.77-82
• /
• 2004

The purpose of this study is to develop a nesting algorithm, using a genetic algorithm to optimize nesting order, and modified No Fit Polygon(NFP) methodology to place parts with the order generated from the previous genetic algorithm. Various genetic algorithm techniques, which have thus far been applied to the Travelling Salesman Problem, were tested. The partially mapped crossover method, the inversion method for mutation, the elitist strategy, and the linear scaling method of fitness value were selected to optimize the nesting order. A modified NFP methodology, with improved searching capability for non-convex polygon, was applied repeatedly to the placement of parts according to the order generated from previous genetic algorithm. Modified NFP, combined with the genetic algorithms that have been proven in TSP, were applied to the nesting problem. For two example cases, the combined nesting algorithm, proposed in this study, shows better results than that from previous studies.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.3
• /
• pp.199-206
• /
• 2013

This paper proposes a modified tag collection algorithm that improves the drawback of the identified slot scan-based tag collection algorithm presented in a previous paper to improve the tag collection performance in active RFID systems. The previous identified slot scan-based tag collection algorithm is optimized in situations where all the tags store the fixed size of data, so it could not result in a good performance improvement with tags having the variable size of data. The improved tag collection algorithm proposed in this paper first collects the slot size information required for the data transmission from each tag via the identified slot scan phase, and then performs the tag collection phase using the information, which resolves the problem of the previous identified slot scan-based tag collection algorithm. The simulation results for performance evaluation showed that the proposed tag collection algorithm resulted in the almost same tag collection performance as the previous algorithm when all the tags have the same size of data and led a large improvement of the tag collection performance in ISO/IEC 18000-7 unlike the previous algorithm when each tag has a random size of data.

• ETRI Journal
• /
• v.32 no.6
• /
• pp.891-900
• /
• 2010

In this paper, a map-matching (MM) algorithm which combines an estimated position with digital road data is proposed. The presented algorithm using a virtual track is appropriate for a MEMS-based pedestrian dead reckoning (PDR) system, which can be used in mobile devices. Most of the previous MM algorithms are for car navigation systems and GPS-based navigation system, so existing MM algorithms are not appropriate for the pure DR-based pedestrian navigation system. The biggest problem of previous MM algorithms is that they cannot determine the correct road segment (link) due to the DR characteristics. In DR-based navigation system, the current position is propagated from the previous estimated position. This means that the MM result can be placed on a wrong link when MM algorithm fails to decide the correct link at once. It is a critical problem. Previous algorithms never overcome this problem because they did not consider pure DR characteristics. The MM algorithm using the virtual track is proposed to overcome this problem with improved accuracy. Performance of the proposed MM algorithm was verified by experiments.

• Proceedings of the IEEK Conference
• /
• 2000.06d
• /
• pp.102-105
• /
• 2000

This paper propose new sound localization algorithm that calculates TDOA(Time Difference Of Arrival) between the two received signals via two microphone array, The proposed Subband CPSP is a development of Previous CPSP method using subband approach. It first split the received microphone signals into three frequency bands and then calculates subband CPSP with corresponding SNR weights. This type of algorithm, Subband CPSP, can provide more accurate TDOA estimation results because it limits the effects of environmental noise within each subband. To verify the performance of the proposed Subband CPSP algorithm, computer simulation was conducted and it was compared with previous CPSP method. From the both simulation results, the proposed Subband CPSP is superior to previous CPSP algorithm more than accuracy for TDOA estimation.

• Journal of Korea Game Society
• /
• v.11 no.5
• /
• pp.23-30
• /
• 2011

Flocking behaviors are frequently used in games and computer graphics for realistic simulation of massive crowds. Since simulation of massive crowds in real time is a computationally intensive task, there were many researches on efficient algorithm. In this paper, we find experimentally the fact that there are unnecessary computations in the previous efficient flocking algorithm, and propose a noble algorithm that overcomes the weakness of the previous algorithm with a simple heuristic. A number of experiments were conducted to evaluate the performance of the proposed algorithm. The experimental results showed that the proposed algorithm outperformed the previous efficient algorithm by about 21% on average.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.109-112
• /
• 2005

In this paper, we propose an improved delay-constrained unicast routing (I-DCUR) algorithm for real-time networks which is based on the delay-constrained unicast routing (DCUR) algorithm. Our I-DCUR algorithm is quite different from DCUR algorithm, because the node will choose the link between the active node and the previous node, and it will replace the original loop path when it detects a loop. Thus, firstly consider to choose the link between the active node and the previous node to replace the original loop path when a node detects a loop. So our algorithm can make the construction of path more efficiently, as compared to DCUR algorithm. We could see that the performance of I-DCUR algorithm is much better than DCUR algorithm in the experimental results. There were over 40% improvement in 100 nodes, 60% in 200 nodes, and 9% reduction of costs.

• Journal of the Korea Safety Management & Science
• /
• v.14 no.1
• /
• pp.167-177
• /
• 2012

In this paper, we raised the performance of heuristic algorithm to assign job to workers in parallel line inspection process without sequence. In previous research, we developed the heuristic algorithm. But the heuristic algorithm can't find optimal solution perfectly. In order to solve this problem, we proposed new method to make initial solution called FN(First Next) method and combined the new FN method and old FE method using previous heuristic algorithm. Experiments of assigning job are performed to evaluate performance of this FE+FN heuristic algorithm. The result shows that the FE+FN heuristic algorithm can find the optimal solution to assign job to workers evenly in many type of cases. Especially, in case there are optimal solutions, this heuristic algorithm can find the optimal solution perfectly.

• Journal of the military operations research society of Korea
• /
• v.3 no.1
• /
• pp.123-136
• /
• 1977

This thesis presents a modification and extension to the Burgess and Killebrew heuristic resource leveling procedure for project networks. In contrast to previous algorithms appearing in the literature, the objective function of this algorithm. is the minimization of the sum of the squared errors in each time period (deviations around the mean usage) of all resources over the duration of the project. This objective function continues the search for an improved schedule beyond that of previous algorithms with their associated objective functions. One important feature is that the algorithm tends to reduce the number of periods that a resource is idle during its duration on the project.

• Journal of Electrical Engineering and information Science
• /
• v.3 no.3
• /
• pp.396-401
• /
• 1998

An optimal algorithm is presented for feasibility test and scheduling of real-time tasks where tasks are preemptable and created dynamically. Each task has an arbitrary creation time, ready time, maximum execution time, and deadline. Feasibility test and scheduling are conducted via the same algorithm. Time complexity of the algorithm is O(n) for each newly created task where n is the number of tasks. This result improves the previous result of O(n log n). It is shown that the algorithm can be used for scheduling tasks with different levels of importance. Time complexity of the algorithm for the problem is O(n\ulcorner) which improves the previous results of O(n\ulcorner log n).

• 제어로봇시스템학회:학술대회논문집
• /
• 1994.10a
• /
• pp.672-675
• /
• 1994

This paper presents a new algorithm to determine the receiver position in satellite navigation for GPS(Global Positioning System). The algorithm which based on vector analysis is able to obtain simultaneously the receiver position and the direction vector which is from the receiver position to a satellite. In its first calculation stage it, does riot require the complex initial value which is used in the previous works and affects the accuracy of the observed receiver position. Furthermore, the algorithm tells us whether a selected configuration among the visible satellites is good or poor for the accuracy. Comparing the algorithm with the previous method, the effectiveness of the algorithm is verified through the experimental simulations.