(1) Will the submission be evaluated with the data and script available online? With the same script but with different datasets

(2) Are participants allowed to perform any offline pre-computation? We do not believe this is useful

(3) Is there a time limit for solving each instance, and how will it be given? For Track 1, no, for Track 2, yes.

(4) There is a tradeoff in Track 1 between score and time. How are these two integrated? Will participants have access to this? We will focus on score, on equal scores, and time will be taken as a decisive value

(5) Are participants allowed to submit multiple entries to the competition? Sure, but we’ll limit to a maximum of 3 per participant (team)

(6) For Track 2, in the description it states that "we just need to output the 3 routes" in the code, it uses "5". Is this hardcoded or a parameter? It is hardcoded, now the value is 3.

(7) Will participants have access to the maximum planning time? It will be in the order of one-digit seconds. 

(8) How does the evaluation algorithm distinguish between Track 1 and Track 2? The evaluation script has now been updated to address this issue.

(9) For Track 1, some specialized libraries for Pareto-front containers could significantly improve efficiency. Are participants allowed to use? It depends, provided they do not violate fairness; you should let us know in advance and ask for confirmation.

(10) From the description, it seems that the number of objectives is four in all test cases. Is the size of the largest test network also known (in terms of number of nodes and edges)? Would the algorithm be evaluated on cases with more/fewer than four objectives? All submitted algorithms will be evaluated on exactly four objectives in every test case. The network on which your algorithm will be tested will not exceed the size of the ones provided through the website.

(11) What is the specification of the machine that runs the evaluation code? The machine on which it will be tested will be an HP laptop with an Intel Core Ultra 7 155H CPU and 32 GB of DDR5 RAM.

(12) Would it be acceptable to bind it with open-source C++ code, for example, by calling a C++ executable (planner) within the provided Python function? Unfortunately, no. All code provided must be in Python using the libraries provided in the guidelines to ensure fairness in comparison to other contestants.

(13)  Is the graph guaranteed to be undirected? Yes, however, it is nice to have a more generic algorithm that works on directed graphs as well. 

(14)  Do parallel edges exist? If you're referring to multiple edges with the same source and target but different costs, the answer is no; such cases are not allowed.

(15) Are all costs nonnegative? Yes, all edge costs are non-negative.