I have selected 38 scenarios through running the random functionality a few times and compared the performance of all given search functions using the same parameters.
For this I used the tutorial_batch_processing.ipynb’s parallel batch processing code section. I only changed the parameters in batch_processing_config.yaml (set the scenario list explicitly, set it to use the list with SPECIFIC, depth of 100, timeout 30 seconds).
Running in the VM, 6 physical cores and 8 GB memory assigned.
Results:
bfs: 4 found, 2 not found, 20 timeout, 38 total
dfs: 22 found, 15 not found, 1 timeout, 38 total
dls: 21 found, 2 not found, 8 timeout, 38 total
gbfs: 22 found, 2 not found, 8 timeout, 38 total
ucs: 2 found, 2 not found, 22 timeout, 38 total
astar: 23 found, 2 not found, 10 timeout, 38 total
examp: 3 found, 2 not found, 31 timeout, 38 total
Then I implemented the student planner (student.py) and inherited literally everything from the GBFS class. How is it possible, that I receive more exceptions and less solutions here than in the original GBFS?
student: 21 found, 2 not found, 7 timeout, 3 exceptions, 38 total