DOCSLIB.ORG

A Comparative Analysis of Design Issues of Evolutionary Structures

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
A Comparative Analysis of Design Issues of Evolutionary Structures Kunjal Bharatkumar Mankad | IJCSET(www.ijcset.net) | August 2015 | Vol 5, Issue 8,304-308 A Comparative Analysis of Design Issues of Evolutionary Structures Kunjal Bharatkumar Mankad Rajkot, India Abstract-Evolutionary computing is ubiquitous in nature. comparison among evolutionary characteristics such as Adaptive nature and evolutionary search capabilities of representation, encoding, and types of genetic operators. evolutionary structures produce a more efficient exploration The concluding part of the paper justifies the design of the state space of possible solutions. Evolutionary perspective of evolutionary structures. computing provides four major structures namely evolutionary programming, genetic programming, genetic algorithm and evolutionary strategy. The uniqueness of II. EVOLUTIONARY ALGORITHMS evolutionary structure is that they are capable to provide In recent years, cognitive systems have gained prominence solutions for highly complex mathematical problems very by implementing evolutionary approach to the efficiently. The paper explains differences between traditional computational modeling. Computational paradigm which is search and optimization algorithm and evolutionary algorithm based on evolutionary characteristics is popularly known as along with advantages of evolutionary computing. evolutionary computing. Evolutionary computing is based Evolutionary life cycle and procedural characteristics of each on principles of natural genetics. It is basically the type of structure are discussed in details. Structural parameters of computing which structuresthe problem with the help of evolutionary methods such as chromosomal representation, process of evolution. The process of evolution is the change encoding, selection, crossover and mutation are narrated comparatively.The paper concludes by showing justification of in the inherited traits of a population from one generation to design issues of evolutionary structures. the next. Evolutionary Computation (EC) refers to the computer-based problem solving systems that use Keywords: Evolutionary Algorithm, Evolutionary computational models of evolutionary process. EC uses an Computing, Evolutionary Programming, Evolutionary algorithm to implement evolutionary characteristics in Strategy, Genetic Algorithm, Genetic Programming. solving problems. Such algorithm is known as evolutionary algorithm. Evolutionary characteristics are achieved using I. INTRODUCTION evolutionary computing in which problem is structured Evolutionary Computation (EC) refers to the computer- using chromosome of different types in form of symbols or based problem solving systems that use computational alphanumeric numbers. Evolutionary algorithms are models of evolutionary process.Evolutionary algorithms basically computational models of evolutionary processes. have provided numerous advantages compared to EA are successfullyapplied to varieties of numerous conventional methods. The capability to provide simulation problems from different domains, including intelligent of biological evolution leads evolutionary methods to search, optimization, automatic programming, machine design highly complex mathematical problems. learning, operations research, bioinformatics, and social Evolutionary algorithms provide adaptive nature with systems, engineering systems, health care, medical multimodal characteristics which proves quite favorable in diagnostic, stock and share market, forecasting systems and design of evolutionary systems. EA are successfully applied many more. Fig. 2 represents basic procedure of to varieties of numerous problems from different domains, evolutionary computing [1]. including intelligent search, optimization, automatic programming, machine learning, operations research, Selection bioinformatics, and social systems, engineering systems, Population of Parents medical diagnostic, stock and share market, forecasting Chromosomes systems and many more. Chromosomes The introductory section of the paper explains importance of evolutionary algorithms. The second section of the paper explains the basic procedure of evolutionary Reproduct Replacement algorithm. Differences between traditional search and ion optimization algorithm and evolutionary algorithm are presented in this section. It also describes advantages of evolutionary algorithm. The third section explains Children evolutionary structures such as evolutionary programming, Chromosomes genetic algorithm, genetic programming and Evolutionary Strategies in detail.Evolutionary life cycle and procedural explanation of each evolutionary structure is presented in Fig.1: Basic Elements of Evolutionary Computing this section. The forth section of the paper presents 304 Kunjal Bharatkumar Mankad | IJCSET(www.ijcset.net) | August 2015 | Vol 5, Issue 8,304-308 A. Difference of Traditional optimization Algorithms Vs primary search with an evolutionary algorithm (for Evolutionary Algorithms example fine tuning of weights of a evolutionary There are significant differences observed between GA neural network), or it may involve simultaneous and most of the traditional optimization algorithms as application of other algorithms (e.g., hybridizing summarized by [2,3,4,5,6]: with simulated annealing or tabu search to improve Evolutionary algorithms are ubiquitous in nature the efficiency of basic evolutionary search). while traditional algorithms are static in nature. The evaluation of each solution can be handled in Evolutionary algorithm are specially designed to parallel and only selectionrequires some serial solve mathematical function,which describes the processing. Implicit parallelism is not possible in problem is not known and the values at certain many global optimization algorithms like simulated parametersare obtained from simulations. annealing and Tabu search. Evolutionary algorithm can handle multi-modal Traditional methods of optimization are not robust functions whereas many other to dynamic changes inproblem the environment and optimizationtechniques supports only single model often require a complete restart in order to provide a function; solution (e.g., dynamic programming). In contrast, In traditional optimization, convergence to an evolutionary algorithms can be used to adapt optimal solution depends on the chosen initial solutions to changing circumstance. solution while in EA, due to randomness , initial EA are capable to handle problems which replaces solution is always different; human expertise although human expertise should EA is generic in nature due to objective function be used when it is available, it oftenproves while a traditional algorithm is efficient in solving advantageous for automating problem-solving one problem but the same may not be efficient in routines. solving a different problem; EA works with coding of parameter set rather than III. EVOLUTIONARY STRUCTURES actual value of parameters; A traditional algorithm may not be efficient to handle problems with discrete variables or highly Evolutionary non-linear variables with constraints while EA can Algorithms be robustly applied to problems with any kinds of objective functions, such as nonlinear or step Evolutionary Genetic Evolutionary Genetic functions; because only values of the objective Programming Programming Strategy function for optimization are used to select genes; Algorithm Traditional algorithm can stuck at suboptimal solutions while EA can have less chance to be Fig. 2: Evolutionary Structures trapped by local optima due to characteristics of A. Evolutionary Algorithm crossover and mutation operators. A technique borrowed from the theory of biological evolution that is used to create optimization procedures or B. Advantages of Evolutionary Algorithms methodologies. In nature, evolution is mostly determined EA offers following advantages [6,8]: by natural selection or different individuals competing for A primary advantage of evolutionary computation is resources in the environment. Those individuals that are that it is conceptually simple. The procedure may be better are more likely to survive and propagate their genetic written as difference equation (1) material.EAs fall into the category of “generate and test” x[t + 1] = s(v(x[t])) (1) algorithms.They are stochastic,population-based wherex[t] is the population at time t under a algorithms. EA are based on variation operators representation x, v is a random variation operator, (recombination and mutation) to create the necessary and sis the selection operator . diversity and finally introduce novelty. EA also use Evolutionary algorithm provides representation selection operator whichreduces diversity and provides independent performance, in contrast with other good quality solution.Fig.3 represents pseudo code of an numerical techniques, which might be applicable for evolutionary algorithm [7]. only continuous values or other constrained sets. BEGIN Evolutionary algorithms offer a framework such that INITIALISE population with random candidate solutions; it is comparably easy to incorporate prior knowledge EVALUATE each candidate; about the problem. Incorporating such information REPEAT UNTIL (TERMINATION CONDITION is satisfied) focuses the evolutionary search, yielding a more DO SELECT parent; efficient exploration of the state space of possible RECOMBINE pairs of parents; solutions. MUTATE the resulting offspring; Evolutionary algorithms can also be hybridized with SELECT individuals for the next generation; END other techniques. For ex. This may be as simple as
Load more

