• 산업경영시스템학회지
• /
• 제45권4호
• /
• pp.187-198
• /
• 2022

This paper addresses the maintenance optimization problem in multi-component systems in which parts are connected in series, carrying out several missions interspersed with scheduled finite breaks. Due to limited time or resources, maintenance actions can be only carried out on a limited set of components. The decision maker then has to decide which components to maintain to ensure a pre-specified performance level during next mission. Most of the existing models in the literature usually assume only one system and enough spare parts. However, there are situations in which maintenance is required for multiple systems of the same type. To overcome this restrictive assumption, this study optimizes the maintenance problem considering the lack of repair parts and cannibalism for many identical systems. This study presents two optimization models with different objectives to solve the problem and analyzes the results so that the decision maker can decide. The results of this study are expected to be used for the maintenance of multiple systems of the same type, such as swarm drones.

• 경영과학
• /
• 제8권1호
• /
• pp.91-108
• /
• 1991

This paper presents an efficient optimization algorithm for the crude oil tanker scheduling problem. The algorithm consists of two stages. In stage one, all the potentially optimal schedules (called 'candidate schedules') are generated from feasible schedules for each ship. In the second stage, a multiple ship scheduling problem is formulated as 0-1 integer programming problem considering only the those candidate schedules. The efficiency of the suggested algorithm was improved by exploiting the special structure of the formulation. The algorithm was illustrated by a numerical example and tested on practical ship scheduling problems.

• 한국경영과학회지
• /
• 제34권3호
• /
• pp.125-136
• /
• 2009

The container packing problem Is one of the traditional optimization problems, which is very related to the knapsack problem and the bin packing problem. In this paper, we deal with the quadratic multiple container picking problem (QMCPP) and it Is known as a NP-hard problem. Thus, It seems to be natural to use a heuristic approach such as evolutionary algorithms for solving the QMCPP. Until now, only a few researchers have studied on this problem and some evolutionary algorithms have been proposed. This paper introduces a new efficient evolutionary algorithm for the QMCPP. The proposed algorithm is devised by improving the original network random key method, which is employed as an encoding method in evolutionary algorithms. And we also propose local search algorithms and incorporate them with the proposed evolutionary algorithm. Finally we compare the proposed algorithm with the previous algorithms and show the proposed algorithm finds the new best results in most of the benchmark instances.

• Journal of Communications and Networks
• /
• 제14권5호
• /
• pp.554-565
• /
• 2012

In this paper, we study a cross-layer and end-to-end optimization problem for the integrated wireless and wireline network that consists of one wireline core network and multiple wireless access networks. We consider joint end-to-end flow control/distribution at the transport and network layers and opportunistic scheduling at the data link and physical layers. We formulate a single stochastic optimization problem and solve it by using a dual approach and a stochastic sub-gradient algorithm. The developed algorithm can be implemented in a distributed way, vertically among communication layers and horizontally among all entities in the network, clearly showing what should be done at each layer and each entity and what parameters should be exchanged between layers and between entities. Numerical results show that our cross-layer and end-to-end optimization approach provides more efficient resource allocation than the conventional layered and separated optimization approach.

• Journal of Communications and Networks
• /
• 제18권4호
• /
• pp.629-638
• /
• 2016

In this paper, we investigate an energy-efficient resource allocation problem in a two-way relay (TWR) network consisting of multiple user pairs and an amplify-and-forward (AF) relay. As the users and relay have individual energy efficiencies (EE), we formulate a multi-objective optimization problem (MOOP). A single-objective optimization problem (SOOP) of the MOOP is introduced using a weighted-sum method, which achieves a single Pareto optimal point of the MOOP. To derive the algorithm for the SOOP, we propose a more tractable equivalent problem using the Karush-Kuhn-Tucker conditions of the SOOP, which guarantees convergence at the local optimal points. The proposed equivalent problem can be efficiently solved by the proposed iterative algorithm. Numerical results demonstrate the effectiveness of the proposed algorithm in achieving the optimal EE in multi-user AF TWR networks.

• 한국정밀공학회지
• /
• 제15권4호
• /
• pp.111-117
• /
• 1998

In order to increase productivity of an assembly system composed of multiple robots along a conveyer line, an efficient sequence planning is necessary because the assembly time is dependent upon the assembly sequence. In this paper, a two-robot assembly system is considered in which two robots operate simultaneously and transfer parts from the part feeders to the workpiece on the conveyer one by one. In this case, the distance from the feeder to the workpiece varies with time because the workpiece moves at a constant speed on the conveyer. Hence, the sequence programming is not a trivial problem. Also, the two robots may interfere with each other kinematically and dynamically due to the simultaneous operation, so the sequence should be programmed to avoid the interferences. In this paper, the task sequence optimization problem is formulated and is solved by employing the simulated annealing which has been shown to be effective for solving large combinatorial optimizations.

• Steel and Composite Structures
• /
• 제27권1호
• /
• pp.27-33
• /
• 2018

In this study, a mixed-interpolated tensorial component 4 nodes method (MITC4) is treated as a numerical analysis model for topology optimization using multiple materials assigned within Reissner-Mindlin plates. Multi-material optimal topology and shape are produced as alternative plate retrofit designs to provide reasonable material assignments based on stress distributions. Element density distribution contours of mixing multiple material densities are linked to Solid Isotropic Material with Penalization (SIMP) as a design model. Mathematical formulation of multi-material topology optimization problem solving minimum compliance is an alternating active-phase algorithm with the Gauss-Seidel version as an optimization model of optimality criteria. Numerical examples illustrate the reliability and accuracy of the present design method for multi-material topology optimization with Reissner-Mindlin plates using MITC4 elements and steel materials.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2000년도 춘계학술대회 논문집
• /
• pp.1027-1031
• /
• 2000

In this paper, multiphase dynamic optimization of machine structure is presented. The final goal is to obtain ( i ) light weight, and ( ii ) rigidity statically and dynamically. The entire optimization process is carried out in two steps. In the first step, multiple optimization problem with two objective functions is treated using Pareto genetic algorithm. Two objective functions are weight of the structure, and static compliance. In the second step, maximum receptance is minimized using genetic algorithm. The method is applied to a simplified milling machine.

• 한국소음진동공학회논문집
• /
• 제14권9호
• /
• pp.827-836
• /
• 2004

In this paper, we design a robust multi-objective track-following controller that satisfies transient response specifications and diminishes the influence of sinusoidal disturbance. To this end, a robust control problem with the multiple constraints is considered. We show that a sufficient condition satisfying the robust control problem can be expressed by linear matrix inequalities. Finally, the robust track-following controller can be designed by solving an LMI optimization problem. The effectiveness of the proposed controller design method is verified though experiments.

• 전산구조공학
• /
• 제9권3호
• /
• pp.179-186
• /
• 1996

본 연구에서는 구조체의 위상학적 최적화를 위한 비선형 formulation(NLP)가 개발, 검토되었다. 이 NLP는 multiple-loading하에서 임의의 오브젝티브 함수, 응력, 변위 제약조건들을 쉽게 다룰 수가 있다. 또한 이 NLP는 해석과 최적화 디자인을 동시에 실시함으로써 요소 사이즈가 영으로 접근함에 따른 강성 매트릭스의 singularity를 피할 수 있다. 즉, 평형 방정식을 등제약조건으로 치환함으로써 강성 매트릭스 그 자체나 그의 역매트릭스를 구할 필요도 없어진다. 이 NLP는 multiple-loading conditon하에서 테스트되었으며, 이를 통해 이 NLP가 다양한 제약조건하에서 강력하게 작용함이 입증되었다.