• 한국해양공학회지
• /
• 제23권3호
• /
• pp.1-5
• /
• 2009

It is necessary to develop an efficient optimization technique to optimize engineering structures that have given design spaces, discrete design values, and several design goals. In this study, an optimum algorithm based on the genetic algorithm was applied to the multi-object problem to obtain an optimum solution that simultaneously minimizes the structural weight and construction cost of panel blocks in ship structures. The cost model was used in this study, which includes the cost of adjusting the weld-induced deformation and applying the deformation control methods, in addition to the cost of the material and the welding cost usually included in the normal cost model. By using the proposed cost model, more realistic optimum design results can be expected.

• 대한산업공학회지
• /
• 제25권3호
• /
• pp.310-320
• /
• 1999

A mixed model assembly line (MMAL) is a special type of production line where a variety of product models similar in product characteristics are assembled. Determining the model sequence is an important problem for the efficient use of MMALs. This paper considers interactive multiobjective decision making problems for MMAL sequencing. Evolution program is employed as an underlying framework. In this study, a way of approximating the linear utility function is first studied. To improve its search efficiency to the solution space preferred by a decision maker, some modifications of a standard evolution program are made: operating several subpopulations instead of a single population and merging two or more subpopulations to a single subpopulation, and using a Pareto pool. Extensive computational experiments are carried out to verify the performance of the proposed approach. The computational results show that our approach is promising in solution quality.

• Advances in Computational Design
• /
• 제1권1호
• /
• pp.87-103
• /
• 2016

This paper adopts and investigates the non-dominated sorting approach for extending the single-objective Cuckoo Search (CS) into a multi-objective framework. The proposed approach uses an archive composed of primary and secondary population to select and keep the non-dominated solutions at each generation instead of pairwise analogy used in the original Multi-objective Cuckoo Search (MOCS). Our simulations show that such a low computational complexity approach can enrich CS to incorporate multi-objective needs instead of considering multiple eggs for cuckoos used in the original MOCS. The proposed MOCS is tested on a set of multi-objective optimization problems and two well-studied engineering design optimization problems. Compared to MOCS and some other available multi-objective algorithms such as NSGA-II, our approach is found to be competitive while benefiting simplicity. Moreover, the proposed approach is simpler and is capable of finding a wide spread of solutions with good coverage and convergence to true Pareto optimal fronts.

• Journal of Communications and Networks
• /
• 제15권5호
• /
• pp.486-495
• /
• 2013

In this article, we suggest a two-dimensional genetic algorithm (GA) method that applies a cognitive radio (CR) decision engine which determines the optimal transmission parameters for multicarrier communication systems. Because a CR is capable of sensing the previous environmental communication information, CR decision engine plays the role of optimizing the individual transmission parameters. In order to obtain the allowable transmission power of multicarrier based CR system demands interference analysis a priori, for the sake of efficient optimization, a two-dimensionalGA structure is proposed in this paper which enhances the computational complexity. Combined with the fitness objective evaluation standard, we focus on two multi-objective optimization methods: The conventional GA applied with the multi-objective fitness approach and the non-dominated sorting GA with Pareto-optimal sorting fronts. After comparing the convergence performance of these algorithms, the transmission power of each subcarrier is proposed as non-interference emission with its optimal values in multicarrier based CR system.

• Journal of Computational Design and Engineering
• /
• 제2권3호
• /
• pp.165-175
• /
• 2015

One of the current challenges in the domain of the multicriteria shape optimization is to reduce the calculation time required by conventional methods. The high computational cost is due to the high number of simulation or function calls required by these methods. Recently, several studies have been led to overcome this problem by integrating a metamodel in the overall optimization loop. In this paper, we perform a coupling between the Normal Boundary Intersection - NBI - algorithm with Radial Basis Function - RBF - metamodel in order to have a simple tool with a reasonable calculation time to solve multicriteria optimization problems. First, we apply our approach to academic test cases. Then, we validate our method against an industrial case, namely, shape optimization of the bottom of an aerosol can undergoing nonlinear elasto-plastic deformation. Then, in order to select solutions among the Pareto efficient ones, we use the same surrogate approach to implement a method to compute Nash and Kalai-Smorodinsky equilibria.

• 산업공학
• /
• 제20권4호
• /
• pp.504-514
• /
• 2007

The multicast routing problem lies in the composition of a multicast routing tree including a source node and multiple destinations. There is a trade-off relationship between cost and delay, and the multicast routing problem of optimizing these two conditions at the same time is a difficult problem to solve and it belongs to a multi-objective optimization problem (MOOP). A multi-objective genetic algorithm (MOGA) is efficient to solve MOOP. A micro-genetic algorithm(${\mu}GA$) is a genetic algorithm with a very small population and a reinitialization process, and it is faster than a simple genetic algorithm (SGA). We propose a multi-objective micro-genetic algorithm (MO${\mu}GA$) that combines a MOGA and a ${\mu}GA$ to find optimal solutions (Pareto optimal solutions) of multicast routing problems. Computational results of a MO${\mu}GA$ show fast convergence and give better solutions for the same amount of computation than a MOGA.

