• Title/Summary/Keyword: Evolutionary computing

Search Result 82, Processing Time 0.033 seconds

An Improved MAP-Elites Algorithm via Rotational Invariant Operator in Differential Evolution for Continuous Optimization (연속 최적화를 위한 개선된 MAP-Elites 알고리즘)

  • Tae Jong Choi
    • Smart Media Journal
    • /
    • v.13 no.2
    • /
    • pp.129-135
    • /
    • 2024
  • In this paper, we propose a new approach that enhances the continuous optimization performance of the MAP-Elites algorithm. The existing self-referencing MAP-Elites algorithm employed the "DE/rand/1/bin" operator from the differential evolution algorithm, which, due to its lack of rotational invariance, led to a degradation in optimization performance when there were high correlations among variables. The proposed algorithm replaces the "DE/rand/1/bin" operator with the "DE/current-to-rand/1" operator. This operator, possessing rotational invariance, ensures robust performance even in cases where there are high correlations among variables. Experimental results confirm that the proposed algorithm performs better than the comparison algorithms.

Boosted DNA Computing for Evolutionary Graphical Structure Learning (진화하는 그래프 구조 학습을 위한 부스티드 DNA 컴퓨팅)

  • Seok Ho-Sik;Zhang Byoung-Tak
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.07b
    • /
    • pp.265-267
    • /
    • 2005
  • DNA 컴퓨팅은 분자 수준(molecular level)에서 연산을 수행한다. 따라서 일반적인 실리콘 기반의 컴퓨터에서와는 달리, 순차적인 연산 제어를 보장하기 어렵다는 특징이 있다. 그러나 DNA 컴퓨팅은 화학반응에 기초한 연산이기 때문에, 실험자가 의도한 연산을 많은 수의 분자에 동시에 적용할 수 있으므로 실리콘 기반의 컴퓨터와는 비교할 수 없는 병렬 연산을 구현할 수 있다. 병렬 연산을 구현하고자 할 때, 일반적으로 연산에 사용하는 모든 DNA 분자들을 대상으로 연산을 구현할 수도 있다. 그러나 전체가 아닌 일부의 분자들을 상대로 연산을 수행하는 것 역시 가능하며 이 때 자연스러운 방법으로 사용할 수 있는 방법이 배깅(Bagging)이나 부스팅(Boosting)과 같은 앙상블(ensemble) 계열의 학습 방법이다. 일반적인 부스팅과 달리 가중치를 부여하는 것이 아니라 특정 학습자(learner)를 나타내는 분자들을 증폭한다면 가중치를 분자의 양으로 표현하는 것이 가능하므로 분자 수준에서 앙상블 계열의 학습을 구현하는 것이 가능하다. 본 논문에서는 앙상블 계열의 학습 방법 중 특히 부스팅의 효과를 DNA 컴퓨팅에 응용하고자 할 때, 어떤 방법이 가능하며, 표현 과정에서 고려해야 할 사항은 어떠한 것들이 있는지 고려하고자 한다. 본 논문에서는 규모를 사전에 한정할 수 없는 진화 가능한 그래프 구조(evolutionary graph structure)를 학습할 수 있는 방법을 찾아보고자 한다. 진화 가능한 그래프 구조는 기존의 DNA 컴퓨팅 방법으로는 학습할 수 없는 문제이다. 그러나 조합 가능한 수를 사전에 정의할 수 없기 때문에 분자의 수에 상관없이 동일한 연산 시간에 문제를 해결할 수 있는 DNA 컴퓨팅의 장정을 가장 잘 발휘할 수 있는 문제이기도 하다.개별 태스크의 특성에 따른 성능 조절과 태스크의 변화에 따른 빠른 반응을 자랑으로 한다. 본 논문에선 TIB 알고리즘을 리눅스 커널에 구현하여 성능을 평가하였고 그 결과 리눅스에서 사용되는 기존 인터벌 기반의 알고리즘들에 비해 좋은 전력 절감 효과를 얻을 수 있었다.과는 한식 외식업체들이 고객들의 재구매 의도를 높이기 위해서는 한식 외식업체의 서비스요인, 식음료요인, 이벤트 요인 등을 강화함으로써 전반적인 종사원 서비스 품질과 식음료품질을 높이는 전략을 취해야 한다는 것을 시사해주고 있다. 본 연구는 대구 경북소재 한식 외식업체만을 대상으로 하여 연구를 실시하여 연구의 일반화와 한식 외식업체를 이용하는 이용 고객들이 한식 외식업체를 재방문하는 재구매 의도가 발생하는데 있어 발생하는 과정을 설명하는 종단적 연구를 실시하지 못한 한계점을 가지고 있다.아직 산업 디자인이 품질경쟁력에 크게 영향을 미치는 성숙단계에 이르지 못하였음을 의미한다. (2) 제품 디자인에게 영향을 끼치는 유의적인 변수는 연구개발력, 연구개발투자 수준, 혁신활동 수준(5S, TPM, 6Sigma 운동, QC 등)이며, 제품 디자인은 우선 품질경쟁력을 높여 간접적으로 고객만족과 고객 충성을 유발하는 것으로 추정되었다. 상기의 분석결과로부터, 본 연구는 다음과 같은 정책적 함의를 도출하였다. 첫째, 신상품 개발과 혁신을 위한 포괄적인 연구개발 프로젝트를 품질 경쟁력의 주요 결정요인(제품의 기본성능, 신뢰성, 수명(내구성) 및 제품 디자인)과 연계하여 추진해야 할 것이다. 둘째, 기업은 디자인 경영 마인드 제고와 디자인 전문인력 양성을, 대학은 디자인 현장 업무를 통하여 창의력 증진과 기획 및 마케팅 능력 교육을, 정부는 디자인 기술개발 및 디자인 교육지원의 강화를 통하여 각각 디자인 경쟁력$\righta

  • PDF

