Developed a time-bounded optimization feature for the ArianitHalimi/AIN_25 repository, introducing a Simulated Annealing With Cutoff heuristic within the Solver class to ensure predictable runtimes for production use. The work involved implementing the algorithm in Python, demonstrating its usage in the application, and refactoring the main loop to remove obsolete code, thereby improving maintainability and integration readiness. Emphasis was placed on code hygiene and workflow clarity, with clear documentation and commit history supporting future onboarding. This contribution showcased skills in algorithm implementation, code refactoring, and optimization, resulting in a more robust and production-ready solver workflow for the project.