Evolutionary Computation Glossary

Go to entries beginning with S

T

TERMINAL SET:

(GP) The set of terminal (leaf) nodes in the parse trees representing the programs in the POPULATION. A terminal might be a variable, such as X, a constant value, such as 42, (cf Q42) or a function taking no arguments, such as (move-north).

TRAVELLING SALESMAN PROBLEM:

The travelling salesperson has the task of visiting a number of clients, located in different cities. The problem to solve is: in what order should the cities be visited in order to minimise the total distance travelled (including returning home)? This is a classical example of an ORDER-BASED PROBLEM.

TSP:

See TRAVELLING SALESMAN PROBLEM.

Go to entries beginning with U

Go to entries beginning with: 1, A, B, C, D, E, F, G, H, I, L, M, N, O, P, R, S, T, U, V, Z.

[Glossary top level] [HHGTEC main contents page]

Mistakes in this page?
Hitch Hiker's Guide to Evolutionary Computation, Issue 7.4, released 18 January 2000
Copyright © 1993-2000 by J. Heitkötter and D. Beasley, all rights reserved.