Purpose: This study proposes a new two-stage clustering method to break down the symmetric multiple traveling salesman problem (mTSP) into several single standard traveling salesman problems, each of which can then be solved separately using a heuristic optimization algorithm....

Purpose: This study proposes a new two-stage clustering method to break down the symmetric multiple traveling salesman problem (mTSP) into several single standard traveling salesman problems, each of which can then be solved separately using a heuristic optimization algorithm....