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 5 of 5 for “"Generalized partition"”.

  1. Generalized partition crossover for the traveling salesman problem

    … designed a new recombination operator known as Generalized Partition Crossover (GPX) for the TSP. GPX is unique among other recombination operators for the TSP in that recombining two local optima produces new local optima with a high probability. Thus the operator can 'tunnel' between local …

    colostate Repository record for Generalized partition crossover for the traveling salesman problem (opens in a new tab)

  2. A Generalization of Plane Partitions and Approximations of the Resulting Function

    … results which involve finding approximations of partition functions. The first is by Ayla Gafni in 2016, who found an approximation for the number of ways to partition a number n into k-th powers. The second is by E. M. Wright in 1931, who found an approximation for plane partitions. We look at a …

    mississippi Repository record for A Generalization of Plane Partitions and Approximations of the Resulting Function (opens in a new tab)

  3. A Generalization of The Partition Problem in Statistics

    In this dissertation, the problem of partitioning a set of treatments with respect to a control treatment is considered. Starting in 1950's a number of researchers have worked on this problem and have proposed alternative solutions. In Tong (1979), the authors proposed a formulation to solve this …

    uno Repository record for A Generalization of The Partition Problem in Statistics (opens in a new tab)

  4. The mixing genetic algorithm for traveling salesman problem

    … the Mixing Genetic Algorithm (MGA), using the Generalized Partition Crossover (GPX) operator to overcome these aspects. The GPX consumes 4 x lesser memory and does not access the memory during crossover operation. The MGA is used in three different modes. (1) MGA can converge fast on problems …

    colostate Repository record for The mixing genetic algorithm for traveling salesman problem (opens in a new tab)