Experimental evaluation of BELA0/BELA* (ECAI 2024)

Data files with the information required to replicate all the experiments reported in the paper:

• Linares López, Carlos; Herman, Ian, 2024. Evolving A* to Efficiently Solve the k Shortest-Path Problem. Proceedings of the Twenty-Seventh European Conference on Artificial Intelligence (ECAI 2024). Santiago de Compostela (Spain). 

This record contains only the test files needed to test any of the algorithms implemented in the different domains (maps, roadmap, n-puzzle and n-pancake).  While these files can be used to run the experiments manually, there are different scripts available in the github repository "ksearch" which automate the experimentation and also the recollection of data and the presentation of results under the directory "scripts".

Files are structured as follows:

• random512: data files used in the maps domain:
  • random512-*.map contains the map whose contents are explained in the movingai repository.
  • random512-*.test contains the testcases for every map.
• test-{10, 20, 30, 40}.test: data files used in the {10, 20, 30, 40}-Pancake
• {9, 16}puzzle.test: data files used in the 8- and 15-Puzzle.
• USA-road.d: data files used in the roadmap domain

To be able to run the experiments in the roadmap domain it is necessary also to have the .gr and .co files located in the same directory than the USA-road-d.test files (these are available in the 9th DIMACS Implementation Challenge: Shortest Paths)

The format of all the data files is explained in the README.md files of the "ksearch" github repo under the corresponding directory.

All tests have been randomly generated. The criteria for the random selection is explained in the main paper, and the executables that pick up every testcase are named "gen-*" and are built automatically by the building script.