Travelling Salesman problem in the city 1.0.2.7
HELPS TO CHOOSE OPTIOMAL TOUR
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 1.0.2.1 - works faster.
Version 1.0.2.3 - works faster.
Version 1.0.2.4 - Bug fix and algorithm enhancements
Version 1.0.2.5 - Algorithm enhancements
Version 1.0.2.6 - Algorithm enhancements
What is expected in the future? Newly-made Travelling Salesman problem in the city 1.1 be downloaded from current page, we also looking forward to unconfirmed 1.2 release build. You may download spsl_en.zip directly, estimated download time by ISDN or CDMA [~128 kbit/s] is 0:00:25. Just write the reviews of the Travelling Salesman problem in the city. System requirements are .Net 2.0. Program has been scanned and verified by the several antivirus and anti-spyware applications and Travelling Salesman problem in the city found to be clean. The following languages are supported by Travelling Salesman problem in the city: English.
