-
Notifications
You must be signed in to change notification settings - Fork 1
/
gen.c
186 lines (154 loc) · 3.76 KB
/
gen.c
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
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <assert.h>
#include "heap.h"
#include "game.h"
#include "gen.h"
#define MIN(x, y) ((x) < (y) ? (x) : (y))
#define MAX(x, y) ((x) > (y) ? (x) : (y))
#define NUM_ELEMENTS 300
typedef struct {
int *vet;
float cost;
} ga_state;
static ga_state _elements[NUM_ELEMENTS];
static inline void mutation(int *state);
static inline void recomb(int *son, int *father1, int *father2);
static inline void create_random_element(ga_state *c);
static inline void ga_evolve(void);
static inline void ga_update_cost(ga_state *state);
static inline void ga_dump_vet(int *vet, int sz);
static inline void ga_assert_element(ga_state *state, char *str);
static inline void ga_dump_vet(int *vet, int sz)
{
int i;
for (i = 0; i < sz; i++) {
printf("%d ", vet[i]);
}
printf("\n");
}
static inline void mutation(int *state)
{
int num_prizes = G.gi.num_prizes;
int i = (rand() % num_prizes) + 1;
int j = (rand() % num_prizes) + 1;
/* 0.01 chance of happening. */
if ((rand() % 10) == 0) {
int aux = state[i];
state[i] = state[j];
state[j] = aux;
}
}
static inline void recomb(int *son_, int *father1, int *father2)
{
int i;
int n;
int num_prizes = G.gi.num_prizes;
int swap_points = rand();
int tainted[num_prizes+1];
int order[num_prizes];
int son[num_prizes];
memset(tainted, 0, sizeof(int)*(num_prizes+1));
son[0] = 0;
son[num_prizes+1] = num_prizes+1;
for (i=1; i<num_prizes+1; i++) {
if (swap_points & (1 << i)) {
son[i] = father1[i];
} else {
tainted[father1[i]] = 1;
}
}
for (n=0, i=1; i<num_prizes+1; i++) {
if (tainted[father2[i]]) {
order[n++] = father2[i];
}
}
for (n=0, i=1; i<num_prizes+1; i++) {
if (!(swap_points & (1 << i))) {
son[i] = order[n++];
}
}
for (i=0; i<num_prizes+2; i++)
son_[i] = son[i];
}
static inline void create_random_element(ga_state *c)
{
int i;
int num_rand_op = 100;
int num_prizes = G.gi.num_prizes;
for (i=0; i<num_prizes+2; i++) c->vet[i] = i;
for (i = 0; i < num_rand_op; i++) mutation(c->vet);
ga_update_cost(c);
}
static inline void ga_assert_element(ga_state *state, char *str)
{
int i, j, k;
for (i=0, j=0, k=0; i < G.gi.num_prizes+2; i++) {
j += i;
k += state->vet[i];
}
if (j != k) {
for (i=0; i < G.gi.num_prizes+2; i++)
printf("%d ", state->vet[i]);
printf("\n");
printf("%s j=%d k=%d\n", str, j, k);
}
assert(j == k);
}
static inline void ga_update_cost(ga_state *state)
{
int i;
state->cost=0;
for (i=0; i < G.gi.num_prizes+1; i++) {
state->cost += graph[mkcostidx(state->vet[i], state->vet[i+1])].cost;
}
assert(state->cost > 0);
}
int ga_compare(const void *_v1, const void *_v2)
{
ga_state *v1 = (ga_state *)_v1;
ga_state *v2 = (ga_state *)_v2;
return v1->cost > v2->cost;
}
static inline void ga_evolve_step(int i)
{
recomb(_elements[NUM_ELEMENTS-i-1].vet,
_elements[i].vet,
_elements[i+1].vet);
ga_update_cost(&_elements[NUM_ELEMENTS-i-1]);
mutation(_elements[i].vet);
ga_update_cost(&_elements[i]);
mutation(_elements[i+1].vet);
ga_update_cost(&_elements[i+1]);
}
static inline void ga_evolve(void)
{
int i;
qsort(_elements, NUM_ELEMENTS, sizeof(ga_state), ga_compare);
for (i = 0; i < NUM_ELEMENTS/3; i++) {
ga_evolve_step(i);
}
}
int *ga_solve_tsp(int num_iterations, float *cost)
{
float min;
int min_idx = 0;
int i;
for (i=0; i<NUM_ELEMENTS; i++)
_elements[i].vet = malloc(sizeof(int) * (G.gi.num_prizes+2));
/* initialize the elements. */
for (i=0; i<NUM_ELEMENTS; i++) {
create_random_element(&_elements[i]);
ga_update_cost(&_elements[i]);
}
for (i=0; i<num_iterations; i++) ga_evolve();
for (min=1000000, i=0; i<NUM_ELEMENTS; i++) {
if (min < _elements[i].cost) {
min = _elements[i].cost;
min_idx = i;
}
}
*cost = _elements[min_idx].cost;
return _elements[min_idx].vet;
}