Differential Evolution for Permutation-Based Combinatorial Problems - Differential Evolution: A Topic for Global Permutation-Based Combinatorial Optimization - page 15

n

1 City n

c 15

c ij = c ji

c 12

c 14

c 13

5 2

c 25

c 45 c 35 c 24 c 23

c 34

4 3

(a) Complete TSP Graph

Fig. 2.1. (a) TSP illustrated on a graph

1

c 51 c 12

5 2

c 24

c 35

c 43

4 3

(b) One possible tour

Fig. 2.2. (b) TSP illustrated on a graph

minimise

N
i =1

N
j =1 c ij x ij

(2.3)

subject to

N
j =1 x ij = 1; ∀ i

(2.4)