Buy Travelling Salesman problem in the city 126.96.36.199 full version
Click here to Buy from the Publisher
Visa, PayPal, Mastercard, Amex, Discover, Check, Purchase Order/Invoice, major cards
Description:Let's imagine for an example such situation. You are engaged in delivery of small goods in the city.You need to optimize a route of the courier (traveling salesman or vehicle) to go round some customers in different places of city and to return to a point of departure.There can be such situation.You need to go round, we shall admit, 16 customers. One vehicle can
to not have time to make it. It is necessary to make the plan of use of several vehicles,
having optimized, both the general route, and a route of each vehicle.
Version 188.8.131.52 - Algorithm enhancements