This document proposes a new modified ant colony optimization (NMACO) algorithm to solve the multiple travelling salesman problem (mTSP). The mTSP is a generalization of the travelling salesman problem where multiple salesmen are allowed to service cities. The NMACO algorithm uses artificial ants that probabilistically choose cities to visit based on pheromone trails and distance, similar to how real ants find food sources. The algorithm includes local search techniques after construction to improve solutions. It is evaluated on applications like the travelling salesman and quadratic assignment problems.