MODIFICATION OF THE TRADER TRAVELER
In this paper, a modification of the well-known traveling salesman transportation problem is considered; the distinctive approach in the article is to take into account time and money in the construction of the Hamiltonian cycle. This task arose at the enterprise biophysical orientation when laying the Hamiltonian cycle for transporting the final product. The model is quite simple - it refers to the linear formulation of the model. This task can be assigned to the class of non-trivial combinatorial problems. Possible algorithms for finding a solution for the proposed model are considered. It is shown that for a sufficiently large sample size, the model considered in the article gets a solution faster than any other known standard model.