Train Booking Agent with Adaptive Sentence Generation Using Interactive Genetic Programming (대화형 유전 프로그래밍을 이용한 적응적 문장생성 열차예약 에이전트)

  • Lim, Sung-Soo;Cho, Sung-Bae
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.12 no.2
    • /
    • pp.119-128
    • /
    • 2006
  • As dialogue systems are widely required, the research on natural language generation in dialogue has raised attention. Contrary to conventional dialogue systems that reply to the user with a set of predefined answers, a newly developed dialogue system generates them dynamically and trains the answers to support more flexible and customized dialogues with humans. This paper proposes an evolutionary method for generating sentences using interactive genetic programming. Sentence plan trees, which stand for the sentence structures, are adopted as the representation of genetic programming. With interactive evolution process with the user, a set of customized sentence structures is obtained. The proposed method applies to a dialogue-based train booking agent and the usability test demonstrates the usefulness of the proposed method.

ACDE2: An Adaptive Cauchy Differential Evolution Algorithm with Improved Convergence Speed (ACDE2: 수렴 속도가 향상된 적응적 코시 분포 차분 진화 알고리즘)

  • Choi, Tae Jong;Ahn, Chang Wook
    • Journal of KIISE
    • /
    • v.41 no.12
    • /
    • pp.1090-1098
    • /
    • 2014
  • In this paper, an improved ACDE (Adaptive Cauchy Differential Evolution) algorithm with faster convergence speed, called ACDE2, is suggested. The baseline ACDE algorithm uses a "DE/rand/1" mutation strategy to provide good population diversity, and it is appropriate for solving multimodal optimization problems. However, the convergence speed of the mutation strategy is slow, and it is therefore not suitable for solving unimodal optimization problems. The ACDE2 algorithm uses a "DE/current-to-best/1" mutation strategy in order to provide a fast convergence speed, where a control parameter initialization operator is used to avoid converging to local optimization. The operator is executed after every predefined number of generations or when every individual fails to evolve, which assigns a value with a high level of exploration property to the control parameter of each individual, providing additional population diversity. Our experimental results show that the ACDE2 algorithm performs better than some state-of-the-art DE algorithms, particularly in unimodal optimization problems.

Designing the Moving Pattern of Cleaning Robot based on Grammatical Evolution with Conditional Probability Table (문법적 진화기법과 조건부 확률을 이용한 청소 로봇의 이동 패턴 계획)

  • Gwon, Soon-Joe;Kim, Hyun-Tae;Ahn, Chang Wook
    • KIISE Transactions on Computing Practices
    • /
    • v.22 no.4
    • /
    • pp.184-188
    • /
    • 2016
  • The cleaning robot is popularly used as a home appliance. The state-of-the-art cleaning robot can clean more efficiently by using information gathered from its sensor, which is difficult for low-price cleaning robots due to limitation in this aspect. In this paper, we suggested a method for the moving pattern of cleaning robot based on grammatical evolution. Optimized program is generated by using moving pattern grammar, which is defined by Backus-Naur form. In addition, conditional probability is used between each of the grammar elements during the program creation process. The proposed method is evaluated by robot simulation in order to verify its performance and further compare it with existing algorithms. The experiment results showed that the proposed method is better than the compared algorithms.

