The project aimed to develop a graph-based algorithm for efficiently finding the shortest path to inspect 'n' points in a single-level warehouse using a robot. A Monte Carlo layout generator was created for testing, generating diverse warehouse layouts to evaluate the algorithm's performance.
- visualization of the operation of algorithms in the warehouse simulation
- support for multiple TSP solvers i.e. OR-Tools, LKH, Concorde, EAX GA
- layout generation that can be used for benchmarking and in the simulation
