• Industrial Engineering and Management Systems
• /
• 제12권2호
• /
• pp.151-160
• /
• 2013

In the past decades, several algorithms based on evolutionary approaches have been proposed for solving job shop scheduling problems (JSP), which is well-known as one of the most difficult combinatorial optimization problems. Most of them have concentrated on finding optimal solutions of a single objective, i.e., makespan, or total weighted tardiness. However, real-world scheduling problems generally involve multiple objectives which must be considered simultaneously. This paper proposes an efficient particle swarm optimization based approach to find a Pareto front for multi-objective JSP. The objective is to simultaneously minimize makespan and total tardiness of jobs. The proposed algorithm employs an Elite group to store the updated non-dominated solutions found by the whole swarm and utilizes those solutions as the guidance for particle movement. A single swarm with a mixture of four groups of particles with different movement strategies is adopted to search for Pareto solutions. The performance of the proposed method is evaluated on a set of benchmark problems and compared with the results from the existing algorithms. The experimental results demonstrate that the proposed algorithm is capable of providing a set of diverse and high-quality non-dominated solutions.

• Ocean Systems Engineering
• /
• 제9권2호
• /
• pp.111-133
• /
• 2019

Flow through a scaled horizontal axis marine current turbine was numerically simulated after validation and the turbine design was optimized. The computational fluid dynamics (CFD) code Ansys-CFX 16.1 for numerical modeling, an in-house blade element momentum (BEM) code for analytical modeling and an in-house surrogate-based optimization (SBO) code were used to find an optimal turbine design. The blade-pitch angle (${\theta}$) and the number of rotor blades (NR) were taken as design variables. A single objective optimization approach was utilized in the present work. The defined objective function was the turbine's power coefficient ($C_P$). A $3{\times}3$ full-factorial sampling technique was used to define the sample space. This sampling technique gave different turbine designs, which were further evaluated for the objective function by solving the Reynolds-Averaged Navier-Stokes equations (RANS). Finally, the SBO technique with search algorithm produced an optimal design. It is found that the optimal design has improved the objective function by 26.5%. This article presents the solution approach, analysis of the turbine flow field and the predictability of various surrogate based techniques.

• Journal of Biosystems Engineering
• /
• 제10권2호
• /
• pp.55-62
• /
• 1985

박(朴)(1982, 1983, 1984 및 1985)이 개발(開發)한 배합사료공장(配合飼料工場)의 투자비용(投資費用) 및 운전비용(運轉費用)의 수학적모형(數學的模型)을 이용(利用)하여, 배합사료공장(配合飼料工場)의 적정(適正) 시스템의 설계(設計)를 예(例)를 들어 소개하였다. 적정(適正)시스템의 설계(設計)를 위(爲)하여 비선형(非線型) 프로그램의 "Single Objective Programming Problem(단일목적함수(單一目的函數))"와 "'Multiple Objective Decision Making Method(다목적함수(多目的函數))"의 2가지 방법(方法)을 적용(適用)하였다. Single Objective Programming Problem에서는 "Generalized Reduced Gradient(GRG) Method"를 이용(利用)하였고, Multiple Objective Decision Making Method(MODM)에서는 "Interactive Nonlinear Goal Program(INGP)"를 이용(利用)하였으며 그 결과(結果)는 다음의 몇가지로 요약(要約)할 수 있다. 1. 박(朴)이 개발(閒發)한 수학적(數學的) 모형(模型)들은 2 가지 방법(方法) 모두 사료공장(飼料工場)의 최적화(最適化) 설계(設計)에 효과적으로 이용(利用)할 수가 있었다. 2. MODM방법(方法)에 의(依)하여 얻어진 최적(最適)시스템은 Single Objective Program Problem에서 구(求)한 결과(結果)보다 균형(均衡)이 있는 시스템이었으며 장래(將來)의 사료원료(飼料原料), 사료구매시장(飼料購買市場), 기타 다른 조건(條件)들의 변화)에 대(對)해서 보다 탄력(彈力)이 있는 시스템으로 나타났다. 3. 엄밀한 의미(意味)에서 절대적(絶對的)인 최적사료공장(最適飼料工場)이란 있을 수 없으며, 주위의 조건(條件), 원료가격(原料價格), 사료가격(飼料價格), 공장주(工場主)의 취향 및 설계조건등(設計條件等)에 따라 최적(最適) 시스템은 각각(各各) 다르게 나타난다.

