• 산업경영시스템학회지
• /
• 제39권2호
• /
• pp.46-53
• /
• 2016

In mobile communication systems, location management deals with the location determination of users in a network. One of the strategies used in location management is to partition the network into location areas. Each location area consists of a group of cells. The goal of location management is to partition the network into a number of location areas such that the total paging cost and handoff (or update) cost is a minimum. Finding the optimal number of location areas and the corresponding configuration of the partitioned network is a difficult combinatorial optimization problem. This cell grouping problem is to find a compromise between the location update and paging operations such that the cost of mobile terminal location tracking is a minimum in location area wireless network. In fact, this is shown to be an NP-complete problem in an earlier study. In this paper, artificial bee colony (ABC) is developed and proposed to obtain the best/optimal group of cells for location area planning for location management system. The performance of the artificial bee colony (ABC) is better than or similar to those of other population-based algorithms with the advantage of employing fewer control parameters. The important control parameter of ABC is only 'Limit' which is the number of trials after which a food source is assumed to be abandoned. Simulation results for 16, 36, and 64 cell grouping problems in wireless network show that the performance of our ABC is better than those alternatives such as ant colony optimization (ACO) and particle swarm optimization (PSO).

• 한국경영과학회지
• /
• 제17권1호
• /
• pp.41-41
• /
• 1992

In the real world situations that some jobs need be processed only on certain limited machines frequently occur due to the capacity restrictions of machines such as tools fixtures or material handling equipment. In this paper we consider n-job non-preemptive and m parallel machines scheduling problem having two machines group. The objective function is to minimize the sum of earliness and tardiness with different release times and due dates. The problem is formulated as a mixed integer programming problem. The problem is proved to be Np-complete. Thus a heuristic is developed to solve this problem. To illustrate its suitability and efficiency a proposed heuristic is compared with a genetic algorithm and tabu search for a large number of randomly generated test problems in ship engine assembly shop. Through the experimental results it is showed that the proposed algorithm yields good solutions efficiently.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권5호
• /
• pp.1567-1587
• /
• 2014

Virtual Machine (VM) resource management is crucial to satisfy the Quality of Service (QoS) demands of various multimedia services in a media cloud platform. To this end, this paper presents a VM resource allocation model that dynamically and optimally utilizes VM resources to satisfy QoS requirements of media-rich cloud services or applications. It additionally maintains high system utilization by avoiding the over-provisioning of VM resources to services or applications. The objective is to 1) minimize the number of physical machines for cost reduction and energy saving; 2) control the processing delay of media services to improve response time; and 3) achieve load balancing or overall utilization of physical resources. The proposed VM allocation is mapped into the multidimensional bin-packing problem, which is NP-complete. To solve this problem, we have designed a Mixed Integer Linear Programming (MILP) model, as well as heuristics for quantitatively optimizing the VM allocation. The simulation results show that our scheme outperforms the existing VM allocation schemes in a media cloud environment, in terms of cost reduction, response time reduction and QoS guarantee.

• 한국컴퓨터정보학회논문지
• /
• 제13권3호
• /
• pp.147-152
• /
• 2008

개미 시스템(Ant System)은 조합 최적화 문제를 해결하기 위한 메타 휴리스틱 탐색 방법으로, 그리디 탐색뿐만 아니라 긍정적 피드백을 사용한 모집단에 근거한 접근법으로 순회 판매원 문제를 풀기 위해 처음으로 제안되었다. 본 논문에서는 이러한 개미 시스템을 이용한 멀티캐스트 라우팅 방법을 제안한다. 멀티캐스트 라우팅은 하나의 송신자에서 다수의 수신자로 데이터를 전송하는 것으로 스타이너 트리(Steiner Tree)를 구성해 문제를 해결할 수 있다. 하지만, 멀티캐스트 라우팅 문제는 모든 노드를 방문하는 순회 판매원 문제와 접근법이 다르므로, 순회 판매원 문제를 해결하기 위한 개미 시스템의 전략을 수정한 엘리트 에이전트에 의한 개미 멀티캐스트 라우팅 모델을 제안한다. 이 모델은 이웃노드를 선택할 경우 해당 에지와 선택될 다음노드의 전체 비용까지 모두 고려해 이웃노드를 선택한다. 또한, 엘리트 에이전트에 의해 선택된 에지에 대해서는 추가 페로몬 갱신을 수행한다. 이러한 전략을 통해 제안한 모델의 성능을 평가한다.

• Journal of Welding and Joining
• /
• 제12권2호
• /
• pp.11-19
• /
• 1994

