-
Notifications
You must be signed in to change notification settings - Fork 0
/
main.cpp
390 lines (363 loc) · 16.1 KB
/
main.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
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
// -*- C++ -*-
#include "tsp_discrete_enn.hpp"
#include "utils.hpp"
#include <fstream>
namespace stdfs = std::filesystem;
const std::string& Data_Optimal_Filename{ "Data/tsp_optimal_distances.csv" };
const stdfs::path Data_Optimal_Path{ utils::getCleanPath(
stdfs::current_path() / stdfs::path(Data_Optimal_Filename)) };
const std::string& Data_Dir{ "Data/ALL_tsp" };
const std::string& Data_Filename_berlin{ "berlin52.tsp" };
const stdfs::path& Output_Path{ "Output" };
int runPipelineSingle(TSPInfo& info, const stdfs::path& data_path,
std::default_random_engine& rng, DiscreteENN_TSP& enn_tsp);
int runPipelineDir(TSPInfoVect_t& infos, const TSPInfoVect_t& opt_infos,
const stdfs::path& data_path,
std::default_random_engine& rng, DiscreteENN_TSP& enn_tsp);
int main(int argc, char** argv)
{
const auto args_count{ static_cast<std::size_t>(argc) };
std::vector<std::string> args(args_count - 1);
for (std::size_t idx{ 1 }; idx < args_count; ++idx) {
args[idx - 1] = std::string(argv[idx]);
#if (DEBUG_PRINT > 1)
std::cout << "#" << idx << " flag " << args[idx - 1] << '\n';
#endif
}
// -------------------------------------------
// Seed and initialize rng
// -------------------------------------------
std::random_device::result_type seed{ std::random_device{}() };
std::default_random_engine rng{ seed };
// -------------------------------------------
// Read optimal distances
// -------------------------------------------
TSPInfoVect_t optimal_infos;
if (not readDistances(Data_Optimal_Path.string(), optimal_infos)) {
utils::printErr("Couldn't read optimal distances from " +
Data_Optimal_Path.string(),
"main");
return EXIT_FAILURE;
}
const bool single_input{ utils::vectContains(std::string{ "--single" },
args) };
const bool draw_path{ utils::vectContains(std::string{ "--draw" }, args) };
const bool draw_coords{ utils::vectContains(std::string{ "--show-coords" },
args) };
const bool draw_failed{ utils::vectContains(std::string{ "--draw-failed" },
args) };
const bool randomize{ utils::vectContains(std::string{ "--random" },
args) };
DiscreteENN_TSP enn_tsp;
enn_tsp.draw() = draw_path;
enn_tsp.drawFailed() = draw_failed;
enn_tsp.drawCoords() = draw_coords;
enn_tsp.shuffleCities() = randomize;
std::string Data_Filename{ Data_Filename_berlin };
stdfs::path Data_Path{ utils::getCleanPath(stdfs::current_path() /
stdfs::path(Data_Dir)) };
if (utils::vectContains(std::string{ "--input" }, args)) {
const auto it =
std::find_if(args.begin(), args.end(),
utils::MatchItem<std::string>{ "--input" });
const std::string& input{ *(it + 1) };
if (single_input) {
Data_Filename = input;
if (Data_Filename.find(".tsp") == std::string::npos) {
Data_Filename += ".tsp";
}
} else {
Data_Path = utils::getCleanPath(input);
}
}
int runs_failed;
TSPInfoVect_t infos;
infos.reserve(optimal_infos.size());
if (single_input) {
stdfs::path Data_FilePath = Data_Path / stdfs::path(Data_Filename);
TSPInfo info{};
runs_failed = runPipelineSingle(info, Data_FilePath, rng, enn_tsp);
if (runs_failed == 0) {
infos.push_back(info);
} else {
utils::printErr("Single input pipeline failed for Data_FilePath: " +
Data_FilePath.string(),
"main");
}
} else {
runs_failed = runPipelineDir(infos, optimal_infos, Data_Path, rng,
enn_tsp);
}
if (runs_failed != 0) {
utils::printErr("Runs failed: " + std::to_string(runs_failed) +
" Data_Path: " + Data_Path.string(),
"main");
return EXIT_FAILURE;
}
for (auto it{ infos.begin() }; it != infos.end(); ++it) {
TSPInfo& info{ *it };
int opt_info_pos{ utils::vectFind(info, optimal_infos) };
if (opt_info_pos == -1) {
utils::printErr("data name : " + info.m_name +
" not found in optimal_distance_map",
"main");
continue;
}
// if (name == "pr2392") {
// utils::printInfo("skipping file pr2392 because of long run time.", "runPipelineDir");
// continue;;
// }
TSPInfo& optimal_info{
optimal_infos[static_cast<std::size_t>(opt_info_pos)]
};
const auto error = std::abs(info.m_distance - optimal_info.m_distance) /
optimal_info.m_distance;
info.m_error = utils::getRound2(error * 100);
info.m_distance = utils::getRound2(info.m_distance);
optimal_info.m_distance = utils::getRound2(optimal_info.m_distance);
}
// const std::string& table_header{ "name\tpoints\terror\ttime(" + time_unit + ")\ttime per city(" + time_unit + ")\ttime per city min(" + time_unit + ")\ttime per city max(" + time_unit + ")\tdistance\toptimal_distance" };
const std::string& table_header{ "name\tpoints\terror\ttime(" + time_unit +
")\ttime per city(" + time_unit +
")\tdistance\toptimal_distance" };
utils::printInfo(table_header);
for (auto it{ optimal_infos.begin() }; it != optimal_infos.end(); ++it) {
TSPInfo& opt_info{ *it };
int info_pos{ utils::vectFind(opt_info, infos) };
if (info_pos == -1) {
// utils::printInfo("skipping file " + opt_info.m_name +
// " for which algorithm was not run.",
// "main");
continue;
}
TSPInfo& info{ infos[static_cast<std::size_t>(info_pos)] };
utils::printInfo(info.m_name + "\t" + std::to_string(info.m_points) +
"\t" + std::to_string(info.m_error) + "\t" +
std::to_string(info.m_time) + "\t" +
std::to_string(info.m_timePerCity) + "\t" +
// std::to_string(info.m_timePerCityMin) + "\t" +
// std::to_string(info.m_timePerCityMax) + "\t" +
std::to_string(info.m_distance) + "\t" +
std::to_string(opt_info.m_distance));
}
std::ofstream table_file{ Output_Path/"DiscreteENN_TSP_table.txt" };
table_file << table_header << std::endl;
for (auto it{ optimal_infos.begin() }; it != optimal_infos.end(); ++it) {
TSPInfo& opt_info{ *it };
int info_pos{ utils::vectFind(opt_info, infos) };
if (info_pos == -1) {
// utils::printInfo("skipping file " + opt_info.m_name +
// " for which algorithm was not run.",
// "main");
continue;
}
TSPInfo& info{ infos[static_cast<std::size_t>(info_pos)] };
table_file << (info.m_name + "\t" + std::to_string(info.m_points) +
"\t" + std::to_string(info.m_error) + "\t" +
std::to_string(info.m_time) + "\t" +
std::to_string(info.m_timePerCity) + "\t" +
// std::to_string(info.m_timePerCityMin) + "\t" +
// std::to_string(info.m_timePerCityMax) + "\t" +
std::to_string(info.m_distance) + "\t" +
std::to_string(opt_info.m_distance))
<< std::endl;
}
table_file.close();
std::ofstream csv_file{ Output_Path/"DiscreteENN_TSP_table.csv" };
csv_file << utils::subtituteStr(table_header, "\t", ",") << std::endl;
for (auto it{ optimal_infos.begin() }; it != optimal_infos.end(); ++it) {
TSPInfo& opt_info{ *it };
int info_pos{ utils::vectFind(opt_info, infos) };
if (info_pos == -1) {
// utils::printInfo("skipping file " + opt_info.m_name +
// " for which algorithm was not run.",
// "main");
continue;
}
TSPInfo& info{ infos[static_cast<std::size_t>(info_pos)] };
csv_file << (info.m_name + "," + std::to_string(info.m_points) + "," +
std::to_string(info.m_error) + "," +
std::to_string(info.m_time) + "," +
std::to_string(info.m_timePerCity) + "," +
// std::to_string(info.m_timePerCityMin) + "," +
// std::to_string(info.m_timePerCityMax) + "," +
std::to_string(info.m_distance) + "," +
std::to_string(opt_info.m_distance))
<< std::endl;
}
csv_file.close();
return 0;
}
int runPipelineDir(TSPInfoVect_t& infos, const TSPInfoVect_t& opt_infos,
const stdfs::path& data_path,
std::default_random_engine& rng, DiscreteENN_TSP& enn_tsp)
{
if (not stdfs::is_directory(data_path)) {
utils::printErr("provided path " + data_path.string() +
" doesn't exit.",
"runPipelineDir");
return 1;
}
infos.clear();
int runs_failed{ 0 };
for (const auto& entry : stdfs::directory_iterator(data_path)) {
const auto filepath = entry.path();
if (entry.is_directory()) {
utils::printInfo("skipping directory " + filepath.string(),
"runPipelineDir");
continue;
}
TSPInfo info;
const std::string& filename{ filepath.stem().string() };
info.m_name = filename;
int opt_info_pos{ utils::vectFind(info, opt_infos) };
if (opt_info_pos == -1) {
utils::printInfo("skipping file " + filepath.string() +
" without optimal distance for TSP.",
"runPipelineDir");
continue;
}
// if (filename == "pr2392") {
// utils::printInfo("skipping file pr2392 because of long run time.", "runPipelineDir");
// continue;;
// }
if (runPipelineSingle(info, filepath, rng, enn_tsp) != 0) {
utils::printErr("pipeline failed for the path " + filepath.string(),
"runPipelineDir");
++runs_failed;
break;
}
infos.push_back(info);
}
return runs_failed;
}
int runPipelineSingle(TSPInfo& info, const stdfs::path& data_path,
std::default_random_engine& rng, DiscreteENN_TSP& enn_tsp)
{
utils::printInfo("Running algorithm for " + data_path.string(),
"runPipelineSingle");
const std::string& filename{ data_path.stem().string() };
// -------------------------------------------
// Create and setup Discrete ENN Solver
// -------------------------------------------
enn_tsp.name() = filename;
Cities_t& cities{ enn_tsp.cities() };
Indices_t& path = enn_tsp.path();
{
// -------------------------------------------
// Parse cities
// -------------------------------------------
Cities_t cities_tmp;
parseCities(cities_tmp, data_path.string());
if (enn_tsp.shuffleCities()) {
std::shuffle(cities_tmp.begin(), cities_tmp.end(), rng);
}
const int num_cities = cities_tmp.size();
// -------------------------------------------
// Calculate layer details
// -------------------------------------------
int layers{ 0 };
int layers_val{ 1 };
while (true) {
++layers;
layers_val *= 4;
if (layers_val >= num_cities)
break;
}
std::printf(
"[Info] (runPipelineSingle): Total number of layers expected %d (power of 4 : %d) for number of cities %d.\n",
layers, layers_val, num_cities);
// -------------------------------------------
// Construct Stack
// -------------------------------------------
createStack(cities_tmp, cities, layers);
// createStack(cities_tmp, cities);
std::printf("[Info] (runPipelineSingle): Total number of layers created %d.\n", layers);
}
const std::size_t num_cities = cities.size();
// -------------------------------------------
// Initialize
// -------------------------------------------
enn_tsp.initialize();
if (path.size() == static_cast<std::size_t>(num_cities)) {
std::printf(
"[Info]: Algorithm complete. Only %zu number of cities provided.",
num_cities);
return 0;
}
// -------------------------------------------
// Construct Path
// -------------------------------------------
enn_tsp.constructInitialPath();
{
#if (TSP_DEBUG_PRINT > 0)
std::cout << ("\n[Debug] (runPipelineSingle): validatePath\n");
#endif
IndexExp_t<bool> erased = enn_tsp.validatePath();
if (erased.err()) {
std::cerr << "[Error] (runPipelineSingle): validatePath failed\n";
return 1;
}
#if (TSP_DEBUG_PRINT > 0)
std::cout << ("\n[Debug] (runPipelineSingle): validatePath updateCostAll\n");
#endif
if (erased.has_value() and path.size() > 2) {
const auto [idx_fail, err] = enn_tsp.updateCostAll();
if (err) {
std::cerr << "[Error] (runPipelineSingle): updateCostAll failed at index "
<< idx_fail << '\n';
return 1;
}
}
}
// -------------------------------------------
// Run Discrete ENN
// -------------------------------------------
std::cout << ("\n[Info] (runPipelineSingle): Run Discrete ENN Algorithm\n");
TimePoint_t start_time = std::chrono::steady_clock::now();
const bool success = enn_tsp.run(rng);
TimePoint_t end_time = std::chrono::steady_clock::now();
if (not success) {
std::cerr << "[Error] (runPipelineSingle): Discrete ENN run failed.\n";
if (enn_tsp.drawFailed()) {
drawPath(path, cities, enn_tsp.drawCoords(), filename);
}
return 1;
}
auto delta = std::chrono::duration_cast<TimeUnit_t>(end_time - start_time);
const auto duration = delta.count();
std::cout << "\n" + utils::Line_Str + "\n";
std::cout << "[Info] (runPipelineSingle): Algorithm finished in " << duration
<< time_unit + "\n";
std::cout << utils::Line_Str + "\n";
assert("[Error] (runPipelineSingle): path size not equal to number of cities" &&
(path.size() == num_cities));
const std::size_t num_nodes = path.size();
// -------------------------------------------
// Show results
// -------------------------------------------
std::cout << "[Info] (runPipelineSingle): Print results\n";
Value_t dist{ 0.0 };
for (std::size_t idx{ 0 }; idx != num_nodes; ++idx) {
// path[idx]->print();
const auto idx_next{ enn_tsp.properIndex(idx + 1) };
dist += getDistance(cities[path[idx]], cities[path[idx_next]]);
}
info.m_name = filename;
info.m_distance = dist;
info.m_points = num_cities;
info.m_time = utils::getRound2(duration);
info.m_timePerCity =
utils::getRound2(static_cast<Value_t>(duration) / num_cities);
// info.m_timePerIter = enn_tsp.timePerCity();
// std::tie(info.m_timePerCityMin, info.m_timePerCityMax) = enn_tsp.timePerCityMinMax();
std::cout << "\n" + utils::Line_Str + "\n";
std::cout << "[Info] (runPipelineSingle): Total distance is : " << dist << '\n';
std::cout << utils::Line_Str + "\n";
if (enn_tsp.draw()) {
drawPath(path, cities, enn_tsp.drawCoords(), filename);
}
utils::printInfo("Finished algorithm for " + data_path.string(),
"runPipelineSingle");
return 0;
}