Returns the best solution from randomly generated in some time.

A* algorithm with suboptimal heuristic function. It doesn't drop goods outside the base. It is executed only for some time, after that it uses Simple greedy algorithm.

A* algorithm without heuristic function. Doesn't drop anything outside the base and always picks everything it can. It is executed only for some time, after that it uses Simple greedy algorithm.

A* algorithm without heuristic function. It is executed only for some time, after that it uses Simple greedy algorithm.

Simple greedy algorithm - if truck is full, go to the base, otherwise go to the best unempty node (based on grading function) and pick everything you can.

A* algorithm with heuristic function based on Simple greedy algorithm.

Works as Simple greedy, but goes to the randomly chosen one of two nodes with best value of grading function. Tries different paths for some time and returns the best.