• The Journal of the Korea Contents Association
• /
• v.6 no.4
• /
• pp.46-54
• /
• 2006

We propose an optimization method for PCB assembly lines including multiple surface mounters. To increase the productivity of PCB assembly line, the component allocation, feeder assignment, and assembly sequence of each surface mounter should be optimized. The optimization Problem is formulated as an integer programming problem. We divide the overall problem into two hierarchical sub-problems: forward-path problem and backward-path problem. The clustering algorithm and branch-and-bound algorithm are applied to solve the forward-path problem. The assignment algorithm and connection algorithm are applied to solve the backward-path problem. Simulation results are presented to verify the usefulness of the proposed method.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.9
• /
• pp.24-30
• /
• 2009

This paper presents a simple resource allocation scheme for throughput enhancement in relay based orthogonal frequency division multiple access (OFDMA) cellular systems. The resource allocation schemes, which are based on the optimization problem, have high computational complexity. That is why a searching process is required on the overall allocable resources. Since these schemes should be performed in real time, we propose a simple resource allocation scheme which has very low computational complexity. Firstly, we formulate the optimization problem and draw observations for throughput maximization. Based on observations, we propose a three step allocation scheme that separates the allocable resources into three (i.e. relay, frequency and time). By doing so, the computational complexity can be reduced. Simulation results show that the proposed scheme has near-optimum performance in spite of its low computational complexity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.9A
• /
• pp.1525-1534
• /
• 2001

국내 통신사업자들이 xDSL 등 초고속 인터넷 액세스 서비스를 왜곡된 요금구조로 경쟁적으로 보급함에 따라 급속히 확산되고 있으나, 엄밀히 원가를 감안한다면 여전히 AO/DI는 인터넷 트래픽 폭증으로 인한 전기통신망의 과부하를 통신사업자가 경제적이며 효과적으로 대처할 수 있는 현실적인 대안이라 할 수 있다. 본 논문은 AO/DI의 동적 채널 할당 및 해지에 있어서 VIA가 권고한 정책보다 효율적으로 대역폭을 할당, 해지할 수 있는 알고리즘을 제안한다. 관찰 시점까지의 누적된 트래픽의 양과 변화를 감안하여 평균 트래픽과 분산을 추정함으로써 트래픽의 변화에 적응하여 채널 할당, 해지 시점을 결정할 수 있으며 트래픽 특성에 따라 매개 변수의 조정을 통하여 D 채널, B 채널의 이용률을 제어할 수 있고 평균 대기시간 등의 성능을 최적화할 수 있음을 보인다. 또한, 이를 기초로 응용 프로토콜을 감지하여 응용이 갖는 고유의 트래픽 특성과 요구사항에 적합한 채널 할당/해지 방안도 제시한다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.5
• /
• pp.95-103
• /
• 2008

The Network Mobility (NEMO) basic support protocol extends the operation of Mobile IPv6 to provide uninterrupted Internet connectivity to the communicating nodes of mobile networks. The protocol is not efficient to offer delays in data delivery and higher overheads in the case of nested mobile networks because it uses fairly sub-optimal routing and multiple encapsulation of data packets. In this paper, our scheme combining Hierarchical Mobile IPv6 (HMIPv6) functionality and Hierarchical Prefix Delegation (HPD) protocol for IPv6, which provide more effective route optimization and reduce packet header overhead and the burden of location registration for handoff. The scheme also uses hierarchical mobile network prefix (HMNP) assignment and tree-based routing mechanism to allocate the location address of mobile network nodes (MNNs) and support micro-mobility and intra-domain data communication. The performance is evaluated using NS-2.

• Journal of the Korean Society for Railway
• /
• v.15 no.5
• /
• pp.524-530
• /
• 2012

Recently, open access policy to railway operation has been widely discussed. Compared to the case of Korea, European countries have dealt with this topic over a few decades. The competition on railway slots incurs an important technological problem about how to optimally allocate railway slots requested from RUs to them. In other words, the authority should be able to coordinate the timetables requested from RUs in the non-discriminatory manner. Related with the coordination, compared to the other European countries, which have done many studies and experiments especially on auction mechanisms, Korean railway has paid less attention to this topic and there have not been any related studies. Our study analyses the state-of-the-arts about the railway slot allocation especially focusing on the auction mechanisms and the associated optimization problems. And we suggest a new railway slot allocation mechanism and related optimization model reflecting the adjustment within the tolerance and the operational policies between railway undertakings.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.7B
• /
• pp.567-574
• /
• 2008

In this paper, we propose an optimal coverage extension scheme in the OFDMA based mobile multi-hop relay system. First, we propose an optimal frequency and time assignment scheme for maximizing system throughput and analyze the frame efficiency of schemes. Then, under the given BS capacity, we find the maximum number of relay hops that can be used to estimate the maximum coverage area of a BS in a multi-hop relay system. Analytical results show that the proposed scheme is efficient in coverage extension and throughput maximization in OFDMA based multi-hop relay system. Our work may be a rough guideline to control the parameters for multi-hop relay system optimization.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.14 no.5
• /
• pp.385-393
• /
• 2021

This study proposes a multi-core-based controller design for an ESC(Electronic Stability Control) system in an automotive multi-core processor. Considering the architectures of an automotive multi-core processor and an ESC system, the overall execution time has been optimized for multi-core platforms. The function module assignment, synchronization between cores, and memory assignment for core-dependent variables in automotive multi-core systems are evaluated. The ESC controller comprising five function modules is used herein. Based on the proposed design, the single-core controller is extended to multi-core controllers. Using multi-core optimization methods, such as function module assignment, semaphore, interrupt awakening, and variable assignment over cores, the ESC system is redesigned to a multi-core controller. Experimental results reveal that the execution time for the multi-core processor is reduced by 59.7% compared with that for the single-core processor.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.9
• /
• pp.139-147
• /
• 2012

This paper suggests simple search algorithm for optimal solution in assignment problem. Generally, the optimal solution of assignment problem can be obtained by Hungarian algorithm. The proposed algorithm reduces the 4 steps of Hungarian algorithm to 1 step, and only selects the minimum cost of row and column then gets the optimal solution simply. For the 27 balanced and 7 unbalanced assignment problems, this algorithm finds the optimal solution but the genetic algorithm fails to find this values. This algorithm improves the time complexity O($n^3$) of Hungarian algorithm to O(n). Therefore, the proposed algorithm can be general algorithm for assignment problem replace Hungarian algorithm.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1992.04b
• /
• pp.75-75
• /
• 1992

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.4
• /
• pp.334-340
• /
• 2017

Reliability is considered a particularly important design factor for systems that have critical results once a failure occurs in a system, such as trains, airplanes, and passenger ships. The reliability of the system can be improved in several ways, but in a system that requires considerable reliability, the redundancy of parts is efficient in improving the system reliability. In the case of duplicating parts to improve reliability, the kind of parts and the number of duplicating parts should be determined under the system reliability, part costs, and resources. This study examined the redundancy allocation of multi-level systems with serial structures. This paper describes the definition of a multi-system and how to optimize the kind of parts and number of duplications to maximize the system reliability. To optimize the redundancy, the cuckoo search algorithm was applied. The search procedure, the solution representation and the development of the neighborhood solution were proposed to optimize the redundancy allocation of a multi-level system. The results of numerical experiments were compared with the genetic algorithm and cuckoo search algorithm.