• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.31 no.2
• /
• pp.41-50
• /
• 2003

In this paper, nonlinear parallel structural analyses are introduced by using the parallel multifrontal solver and damage localization for 2D and 3D crack models is presented as the application of nonlinear parallel computation. The parallel algorithms related with nonliear reduce the amount of memory used is carried out because many variables should be utilized for this highly nonlinear damage analysis. Also, Riks' continuation method is parallelized to search the solution when strain softening occurs due to damage evolution. For damage localization problem, several computational models having up to around 1-million degree of freedoms are used. The parallel performance in this nonlinear parallel algorithm is shown through these examples and the local variation of damage at crack tip is compared among the models with different degree of freedoms.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.05a
• /
• pp.433-440
• /
• 2003

통신시스템의 발전과 더불어 WDM 전송기술의 등장은 미래의 다양한 광대역 서비스의 제공이 가능하게 되었다. 하지만, 개별 수요들이 요구하는 대역폭이 광파장의 대역폭에 비해 매우 작으므로. 개별 수요들을 다중화하여 하나의 광경로를 통해 전송하는 수요집적(traffic grooming)에 관한 연구들이 많은 관심을 받고. 있다 본 연구는 mesh 구조의 WDM 통신망에서의 수요집적 및 광경로 설정에 관한 문제를 다루고 있다. 주어진 네트워크 상에 하나의 가상노드와 아크를 추가하여 새로운 네트워크를 구성하고 이를 대상으로 목적함수를 사용되는 광파장의 수를 최소화하는 혼합정수계획 모형을 수립하였다. 아울러. NP-Complete로 알려진 본 문제의 해를 효과적으로 구하기 위한 발견적 해법을 제안하며, 실제 다양한 실험을 통해 제안된 알고리즘의 효율성을 보인다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.5A
• /
• pp.325-338
• /
• 2012

In this paper, a radio resource allocation scheme for a multi-hop relay transmission in cognitive radio (CR) system is proposed to support the employment of relay nodes in IEEE 802.22 standard for wireless regional area network (WRAN). An optimization problem is formulated to maximize the number of serving secondary users (SUs) under system constraints such as time-divided frame structure for multiplexing and a single resource-unit to every relay-hop. However, due to mathematical complexity, the optimization problem is solved with a sub-optimal manner instead, which takes three steps in the order of user selection, relay/path selection, and frequency selection. In the numerical analysis, this proposed solution is evaluated in terms of service rate denoting as the ratio of the number of serving SUs to the number of service-requesting SUs. Simulation results show the condition of adopting multi-hop relay and the optimum number of relaying hops by comparing with the performance of 1-hop system.

• Journal of Korea Society of Industrial Information Systems
• /
• v.15 no.4
• /
• pp.7-15
• /
• 2010

This study proposes a rad o resource management scheme to maximize the performance of the LTE(Long Term Evolution) uplink, using SC-FDMA(Single Carrier-Frequency Division Multiple Access). Rather than the single-cell SC-FDMA system the existing studies are mainly concerning, this study focuses on multi-cell system which needs considering the interaction among cells. Radio resource management is divided into two phases, planning and operation phases. The former is for the master eNB(e-NodeB) to allocate RBs(radio bearer) to eNB, the latter for eNB to assign RBs to the mobiles in the cell. For each phase, an optimization model and greedy algorithm are proposed. Optimization models aim to maximize the system performance while satisfying the constraints for both QoS and RB continuity. The greedy algorithms, like generic ones, move from a solution to a neighboring one having the best objective value among neighboring ones. From the numerous numerical experiments, the performance and characteristics of the algorithms are analyzed. This study is expected to play a volunteering role in radio resource management for the multi-cell SC-FDMA system.

• KIPS Transactions on Computer and Communication Systems
• /
• v.10 no.8
• /
• pp.215-222
• /
• 2021

In order to alleviate the limited resource problem and interference problem in cellular networks, the dual connectivity technology has been introduced with the cooperation of small cell base stations. In this paper, we design a new efficient and fair resource allocation scheme for the dual connectivity technology. Based on two different bargaining solutions - Generalizing Tempered Aspiration bargaining solution and Gupta and Livne bargaining solution, we develop a two-stage radio resource allocation method. At the first stage, radio resource is divided into two groups, such as real-time and non-real-time data services, by using the Generalizing Tempered Aspiration bargaining solution. At the second stage, the minimum request processing speeds for users in both groups are guaranteed by using the Gupta and Livne bargaining solution. These two-step approach can allocate the 5G radio resource sequentially while maximizing the network system performance. Finally, the performance evaluation confirms that the proposed scheme can get a better performance than other existing protocols in terms of overall system throughput, fairness, and communication failure rate according to an increase in service requests.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.10
• /
• pp.3113-3118
• /
• 2000

