Commit Graph

43 Commits

Author SHA1 Message Date
coolneng 3e0dbb9168
Populate results with mean and std deviation 2021-04-20 11:58:24 +02:00
coolneng 9ab8ec3d8a
Add execution script 2021-04-20 01:21:30 +02:00
coolneng ed76d07345
Add user manual to summary 2021-04-20 00:02:38 +02:00
coolneng 94570601e1
Add algorithms pseudocode in the summary 2021-04-19 22:15:57 +02:00
coolneng b937b41853
Revert "Revert "Remove iteration print statement""
This reverts commit bd4a88bb4e.
2021-04-19 20:27:56 +02:00
coolneng 097ed9b52a
Remove redundant previous solution checks 2021-04-19 18:29:11 +02:00
coolneng bd4a88bb4e
Revert "Remove iteration print statement"
This reverts commit 9ef41abe46.
2021-04-19 16:17:52 +02:00
coolneng 9ef41abe46
Remove iteration print statement 2021-04-19 15:53:13 +02:00
coolneng 8b5029645f
Return the best solution when you can't explore 2021-04-19 15:51:39 +02:00
coolneng 2eb84a6883
Only insert element that are not duplicated 2021-04-19 15:51:12 +02:00
coolneng 5e6a6d00e9
Remove duplicates in local search 2021-04-16 20:07:31 +02:00
coolneng 028db4ba91
Return best solution or the same if there's none 2021-04-16 20:06:13 +02:00
coolneng 3e08b67371
Simplify worst element replacement 2021-04-16 20:05:45 +02:00
coolneng 5812d470a9
Add numpy dependency 2021-04-15 23:28:57 +02:00
coolneng 1f2fde1abf
Move each algorithm into a diffent module 2021-04-15 22:07:44 +02:00
coolneng b584239d6e
Rename variable in remove_duplicates function 2021-04-15 22:01:40 +02:00
coolneng aa4a3fdec9
Set initial distance to 0 in the greedy algorithm 2021-04-15 20:51:21 +02:00
coolneng 193e9046eb
Refactor neighbourhood exploration 2021-04-15 20:13:19 +02:00
coolneng e3c55ca89f
Refactor random solution generation 2021-04-15 20:05:15 +02:00
coolneng 98a86a97c0
Minor refactor in results report 2021-04-15 18:35:31 +02:00
coolneng 1cf8a2696a
Implement local search algorithm 2021-04-14 19:26:13 +02:00
coolneng 33a9cf323a
Check if the random candidate is a duplicate 2021-04-14 19:25:25 +02:00
coolneng da234aae96
Implement best first local search algorithm 2021-04-14 18:34:52 +02:00
coolneng b3211ff682
Select m random elements as the first solution 2021-04-13 23:01:37 +02:00
coolneng bf7ca7f520
Remove duplicates in an efficient way 2021-04-13 22:44:31 +02:00
coolneng 75c3a94fbe
Change metric in Greedy algorithm 2021-04-13 22:44:17 +02:00
coolneng b63b5b08b6
Fix pseudorandom solution generation 2021-04-12 15:22:54 +02:00
coolneng d04d0becfe
Show algorithm execution time 2021-04-12 13:23:32 +02:00
coolneng a81756e93b
Remove selected solution from dataset properly 2021-04-12 12:58:23 +02:00
coolneng 04c92add44
Cast distance to float to get the maximum value 2021-04-12 12:22:26 +02:00
coolneng f73e28fb8a
Choose pseudorandom first solution in local search 2021-04-12 12:03:11 +02:00
coolneng 27df20f7d1
Specify algorithm choice via CLI arguments 2021-04-12 12:01:37 +02:00
coolneng 6a3bdc44e3
Add function to show results 2021-04-12 11:12:46 +02:00
coolneng f534521410
Set distance of the first solution to zero 2021-04-11 22:30:28 +02:00
coolneng 2fe874e733
Remove duplicates from the solutions 2021-04-11 22:24:22 +02:00
coolneng 85e6b072c6
Implement furthest element computation 2021-04-11 22:08:24 +02:00
coolneng 27f3baca07
Compute the first element for the greedy algorithm 2021-03-22 19:36:47 +01:00
coolneng 8b72d3f01c
Implement furthest element computation 2021-03-22 17:57:25 +01:00
coolneng b50d549ce2
Cast header values to integers 2021-03-15 21:46:58 +01:00
coolneng f44f95f9f2
Add gitignore 2021-03-15 18:23:02 +01:00
coolneng 46efa13c5b
Implement file parsing 2021-03-15 18:19:59 +01:00
coolneng 09caafc2cf
Add shell.nix 2021-03-15 18:19:52 +01:00
coolneng 1b8408dd14
Initial commit 2021-03-08 19:01:40 +01:00