A Study on the Architectural Application of Biological Patterns (생물학적 패턴의 건축적 적용에 관한 연구)

  • Kim, Won Gaff
    • Korean Institute of Interior Design Journal
    • /
    • v.21 no.2
    • /
    • pp.35-45
    • /
    • 2012
  • The development of digital media made the change of architectural paradigm from tectonic to the surface and pattern. This means the transition to the new kind of materiality and the resurrection of ornament. This study started as an aim to apply biological pattern to architectural design from the new perception of pattern. Architectural patterns in the early era appeared as ladders, steps, chains, trees, vortices. But since 21st century, we can find patterns in nature like atoms and molecular structures, fluid forms of dynamics and new geometrical pattern like fractal and first of all biological patterns like viruses and micro-organisms, Voronoi cells, DNA structure, rhizomes and various hybrids and permutations of these. Pattern became one of the most important elements and themes of contemporary architecture through the change of materiality and resurrection of ornament with the new perception of surface in architecture. One of the patterns that give new creative availability to the architectural design is biological pattern which is self-organized as an optimum form through interaction with environment. Biological patterns emerge mostly as self-replicating patterns through morphogenesis, certain geometrical patterns(in particular triangles, pentagons, hexagons and spirals). The architectural application methods of biological patterns are direct figural pattern of organism, circle pattern, polygon pattern, energy-material control pattern, differentiation pattern, parametric pattern, growth principle pattern, evolutionary ecologic pattern. These patterns can be utilized as practical architectural patterns through the use of computer programs as morphogenetic programs like L-system, MoSS program and genetic algorithm programs like Grasshoper, Generative Components with the help of computing technology like mapping and scripting.

  • PDF

Identification of Fuzzy Inference System Based on Information Granulation

  • Huang, Wei;Ding, Lixin;Oh, Sung-Kwun;Jeong, Chang-Won;Joo, Su-Chong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.4 no.4
    • /
    • pp.575-594
    • /
    • 2010
  • In this study, we propose a space search algorithm (SSA) and then introduce a hybrid optimization of fuzzy inference systems based on SSA and information granulation (IG). In comparison with "conventional" evolutionary algorithms (such as PSO), SSA leads no.t only to better search performance to find global optimization but is also more computationally effective when dealing with the optimization of the fuzzy models. In the hybrid optimization of fuzzy inference system, SSA is exploited to carry out the parametric optimization of the fuzzy model as well as to realize its structural optimization. IG realized with the aid of C-Means clustering helps determine the initial values of the apex parameters of the membership function of fuzzy model. The overall hybrid identification of fuzzy inference systems comes in the form of two optimization mechanisms: structure identification (such as the number of input variables to be used, a specific subset of input variables, the number of membership functions, and polyno.mial type) and parameter identification (viz. the apexes of membership function). The structure identification is developed by SSA and C-Means while the parameter estimation is realized via SSA and a standard least square method. The evaluation of the performance of the proposed model was carried out by using four representative numerical examples such as No.n-linear function, gas furnace, NO.x emission process data, and Mackey-Glass time series. A comparative study of SSA and PSO demonstrates that SSA leads to improved performance both in terms of the quality of the model and the computing time required. The proposed model is also contrasted with the quality of some "conventional" fuzzy models already encountered in the literature.

A Survey of Genetic Programming and Its Applications

  • Ahvanooey, Milad Taleby;Li, Qianmu;Wu, Ming;Wang, Shuo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.4
    • /
    • pp.1765-1794
    • /
    • 2019
  • Genetic Programming (GP) is an intelligence technique whereby computer programs are encoded as a set of genes which are evolved utilizing a Genetic Algorithm (GA). In other words, the GP employs novel optimization techniques to modify computer programs; imitating the way humans develop programs by progressively re-writing them for solving problems automatically. Trial programs are frequently altered in the search for obtaining superior solutions due to the base is GA. These are evolutionary search techniques inspired by biological evolution such as mutation, reproduction, natural selection, recombination, and survival of the fittest. The power of GAs is being represented by an advancing range of applications; vector processing, quantum computing, VLSI circuit layout, and so on. But one of the most significant uses of GAs is the automatic generation of programs. Technically, the GP solves problems automatically without having to tell the computer specifically how to process it. To meet this requirement, the GP utilizes GAs to a "population" of trial programs, traditionally encoded in memory as tree-structures. Trial programs are estimated using a "fitness function" and the suited solutions picked for re-evaluation and modification such that this sequence is replicated until a "correct" program is generated. GP has represented its power by modifying a simple program for categorizing news stories, executing optical character recognition, medical signal filters, and for target identification, etc. This paper reviews existing literature regarding the GPs and their applications in different scientific fields and aims to provide an easy understanding of various types of GPs for beginners.

