Differential Evolution: A Handbook for Global Permutation-Based Combinatorial Optimization

The traveling salesman problem's feasible solutions - permutations of city labels - c- prise a ?nite, discrete set. The set of feasible solutions - vectors whose components are nonnegative integers - is both numerical and discrete.