keywords = "genetic algorithms, genetic programming, multi
expression programming",
ISBN = "3-540-22115-8",
DOI = "doi:10.1007/b97988",
size = "4 pages",
abstract = "Multi Expression Programming (MEP) is used for
evolving a Travelling Salesman Problem (TSP) heuristic
for graphs satisfying triangle inequality. Evolved MEP
heuristic is compared with Nearest Neighbour Heuristic
(NN) and Minimum Spanning Tree Heuristic (MST) on some
difficult problems in TSPLIB. The results emphasises
that evolved MEP heuristic is better than the compared
algorithm for the considered test problems.",