• 대한기계학회논문집A
• /
• 제26권6호
• /
• pp.987-992
• /
• 2002

In an attempt to solve multiobjective optimization problems, many traditional methods scalarize the objective vector into a single objective. In those cases, the obtained solution is highly sensitive to the weight vector used in the scalarization process and demands the user to have knowledge about the underlying problem. Moreover, in solving multiobjective problems, designers may be interested in a set of Pareto-optimal points, instead of a single point. In this paper, pareto-based Continuous Evolutionary Algorithms for Multiobjective Optimization problems having continuous search space are introduced. This algorithm is based on Continuous Evolutionary Algorithms to solve single objective optimization problems with a continuous function and continuous search space efficiently. For multiobjective optimization, a progressive reproduction operator and a niche-formation method fur fitness sharing and a storing process for elitism are implemented in the algorithm. The operator and the niche formulation allow the solution set to be distributed widely over the Pareto-optimal tradeoff surface. Finally, the validity of this method has been demonstrated through a numerical example.

• Journal of Electrical Engineering and Technology
• /
• 제3권2호
• /
• pp.218-223
• /
• 2008

A new Pareto-optimal design algorithm, requiring least computational work, is proposed for a single phase AC solenoid actuator with multi-design-objectives: maximizing holding force and minimizing eddy current loss simultaneously. In the algorithm, the design space is successively reduced by a suitable factor, as iteration repeats, with the center of pseudo-optimal point. At each iteration, the objective functions are approximated to a simple second-order response surface with the CCD sampling points generated within the reduced design space, and Pareto-optimal solutions are obtained by applying($1+{\lambda}$) evolution strategy with the fitness values of Pareto strength.

• 대한산업공학회지
• /
• 제32권1호
• /
• pp.9-17
• /
• 2006

This paper deals with a discrete simulation optimization method for designing a complex probabilistic discrete event simulation. The developed algorithm uses the configuration algorithm that can change decision variables and the stopping algorithm that can end simulation in order to satisfy the given objective value during single run. It tries to estimate an auto-regressive model for evaluating correctly the objective function obtained by a small amount of output data. We apply the proposed algorithm to M/M/s model, (s, S) inventory model, and known-function problem. The proposed algorithm can't always guarantee the optimal solution but the method gives an approximate feasible solution in a relatively short time period. We, therefore, show the proposed algorithm can be used as an initial feasible solution of existing optimization methods that need multiple simulation run to search an optimal solution.

• Journal of applied mathematics & informatics
• /
• 제14권1_2호
• /
• pp.353-363
• /
• 2004

The purpose of this paper is to present a model to design the layout of the user interface components that handles many numbers of qualitative factors. An alternate rating system is also proposed for the closeness relationship ratings between the various pairs of components evaluated by using GOMS (goals, operators, methods and selection rules) technique. The proposed model is applied to the design of the part of the user interface in order to obtain the best layout of the components. The results of the proposed model are compared with that of an existing model, which handles single qualitative factor applied to obtain the layouts of user interface components.

• 한국콘크리트학회:학술대회논문집
• /
• 한국콘크리트학회 2005년도 봄학술 발표회 논문집(I)
• /
• pp.315-318
• /
• 2005

The objective of this study is to find out discrepancy in ability of bond behavior between Carbon fiber-reinforced polymer(CFRP Plate) and concrete by method of experiment. For the objective, single and double face shear test were tested. From the experimental results, it was analyzed bond strength of FRP to concrete, distribution of stress and strain of FRP. The bond strength and the effective bond length was evaluated by the theory of existing studies. Effective bond length of single face test was smaller than it of double face test.

• 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.

• 한국안전학회지
• /
• 제18권1호
• /
• pp.94-100
• /
• 2003

Generally, cable-stayed bridges are both statically indeterminate structure with a high degree of redundancy and flexible structure. So it is very important to ensure precision control during both fabrication and construction. In precision control of cable-stayed bridges, precision control under multi-objective programming method is needed, because precision control problem of cable-stayed bridges is a multi-objective programming problem in which many objective functions are regard as variables. In previous studies, it was regarded as a single-objective problem, so it had many problems in respect of usefulness and rationalness. In this study, precision control under multi-objective programming method is proposed considering economy, efficiency, and safety at best in precision control of cable-stayed bridges. Precision control problem of cable-stayed bridges is formulated with satisfying trade-off method which is a kind of multi-objective programming method, then it is optimized with min-max method. A computer program is presented including above process.