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.
REFERENCES(35)
1.
Aarts E., Lenstra J. (2003). Local search in combinatorial optimization. John Wiley & Sons.
Dorigo M., Maniezzo V., Colorni A. (1996). The Ant System: Optimization by a colony of cooperating agents, IEEE Transactions on Systems, Man, and Cybernetics – Part B, 26 (1).
Ramani G. (2011). Travelling Salesman Problem (TSP) optimization through Genetic Algorithm: Improvised solution to VLSI Detailed Routing and National Tour Paperback – September 8.
We process personal data collected when visiting the website. The function of obtaining information about users and their behavior is carried out by voluntarily entered information in forms and saving cookies in end devices. Data, including cookies, are used to provide services, improve the user experience and to analyze the traffic in accordance with the Privacy policy. Data are also collected and processed by Google Analytics tool (more).
You can change cookies settings in your browser. Restricted use of cookies in the browser configuration may affect some functionalities of the website.