A framework proposed in this paper includes representations of multi-objectives rule-basd constraint satisfaction problem(RCSP) and especially, flexible structure of RCSP which provides adequate solution sithin an expectation time and adaptively considers some change of constratraints on the RCSP. In this study, the power system implemented by above framework is entirely programmed by using a modeling system for the quantitative model and a rule-based constraint programming tool for the qualitative model. The results of an exemplary cse show how the structure that involves the problem representation gives the scheduler an effective decision and what are the advantages of the easy and diverse representation for considering the techmical characteristics of the units on the RCSP over the traditional problem.

• Journal of the Korea Society for Simulation
• /
• v.17 no.2
• /
• pp.91-103
• /
• 2008

In order to simulate the behavior of automated manufacturing systems, the performance of material handling systems should be measured dynamically. Multi-Agent technology could be well adapted for the development of simulator for distributed and intelligent manufacture systems. A multi-agent system is composed of one coordination agent and multiple application agents. Issues in AGVS simulator can be classified by the set-up and operating problems. Decisions on the number of vehicles, bi- or uni-directional guide-path, etc. are fallen into the set-up problem category, while deadlock tree algorithm and conflict resolution are in operating problem. In this paper, a multi-agent based deadlock-free simulator for automated guided vehicle system(AGVS) are proposed through the use of multi-agent technologies and the development of deadlock-free algorithm. In this AGVS simulator proposed, well-known Floyd algorithm is used to create AGVS Guide path, through which AGVS move. Also, AGVs avoid vehicle conflict and deadlock using check path algorithm. And Moving vehicle agents are operated in real-time control by coordination agent. AGV position is dynamically calculated based on the concept of rolling time horizon. Simulator receives and presents operating information of vehicle in AGVS Gaunt chart. The performance of the proposed algorithm and developed simulator based on multi-agent are validated through set of experiments.

• Journal of Korean Institute of Industrial Engineers
• /
• v.23 no.4
• /
• pp.661-667
• /
• 1997

We consider a generalized problem of the continuous multiple choice knapsack problem and study on the LP relaxation of the candidate problems which are generated in the branch and bound algorithm for solving the generalized problem. The LP relaxed candidate problem is called the generalized continuous multiple choice linear knapsack problem and characterized by some variables which are partitioned into continuous multiple choice constraints and the others which only belong to simple upper bound constraints. An efficient algorithm of order O($n^2logn$) is developed by exploiting some structural properties and applying binary search to ordered solution sets, where n is the total number of variables. A numerical example is presented.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.21 no.1
• /
• pp.147-161
• /
• 1996

Generally the Multiprocessor Scheduling (MPS) problem is difficult to solve because of the precedence of the tasks, and it takes a lot of time to obtain its optimal solution. Though Genetic Algorithm (GA) does not guarantee the optimal solution, it is practical and effective to solve the MPS problem in a reasonable time. The algorithm developed in this research consists of a improved GA and GP/MISF (Critical Path/Most Immediate Successors First). An efficient genetic operator is derived to make GA more efficient. It runs parallel CP/MISF with GA to complement the faults of GA. The solution by the developed algorithm is compared with that of CP/MISF, and the better is taken as a final solution. As a result of comparative analysis by using numerical examples, although this algorithm does not guarantee the optimal solution, it can obtain an approximate solution that is much closer to the optimal solution than the existing GA's.

• Journal of Korean Institute of Industrial Engineers
• /
• v.9 no.2
• /
• pp.3-8
• /
• 1983

The multiple choice knapsack problem is modified. To solve this modified multiple choice knapsack problem, Lagrangian relaxation is used, and to take advantage of the special structure of subproblems obtained by decomposing this relaxed Lagrangian problem, a modified ranking algorithm is used. The K best rank order solutions obtained from each subproblem as a result of applying modified ranking algorithm are used to formulate restricted problems of the original problem. The optimality for the original problem of solutions obtained from the restricted problems is judged from the upper bound and lower bounds calculated iteratively from the relaxed problem and restricted problems, respectively.