• 제목/요약/키워드: Optimization algorithms

검색결과 1,702건 처리시간 0.205초

유전알고리즘을 이용한 지속가능 공간최적화 모델 기초연구 - 선행연구 분석을 중심으로 - (Basic Study on Spatial Optimization Model for Sustainability using Genetic Algorithm - Based on Literature Review -)

  • 윤은주;이동근
    • 한국환경복원기술학회지
    • /
    • 제20권6호
    • /
    • pp.133-149
    • /
    • 2017
  • As cities face increasing problems such as aging, environmental pollution and growth limits, we have been trying to incorporate sustainability into urban planning and related policies. However, it is very difficult to generate a 'sustainable spatial plans' because there are trade-offs among environmental, society, and economic values. This is a kind of non-linear problem, and has limitations to be solved by existing qualitative expert knowledge. Many researches from abroad have used the meta heuristic optimization algorithms such as Genetic Algorithms(GAs), Simulated Annealing(SA), Ant Colony Optimization(ACO) and so on to synthesize competing values in spaces. GAs is the most frequently applied theory and have been known to produce 'good-enough plans' in a reasonable time. Therefore we collected the research on 'spatial optimization model based GAs' and analyzed in terms of 'study area', 'optimization objective', 'fitness function', and 'effectiveness/efficiency'. We expect the results of this study can suggest that 'what problems the spatial optimization model can be applied to' and 'linkage possibility with existing planning methodology'.

Soccer league optimization-based championship algorithm (SLOCA): A fast novel meta-heuristic technique for optimization problems

  • Ghasemi, Mohammad R.;Ghasri, Mehdi;Salarnia, Abdolhamid
    • Advances in Computational Design
    • /
    • 제7권4호
    • /
    • pp.297-319
    • /
    • 2022
  • Due to their natural and social revelation, also their ease and flexibility, human collective behavior and teamwork sports are inspired to introduce optimization algorithms to solve various engineering and scientific problems. Nowadays, meta-heuristic algorithms are becoming some striking methods for solving complex real-world problems. In that respect in the present study, the authors propose a novel meta-innovative algorithm based on soccer teamwork sport, suitable for optimization problems. The method may be referred to as the Soccer League Optimization-based Championship Algorithm, inspired by the Soccer league. This method consists of two main steps, including: 1. Qualifying competitions and 2. Main competitions. To evaluate the robustness of the proposed method, six different benchmark mathematical functions, and two engineering design problem was performed for optimization to assess its efficiency in achieving optimal solutions to various problems. The results show that the proposed algorithm may well explore better performance than some well-known algorithms in various aspects such as consistency through runs and a fast and steep convergence in all problems towards the global optimal fitness value.

A brief review of penalty methods in genetic algorithms for optimization

  • Gen, Mitsuo;Cheng, Runwei
    • 한국경영과학회:학술대회논문집
    • /
    • 대한산업공학회/한국경영과학회 1996년도 춘계공동학술대회논문집; 공군사관학교, 청주; 26-27 Apr. 1996
    • /
    • pp.30-35
    • /
    • 1996
  • Penalty technique perhaps is the most common technique used in the genetic algorithms for constrained optimization problems. In recent years, several techniques have been proposed in the area of evolutionary computation. However, there is no general guideline on designing penalty function and constructing an efficient penalty function is quite problem-dependent. The purpose of the paper is to give a tutorial survey of recent works on penalty techniques used in genetic algorithms and to give a better classification on exisitng works, which may be helpful for revealing the intrinsic relationship among them and for providing some hints for further studies on penalty techniques.

  • PDF

유전자 알고리즘에 의한 평면 및 입체 트러스의 형상 및 위상최적설계 (Shape & Topology Optimum Design of Truss Structures Using Genetic Algorithms)

  • 여백유;박춘욱;강문명
    • 한국공간구조학회논문집
    • /
    • 제2권3호
    • /
    • pp.93-102
    • /
    • 2002
  • The objective of this study is the development of size, shape and topology discrete optimum design algorithm which is based on the genetic algorithms. The algorithm can perform both shape and topology optimum designs of trusses. The developed algorithm was implemented in a computer program. For the optimum design, the objective function is the weight of trusses and the constraints are stress and displacement. The basic search method for the optimum design is the genetic algorithms. The algorithm is known to be very efficient for the discrete optimization. The genetic algorithm consists of genetic process and evolutionary process. The genetic process selects the next design points based on the survivability of the current design points. The evolutionary process evaluates the survivability of the design points selected from the genetic process. The efficiency and validity of the developed size, shape and topology discrete optimum design algorithms were verified by applying the algorithm to optimum design examples

  • PDF

Shape & Topology GAs에 의한 트러스의 단면, 형상 및 위상최적설계 (Size, Shape and Topology Optimum Design of Trusses Using Shape & Topology Genetic Algorithms)

  • 박춘욱;여백유;김수원
    • 한국공간정보시스템학회:학술대회논문집
    • /
    • 한국공간정보시스템학회 2004년도 춘계 학술발표회 논문집 제1권1호(통권1호)
    • /
    • pp.43-52
    • /
    • 2004
  • The objective of this study is the development of size, shape and topology discrete optimum design algorithm which is based on the genetic algorithms. The algorithm can perform both shape and topology optimum designs of trusses. The developed algerian was implemented in a computer program. For the optimum design, the objective function is the weight of trusses and the constraints are stress and displacement. The basic search method for the optimum design is the genetic algorithms. The algorithm is known to be very efficient for the discrete optimization. The genetic algorithm consists of genetic process and evolutionary process. The genetic process selects the next design points based on the survivability of the current design points. The evolutionary process evaluates the survivability of the design points selected from the genetic process. The efficiency and validity of the developed size, shape and topology discrete optimum design algorithms were verified by applying the algorithm to optimum design examples

  • PDF

