human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent groups of papers sharing a common citing paper.

Details of the hypergraph:
Center node: "A Generalized Permutation Approach to Job Shop Scheduling with Genetic Algorithms"
  Abstract: In order to sequence the tasks of a job shop problem (JSP) on a number of machines related to the technological machine order of jobs, a new representation technique mathematically known as "permutation with repetition" is presented. The main advantage of this single chromosome representation is in analogy to the permutation scheme of the traveling salesman problem (TSP) that it cannot produce illegal sets of operation sequences (infeasible symbolic solutions). As a consequence of the representation scheme a new crossover operator preserving the initial scheme structure of permutations with repetition will be sketched. Its behavior is similar to the well known Order-Crossover for simple permutation schemes. Actually the GOX operator for permutations with repetition arises from a Generalisation of OX. Computational experiments show, that GOX passes the information from a couple of parent solutions efficiently to offspring solutions. Together, the new representation and GOX support the cooperative aspect of the genetic search for scheduling problems strongly.

Connected through hyperedge HE-1 (induced by source paper "The Application of a Parallel Genetic Algorithm to the n=m=P=C max Flowshop Problem"):
  with members:
    - "4 Implementing Application Specific Routines  Genetic algorithms in search, optimization, and machine learning. Reading, MA: Addison-Wesley."

Connected through hyperedge HE-2 (induced by source paper "Genetic Algorithm based Scheduling in a Dynamic Manufacturing Environment"):
  with members:
    - "Control of Parallel Population Dynamics by Social-Like Behavior of GA-Individuals"

Connected through hyperedge HE-3 (induced by source paper "Control of Parallel Population Dynamics by Social-Like Behavior of GA-Individuals"):
  with members:
    - "Genetic Algorithm based Scheduling in a Dynamic Manufacturing Environment"

Connected through hyperedge HE-4 (induced by source paper "Using Neural Networks and Genetic Algorithms as Heuristics for NP-Complete Problems"):
  with members:
    - "4 Implementing Application Specific Routines  Genetic algorithms in search, optimization, and machine learning. Reading, MA: Addison-Wesley."
    - "HGA: A Hardware-Based Genetic Algorithm"
    - "Vector Quantizer Design Using Genetic Algorithms"
    - "A Comparative Study of Genetic Search"
    - "Using Problem Generators to Explore the Effects of Epistasis"
    - "How good are genetic algorithms at finding large cliques: an experimental study"
    - "An Evolutionary Approach to Vector Quantizer Design"
    - "Using Genetic Algorithms for Supervised Concept Learning"

Question: Please tell me which class the center node belongs to. The 7 classes are: Neural_Networks, Reinforcement_Learning, Probabilistic_Methods, Theory, Genetic_Algorithms, Case_Based, Rule_Learning. Directly output the class name.

gpt: Genetic_Algorithms