• 산업공학
• /
• 제13권4호
• /
• pp.688-693
• /
• 2000

We analyze IS0 9001 audit data and add-on requirements data collected by leader assessors from three leading Korean furniture companies for around three years. We plot a Pareto chart and test the homogeneities for the number of non-compliances and improvement notes across companies. We also fit the data to a loglinear model. Some recommendations with regard to add-on requirements are suggested. The recommendations should be added to IS0 9001 requirements to specifically implement an efficient QMS in Korean furniture industry.

• 한국산학기술학회논문지
• /
• 제21권5호
• /
• pp.93-102
• /
• 2020

자동차, 항공기, 선박과 같은 대형 복합 기계시스템 설계는 다분야 설계최적화의 영역이다. 다양한 영역의 전문지식과 경험을 동시에 요구하기 때문이다. 최근 급격한 기술발전과 더불어 인간의 편의 증진을 위한 요구로 이들 시스템의 복합도와 복잡도가 점증되고 있다. 이런 복합 시스템의 설계를 위해서는 도메인별 지식뿐만 아니라 다양한 분야의 지식, 경험 그리고 관점을 융합할 수 있는 통합 시스템 설계, 즉 다분야 설계최적화가 필요하다. 과거 다분야 설계최적화는 주로 설계자의 직관과 경험에 의존함으로써 해의 정확도나 시간 효율면에서 효용성이 크게 높지 않았다. 최근 다분야 설계최적화는 정보통신기술(IT)의 발전에 힘입어 프로세스통합 및 설계최적화(PIDO) 프레임워크에 의해 주로 구현된다. 본 논문은 오픈소스 PIDO 프레임워크인 RCE를 이용하여 합리적 수준의 노력과 시간 투입으로 효율적인 다분야 설계최적화를 구현하는 프로세스와 방법론을 찾고자 한다. 벤치마킹 예제로 벌크선 개념설계 모델에 본 논문이 제안한 다분야설계최적화 프로세스와 방법론을 적용해 보았다. 최적설계 결과에 대한 시각적 분석을 통해 제안된 방법론의 타당성을 확인하였다.

• Journal of Communications and Networks
• /
• 제13권3호
• /
• pp.266-276
• /
• 2011

In wireless networks, it is well-known that intermediate nodes can be used as cooperative relays to reduce the transmission energy required to reliably deliver a message to an intended destination. When the network is under a central authority, energy allocations and cooperative pairings can be assigned to optimize the overall energy efficiency of the network. In networks with autonomous selfish nodes, however, nodes may not be willing to expend energy to relay messages for others. This problem has been previously addressed through the development of extrinsic incentive mechanisms, e.g., virtual currency, or the insertion of altruistic nodes in the network to enforce cooperative behavior. This paper considers the problem of how selfish nodes can decide on an efficient energy allocation and endogenously form cooperative partnerships in wireless networks without extrinsic incentive mechanisms or altruistic nodes. Using tools from both cooperative and non-cooperative game theory, the three main contributions of this paper are (i) the development of Pareto-efficient cooperative energy allocations that can be agreed upon by selfish nodes, based on axiomatic bargaining techniques, (ii) the development of necessary and sufficient conditions under which "natural" cooperation is possible in systems with fading and non-fading channels without extrinsic incentive mechanisms or altruistic nodes, and (iii) the development of techniques to endogenously form cooperative partnerships without central control. Numerical results with orthogonal amplify-and-forward cooperation are also provided to quantify the energy efficiency of a wireless network with sources selfishly allocating transmission/relaying energy and endogenously forming cooperative partnerships with respect to a network with centrally optimized energy allocations and pairing assignments.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2005년도 춘계학술대회 논문집
• /
• pp.997-1000
• /
• 2005

Dynamic job shop environment requires not only more flexible capabilities of a CAPP system but higher utility of the generated process plans. In order to meet the requirements, this paper develops an algorithm that can select machines for the machining operations to be performed by predicting the machine loads. The developed algorithm is based on the multiple objective genetic algorithm that gives rise to a set of optimal solutions (in general, known as Pareto-optimal solutions). The objective shows a combination of the minimization of part movement and the maximization of machine utility balance. The algorithm is characterized by a new and efficient method for nondominated sorting, which can speed up the running time, as well as a method of two stages for genetic operations, which can maintain a diverse set of solutions. The performance of the algorithm is evaluated by comparing with another multiple objective genetic algorithm, called NSGA-II.