update readme, solve issue #1, add notes to LKH3 folder

Algorithms/Offline_Centralized/Algorithm_TA_Prioritized/LKH3/README.txt

+# Overview
+In this folder you can find:
+- LKH-3.exe: executable for Windows
+- LKH_Linux: executable for Linux
+- LKHWin-3.0.6-WinChanges.zip: visual studio project for Windows
+- SRC.zip: software for Linux/mac
+
+
+LKH-3 is a modified version of the implementation available at: http://webhotel4.ruc.dk/~keld/research/LKH/.
+
+# Original documentation
+
 LKH is an implementation of the Lin-Kernighan traveling salesman heuristic.
 
 The code is distributed for research use. The author reserves all rights to 

Algorithms/Offline_Centralized/Algorithm_TA_Prioritized/Readme.md

@@ -10,9 +10,11 @@ Not supported:
 - Randomly generated tasks (randomTasks = True)
 - Tasklists without releaseTimes
 
+It was added by Hicham Azmani. The corresponding Bachelor thesis has been added in the repository and can be found in [paper](/Algorithms/Offline_Centralized/Algorithm_TA_Prioritized/paper)
+
 ## Running the algorithm
 
-1. Install the virtual environment
+1. If not yet done, install the virtual python environment
     - 'pipenv install'
 2. Setup the LKH-3 TSP solver (see "LKH-3 TSP Solver" section)
 3. Setup lkh.config (see below)
@@ -21,9 +23,7 @@ Not supported:
 
 ## Working of the algorithm
 
-This implementation is a modified version of the implementation available at: https://github.com/Pieter-Cawood/M-TA-Prioritized-MAPD
-
-This implementation is based on the "Task and Path Planning for Multi-Agent Pickup and Delivery" paper (http://idm-lab.org/bib/abstracts/papers/aamas19a.pdf).
+This implementation is a modified version of the implementation available at: https://github.com/Pieter-Cawood/M-TA-Prioritized-MAPD and  based on the "Task and Path Planning for Multi-Agent Pickup and Delivery" paper (http://idm-lab.org/bib/abstracts/papers/aamas19a.pdf).
 An explanation of the algorithm is available at:
     - Section 3 and 4 of the "Task and Path Planning for Multi-Agent Pickup and Delivery" paper
     - Section 2.2.2 of the paper provided in the "paper" 
@@ -41,7 +41,7 @@ General working of the algorithm:
 
 ## (IMPORTANT) LKH-3 TSP Solver
 
-- This algorithm uses a modified version of the original LKH-3 TSP solver (original: http://akira.ruc.dk/~keld/research/LKH-3/) to generate task sequences. The source code (and an executable for Linux and Windows) can be found in the LKH3 directory. A visual studio project for Windows is added as LKHwin-3.0.6-WinChanges.
+- This algorithm uses a modified version of the original LKH-3 TSP solver (original: http://akira.ruc.dk/~keld/research/LKH-3/) to generate task sequences. The modified source code (and an executable for Linux and Windows) can be found in the [LKH3](/Algorithms/Offline_Centralized/Algorithm_TA_Prioritized/LKH3) directory. A visual studio project for Windows is added as LKHwin-3.0.6-WinChanges.
 - By default the algorithm computes new task sequences using the LKH-3 solver every time the algorithm is ran
 - The algorithm supports using pre-computed task sequences (as this process can be slow for larger task sets)