By Topic

Evolutionary Computation, IEEE Transactions on

Issue 4 • Date Nov. 1997

Filter Results

Displaying Results 1 - 8 of 8
  • Genetic Programming 1997: Proceedings Of The Second Annual Conference On Genetic Programming [Book Reviews]

    Publication Year: 1997 , Page(s): 294 - 295
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | PDF file iconPDF (17 KB)  
    Freely Available from IEEE
  • Using cultural algorithms to support re-engineering of rule-based expert systems in dynamic performance environments: a case study in fraud detection

    Publication Year: 1997 , Page(s): 225 - 243
    Cited by:  Papers (15)  |  Patents (5)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (296 KB)  

    A significant problem in the application of rule-based expert systems has arisen in the area of re-engineering such systems to support changes in initial requirements. In dynamic performance environments, the rate of change is accelerated and the re-engineering problem becomes significantly more complex. One mechanism to respond to such dynamic changes is to utilize a cultural algorithm (CA). The ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hybrid genetic algorithms for constrained placement problems

    Publication Year: 1997 , Page(s): 266 - 277
    Cited by:  Papers (16)  |  Patents (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (280 KB)  

    When solving real-world problems, often the main task is to find a proper representation for the candidate solutions. Strings of elementary data types with standard genetic operators may tend to create infeasible individuals during the search because of the discrete and often constrained search space. This article introduces a generally applicable representation for 2D combinatorial placement and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Training multiple-layer perceptrons to recognize attractors

    Publication Year: 1997 , Page(s): 244 - 248
    Cited by:  Papers (8)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (124 KB)  

    Determining the long-term behavior in dynamical systems is an area of intense research interest. In this paper, a multilayer perceptron is used to perform this task. The network is trained using an evolution strategy. A comparison against backpropagation-trained networks was performed, and the results indicate evolution strategies produce better performing networks View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using genetic algorithms in process planning for job shop machining

    Publication Year: 1997 , Page(s): 278 - 289
    Cited by:  Papers (50)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (260 KB)  

    This paper presents a novel computer-aided process planning model for machined parts to be made in a job shop manufacturing environment. The approach deals with process planning problems in a concurrent manner in generating the entire solution space by considering the multiple decision-making activities, i.e., operation selection, machine selection, setup selection, cutting tool selection, and ope... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Schema processing under proportional selection in the presence of random effects

    Publication Year: 1997 , Page(s): 290 - 293
    Cited by:  Papers (12)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (140 KB)  

    Traditional selection in genetic algorithms has relied on reproduction in proportion to observed fitness. This method of selection devotes samples to the observed schemata in a form described by the well known schema theorem. When schema fitness takes the form of a random variable, however, the expected number of samples from extant schemata may not be described by the schema theorem and varies ac... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Local convergence rates of simple evolutionary algorithms with Cauchy mutations

    Publication Year: 1997 , Page(s): 249 - 258
    Cited by:  Papers (27)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (476 KB)  

    The standard choice for mutating an individual of an evolutionary algorithm with continuous variables is the normal distribution; however other distributions, especially some versions of the multivariate Cauchy distribution, have recently gained increased popularity in practical applications. Here the extent to which Cauchy mutation distributions may affect the local convergence behavior of evolut... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Genetic algorithm optimization for blind channel identification with higher order cumulant fitting

    Publication Year: 1997 , Page(s): 259 - 265
    Cited by:  Papers (18)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (244 KB)  

    An important family of blind equalization algorithms identify a communication channel model based on fitting higher order cumulants, which poses a nonlinear optimization problem. Since higher order cumulant-based criteria are multimodal, conventional gradient search techniques require a good initial estimate to avoid converging to local minima. We present a novel scheme which uses genetic algorith... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.

Aims & Scope

IEEE Transactions on Evolutionary Computation publishes archival quality original papers in evolutionary computation and related areas including nature-inspired algorithms, population-based methods, and optimization where selection and variation are integral, and hybrid systems where these paradigms are combined. Purely theoretical papers are considered as are application papers that provide general insights into these areas of computation.
 

Full Aims & Scope

Meet Our Editors

Editor-in-Chief

Dr. Kay Chen Tan (IEEE Fellow)

Department of Electrical and Computer Engineering

National University of Singapore

Singapore 117583

Email: eletankc@nus.edu.sg

Website: http://vlab.ee.nus.edu.sg/~kctan