The Traveling Salesman Problem

<-! Icon -> " Many complain about their memory, but nobody complains about their witness.  Benjamin Franklin

Traveling Salesman Problem is a widespread task of optimization, in which it is required to calculate the most appropriate version of the route on the basis of a particular criteria, such as the time and cost. It is considered that none of destination points will be passed twice.

The traveling salesman problem is a type of very complex tasks, since calculation must be carried out according to a special algorithm. To fully carry out the task by simple selection is impossible even in several hundred years, that is the criterion of difficulty. A special kind of tasks is the development of a route that does not exceed a predetermined K criterion, which may be a certain cost, mileage and other options.

The only important parameter for the development of a route is its profitability from one or another feature. It involves checking all of the options and then selecting the most correct one. There is no confidence that this is the most profitable route, so check of the decision is required. It can be done by searching the error in the calculation or the comparison of the data with a ready result. In the real development of optimal route, the primary option is used, since there is no second option. However, within psychiatry, it often occurs that the result verification is done by comparing the data with the result.

The successful application of this problem within the framework of psychology is possible because of the fact that due to the attempts of the assignment completion,  several important skills are developed: memory, spatial thinking and intelligence in general. < / em>

The user can try themselves in the role of a Salesman in a special section of IQClub.

Theory Development History

This Is Interesting

The traveling salesman problem officially appeared in the scientific community in 1832, however, the best methods for its solution began to emerge only in the mid-20th century, when it was presented as a discrete optimization task.

In psychology, the use of this task was presented by Allan Baddeley, who proved one of the most important theories concerning memory. He managed to turn the challenge of optimization into an interesting game, with which memory is effectively and quickly developed. You can test the attractiveness of such trainer on our website in the "Games" section.

Brain Development Application of the Task

The development of memory is considered to be one of the greatest challenges in psychology, as it is believed that after a certain age, it is impossible to develop these attributes. However, maintaining a certain level also requires training, which stands for at least the active and constant memory usage in everyday life.

To construct such interesting games like "FindACoin", we successfully used the traveling salesman problem. Its use in the development of intelligence lies in the use of theory that the development of short-term memory has an active influence on the long-term memory, while also improving it. The theory is that during training with the "FindACoin" the number of connections between nerve cells is increased, thereby, so does the memory capacity.

It is believed that the human memory can be estimated by the number of objects or any details that they can remember.

Also thanks to this task, you can develop the skills of spatial thinking, which is useful in everyday life. Training with the help of our trainer will not only efficiently develop your brain, but also let you spend time during a funny task.

Try IQClub for Free
Makes learning the art of literacy fun!
AI-Powered eBooks for Kids
Sign Up for Free
IQClub uses cookies in order to offer the best experience of our website. Please review our Cookie policy for more information.