aboutsummaryrefslogtreecommitdiff
path: root/src/include/optimizer/geqo_recombination.h
blob: baa7fc24fa425614d73a490b4ecb741ca26cb4e9 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
/*-------------------------------------------------------------------------
 *
 * geqo_recombination.h--
 *    prototypes for recombination in the genetic query optimizer
 *
 * Copyright (c) 1994, Regents of the University of California
 *
 * $Id: geqo_recombination.h,v 1.1 1997/02/19 12:59:04 scrappy Exp $
 *
 *-------------------------------------------------------------------------
 */

/* contributed by:
   =*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=
   *  Martin Utesch              * Institute of Automatic Control      *
   =                             = University of Mining and Technology =
   *  utesch@aut.tu-freiberg.de  * Freiberg, Germany                   *
   =*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=*=
 */

/* -- parts of this are adapted from D. Whitley's Genitor algorithm -- */

#ifndef GEQO_RECOMBINATION_H
#define GEQO_RECOMBINATION_H


extern void init_tour(Gene *tour, int num_gene);


/* edge recombination crossover [ERX] */

typedef struct Edge {
  Gene edge_list[4]; /* list of edges */
  int  total_edges;
  int  unused_edges;
} Edge;

extern Edge *alloc_edge_table(int num_gene);
extern void free_edge_table(Edge *edge_table);

extern float gimme_edge_table (Gene *tour1, Gene *tour2, int num_gene, Edge *edge_table);

extern int gimme_tour(Edge *edge_table, Gene *new_gene, int num_gene);


/* partially matched crossover [PMX] */

#define DAD 1                 /* indicator for gene from dad */
#define MOM 0                 /* indicator for gene from mom */
 
extern void pmx(Gene *tour1, Gene *tour2, Gene *offspring, int num_gene);


typedef struct City {
  int	tour2_position;
  int	tour1_position;
  int	used;
  int	select_list;
} City;

extern City *alloc_city_table(int num_gene);
extern void free_city_table(City *city_table);

/* cycle crossover [CX] */
extern int cx(Gene *tour1, Gene *tour2, Gene *offspring, int num_gene, City *city_table);

/* position crossover [PX] */
extern void px(Gene *tour1, Gene *tour2, Gene *offspring, int num_gene, City *city_table);

/* order crossover [OX1] according to Davis */
extern void ox1(Gene *mom, Gene *dad, Gene *offspring, int num_gene, City *city_table);

/* order crossover [OX2] according to Syswerda */
extern void ox2(Gene *mom, Gene *dad, Gene *offspring, int num_gene, City *city_table);


#endif /* GEQO_RECOMBINATION_H */