Evolutionary Network Optimization: Hybrid Genetic Algorithms Approach

  • Gen, Mitsuo
    • 한국지능시스템학회:학술대회논문집
    • /
    • 한국퍼지및지능시스템학회 2003년도 ISIS 2003
    • /
    • pp.195-204
    • /
    • 2003
  • Network optimization is being increasingly important and fundamental issue in the fields such as engineering, computer science, operations research, transportation, telecommunication, decision support systems, manufacturing, and airline scheduling. Networks provide a useful way to modeling real world problems and are extensively used in practice. Many real world applications impose on more complex issues, such as, complex structure, complex constraints, and multiple objects to be handled simultaneously and make the problem intractable to the traditional approaches. Recent advances in evolutionary computation have made it possible to solve such practical network optimization problems. The invited talk introduces a thorough treatment of evolutionary approaches, i.e., hybrid genetic algorithms approach to network optimization problems, such as, fixed charge transportation problem, minimum cost and maximum flow problem, minimum spanning tree problem, multiple project scheduling problems, scheduling problem in FMS.

  • PDF

A Hybrid of Evolutionary Search and Local Heuristic Search for Combinatorial Optimization Problems

  • Park, Lae-Jeong;Park, Cheol-Hoon
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • 제1권1호
    • /
    • pp.6-12
    • /
    • 2001
  • Evolutionary algorithms(EAs) have been successfully applied to many combinatorial optimization problems of various engineering fields. Recently, some comparative studies of EAs with other stochastic search algorithms have, however, shown that they are similar to, or even are not comparable to other heuristic search. In this paper, a new hybrid evolutionary algorithm utilizing a new local heuristic search, for combinatorial optimization problems, is presented. The new intelligent local heuristic search is described, and the behavior of the hybrid search algorithm is investigated on two well-known problems: traveling salesman problems (TSPs), and quadratic assignment problems(QAPs). The results indicate that the proposed hybrid is able to produce solutions of high quality compared with some of evolutionary and simulated annealing.

  • PDF

Hybrid Multi-layer Perceptron with Fuzzy Set-based PNs with the Aid of Symbolic Coding Genetic Algorithms

  • Roh, Seok-Beom;Oh, Sung-Kwun;Ahn, Tae-Chon
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2005년도 학술대회 논문집 정보 및 제어부문
    • /
    • pp.155-157
    • /
    • 2005
  • We propose a new category of hybrid multi-layer neural networks with hetero nodes such as Fuzzy Set based Polynomial Neurons (FSPNs) and Polynomial Neurons (PNs). These networks are based on a genetically optimized multi-layer perceptron. We develop a comprehensive design methodology involving mechanisms of genetic optimization and genetic algorithms, in particular. The augmented genetically optimized HFPNN (namely gHFPNN) results in a structurally optimized structure and comes with a higher level of flexibility in comparison to the one we encounter in the conventional HFPNN. The GA-based design procedure being applied at each layer of HFPNN leads to the selection of preferred nodes (FPNs or PNs) available within the HFPNN. In the sequel, two general optimization mechanisms are explored. First, the structural optimization is realized via GAs whereas the ensuing detailed parametric optimization is carried out in the setting of a standard least square method-based learning. The performance of the gHFPNNs quantified through experimentation where we use a number of modeling benchmarks-synthetic and experimental data already experimented with in fuzzy or neurofuzzy modeling.

  • PDF

수정된 유전 알고리즘을 이용한 비선형최적화 문제의 효율적인 해법 (An efficient method for nonlinear optimization problems using modified genetic algorithms)

  • 윤영수;이상용
    • 한국경영과학회:학술대회논문집
    • /
    • 대한산업공학회/한국경영과학회 1996년도 춘계공동학술대회논문집; 공군사관학교, 청주; 26-27 Apr. 1996
    • /
    • pp.519-524
    • /
    • 1996
  • This paper describes the application of Genetic Algorithms(GAs) to nonlinear constrained mixed optimization problems. Genetic Algorithms are combinatorial in nature, and therefore are computationally suitable for treating discrete and integer design variables. But, several problems that conventional GAs are ill defined are applicaiton of penalty function that can be adapted to transform a constrained optimization problem into an unconstrained optimization problem into an unconstrained one and premature convergence of solution. Thus, we developed an modified GAs to solve this problems, and two examples are given to demonstrate the effectiveness of the methodology developed in this paper.

  • PDF

군집지능과 모델개선기법을 이용한 구조물의 결함탐지 (Structural Damage Detection Using Swarm Intelligence and Model Updating Technique)

  • 최종헌;고봉환
    • 한국소음진동공학회논문집
    • /
    • 제19권9호
    • /
    • pp.884-891
    • /
    • 2009
  • This study investigates some of swarm intelligence algorithms to tackle a traditional damage detection problem having stiffness degradation or damage in mechanical structures. Particle swarm(PSO) and ant colony optimization(ACO) methods have been exploited for localizing and estimating the location and extent damages in a structure. Both PSO and ACO are population-based, stochastic algorithms that have been developed from the underlying concept of swarm intelligence and search heuristic. A finite element (FE) model updating is implemented to minimize the difference in a set of natural frequencies between measured and baseline vibration data. Stiffness loss of certain elements is considered to simulate structural damages in the FE model. It is numerically shown that PSO and ACO algorithms successfully completed the optimization process of model updating in locating unknown damages in a truss structure.