The main target of Traveling Salesman Problem (TSP) is to construct the path with the lowest time between different cities, visiting every one once. The Scheduling Project Ant Colony Optimization (SPANCO) Algorithm proposes a way to solve TSP problems adding three aspects: time, cost effort and scope, where the scope is the number of cities, the effort is calculated multiplying time, distance and delivering weight factors and dividing by the sum of them and optimizing the best way to visit the cities graph.