The results of samples solutions of Traveling Salesperson Problem (TSP) received using Evolutionary Solver included in standard Solver for MS Excel 2010 is presented in this article. According to All different constraints Evolutionary Solver permits to solve TSP based on combinatorial model using permutation. Results are samples of solutions and time values received for accepted parameters and restart manners of Solver.
PL
W artykule przedstawiono wyniki rozwiązywania czternastu przykładów TSP (Traveling Salasman Problem) ze zbior TSPLIB w oparciu o premutacje z wykorzystaniem Metody Ewolucyjnej ze standardowego Solvera z MS Excel 2010.
The solutions of results of Traveling Salesperson Problem (TSP) samples are presented in this article. Their were received using LP/Quadratic Solver included in Analytic Solver Platform V12.5. LP/Quadratic Solver designed for solutions of LP/MIP problems allow to solve TSP as integer programming model. Solutions were received based on Assignment Problem with Miller, Tucker, Zemlin subtour eliminating constraints model introduced to Excel 2010. Solved times of symmetric and asymmetric TSP samples from TSPLIB with small size of problems, limited by max integer variables of LP/Quadratic Solver are presented.
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.