• Title/Summary/Keyword: optimization algorithms

Search Result 1,707, Processing Time 0.032 seconds

Routing in Computer Networks: A Survey of Algorithms (컴퓨터 네트웍에서의 경로선정 :알고리즘의 개관)

  • 차동완;정남기;장석권
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.9 no.2
    • /
    • pp.46-55
    • /
    • 1984
  • The purpose of this parer is to provide a survey of the state of the art of routing methods in store-and-forward computer networks. The survey is carried out in line with a new taxonomy: heuristic methods, user-optimization methods, and system-optimization methods. This taxonomy on routing algorithms is based on two viewpoints: the level of optimization and the relative difficulty for the implementation in real computer networks. Some actual methods implemented in real computer networks are surveyed as well as the theoretical studies in the literature. This paper concludes with some points in need of further researches.

  • PDF

Optimizing SVM Ensembles Using Genetic Algorithms in Bankruptcy Prediction

  • Kim, Myoung-Jong;Kim, Hong-Bae;Kang, Dae-Ki
    • Journal of information and communication convergence engineering
    • /
    • v.8 no.4
    • /
    • pp.370-376
    • /
    • 2010
  • Ensemble learning is a method for improving the performance of classification and prediction algorithms. However, its performance can be degraded due to multicollinearity problem where multiple classifiers of an ensemble are highly correlated with. This paper proposes genetic algorithm-based optimization techniques of SVM ensemble to solve multicollinearity problem. Empirical results with bankruptcy prediction on Korea firms indicate that the proposed optimization techniques can improve the performance of SVM ensemble.

Optimization Design of Log-periodic Dipole Antenna Arrays Via Multiobjective Genetic Algorithms

  • Wang, H.J.
    • Proceedings of the KSRS Conference
    • /
    • 2003.11a
    • /
    • pp.1353-1355
    • /
    • 2003
  • Genetic algorithms (GA) is a well known technique that is capable of handling multiobjective functions and discrete constraints in the process of numerical optimization. Together with the Pareto ranking scheme, more than one possible solution can be obtained despite the imposed constraints and multi-criteria design functions. In view of this unique capability, the design of the log-periodic dipole antenna array (LPDA) using this special feature is proposed in this paper. This method also provides gain, front-back level and S parameter design tradeoff for the LPDA design in broadband application at no extra computational cost.

  • PDF

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.

Colliding bodies optimization for size and topology optimization of truss structures

  • Kaveh, A.;Mahdavi, V.R.
    • Structural Engineering and Mechanics
    • /
    • v.53 no.5
    • /
    • pp.847-865
    • /
    • 2015
  • This paper presents the application of a recently developed meta-heuristic algorithm, called Colliding Bodies Optimization (CBO), for size and topology optimization of steel trusses. This method is based on the one-dimensional collisions between two bodies, where each agent solution is considered as a body. The performance of the proposed algorithm is investigated through four benchmark trusses for minimum weight with static and dynamic constraints. A comparison of the numerical results of the CBO with those of other available algorithms indicates that the proposed technique is capable of locating promising solutions using lesser or identical computational effort, with no need for internal parameter tuning.

Optimum design of steel space structures using social spider optimization algorithm with spider jump technique

  • Aydogdu, Ibrahim;Efe, Perihan;Yetkin, Metin;Akin, Alper
    • Structural Engineering and Mechanics
    • /
    • v.62 no.3
    • /
    • pp.259-272
    • /
    • 2017
  • In this study, recently developed swarm intelligence algorithm called Social Spider Optimization (SSO) approach and its enhanced version of SSO algorithm with spider jump techniques is used to develop a structural optimization technique for steel space structures. The improved version of SSO uses adaptive randomness probability in generating new solutions. The objective function of the design optimization problem is taken as the weight of a steel space structure. Constraints' functions are implemented from American Institute of Steel Construction-Load Resistance factor design (AISC-LRFD) and Ad Hoc Committee report and practice which cover strength, serviceability and geometric requirements. Three steel space structures are optimized using both standard SSO and SSO with spider jump (SSO_SJ) algorithms and the results are compared with those available in the literature in order to investigate the performance of the proposed algorithms.

