22 Commits

Author	SHA1	Message	Date
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	46efa13c5b	Implement file parsing	2021-03-15 18:19:59 +01:00