The bounded single depot multiple travelling salesman problem (BSD-MTSP) is a complex optimization problem, involves the designing of optimal routes for multiple salesmen while imposing constraints on the number of cities each salesman can visit. BSD-MTSP is particularly known for its combinatorial nature and the other complexities that arise from managing multiple salesmen while adhering to depot-related constraints. In this paper, we introduce a novel software tool, the BSD-MTSP Solver, which has been designed to efficiently address large-scale BSD-MTSP instances. This software is built on the foundation of the efficient hybrid algorithm ACSLs, which was previously published in the IEEE WCCI 2024 proceedings. ACSLs integrates an Initialization heuristic, an Ant colony system, and Local search operations to obtain high-quality solutions. This paper provides a comprehensive overview of the BSD-MTSP Solver, detailing its implementation as a standalone software application and demonstrating its effectiveness in addressing large-scale BSD-MTSPs.