Traveling-Salesman
Problem
· A
classical
problem
using heuristic
algorithm
·
Problem
description
·
Goal:
find
an
optimal
"tour"
through n
cities
that
visit
each
city
one
and
only
one
time
· merit:
distance
or
cost
is a
minimum
