the travelling salesmen problem (tsp) is one of the most important and famous combinational optimization problems that aim to find the shortest tour. in this problem, the salesman starts to move from an arbitrary place called depot and after visiting all nodes, finally comes back to depot. solving this problem seems hard because program statement is simple and leads this problem belonging to np...

the traveling salesman problem (tsp) is a well-known combinatorial optimization problem and holds a central place in logistics management. the tsp has received much attention because of its practical applications in industrial problems. many exact, heuristic and metaheuristic approaches have been proposed to solve tsp in recent years. in this paper, a modified ant colony optimization (maco) is ...