Matrix method for the multi salesmen problem (TSP) with several vehicles

TL;DR

This paper presents a matrix-based method to decompose the multi-vehicle Traveling Salesman Problem into simpler single-vehicle problems, facilitating easier solution strategies.

Contribution

It introduces a novel matrix approach for separating multi-vehicle TSP into manageable single-vehicle subproblems.

Findings

Effective decomposition of multi-vehicle TSP into simpler problems

Potential for improved solution efficiency

Framework adaptable to various vehicle routing scenarios

Abstract

In this paper discussed procedure of separation of the original problem with several vehicles to a number of simpler problems with one vehicle which based on the matrix approach.