레이저 가공기술은 재료가공 분야에서 넓은 응용분야를 가지고 있으며, 특히 절단, 용접, 열처리 등의 가공분야에서 고정밀도와 자동화의 용이성으로 인해 생산성이 높은, 고부가가치의 첨단응용 기술로 부각되고 있다. 특히 레이저절단은 타 절단법에 비교되는 절단정도, 열영향, 생산성, 작업 환경등의 각종 우위성으로 박판 및 후판절단분야에서 급속한 보급을 보이기 시작하였다. 현재 대 부분의 레이저 가공기는 CNC화 되어가고 있는 추세이며, 레이저 절단의 경우 생산성증대 및 고 정밀화를 위하여 CAD/CAM인터페이스에 의한 자동화가 필연적인 상황이다. 뿐만아니라 고출력 레이저 발전기를 가공 기본체에 탑재한 탑재형 레이저가공기의 출현으로 대형부재의 절단이 가능 하게 되었으며, 더불어 절단공정의 무인화를 지향하는 각종 시스템이 개발되고 있다. 이와 같은 무인화, 생산성증대, 작업시간단축과 러닝 코스트 및 재료의 절감을 위한 노력의 일환으로 컴 퓨터에 의한 자동 및 반자동 네스팅 시스템의 개발을 들 수 있다. 레이저에 의한 2차원 절단응 용분야에서의 네스팅작업은 설계가 끝난 각 부품의 절단작업의 전단계로서 수행되며, 일반적으로 네스팅공정이 완료되면 절단경로를 결정하고 가공조건과 함께 수치제어공작기계의 제어에 필요한 NC코드를 생성하게 된다. 최근에는 이와 같은 네스팅 시스템이 일부 생산현장에 적용되고 있 으나 이러한 시스템들의 대부분이 외국에서 개발된 것을 수입하여 사용하는 실정이다. 2차원 패턴의 최적자동배치문제는 비단 레이저 절단과 같은 열가공 분야에서 뿐만 아니라 블랭킹 금형, 의류, 유리, 목재등 여러분야에서 응용이 가능하며 패키지의 국산화가 시급한 실정이다. 네스 팅작업은 적용되는 분야에 따라 요구사항과 구속조건이 달라지며 이로 인해 알고리즘과 자료구 조도 달라지게 되나 공통적인 목표는 주어진 영역안에서 겹침없이 배치하면서 버림율을 최소화 하는 것이다. 지난 10여년간 여러 산업의 응용분야에서는 네스팅시스템의 도입이 활발하게 이 루어지고 있는데 수동에 반자동 및 자동에 이르기까지 다양하나 자동네스팅시스템의 경우 배치 효율의 신뢰성이 비교적 부족하기 때문에 아직까지는 생산현장에서 기피하는 실정이다. 배치알 고리즘의 관점에서 볼 때 이러한 문제들은 NP-complete문제로 분류하며 제한된 시간안에 최적의 해를 구하기가 가능한 조합 최적화 문제로 알려져 있다. 따라서 이 글에서는 레이저 절단분야 에서의 네스팅시스템에 관한 개요와 최근의 연구동향 그리고 몇 가지 전형적인 네스팅 알고리 즘들을 소개하고 비교분석을 통해 개선점을 간략하게 논의하고자 한다.

• 산업경영시스템학회지
• /
• 제40권4호
• /
• pp.260-267
• /
• 2017

Quantum-inspired Genetic Algorithm (QGA) is a probabilistic search optimization method combined quantum computation and genetic algorithm. In QGA, the chromosomes are encoded by qubits and are updated by quantum rotation gates, which can achieve a genetic search. Asset-based weapon target assignment (WTA) problem can be described as an optimization problem in which the defenders assign the weapons to hostile targets in order to maximize the value of a group of surviving assets threatened by the targets. It has already been proven that the WTA problem is NP-complete. In this study, we propose a QGA and a hybrid-QGA to solve an asset-based WTA problem. In the proposed QGA, a set of probabilistic superposition of qubits are coded and collapsed into a target number. Q-gate updating strategy is also used for search guidance. The hybrid-QGA is generated by incorporating both the random search capability of QGA and the evolution capability of genetic algorithm (GA). To observe the performance of each algorithm, we construct three synthetic WTA problems and check how each algorithm works on them. Simulation results show that all of the algorithm have good quality of solutions. Since the difference among mean resulting value is within 2%, we run the nonparametric pairwise Wilcoxon rank sum test for testing the equality of the means among the results. The Wilcoxon test reveals that GA has better quality than the others. In contrast, the simulation results indicate that hybrid-QGA and QGA is much faster than GA for the production of the same number of generations.

• 한국정보처리학회논문지
• /
• 제5권3호
• /
• pp.671-680
• /
• 1998

