- add code to run multiple instances and store the result in a specific directory
- add new config
- add a complete json output

- call clean empty route for every new best solution
- add new elements in the config  file
- clean up some of the code

- add FTS in the time window constraint

- add a time measurement
- add an iteration measurement

- add initial (maximal) number of routes
- update cost at each iteration of LNS

- add basic string removal operator

Requests are divided into two locations; we are adapting current sorting methods to this criterion.
- Sort by width: take the average of the two time windows (pickup and delivery)
- End: take the end of the delivery
- Start: take the start of the pickup
- Distance: take the average of the two locations

- add sorting based on demand
- add sorting based on nearest and furthest
- add sorting based on time window

- Sorting strategy and Enum strategy moved as list_heuristic class parameters

- time window was doing a copy of an updated vector then update the vector doing two time a modification before evaluating the reach times

- add  list_heuristic_cost_oriented, same as list_heuristic_insertion but evaluate cost before feasibility

- replace template by switch case for the sorting strategy and the enumeration strategy in reconstruction operator
- remove generator / modficiation generator

- add .ipynb to display capacity (link with solutiion and data file to do)

- add simple solution exporter (to json)
- add jupyter visualisation (map only)

- replace all [ . ] by .at( . )  when looking into a vector

- fix bug in Solution Checker
- Shuffle and InsertPair operators are working

- init the solution with one empty road
- fix bug while init Data
- some tests in the main

- add enumeration of all Insert position for a pair
- add shuffle strategy

- add shuffle as basic sorting strategy
- add getter  to Solution

- add basic solution Checker
- add random destroy Operator
- revised some parts of the code

- revised some parts of the code
- add some comments
- add config.h and types.h
- data init with the list of Pair
- Solution init and link with constraints

- Add TimeWIndow constraint
- add Capacity constraint
 TODO
- constraint check in O(1)
- consrtaint tests
- use constraints in solution
- full solution checker

- add basic modification for a solution

- data coherence checker added
- new folders
- new .cpp .h in modification (to do)

- project base
- no build (see conan / cmake files)
- no data (to heavy)