Dualizm logistyczno-kombinatoryczny zadania komiwojażera
Logistic-Combinatorial Dualism of Setting the Travelling Salesman

Summary/Abstract: At the work described dual character of the vehicle routing stayed (TPS – Travelling Salesman Problem) which can simultaneously be considered as the utilitarian transport task according to logistic criteria and as a combinatorial many-sided problem of discreet optimization. In the operational research aspect the TSP task is included in problems NP-complete, which in general effective methods of solutions don’t exist for. On account of very wide range of logistic applications of the TSP task they made the presentation the most of popular methods of untying him. They paid special attention to the modern attempt based on methods of the artificial intelligence and ant algorithms. The classic TSP problem is a special case very much important in the contemporary logistics of the multidimensional problem route projecting among others onto total costs of transport and logistic activity.

• Details
• Contents