Generate final performance profiles

[dparo]

TODO

In order to assess the performance of our CPTP executable we need to generate the performance profiles for many pricing iterations induced from solving common CVRP instances...

Due to the problem of BapCod non-guaranteed elementarity, and the Branch&Cut nature of our approach we can distinguish three main different families of cut generations:

• Only with CVRP instances having a number of customers inferior to the size of the NG-paths assumed in the BaPCod Pricer (63 by default)
• New CVRP instances obtained from the original CVRP instances, but having a vehicle_cap which is multiplied by a constant factor (favors long tours solutions, where B&C approaches seem to work better than dynamic labelling algorithms)
• Use all standard CVRP instances independently from the number of customers. The main CVRP families to use for comparison are: family E (short routes, hard for a B&C) and family F (long routes, easier for a B&C)

And combinations of the above.

WHY

Even though unlikely our CPTP solver will beat the dynamic programming labelling algorithm it can still provide a non-negligible contribution when vehicle capacities are high, and similar to real world problems (eg Amazon order delivery)