home.md

@@ -3,7 +3,7 @@ This repository contains algorithms and datasets for the Travelling Salesperson
 This wiki contains instructions on installation and example usage. 
 For further assistance, you can contact the maintainer: [wolledav@cvut.cz](wolledav@cvut.cz)
 
-First, download the repository and perform the following steps in its base directory. 
+Download the repository and perform the following steps in its base directory. 
 
 # Weak Path-Conforming Circle Placement Problem (WPCCP) with fixed radius
 WPCCP was first introduced in the paper *[Where to place a pile?](https://www.researchgate.net/publication/374246979_Where_to_Place_a_Pile)*.
@@ -22,6 +22,10 @@ Only the variant with fixed radius is needed in TSP-CP.
 
 ## Installation
 
+The source codes are written in C++ and do not require any external libraries.
+In Ubuntu or Debian OSs, the build-essential package has to be installed. 
+The code depends on the Boost library (typically installed with build-essential).
+
 In the project base directory, run: 
 ```
 cd circplace_orig/
@@ -33,6 +37,34 @@ make
 This will create the executable `./build/circplace_weak`
 ## Usage
 
+In the project base directory, run:
+```
+circplace_orig/build/circplace_weak -i ./data/circplace/grids/ -p mesh115 -o ./demo_out -r 30
+```
+Parameters: \
+-i . . . input problem directory\
+-p . . . problem instance name\
+-o . . . output directory\
+-r . . . required circle radius
+
+## Soft WPCCP variant
+
+This variant returns a solution with the least possible number of collisions between circles and the TSP path. It needs to be compiled to run the TSP-CP algorithm.
+
+In the project directory, run:
+```
+cd circplace_soft/
+mkdir build
+cd build
+cmake ..
+make
+```
+Usage: 
+```
+circplace_soft/build/circplace_weak -i ./data/circplace/grids/ -p mesh115 -o ./demo_out -r 35
+```
+
+
 
 # Travelling Salesperson Problem with Self-deleting graphs (TSP-SD)