- 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

- 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