Recommended publications
  • Application of Fuzzy Differential Evolutionary Algorithms in Biological Data Mining
    International Journal of Scientific & Engineering Research Volume 10, Issue 1, January-2019 1379 ISSN 2229-5518 Application of Fuzzy Differential Evolutionary Algorithms in Biological Data Mining S.Poongothai1,*, C.Dharuman2 , P. Venkatesan3 1Asst. Professor, Department of Mathematics, SRM University, Ramapuram Campus, Chennai, India. 2 Professor, Department of Mathematics, SRM University, Ramapuram Campus, Chennai, India. 3Faculty of Research, Sri Ramachandra University, Chennai, India. *Corresponding author: [email protected] Abstract In the world, everyday massive quantity of statistics being generated at a fee some distance higher than via which it could be tested by means of human comprehension alone, data mining became an essential undertaking for extracting as plenty useful data from this statistical data as possible. The standardized data mining techniques are appropriate enough to a positive extent but they are restrained by some limitations, and particularly for those cases that evolutionary approaches performs greater as well as extra capable. In this paper, a nature inspired evolutionary strategies is used for data mining with unique connection with Differential algorithm. We additionally expand to the hybrid algorithms- Fuzzy Differential Algorithms. Keywords: Data mining, Fuzzy logic, Differential Evolutionary algorithm, FURIA, Hybrid FDE 1. Introduction In data mining, especially in medical field, various computerized tools and techniques provides many advantages in health related problems. Most commonly used technique is artificial intelligence in disease diagnosis [1-3]. Evolutionary Algorithms are the class of general purpose of stochastic optimization algorithms based on neo-Darwinian theory. Differential Genetic Algorithm is one of the branch of Evolutionary Algorithm is recognized as a significant stochastic search technique in the recent world [4].
    [Show full text]
  • Revisiting Evolutionary Algorithms in Feature Selection and Nonfuzzy/Fuzzy Rule Based Classification Satchidananda Dehuri1 and Ashish Ghosh2∗
    Advanced Review Revisiting evolutionary algorithms in feature selection and nonfuzzy/fuzzy rule based classification Satchidananda Dehuri1 and Ashish Ghosh2∗ This paper discusses the relevance and possible applications of evolutionary algo- rithms, particularly genetic algorithms, in the domain of knowledge discovery in databases. Knowledge discovery in databases is a process of discovering knowl- edge along with its validity, novelty,andpotentiality. Various genetic-based feature selection algorithms with their pros and cons are discussed in this article. Rule (a kind of high-level representation of knowledge) discovery from databases, posed as single and multiobjective problems is a difficult optimization problem. Here, we present a review of some of the genetic-based classification rule discovery methods based on fidelity criterion. The intractable nature of fuzzy rule mining using single and multiobjective genetic algorithms reported in the literatures is reviewed. An extensive list of relevant and useful references are given for further research. C 2013 Wiley Periodicals, Inc. How to cite this article: WIREs Data Mining Knowl Discov 2013. doi: 10.1002/widm.1087 INTRODUCTION is by means of data mining or knowledge discovery he current information era is characterized by from databases (KDD).3–6 Through data mining, in- T a great expansion in the volume of data that teresting knowledge7 can be extracted and the dis- are being generated by low-cost devices (e.g., scan- covered knowledge can be applied in the target field ners, bar code readers, sensors) and stored. Intu- to increase the working efficiency and to improve itively, this large amount of stored data contains valu- the quality of decision making.
    [Show full text]
  • Genetic Optimization of Fuzzy Membership Functions for Cloud Resource Provisioning
    Genetic optimization of fuzzy membership functions for cloud resource provisioning Amjad Ullah, Jingpeng Li, Amir Hussain Yindong Shen Division of Computing Science and Mathematics School of Automation University of Stirling Huazhong University of Science and Technology Stirling FK9 4LA, UK Wuhan 430074, China Email: faul,jli,[email protected] Email: [email protected] Abstract—The successful usage of fuzzy systems can be seen this paper aims to find near optimal parameter settings for the in many application domains owing to their capabilities to design of the used membership functions with an objective to model complex systems by exploiting knowledge of domain obtain more improved results, i.e. better system performance experts. Their accuracy and performance are, however, primarily dependent on the design of its membership functions and control by minimizing the Service Level Objective (SLO) violations rules. The commonly employed technique to design membership (explained in IV-B) and reduced system running cost. functions is to exploit the knowledge of domain experts. However, An FRBS consists of two ingredients: (i) a Rule Base (RB) in certain application domains, the knowledge of domain experts which is a collection of IF-Then rules, and (ii) a Data Base are limited and therefore, cannot be relied upon. Alternatively, (DB) which contains the definitions and semantics for the optimization techniques such as genetic algorithms are utilized to optimize the various design parameters of fuzzy systems. In linguistic terms of fuzzy sets. The commonly used approach this paper, we report a case study of optimizing the membership of designing an FRBS is to acquire knowledge from domain functions of a fuzzy system using genetic algorithm, which is experts and represent it using a DB and an RB [5].
    [Show full text]
  • Differential Evolution with Local Information for Neuro-Fuzzy Systems Optimisation ⇑ Ming-Feng Han , Chin-Teng Lin, Jyh-Yeong Chang
    Knowledge-Based Systems 44 (2013) 78–89 Contents lists available at SciVerse ScienceDirect Knowledge-Based Systems journal homepage: www.elsevier.com/locate/knosys Differential evolution with local information for neuro-fuzzy systems optimisation ⇑ Ming-Feng Han , Chin-Teng Lin, Jyh-Yeong Chang Institute of Electrical Control Engineering, National Chiao Tung University, 1001 University Road, Hsinchu 300, Taiwan, ROC article info abstract Article history: This paper proposes a differential evolution with local information (DELI) algorithm for Takagi–Sugeno– Received 3 October 2012 Kang-type (TSK-type) neuro-fuzzy systems (NFSs) optimisation. The DELI algorithm uses a modified Received in revised form 21 December 2012 mutation operation that considers a neighbourhood relationship for each individual to maintain the Accepted 23 January 2013 diversity of the population and to increase the search capability. This paper also proposes an adaptive Available online 4 February 2013 fuzzy c-means method for determining the number of rules and for identifying suitable initial parameters for the rules. Initially, there are no rules in the NFS model; the rules are automatically generated by the Keywords: fuzzy measure and the fuzzy c-means method. Until the firing strengths of all of the training patterns sat- Neuro-fuzzy systems (NFSs) isfy a pre-specified threshold, the process of rule generation is terminated. Subsequently, the DELI algo- Differential evolution (DE) Neuro-fuzzy systems optimisation rithm optimises all of the free parameters for NFSs design. To enhance the performance of the DELI Evolutionary algorithm (EA) algorithm, an adaptive parameter tuning based on the 1/5th rule is used for the tuning scale factor F.
    [Show full text]
  • A Rule-Based Symbiotic Modified Differential Evolution for Self-Organizing Neuro-Fuzzy Systems
    Applied Soft Computing 11 (2011) 4847–4858 Contents lists available at ScienceDirect Applied Soft Computing j ournal homepage: www.elsevier.com/locate/asoc A Rule-Based Symbiotic MOdified Differential Evolution for Self-Organizing Neuro-Fuzzy Systems a b c,∗ a Miin-Tsair Su , Cheng-Hung Chen , Cheng-Jian Lin , Chin-Teng Lin a Department of Electrical Engineering, National Chiao-Tung University, Hsinchu 300, Taiwan, ROC b Department of Electrical Engineering, National Formosa University, Yunlin County 632, Taiwan, ROC c Department of Computer Science and Information Engineering, National Chin-Yi University of Technology, Taichung 411, Taiwan, ROC a r t i c l e i n f o a b s t r a c t Article history: This study proposes a Rule-Based Symbiotic MOdified Differential Evolution (RSMODE) for Self- Received 9 March 2009 Organizing Neuro-Fuzzy Systems (SONFS). The RSMODE adopts a multi-subpopulation scheme that uses Received in revised form 24 March 2011 each individual represents a single fuzzy rule and each individual in each subpopulation evolves sepa- Accepted 26 June 2011 rately. The proposed RSMODE learning algorithm consists of structure learning and parameter learning Available online 8 July 2011 for the SONFS model. The structure learning can determine whether or not to generate a new rule- based subpopulation which satisfies the fuzzy partition of input variables using the entropy measure. Keywords: The parameter learning combines two strategies including a subpopulation symbiotic evolution and a Neuro-fuzzy systems modified differential evolution. The RSMODE can automatically generate initial subpopulation and each Symbiotic evolution individual in each subpopulation evolves separately using a modified differential evolution.
    [Show full text]
  • A Genetic-Fuzzy System for Optimising Agent Steering
    COMPUTER ANIMATION AND VIRTUAL WORLDS Comp. Anim. Virtual Worlds 2010; 21: 453–461 Published online 25 May 2010 in Wiley InterScience (www.interscience.wiley.com)........................................................................................... DOI: 10.1002/cav.360 A genetic-fuzzy system for optimising agent steering ..........................................................................By Anton Gerdelan* and Carol O’Sullivan Fuzzy controllers are a popular method for animated character perception and control. A drawback of fuzzy systems is that time intensive manual calibration of system parameters is required. We introduce a new Genetic-Fuzzy System (GFS) that automates the tuning process of rules for animated character steering. An advantage of our GFS is that it is able to adapt the rules for steering behaviour during run time. We explore the parameter space of the new GFS, and discuss how the GFS can be implemented to run as a background process during normal execution of a simulation. Copyright © 2010 John Wiley & Sons, Ltd. KEY WORDS: agent navigation and steering; genetic algorithms; fuzzy logic Introduction tances in meters, into members of discrete fuzzy sets such as near, medium or far. This process is called Fuzzy logic controllers are an elegant solution for agents fuzzification. controlling the motion of real time animated charac- (2) Designing the value of fuzzy sets for outputs from ters, creatures and vehicles because fuzzy controllers the controller. These could be steering angles light, produce outputs that transition smoothly, rather than sharp, and very sharp. Using a singleton model, each stepping between output states, and because they can set must correspond to a single crisp output value, in be implemented to allow agents to react to changing radians for example.
    [Show full text]
  • Heuristic Design of Fuzzy Inference Systems: a Review of Three Decades of Research
    Heuristic design of fuzzy inference systems: a review of three decades of research Article Accepted Version Creative Commons: Attribution-Noncommercial-No Derivative Works 4.0 Ojha, V., Abraham, A. and Snášel, V. (2019) Heuristic design of fuzzy inference systems: a review of three decades of research. Engineering Applications of Artificial Intelligence, 85. pp. 845-864. ISSN 0952-1976 doi: https://doi.org/10.1016/j.engappai.2019.08.010 Available at http://centaur.reading.ac.uk/85784/ It is advisable to refer to the publisher’s version if you intend to cite from the work. See Guidance on citing . To link to this article DOI: http://dx.doi.org/10.1016/j.engappai.2019.08.010 Publisher: Elsevier All outputs in CentAUR are protected by Intellectual Property Rights law, including copyright law. Copyright and IPR is retained by the creators or other copyright holders. Terms and conditions for use of this material are defined in the End User Agreement . www.reading.ac.uk/centaur CentAUR Central Archive at the University of Reading Reading’s research outputs online Heuristic Design of Fuzzy Inference Systems: A Review of Three Decades of Research Varun Ojha*1,2, Ajith Abraham3,4, and V´aclav Sn´aˇsel5 1ETH Z¨urich,Switzerland 2University of Reading, United Kingdom 3University of Pretoria, South Africa 4Machine Intelligence Research Labs (MIR Labs), WA, United States 5Technical University of Ostrava, Czech Republic Abstract This paper provides an in-depth review of the optimal design of type-1 and type-2 fuzzy inference systems (FIS) using five well known computational frameworks: genetic-fuzzy systems (GFS), neuro-fuzzy systems (NFS), hierarchical fuzzy systems (HFS), evolving fuzzy systems (EFS), and multiobjective fuzzy systems (MFS), which is in view that some of them are linked to each other.
    [Show full text]
  • Genetic Learning of Fuzzy Rule-Based Classification Systems Cooperating
    <ᎏ ᎏ< Genetic Learning of Fuzzy Rule-Based Classi®cation Systems Cooperating with Fuzzy Reasoning Methods Oscar Cordon * Department of Computer Science and Arti®cial Intelligence, University of Granada, 18071 Granada, Spain Marõa Jose del Jesus² Department of Computer Science, University of Jaen, 23071 Jaen, Spain Francisco Herrera³ Department of Computer Science and Arti®cial Intelligence, University of Granada, 18071 Granada, Spain In this paper, we present a multistage genetic learning process for obtaining linguistic fuzzy rule-based classi®cation systems that integrates fuzzy reasoning methods cooperat- ing with the fuzzy rule base and learns the best set of linguistic hedges for the linguistic variable terms. We show the application of the genetic learning process to two well known sample bases, and compare the results with those obtained from different learning algorithms. The results show the good behavior of the proposed method, which maintains the linguistic description of the fuzzy rules. ᮊ 1998 John Wiley & Sons, Inc. 1. INTRODUCTION In a supervised inductive learning process, a pattern classi®cation system is developed by means of a set of classi®ed examples used to establish a correspon- dence between the new pattern descriptions and the class labels. This system is a description of the concepts learned and it can be expressed as a logic expression, a set of fuzzy rules, a decision tree, or a neural network, among others. When the classi®cation system is composed of a set of fuzzy rules, it is called a fuzzy rule-based classi®cation systemŽ. FRBCS . * E-mail: [email protected]. ² E-mail: [email protected].
    [Show full text]
  • Developing a Fuzyy Inference System by Using Genetic Algorithms and Expert Knowledge (With a Case Study for Landslides in Iran)
    DEVELOPING A FUZYY INFERENCE SYSTEM BY USING GENETIC ALGORITHMS AND EXPERT KNOWLEDGE (WITH A CASE STUDY FOR LANDSLIDES IN IRAN) AZAR ZAFARI February, 2014 SUPERVISORS: Dr.Ali A. (Aliasghar) Alesheikh Dr.R. (Raul) Zurita-Milla DEVELOPING A FUZYY INFERENCE SYSTEM BY USING GENETIC ALGORITHMS AND EXPERT KNOWLEDGE (WITH A CASE STUDY FOR LANDSLIDES IN IRAN) AZAR ZAFARI Enschede, The Netherlands, February, 2014 Thesis submitted to the Faculty of Geo-Information Science and Earth Observation of the University of Twente in partial fulfilment of the requirements for the degree of Master of Science in Geo-information Science and Earth Observation. Specialization: GFM SUPERVISORS: Dr. Ali A. (Aliasghar) Alesheikh Dr. R. (Raul) Zurita-Milla THESIS ASSESSMENT BOARD: Dr.A. (Abolghasem) Sadeghi Prof. G. (George) Vosselman DISCLAIMER This document describes work undertaken as part of a programme of study at the Faculty of Geo-Information Science and Earth Observation of the University of Twente. All views and opinions expressed therein remain the sole responsibility of the author, and do not necessarily represent those of the Faculty. ABSTRACT Meeting the need to produce hazard maps has become more urgent than ever due to recent natural disasters like earthquakes, tsunami and hurricanes. This urgent need makes the scientific community to work more and more on assessing and understanding such natural disasters to mitigate casualties. One of these major hazards is landslides, which may follow all the aforementioned disasters. There are several methods for landslide susceptibility assessment. Most of them either use knowledge extracted from data or expert knowledge. Since all kinds of knowledge are not extractable from data and expert knowledge is inherently subjective, the need to develop a system for integrating knowledge is clearly tangible.
    [Show full text]
  • Genetic Fuzzy Systems: Taxonomy, Current Research Trends and Prospects
    Evol. Intel. (2008) 1:27–46 DOI 10.1007/s12065-007-0001-5 REVIEW ARTICLE Genetic fuzzy systems: taxonomy, current research trends and prospects Francisco Herrera Received: 1 October 2007 / Accepted: 17 October 2007 / Published online: 10 January 2008 Ó Springer-Verlag 2008 Abstract The use of genetic algorithms for designing they can deal with complex engineering problems which fuzzy systems provides them with the learning and adap- are difficult to solve by classical methods [73]. tation capabilities and is called genetic fuzzy systems Hybrid approaches have attracted considerable attention (GFSs). This topic has attracted considerable attention in in the Computational Intelligence community. One of the the Computation Intelligence community in the last few most popular approaches is the hybridization between years. This paper gives an overview of the field of GFSs, fuzzy logic and GAs leading to genetic fuzzy systems being organized in the following four parts: (a) a taxonomy (GFSs) [27]. A GFS is basically a fuzzy system augmented proposal focused on the fuzzy system components involved by a learning process based on evolutionary computation, in the genetic learning process; (b) a quick snapshot of the which includes genetic algorithms, genetic programming, GFSs status paying attention to the pioneer GFSs contri- and evolutionary strategies, among other evolutionary butions, showing the GFSs visibility at ISI Web of Science algorithms (EAs) [40]. including the most cited papers and pointing out the Fuzzy systems are one of the most important areas for milestones covered by the books and the special issues in the application of the Fuzzy Set Theory. Usually it is the topic; (c) the current research lines together with a considered a model structure in the form of fuzzy rule discussion on critical considerations of the recent devel- based systems (FRBSs).
    [Show full text]
  • Introduction to Genetic Algorithms S.N.Sivanandam · S.N.Deepa
    Introduction to Genetic Algorithms S.N.Sivanandam · S.N.Deepa Introduction to Genetic Algorithms With 193 Figures and 13 Tables Authors S.N.Sivanandam S.N.Deepa Professor and Head Ph.D Scholar Dept. of Computer Science Dept. of Computer Science and Engineering and Engineering PSG College of Technology PSG College of Technology Coimbatore - 641 004 Coimbatore - 641 004 TN, India TN, India Library of Congress Control Number: 2007930221 ISBN 978-3-540-73189-4 Springer Berlin Heidelberg New York This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilm or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer. Violations are liable for prosecution under the German Copyright Law. Springer is a part of Springer Science+Business Media springer.com c Springer-Verlag Berlin Heidelberg 2008 The use of general descriptive names, registered names, trademarks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. Typesetting: Integra Software Services Pvt. Ltd., India Cover design: Erich Kirchner, Heidelberg Printed on acid-free paper SPIN: 12053230 89/3180/Integra 5 4 3 2 1 0 Preface The origin of evolutionary algorithms was an attempt to mimic some of the processes taking place in natural evolution.
    [Show full text]
  • Training Multilayer Perceptron with Genetic Algorithms and Particle Swarm Optimization for Modeling Stock Price Index Prediction
    entropy Article Training Multilayer Perceptron with Genetic Algorithms and Particle Swarm Optimization for Modeling Stock Price Index Prediction Fatih Ecer 1 , Sina Ardabili 2,3, Shahab S. Band 4 and Amir Mosavi 5,6,7,* 1 Department of Business Administration, Afyon Kocatepe University, Afyonkarahisar 03030, Turkey; [email protected] 2 Biosystem Engineering Department, University of Mohaghegh Ardabili, Ardabil 5619911367, Iran; [email protected] 3 Kando Kalman Faculty of Electrical Engineering, Obuda University, 1034 Budapest, Hungary 4 Future Technology Research Center, College of Future, National Yunlin University of Science and Technology, 123 University Road, Section 3, Douliou, Yunlin 64002, Taiwan; [email protected] 5 Faculty of Civil Engineering, Technische Universität Dresden, 01069 Dresden, Germany 6 Institute of Research and Development, Duy Tan University, Da Nang 550000, Vietnam 7 School of Economics and Business, Norwegian University of Life Sciences, 1430 As, Norway * Correspondence: [email protected] or [email protected] Received: 22 August 2020; Accepted: 28 October 2020; Published: 31 October 2020 Abstract: Predicting stock market (SM) trends is an issue of great interest among researchers, investors and traders since the successful prediction of SMs’ direction may promise various benefits. Because of the fairly nonlinear nature of the historical data, accurate estimation of the SM direction is a rather challenging issue. The aim of this study is to present a novel machine learning (ML) model to forecast the movement of the Borsa Istanbul (BIST) 100 index. Modeling was performed by multilayer perceptron–genetic algorithms (MLP–GA) and multilayer perceptron–particle swarm optimization (MLP–PSO) in two scenarios considering Tanh (x) and the default Gaussian function as the output function.
    [Show full text]