Predictive modeling of the compressive strength of bacteria-incorporated geopolymer concrete using a gene expression programming approach

  • Mansouri, Iman;Ostovari, Mobin;Awoyera, Paul O.;Hu, Jong Wan
    • Computers and Concrete
    • /
    • v.27 no.4
    • /
    • pp.319-332
    • /
    • 2021
  • The performance of gene expression programming (GEP) in predicting the compressive strength of bacteria-incorporated geopolymer concrete (GPC) was examined in this study. Ground-granulated blast-furnace slag (GGBS), new bacterial strains, fly ash (FA), silica fume (SF), metakaolin (MK), and manufactured sand were used as ingredients in the concrete mixture. For the geopolymer preparation, an 8 M sodium hydroxide (NaOH) solution was used, and the ambient curing temperature (28℃) was maintained for all mixtures. The ratio of sodium silicate (Na2SiO3) to NaOH was 2.33, and the ratio of alkaline liquid to binder was 0.35. Based on experimental data collected from the literature, an evolutionary-based algorithm (GEP) was proposed to develop new predictive models for estimating the compressive strength of GPC containing bacteria. Data were classified into training and testing sets to obtain a closed-form solution using GEP. Independent variables for the model were the constituent materials of GPC, such as FA, MK, SF, and Bacillus bacteria. A total of six GEP formulations were developed for predicting the compressive strength of bacteria-incorporated GPC obtained at 1, 3, 7, 28, 56, and 90 days of curing. 80% and 20% of the data were used for training and testing the models, respectively. R2 values in the range of 0.9747 and 0.9950 (including train and test dataset) were obtained for the concrete samples, which showed that GEP can be used to predict the compressive strength of GPC containing bacteria with minimal error. Moreover, the GEP models were in good agreement with the experimental datasets and were robust and reliable. The models developed could serve as a tool for concrete constructors using geopolymers within the framework of this research.

Development Web-based Arabic Assessments for Deaf and Hard-of-Hearing Students

  • Atwan, Jaffar;Wedyan, Mohammad;Abbas, Abdallah;Gazzawe, Foziah;Alturki, Ryan
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.5
    • /
    • pp.359-367
    • /
    • 2022
  • Arabic skills are the tools by which children are prepared for the educational procedures on which their life depends. Deaf and hard of hearing students (DHH), must be able to grasp the same Arabic terms as hearing students and their different meanings in a context of different sentences less than what they are supposed to be due to their inability. However, problems arise in the same Arabic word and their different meanings in a context for (DHH) students since the way of comprehending such words does not meet the needs and circumstances of (DHH) students. Therefore, researchers introduce web-based method for Arabic words and their meanings in a context prototype that can overcome those problems. Methodology: The study sample consists of 30 (DHH) students at Al Amal City of Palestine, Gaza Region (GR). Those participants that agreed to take part in this study were recruited using a purposeful sampling method. Additionally, to examine the survey information descriptively, the Statistical Packages for social Sciences (SPSS) version 24.0 was used. A sign language teaching movie is utilized in the prototype to standardize the process and verify that Arabic vocabulary and their implications are comprehended. The Evolutionary Process Model of Prototype technique was utilized to create this system. Finding: The findings of this study show that the prototype built is workable and has the ability to help DHHS differentiate between phrases that have the same letters but distinct meanings. The findings of this study are expected to contribute to a better understanding and application of Development of Web-based Arabic Assessments for (DHH) Students in developing countries, which will help to increase the use of Development of Web-based Arabic for (HDD) students in those countries. The empirical models of Web-based Arabic for (DHH) students are established as a proof of concept for the proposed model. The results of this study are predicted to have a significant impact to the information system practitioners and to the body of knowledge.