-
Notifications
You must be signed in to change notification settings - Fork 0
/
ant.cpp
261 lines (218 loc) · 5.85 KB
/
ant.cpp
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
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
#include "ant.h"
#include <QDebug>
#include <QVector2D>
int Ant::speed = 10.0;
double Ant::pheromoneExponent = 4.0;
double Ant::distanceExponent = 2.50;
int Ant::mutation = 3;
Ant::Ant(QSP<City> &startingCity, int index, int numCities) :
Entity(QPointF(startingCity->getLocation())),
startCity(index),
fromCity(index),
toCity(-1),
doneTour(false)
{
ellipse = new QGraphicsEllipseItem(LOC_HELPER(location,ANT_RADIUS));
ellipse->setPen(QPen(ANT_COLOR));
ellipse->setBrush(QBrush(ANT_COLOR));
ellipse->setZValue(ANT_Z);
for (int i = 0; i < numCities; i++)
tabu.append(i == index);
}
Ant::~Ant()
{
delete ellipse;
}
QGraphicsItem *Ant::getGraphicsItem()
{
return ellipse;
}
bool Ant::update(QList<QSP<City> > &cities)
{
if (cities.length() < 2)
return false;
if (toCity == -1)
chooseNextCity(cities);
double speedLeft = speed;
if (speedLeft > 100.0)
speedLeft = INT_MAX;
double distance;
if (doneTour)
return doneTour;
while(!doneTour) {
distance = dist(location, cities.at(toCity)->getLocation());
// you can make it to the destination this turn. Move there, pick next city
if (distance - speedLeft < 0.0001) {
speedLeft -= distance;
location = cities.at(toCity)->getLocation();
chooseNextCity(cities);
} else {
break;
}
}
//move speedLeft amount towards toCity
if (!doneTour && speedLeft > 0) {
QPointF dest = cities.at(toCity)->getLocation();
QVector2D move(dest - location);
move.normalize();
move *= speedLeft;
location.setX(location.x() + move.x());
location.setY(location.y() + move.y());
}
updateEllipse();
return doneTour;
}
bool Ant::removeCity(int cityIndex)
{
tabu.removeAt(cityIndex);
if (cityIndex == fromCity || cityIndex == toCity || startCity == cityIndex)
return true;
if (cityIndex < fromCity)
fromCity--;
if (cityIndex < toCity)
toCity--;
if (cityIndex < startCity)
startCity--;
for (int i = 0; i < tour.length(); i++) {
if (tour.at(i) == cityIndex) {
tour.removeAt(i);
i--;
} else if (tour.at(i) > cityIndex) {
tour[i] = tour[i] - 1;
}
}
return false;
}
void Ant::addCity()
{
tabu.append(false);
}
void Ant::updateEllipse()
{
if (speed > 100) {
ellipse->setVisible(false);
} else {
ellipse->setRect(LOC_HELPER(location,ANT_RADIUS));
ellipse->setVisible(true);
}
}
void Ant::chooseNextCity(QList<QSP<City> > &cities)
{
if (cities.length() <= 1 || doneTour)
return;
if (toCity >= 0) {
tour.append(fromCity);
tabu[toCity] = true;
fromCity = toCity;
//ant has completed its tour
if (fromCity == startCity) {
doneTour = true;
toCity = -1;
return;
}
}
QList<double> cityProb;
double currentProb;
double total = 0.0;
QSP<Edge> edge;
//if every city has been visited, return to the starting city
if (!tabu.contains(false)) {
toCity = startCity;
return;
}
//set chance to visit any particular neighbour that hasn't been visited this cycle
for (int i = 0; i < cities.length(); i++) {
currentProb = 0;
if (!tabu.at(i)) {
edge = cities.at(fromCity)->edgeForNeighbour(i);
currentProb = qPow(edge->getPheromone(), pheromoneExponent) * qPow(1.0/cities.at(fromCity)->distance(i), distanceExponent);
}
total += currentProb;
cityProb.append(currentProb);
}
if (total == 0 || (qrand() % 100) < mutation) {
chooseRandomCity();
return;
}
for (int i = 0; i < cityProb.length(); i++)
cityProb[i] = cityProb[i] / total;
bool allZero = true;
do {
//pick a neighbour proportional to its inverse distance and pheromone
double random = ((double)qrand() / RAND_MAX);
for (int i = 0; i < cities.length(); i++) {
allZero &= (cityProb[i] == 0.0);
if (random - cityProb[i] < 0.000001 && !tabu.at(i)) {
toCity = i;
break;
}
random -= cityProb[i];
}
if (allZero)
break;
} while (toCity == fromCity || toCity < 0);
if (allZero) {
chooseRandomCity();
return;
}
}
void Ant::chooseRandomCity()
{
int random;
while (true) {
random = qrand() % tabu.length();
if (!tabu.at(random)) {
toCity = random;
return;
}
}
}
BestDistancePheromone Ant::addPheromoneToTour(QList<QSharedPointer<City> > &cities)
{
double tourLength = 0.0;
for (int i = 0; i < tour.length(); i++)
tourLength += cities.at(tour.at(i))->distance(tour.at((i + 1) % tour.length()));
double pheromoneAdd = 1.0/tourLength;
double bestPheromone = 0.0, curr;
for (int i = 1; i < tour.length(); i++) {
curr = cities.at(tour.at(i))->addPheromone(tour.at(i-1), pheromoneAdd);
if (curr > bestPheromone)
bestPheromone = curr;
}
cities.at(tour.at(0))->addPheromone(tour.last(), pheromoneAdd);
return BestDistancePheromone(tourLength, bestPheromone);
}
void Ant::resetTour()
{
fromCity = startCity;
toCity = -1;
for (int i = 0; i < tabu.length(); i++) {
tabu[i] = (fromCity == i);
}
tour.clear();
doneTour = false;
}
QList<int> Ant::getTour()
{
return tour;
}
int Ant::tourLength()
{
return tour.length();
}
void Ant::setSpeed(int speed)
{
Ant::speed = speed;
}
void Ant::setPheromoneImportance(int val)
{
pheromoneExponent = val/10.0;
}
void Ant::setDistanceImportance(int val)
{
distanceExponent = val/10.0;
}
void Ant::setMutation(int val)
{
mutation = val;
}