Genetic optimization of vibrating stiffened plates

  • Marcelin, Jean Luc
    • Structural Engineering and Mechanics
    • /
    • v.24 no.5
    • /
    • pp.529-541
    • /
    • 2006
  • This work gives an application of stochastic techniques for the optimization of stiffened plates in vibration. The search strategy consists of substituting, for finite element calculations in the optimization process, an approximate response from a Rayleigh-Ritz method. More precisely, the paper describes the use of a Rayleigh-Ritz method in creating function approximations for use in computationally intensive design optimization based on genetic algorithms. Two applications are presented; their deal with the optimization of stiffeners on plates by varying their positions, in order to maximize some natural frequencies, while having well defined dimensions. In other words, this work gives the fundamental idea of using a Ritz approximation to the response of a plate in vibration instead of finite element analysis.

Gamma ray interactions based optimization algorithm: Application in radioisotope identification

  • Ghalehasadi, Aydin;Ashrafi, Saleh;Alizadeh, Davood;Meric, Niyazi
    • Nuclear Engineering and Technology
    • /
    • v.53 no.11
    • /
    • pp.3772-3783
    • /
    • 2021
  • This work proposes a new efficient meta-heuristic optimization algorithm called Gamma Ray Interactions Based Optimization (GRIBO). The algorithm mimics different energy loss processes of a gamma-ray photon during its passage through a matter. The proposed novel algorithm has been applied to search for the global minima of 30 standard benchmark functions. The paper also considers solving real optimization problem in the field of nuclear engineering, radioisotope identification. The results are compared with those obtained by the Particle Swarm Optimization, Genetic Algorithm, Gravitational Search Algorithm and Grey Wolf Optimizer algorithms. The comparisons indicate that the GRIBO algorithm is able to provide very competitive results compared to other well-known meta-heuristics.

An optimization framework of a parametric Octabuoy semi-submersible design

  • Xie, Zhitian;Falzarano, Jeffrey
    • International Journal of Naval Architecture and Ocean Engineering
    • /
    • v.12 no.1
    • /
    • pp.711-722
    • /
    • 2020
  • An optimization framework using genetic algorithms has been developed towards an automated parametric optimization of the Octabuoy semi-submersible design. Compared with deep draft production units, the design of the shallow draught Octabuoy semi-submersible provides a floating system with improved motion characteristics, being less susceptible to vortex induced motions in loop currents. The relatively large water plane area results in a decreased natural heave period, which locates the floater in the wave period range with more wave energy. Considering this, the hull design of Octabuoy semi-submersible has been optimized to improve the floater's motion performance. The optimization has been conducted with optimized parameters of the pontoon's rectangular cross section area, the cone shaped section's height and diameter. Through numerical evaluations of both the 1st-order and 2nd-order hydrodynamics, the optimization through genetic algorithms has been proven to provide improved hydrodynamic performance, in terms of heave and pitch motions. This work presents a meaningful framework as a reference in the process of floating system's design.

Distributed Hybrid Genetic Algorithms for Structural Optimization (분산 복합유전알고리즘을 이용한 구조최적화)

  • 우병헌;박효선
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.16 no.4
    • /
    • pp.407-417
    • /
    • 2003
  • Enen though several GA-based optimization algorithms have been successfully applied to complex optimization problems in various engineering fields, GA-based optimization methods are computationally too expensive for practical use in the field of structural optimization, particularly for large- scale problems. Furthermore, a successful implementation of GA-based optimization algorithm requires a cumbersome and trial-and-error routine related to setting of parameters dependent on a optimization problem. Therefore, to overcome these disadvantages, a high-performance GA is developed in the form of distributed hybrid genetic algorithm for structural optimization on a cluster of personal computers. The distributed hybrid genetic algorithm proposed in this paper consist of a simple GA running on a master computer and multiple μ-GAs running on slave computers. The algorithm is implemented on a PC cluster and applied to the minimum weight design of steel structures. The results show that the computational time required for structural optimization process can be drastically reduced and the dependency on the parameters can be avoided.