{"id":4528,"date":"2017-04-05T12:18:02","date_gmt":"2017-04-05T12:18:02","guid":{"rendered":"https:\/\/www.rsoftsolution.com\/blog\/missing-puzzle-piece-to-help-solve-the-infamous-travelling-salesman-problem.html"},"modified":"2017-04-05T12:18:02","modified_gmt":"2017-04-05T12:18:02","slug":"missing-puzzle-piece-to-help-solve-the-infamous-travelling-salesman-problem","status":"publish","type":"post","link":"https:\/\/www.rbsitsoftwaresolution.in\/blog\/missing-puzzle-piece-to-help-solve-the-infamous-travelling-salesman-problem.html","title":{"rendered":"‘Missing puzzle piece’ to help solve the infamous Travelling Salesman Problem"},"content":{"rendered":"
\n
\n
\n \"\u201cMissing<\/a>
\n Flinders\u00a0Mathematical Sciences Laboratory director Associate Professor Vladimir\u00a0Ejov, software engineer\u00a0Serguei\u00a0Rossomakhine\u00a0with PhD students\u00a0Pouya\u00a0Baniasadi\u00a0and Alex\u00a0Newcombe.
\n <\/figcaption><\/figure>\n

A “missing puzzle piece” to help solve the infamous Travelling Salesman Problem (TSP) has been developed in Australia, researchers say.\n <\/p>\n


\n <\/section>\n

The algorithm, called Kookaburra, was developed at Flinders University in South Australia and works in conjunction with the North American computer code Concorde and the Danish algorithm LKH.<\/p>\n

The TSP is a classic algorithm question in computer science that focuses on finding the most efficient way for a travelling salesman to visit all of his cities and return to a starting point.<\/p>\n

Unlike previous solutions, which have been targeted at one particular TSP, Kookaburra has been used to help optimally solve more than 20 problems listed on the international register of TSPs maintained by the University of Waterloo, Canada.<\/p>\n

There are numerous techniques that aim to solve particular TSPs but many scientists believe it is impossible to develop a comprehensive model that can address every problem.<\/p>\n

Director of the Flinders Mathematical Sciences Laboratory Vladimir Ejov said although the TSP would never theoretically be solved, the Kookaburra was now the best and most reliable TSP solver worldwide in very strong competition.<\/p>\n

“We’ll keep improving Kookaburra but it’s already remarkably the best bird in the world,” Associate Professor Ejov said.<\/p>\n

“It (Kookaburra) is the missing piece of the puzzle because together with the versions from Denmark and Concorde, as a team, they solved problems that were outstanding for a long time.<\/p>\n

“Working together, these three tools are producing phenomenal results. They can certify optimality of existing solutions previously unknown to be optimal or improve them to optimality.”<\/p>\n

Concorde was developed by the University of Waterloo in Canada and the Georgia Institute of Technology in the United States while LKH is the product of research at Denmark’s Roskilde University.<\/p>\n

The study of contemporary TSPs began about 80 years ago in Vienna and Harvard when mathematician Karl Menger observed the non-optimality of nearest neighbour approach.<\/p>\n

The Kookaburra algorithm has many potential practical applications such as cost-efficient manufacturing, ordering features of the human genome and planning drone missions.<\/p>\n

Associate Professor Ejov said Kookaburra and the other two models were shaping up as the most efficient tool for developing better software systems that would not only benefit technologies such as driverless cars but also help companies save millions of dollars.<\/p>\n

Now, Kookaburra and the other two models are not only able to calculate the best possible candidate to multiple problems but they can ensure it is the optimal result.<\/p>\n

“There are many types of problems for different types of Travelling Salesman Problems but our method can solve graphs, 2-D problems<\/a> and more \u2013 it is the universal tool,” he said.<\/p>\n

“We believe our solutions cannot be further improved because Kookaburra certifies the solution<\/a>, so any other solution is either equally optimal or worse.”<\/p>\n

Further results from the University of Waterloo register will be published in the coming months.<\/p>\n

The group is also looking to commercialise their TSP-solving solution, which has been made available by Flinders Partners.\n <\/p>\n

\n \"\"
\n Explore further:<\/b>
\n Strong polynomiality of the simplex method for totally unimodular linear programming problems<\/a>\n <\/p>\n