• Title/Summary/Keyword: Discrete Optimization

Search Result 508, Processing Time 0.025 seconds

The Effect of Sample and Particle Sizes in Discrete Particle Swarm Optimization for Simulation-based Optimization Problems (시뮬레이션 최적화 문제 해결을 위한 이산 입자 군집 최적화에서 샘플수와 개체수의 효과)

  • Yim, Dong-Soon
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.40 no.1
    • /
    • pp.95-104
    • /
    • 2017
  • This paper deals with solution methods for discrete and multi-valued optimization problems. The objective function of the problem incorporates noise effects generated in case that fitness evaluation is accomplished by computer based experiments such as Monte Carlo simulation or discrete event simulation. Meta heuristics including Genetic Algorithm (GA) and Discrete Particle Swarm Optimization (DPSO) can be used to solve these simulation based multi-valued optimization problems. In applying these population based meta heuristics to simulation based optimization problem, samples size to estimate the expected fitness value of a solution and population (particle) size in a generation (step) should be carefully determined to obtain reliable solutions. Under realistic environment with restriction on available computation time, there exists trade-off between these values. In this paper, the effects of sample and population sizes are analyzed under well-known multi-modal and multi-dimensional test functions with randomly generated noise effects. From the experimental results, it is shown that the performance of DPSO is superior to that of GA. While appropriate determination of population sizes is more important than sample size in GA, appropriate determination of sample size is more important than particle size in DPSO. Especially in DPSO, the solution quality under increasing sample sizes with steps is inferior to constant or decreasing sample sizes with steps. Furthermore, the performance of DPSO is improved when OCBA (Optimal Computing Budget Allocation) is incorporated in selecting the best particle in each step. In applying OCBA in DPSO, smaller value of incremental sample size is preferred to obtain better solutions.

Discrete Structural Design of Reinforced Concrete Frame by Genetic Algorithm (유전알고리즘에 의한 철근콘크리트 골조의 이산형 구조설계)

  • Ahn, Jeehyun;Lee, Chadon
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 1999.10a
    • /
    • pp.127-134
    • /
    • 1999
  • An optimization algorithm based on Genetic Algorithm(GA) is developed for discrete optimization of reinforced concrete plane frame by constructing databases. Under multiple loading conditions, discrete optimum sets of reinforcements for both negative and positive moments in beams, their dimensions, column reinforcement, and their column dimensions are found. Construction practice is also implemented by linking columns and beams by group ‘Connectivity’between columns located in the same column line is also considered. It is shown that the developed genetic algorithm was able to reach optimum design for reinforced concrete plane frame construction practice.

  • PDF

Global Optimization Using a Sequential Algorithm with Orthogonal Arrays in Discrete Space (이산공간에서 순차적 알고리듬(SOA)을 이용한 전역최적화)

  • Cho Bum-Sang;Yi Jeong-Wook;Park Gyung-Jin
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.29 no.10 s.241
    • /
    • pp.1369-1376
    • /
    • 2005
  • In structural design, the design variables are frequently selected from certain discrete values. Various optimization algorithms have been developed fDr discrete design. It is well known that many function evaluations are needed in such optimization. Recently, sequential algorithm with orthogonal arrays (SOA), which is a search algorithm for a local minimum in a discrete space, has been developed. It considerably reduces the number of function evaluations. However, it only finds a local minimum and the final solution depends on the initial values of the design variables. A new algorithm is proposed to adopt a genetic algorithm (GA) in SOA. The GA can find a solution in a global sense. The solution from the GA is used as the initial design of SOA. A sequential usage of the GA and SOA is carried out in an iterative manner until the convergence criteria are satisfied. The performance of the algorithm is evaluated by various examples.

Approximate Optimization with Discrete Variables of Fire Resistance Design of A60 Class Bulkhead Penetration Piece Based on Multi-island Genetic Algorithm (다중 섬 유전자 알고리즘 기반 A60 급 격벽 관통 관의 방화설계에 대한 이산변수 근사최적화)

  • Park, Woo-Chang;Song, Chang Yong
    • Journal of the Korean Society of Manufacturing Process Engineers
    • /
    • v.20 no.6
    • /
    • pp.33-43
    • /
    • 2021
  • A60 class bulkhead penetration piece is a fire resistance system installed on a bulkhead compartment to protect lives and to prevent flame diffusion in a fire accident on a ship and offshore plant. This study focuses on the approximate optimization of the fire resistance design of the A60 class bulkhead penetration piece using a multi-island genetic algorithm. Transient heat transfer analysis was performed to evaluate the fire resistance design of the A60 class bulkhead penetration piece. For approximate optimization, the bulkhead penetration piece length, diameter, material type, and insulation density were considered discrete design variables; moreover, temperature, cost, and productivity were considered constraint functions. The approximate optimum design problem based on the meta-model was formulated by determining the discrete design variables by minimizing the weight of the A60 class bulkhead penetration piece subject to the constraint functions. The meta-models used for the approximate optimization were the Kriging model, response surface method, and radial basis function-based neural network. The results from the approximate optimization were compared to the actual results of the analysis to determine approximate accuracy. We conclude that the radial basis function-based neural network among the meta-models used in the approximate optimization generates the most accurate optimum design results for the fire resistance design of the A60 class bulkhead penetration piece.

MONOTONIC OPTIMIZATION TECHNIQUES FOR SOLVING KNAPSACK PROBLEMS

  • Tran, Van Thang;Kim, Jong Kyu;Lim, Won Hee
    • Nonlinear Functional Analysis and Applications
    • /
    • v.26 no.3
    • /
    • pp.611-628
    • /
    • 2021
  • In this paper, we propose a new branch-reduction-and-bound algorithm to solve the nonlinear knapsack problems by using general discrete monotonic optimization techniques. The specific properties of the problem are exploited to increase the efficiency of the algorithm. Computational experiments of the algorithm on problems with up to 30 variables and 5 different constraints are reported.