화상 회의, 원격 진료 및 교육 시스템, CSCW 등과 같은 그룹 응용을 지원하기 위해서는 망에 의해서 멀티캐스트 기능이 제공되어야 한다. 멀티캐스트 경로배정의 방법으로는 보통 최단 경로 트리 방식과 최소 비용 스타이너 트리를 찾기 위해 유전자 알고리즘을 사용하는 진화적 최적화 방법을 제안하고자 한다. 특히 스타이너 트리를 찾기 위해 유전자 알고리즘을 사용하는 진화적 최적화 방법을 제안하고자 한다. 특히 스타이너 트리의 표현에 있어, 일반적인 유전자 알고리즘에서 사용되는 이진 스트링의 개체 표현 대신 트리를 사용하여 개체를 표현하는 방법을 제안함으로써 최적화의 효율을 개선하는 방식을 보여주며, 또한 기존의 경험적 알고리즘과의 비교를 통하여 진화방식에 의한 최적화가 기존의 방법보다 최적해에 더 가까이 수렴할 수 있음을 보여준다.

• 한국환경농학회지
• /
• 제30권4호
• /
• pp.395-401
• /
• 2011

BACKGROUND: Potassium (K) is one of the macronutrients which are essential for plant growth and development. Its deficiency in paddy soils is becoming one of the limiting factors for increasing rice yield in Asia. METHODS AND RESULTS: To investigate physiological symptoms under K-starvation (NP) compared with complete media (NPK) condition, we measured shoot/root length, weight, nutrients, and patterns of protein expression. The shoot growth was significantly reduced, but root growth was not affected by K-starvation. However, biomasses were decreased in both shoot and root. Uptake of K was reduced up to 85%, while total concentrations of P, Ca, Mg, Na were increased in root and shoot. To better understand the starved K mechanism of rice, comparative proteome analysis for proteins isolated from rice leaves was conducted using 2-DGE. Five spots of differentially expressed proteins were analyzed by MALDI-TOF MS. Analysis of these K-starvation response proteins suggested that they were involved in metabolism and defense. CONCLUSION(s): Physiological and 2-DGE based proteomics approach used in our study results in observation of morphology or nutrients change and identification of K-starvation responsive proteins in rice root. These results have important roles in maintaining nutrient homeostasis and would also be useful for further characterization of protein function in plant K nutrition.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권12호
• /
• pp.5723-5743
• /
• 2018

The evolving internet-based services demand high-speed data transmission in conjunction with scalability. The next generation optical network has to exploit artificial intelligence and cognitive techniques to cope with the emerging requirements. This work proposes a novel way to solve the dynamic provisioning problem in optical network. The provisioning in optical network involves the computation of routes and the reservation of wavelenghs (Routing and Wavelength assignment-RWA). This is an extensively studied multi-objective optimization problem and its complexity is known to be NP-Complete. As the exact algorithms incurs more running time, the heuristic based approaches have been widely preferred to solve this problem. Recently the software-defined networking has impacted the way the optical pipes are configured and monitored. This work proposes the dynamic selection of path computation algorithms in response to the changing service requirements and network scenarios. A software-defined controller mechanism with a novel packet matching feature was proposed to dynamically match the traffic demands with the appropriate algorithm. A software-defined controller with Path Computation Element-PCE was created in the ONOS tool. A simulation study was performed with the case study of dynamic path establishment in ONOS-Open Network Operating System based software defined controller environment. A java based NOX controller was configured with a parent path computation element. The child path computation elements were configured with different path computation algorithms under the control of the parent path computation element. The use case of dynamic bulk path creation was considered. The algorithm selection method is compared with the existing single algorithm based method and the results are analyzed.

• Safety and Health at Work
• /
• 제14권2호
• /
• pp.163-173
• /
• 2023

In many industrial sectors, workers are exposed to manufactured or unintentionally emitted airborne nanoparticles (NPs). To develop prevention and enhance knowledge surrounding exposure, it has become crucial to achieve a consensus on how to assess exposure to airborne NPs by inhalation in the workplace. Here, we review the literature presenting recommendations on assessing occupational exposure to NPs. The 23 distinct strategies retained were analyzed in terms of the following points: target NPs, objectives, steps, "measurement strategy" (instruments, physicochemical analysis, and data processing), "contextual information" presented, and "work activity" analysis. The robustness (consistency of information) and practical aspects (detailed methodology) of each strategy were estimated. The objectives and methodological steps varied, as did the measurement techniques. Strategies were essentially based on NPs measurement, but improvements could be made to better account for "contextual information" and "work activity". Based on this review, recommendations for an operational strategy were formulated, integrating the work activity with the measurement to provide a more complete assessment of situations leading to airborne NP exposure. These recommendations can be used with the objective of producing homogeneous exposure data for epidemiological purposes and to help improve prevention strategies.