### Information

 Deadline 15/08/2022 23:59:00 Submission limit No limitation

## [Project 2022] Instance 3

The full statement for the project is available here.

• Instance: custom3
• Threshold 1: 12500
• Threshold 2: 12050

Grading: 7/20 if you find any valid solution. 12/20 if you reach the first threshold. 14/20 if you reach the second threshold. 20/20 if you find the best solution among all groups. Linear (depending on your rank in the scoreboard, per instance) in between.

The grade given by INGInious is not your final grade, as it will only give you either 0 (which is final), 7 (which is final), 12 (which is final) and 14 (which is the minimum you will obtain in this case).

Your solver will be started with the command

MAVEN_OPTS="-Xms256M -Xmx600M" mvn -q exec:java -Dexec.mainClass="minicp.examples.EBRP" -Dexec.args="path/to/instance"


Test it on your computer before testing on INGInious.

Only the last 2 lines of your output will be read, as they should contain your best found solution.

Use the EBRPSolution class to build the solution, and print it each time you obtain a solution. It should be something like this:

Length: 15048
0 1 2 3 4 5 6 7 8 9


Length is of course the total length of the tour made by the Bell. The next line includes the stops. 0 is the depot and all subsequents numbers are the other nodes, in order of visit. The return to the depot is implicit and hence not indicated.

You have 3 minutes in CPU (!!) time for each instance. Make sure you print your best found solution before being killed. You can either stop your program manually before the time-out or wait for your submission to be killed by INGInious: as long as we can correctly read your last found solution, everything is OK.

You can measure the CPU time of your solver by using the following code snippet:

import java.lang.management.ManagementFactory;