Note : The project documentation is written in French.
The objective of this project is to develop an advanced algorithm to solve the "Treasure Hunt Problem." This problem involves searching for an unknown treasure within a large area, with limited resources and constraints. The goal is to design a solution that efficiently locates the treasure by exploring the environment using various search strategies and techniques.
The project aims to analyze different algorithms, compare their performances, and select the most optimal approach based on factors like time complexity, resource consumption, and the ability to adapt to changing conditions in the search area. It explores real-world applications where such algorithms can be used, such as robotics, navigation systems, or automated exploration tasks.
A working folder has been created :
To execute the PLNE model, use the following command:
python3 chasse_tresors_plne.py <file_path> [-MTZ | -DFJ] [-display]<file_path>: Path to the input file containing the instance data.-MTZ: Specifies the MTZ formulation (default).-DFJ: Specifies the DFJ formulation.-display: Optionally display results during execution.
python3 chasse_tresors_plne.py instances/cat5_175.txt -MTZ -displayTo execute the metaheuristic (tabu search) algorithm, use the following command:
python3 chasse_tresors_mh.py <file_path> <max_iterations> <size_tabu> [-display]<file_path>: Path to the input file.<max_iterations>: Maximum number of iterations for the search.<size_tabu>: Size of the tabu list to avoid revisiting recent solutions.-display: Optionally display the results during execution.
python3 chasse_tresors_mh.py instances/cat5_175.txt 100 5 -displayBoth scripts (
chasse_tresors_plne.pyandchasse_tresors_mh.py) require Python 3 and appropriate libraries. The-displayoption can be omitted if you do not want the results to be shown during execution.