Definition of traveling salesman problem in English:
A mathematical problem in which one tries to find the shortest route that passes through each of a set of points once and only once.
- Instead of starting with random collections of answers, such as the various routes in the travelling salesman problem, GP begins with random collections of mathematical operations and inputs: add, x, sine, multiply, y, and so on.
- A classic example is the travelling salesman problem, which entails working out the shortest route connecting a large number of points in space so that each is visited just once.
- These ‘ants’ are good for solving a classic algorithm problem, the so-called ‘travelling salesman problem.
What do you find interesting about this word or phrase?
Comments that don't adhere to our Community Guidelines may be moderated or removed.
Most popular in the US
Most popular in the UK
Most popular in Canada
Most popular in Australia
Most popular in Spain
Most popular in Malaysia
Most popular in India
Most popular in Pakistan