A mathematical problem in which one has to find which is the shortest route which 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.
Definition of travelling salesman problem in:
What do you find interesting about this word or phrase?
Comments that don't adhere to our Community Guidelines may be moderated or removed.