Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 46 for “"Genetic Search"”.

  1. Genetic Search for Multi School Routing

    In genetic search for multi school routing, a set of commonly shared school buses and vans with capacity, travel speed and travel time limitations are used to service students from their pick up locations to their respective schools. The goal is to reduce the number of buses used, the total travel …

    ndsu Repository record for Genetic Search for Multi School Routing (opens in a new tab)

  2. A grammar-based technique for genetic search and optimization

    The genetic algorithm (GA) is a robust search technique which has been theoretically and empirically proven to provide efficient search for a variety of problems. Due largely to the semantic and expressive limitations of adopting a bitstring representation, however, the traditional GA has not found …

    wm-mary Repository record for A grammar-based technique for genetic search and optimization (opens in a new tab)

  3. Dynamic Scale Genetic Algorithm: An Enhanced Genetic Search for Discrete Optimization

    … discrete optimization and the simulation domain. Genetic algorithms, offering a robust search strategy suitable for integer variables and the simulation domain, can be applied to minimize these resources. This research developed an enhanced genetic algorithm for problems with a linear objective …

    odu Repository record for Dynamic Scale Genetic Algorithm: An Enhanced Genetic Search for Discrete Optimization (opens in a new tab)

  4. Examining the role of local optima and schema processing in genetic search

    Several factors contribute to making search problems easy or difficult. One of these factors is the modality of the fitness landscape. Quite often, when local search algorithms fail to locate the global optimum, it is because the algorithm converged to a local optimum. The majority of local search …

    colostate Repository record for Examining the role of local optima and schema processing in genetic search (opens in a new tab)

  5. A medial axis transformation language for recongnizing aircraft silhouettes using a genetic search technique

    … This work explores aircraft classification using genetic algorithms for search through a classification space. Two main algorithms comprise this approach. The first produces an assortment of shapes derived from a medial axis transform language (MAT), by establishing a set of genes, a chromosome, …

    ucf Repository record for A medial axis transformation language for recongnizing aircraft silhouettes using a genetic search technique (opens in a new tab)

  6. Hibridinės genetinės paieškos algoritmai transporto maršrutų sudarymo uždaviniams /

    This work investigates the application of Hybrid Genetic Search (HGS) to vehicle routing problems and the acceleration of its local search using GPU hardware. The work reviews the operation of the swap* operator and existing GPU-based local search parallelization methods. A tensor-based formulation …

    vilnius Repository record for Hibridinės genetinės paieškos algoritmai transporto maršrutų sudarymo uždaviniams / (opens in a new tab)

  7. Bajeso metodo taikymas kredito rizikos valdyme /

    … machine learning technique for classification, genetic search as a feature selection method for relevant attribute selection and Altman Z-Score discriminant technique for credit risk evaluation. Bayesian method based classifiers (Naïve Bayes, Bayesian Networks) were explored and used in this …

    vilnius Repository record for Bajeso metodo taikymas kredito rizikos valdyme / (opens in a new tab)

  8. Scheduling healthcare services: An object-orientation approach

    … as more recent optimization techniques, such as genetic search algorithms. The radiology center is considered as a representative of that class of scheduling problems, which is characterized by random arrivals of patients, with stochastic processing times and several servers. For this class, …

    nebraska Repository record for Scheduling healthcare services: An object-orientation approach (opens in a new tab)

  9. Genetic Algorithms for Composite Laminate Design and Optimization

    Genetic algorithms are well known for being expensive optimization tools, especially if the cost for the analysis of each individual design is high. In the past few years, significant effort has been put forth in addressing the high computational cost GAs. The research conducted in the first part …

    vt Repository record for Genetic Algorithms for Composite Laminate Design and Optimization (opens in a new tab)

  10. Optimization of composite structures by genetic algorithms

    … may benefit by knowing many of those designs. Genetic algorithms are well suited for laminate design because they can handle the combinatorial nature of the problem and they permit the designer to obtain many near-optimal designs. However, their computational cost is high for most structural …

    vt Repository record for Optimization of composite structures by genetic algorithms (opens in a new tab)

  11. Linear Programming Assisted Genetic Algorithm for Solving a Comprehensive Job shop Lot Streaming Problem

    … trends in recent years. The focus of research on metaheuristics has also notably shifted from an algorithm-oriented point of view to a problem-oriented one. Many researchers focus on solving a problem at hand as best as possible rather than promoting a certain metaheuristic. This has led …

    guelph Repository record for Linear Programming Assisted Genetic Algorithm for Solving a Comprehensive Job shop Lot Streaming Problem (opens in a new tab)

  12. Nonlinear Extensions to New Causality and a NARMAX Model Selection Algorithm for Causality Analysis

    … are presented. The algorithm combines a genetic search element for regressor selection with a set-theoretic optimal bounded ellipsoid algorithm for parameter estimation. The enhancements to the genetic search make use of sparsity and information theoretic measures to reduce the …

    msu Repository record for Nonlinear Extensions to New Causality and a NARMAX Model Selection Algorithm for Causality Analysis (opens in a new tab)

  13. A kernelized genetic algorithm decision tree with information criteria

    … of a decision tree. This allows the algorithm to search for the best split using the projected feature space information while remaining in the current data space. The decision tree will capture the information of the linear split in the projected feature space and present the corresponding …

    utk-theses Repository record for A kernelized genetic algorithm decision tree with information criteria (opens in a new tab)

  14. An Investigation Into Partitioning Algorithms for Automatic Heterogeneous Compilers

    … of a full-fledged design team, but limited research exists on current partitioning algorithms responsible for separating hardware and software. The purpose of this thesis is to implement various partitioning algorithms onto the same automatic heterogeneous compiler platform to create an apples …

    calpoly Repository record for An Investigation Into Partitioning Algorithms for Automatic Heterogeneous Compilers (opens in a new tab)

  15. Influence of Customer Locations on Heuristics and Solutions for the Vehicle Routing Problem

    … to compare the performance of VRP heuristics, researchers have developed bench-marking datasets. These datasets, however, lack properties found in industry datasets. In this dissertation, we explore how properties of industry datasets influence VRP heuristics and objective functions. In Chapter …

    vt Repository record for Influence of Customer Locations on Heuristics and Solutions for the Vehicle Routing Problem (opens in a new tab)

  16. The optimization of simulation models by genetic algorithms:a comparative study

    … methods. We compare a new technique, genetic search, to two old techniques: the pattern search and the response surface methodology search. The pattern search uses the Hooke and Jeeves algorithm and the response surface method search uses the code of Dennis Smith. The research compares …

    vt Repository record for The optimization of simulation models by genetic algorithms:a comparative study (opens in a new tab)

  17. The GA heuristic generically has hyperbolic fixed points

    … function &Gscr; models the behavior of a simple genetic algorithm, incorporating the genetic operators selec-tion, mutation and crossover. In this model, populations are repre-sented by points in ℜ<sup><em>n</em></sup>. (Typically, in genetic search the populations correspond to points in Λ = …

    utk-theses Repository record for The GA heuristic generically has hyperbolic fixed points (opens in a new tab)

Page 1 of 3