Rule-based Hybrid Discretization of Discrete Particle Swarm Optimization for Optimal PV System Allocation (PV 시스템의 최적 배치 문제를 위한 이산 PSO에서의 규칙 기반 하이브리드 이산화)

  • Song, Hwa-Chang;Ko, Jae-Hwan;Choi, Byoung-Wook
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.21 no.6
    • /
    • pp.792-797
    • /
    • 2011
  • This paper discusses the application of a hybrid discretiziation method for the discretization procedure that needs to be included in discrete particle swarm optimization (DPSO) for the problem of allocating PV (photovoltaic) systems onto distribution power systems. For this purpose, this paper proposes a rule-based expert system considering the objective function value and its optimizing speed as the input parameters and applied it to the PV allocation problem including discrete decision variables. For multi-level discretization, this paper adopts a hybrid method combined with a simple rounding and sigmoid funtion based 3-step and 5-step quantization methods, and the application of the rule based expert system proposing the adequate discretization method at each PSO iteration so that the DPSO with the hybrid discretization can provide better performance than the previous DPSO.

A Study of Frequency Mixing Approaches for Eddy Current Testing of Steam Generator Tubes

  • Jung, Hee-Jun;Song, Sung-Jin;Kim, Chang-Hwan;Kim, Dea-Kwang
    • Journal of the Korean Society for Nondestructive Testing
    • /
    • v.29 no.6
    • /
    • pp.579-585
    • /
    • 2009
  • The multifrequency eddy current testing(ECT) have been proposed various frequency mixing algorithms. In this study, we compare these approaches to frequency mixing of ECT signals from steam generator tubes; time-domain optimization, discrete cosine transform-domain optimization. Specifically, in this study, two different frequency mixing algorithms, a time-domain optimization method and a discrete cosine transform(DCT) optimization method, are investigated using the experimental signals captured from the ASME standard tube. The DCT domain optimization method is computationally fast but produces larger amount of residue.

Optimi Design for R.C. Beam with Discrete Variables (이산형 설계변수를 갖는 철그콘크리트보의 최적설계)

  • 구봉근;한상훈;김홍룡
    • Magazine of the Korea Concrete Institute
    • /
    • v.5 no.4
    • /
    • pp.167-178
    • /
    • 1993
  • The objective of this paper is to look into the possibility of the detailed and practical optimum design of rt:inforced concrete beam using methods oi discrete mathematical programming. In this discrete optimum formulation, the design variables are the overall depth, width and effective depth of members, and area of longitudinal reinforcement. In addition, the details such as the amount of web reinforcement and cutoff points of longitudinal reinforcement are also considered as variables. Total cost has been used as the objective function. The constraints include the code requirments such as flexural strength, shear strength, ductility, serviceability, concrete cover. spacing, web reinforcement, and development length and cutoff points of longitudinal renforcement. An optimization algorithm is presented for effective optimum design of R.C. beam with discrete de sign variables. First, the continuous variable optimization can be achieved by Feasible Direction Method. Using the results obtained from the continuous variable optimization, a branch and bound method is used to obtained the discrete design values. The proposed algorithm is applied to test problem for reliability, and the results are compared with those of graphical method and rounded-up method. And a simply supported R.C. beam and a two-span continuous R.C. beam are presented as numerical examples for effectiveness and applicability. It is considered that the presented algorithm can be effectively applied to the discrete optimum design of R.C. beams.

Discrete Optimum Design of Ship Structures by Genetic Algorithm (유전적 알고리즘에 의한 선체 구조물의 이산적 최적설계)

  • Y.S. Yang;G.H. Kim;W.S. Ruy
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.31 no.4
    • /
    • pp.147-156
    • /
    • 1994
  • Though optimization method had been used for long time for the optimal design of ship structure, design variables in the most cases were assumed to be continuous real values or it was not easy to solve the mixed integer optimum design problems using the conventional optimization methods. Thus, it was often tried to use various initial starting points to locate the best optimum paint and to use special method such as branch and bound method to handle the discrete design variables in the optimization problems. Sometimes it had succeed, but the essential problems for dealing with the local optimum and discrete design variables was left unsolved. Hence, in this paper, Genetic Algorithms adopting the biological evolution process is applied to the ship structural design problem where the integer values for the number of stiffen design variables or the discrete values for the plate thickness variables would be more preferable in order to find out their effects on the final optimum design. Through the numerical result comparisons, it was found that Genetic Algorithm could always yield the global optimum for the discrete and mixed integer structural optimization problem cases even though it takes more time than other methods.

  • PDF

Oscillation Phenomena of the discrete Optimum Solutions and control (불연속 최적해의 흔들림 현상과 제어에 관한 연구)

  • Choi, Chang-Koon;Jin, Ho-Kyun;Kim, Jong-Soo;Lee, Hwan-Woo
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 1994.10a
    • /
    • pp.9-16
    • /
    • 1994
  • In the discrete optimum design, occasionally, the solutions oscillate between the feasible and the infeasible resions during the series of redesigns of members with discrete sections. This phenomenon may be caused inherently by the discontinuity of variables of commercially available sections in the database. In this paper, in-depth investigation into the oscillation in the discrete optimization and its control has been conducted. When the structure is optimized through element optimization, the oscillation can be divided into two categories, local and global oscillations. An algorithm which controls these phenomena is suggested and numerical examples demonstrate the oscillation in optimum solutions and the effectiveness of the control strategy suggested here.

  • PDF