![Page 1: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/1.jpg)
A tabu search algorithm for the min-max k-Chinese postman problem
Dino Ahr, Gerhard Reinelt*Computers & Operations Research 33
(2006) 3403–3422報告人 : 陳政謙
![Page 2: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/2.jpg)
Outline
• The min-max k-Chinese postman problem• Merging and separating edges• Improving tours• The tabu search algorithm• Computational results
![Page 3: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/3.jpg)
k-Chinese postman tour• For a given graph G=(V, E), k-Chinese postman tour is k closed
walks(tours) which each tour starts and ends at the depot node and each edge e E is covered by at least one tour.∈
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
1
2 2427
18
77
1
26
210
![Page 4: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/4.jpg)
k-Chinese postman tour• For a given graph G=(V, E), k-Chinese postman tour is k closed
walks(tours) which each tour starts and ends at the depot node and each edge e E is covered by at least one tour.∈
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
1
2 2427
18
77
1
26
210
depot node = v1
![Page 5: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/5.jpg)
k-Chinese postman tour• For a given graph G=(V, E), k-Chinese postman tour is k closed
walks(tours) which each tour starts and ends at the depot node and each edge e E is covered by at least one tour.∈
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
1
2 2427
18
77
1
26
210
depot node = v1
k = 2
![Page 6: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/6.jpg)
k-Chinese postman tour• For a given graph G=(V, E), k-Chinese postman tour is k closed
walks(tours) which each tour starts and ends at the depot node and each edge e E is covered by at least one tour.∈
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
1
2 2427
18
77
1
26
210
depot node = v1
k = 2
![Page 7: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/7.jpg)
7
1
1
k-Chinese postman tour• For a given graph G=(V, E), k-Chinese postman tour is k closed
walks(tours) which each tour starts and ends at the depot node and each edge e E is covered by at least one tour.∈
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
depot node = v1
k = 2
![Page 8: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/8.jpg)
The min-max k-Chinese postman problem
• The aim for the min-max k-Chinese postman problem (MM k-CPP) is to minimize the length of the longest tour of k-Chinese postman tour.
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
![Page 9: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/9.jpg)
The min-max k-Chinese postman problem
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
C1:
• The aim for the min-max k-Chinese postman problem (MM k-CPP) is to minimize the length of the longest tour of k-Chinese postman tour.
![Page 10: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/10.jpg)
The min-max k-Chinese postman problem
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
C2:
C1:
• The aim for the min-max k-Chinese postman problem (MM k-CPP) is to minimize the length of the longest tour of k-Chinese postman tour.
![Page 11: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/11.jpg)
The min-max k-Chinese postman problem
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
w(C1) = 107
C2:
C1:
• The aim for the min-max k-Chinese postman problem (MM k-CPP) is to minimize the length of the longest tour of k-Chinese postman tour.
![Page 12: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/12.jpg)
The min-max k-Chinese postman problem
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
w(C2) = 78
w(C1) = 107
C2:
C1:
• The aim for the min-max k-Chinese postman problem (MM k-CPP) is to minimize the length of the longest tour of k-Chinese postman tour.
![Page 13: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/13.jpg)
The min-max k-Chinese postman problem
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
w(C2) = 78
w(C1) = 107
C2:
C1:
The maximum weight is 107
• The aim for the min-max k-Chinese postman problem (MM k-CPP) is to minimize the length of the longest tour of k-Chinese postman tour.
![Page 14: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/14.jpg)
The min-max k-Chinese postman problem
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
w(C2) = 94
w(C1) = 93
C2:
C1:
The maximum weight is 94
• The aim for the min-max k-Chinese postman problem (MM k-CPP) is to minimize the length of the longest tour of k-Chinese postman tour.
![Page 15: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/15.jpg)
Merging and separating edges
• Two Algorithms– SeparateWalkFromTour– MergeWalkWithTour
![Page 16: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/16.jpg)
Algorithm: SeparateWalkFromTour
• Input: The tour Ci and the walk H to be separated.
• Output: The tour represents a feasible tour formed from the remaining of edges of Ci after removing edges from H and possibly additional edges needed to re-establish feasibility.
![Page 17: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/17.jpg)
Algorithm: SeparateWalkFromTour• Step1: Let u and v be the endnodes of H (u = v is possible).
Check whether the depot node v1 is an internal node of H.
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
C1: C2:
![Page 18: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/18.jpg)
Algorithm: SeparateWalkFromTour
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
C1: C2:
u = v4
• Step1: Let u and v be the endnodes of H (u = v is possible). Check whether the depot node v1 is an internal node of H.
![Page 19: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/19.jpg)
Algorithm: SeparateWalkFromTour
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
C1: C2: H:
u = v4
• Step1: Let u and v be the endnodes of H (u = v is possible). Check whether the depot node v1 is an internal node of H.
![Page 20: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/20.jpg)
Algorithm: SeparateWalkFromTour
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
C1: C2: H:
u = v4
• Step1: Let u and v be the endnodes of H (u = v is possible). Check whether the depot node v1 is an internal node of H.
![Page 21: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/21.jpg)
Algorithm: SeparateWalkFromTour
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
C1: C2:
v = v8
H:
u = v4
• Step1: Let u and v be the endnodes of H (u = v is possible). Check whether the depot node v1 is an internal node of H.
![Page 22: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/22.jpg)
Algorithm: SeparateWalkFromTour
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
C1: C2:
v1 is not an internal node of H.
H:
u = v4
v = v8
• Step1: Let u and v be the endnodes of H (u = v is possible). Check whether the depot node v1 is an internal node of H.
![Page 23: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/23.jpg)
Algorithm: SeparateWalkFromTour
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
C1: C2: H:
• Step2: Remove all edges of H from Ci to yield Ĉi. Check whether the depot node v1 is contained in Ĉi.
u = v4
v = v8
![Page 24: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/24.jpg)
Algorithm: SeparateWalkFromTour
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
C1: C2: H:
u = v4
v = v8
• Step2: Remove all edges of H from Ci to yield Ĉi. Check whether the depot node v1 is contained in Ĉi.
![Page 25: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/25.jpg)
Algorithm: SeparateWalkFromTour
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
C1: C2: H:
u = v4
v = v8
• Step2: Remove all edges of H from Ci to yield Ĉi. Check whether the depot node v1 is contained in Ĉi.
![Page 26: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/26.jpg)
Algorithm: SeparateWalkFromTour
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
C2: H:Ĉ1:
u = v4
v = v8
• Step2: Remove all edges of H from Ci to yield Ĉi. Check whether the depot node v1 is contained in Ĉi.
![Page 27: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/27.jpg)
Algorithm: SeparateWalkFromTour
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
C2: H:Ĉ1:
v1 is contained in Ĉ1.
u = v4
v = v8
• Step2: Remove all edges of H from Ci to yield Ĉi. Check whether the depot node v1 is contained in Ĉi.
![Page 28: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/28.jpg)
Algorithm: SeparateWalkFromTour
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
C2: H:Ĉ1:
• Step3: We have to consider two cases when we connect u and v:– If v1 is an internal node of H and v1 is not contained in Ĉi , then we let
evolves from Ĉi by connecting u and v with SP(u, v1), SP(v1, v).– Otherwise we let evolves from Ĉi by connecting u and v with SP(u,
v). u = v4
v = v8
![Page 29: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/29.jpg)
Algorithm: SeparateWalkFromTour
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
C2: H:Ĉ1:
• Step3: We have to consider two cases when we connect u and v:– If v1 is an internal node of H and v1 is not contained in Ĉi , then we let
evolves from Ĉi by connecting u and v with SP(u, v1), SP(v1, v).– Otherwise we let evolves from Ĉi by connecting u and v with SP(u,
v). u = v4
v = v8
![Page 30: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/30.jpg)
Algorithm: MergeWalkWithTour
• Input: The tour Ci and the walk H to be merged.
• Output: The tour represents a feasible tour formed from edges contained in Ci and H and possibly additional edges.
![Page 31: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/31.jpg)
Algorithm: MergeWalkWithTour• Step1: Remove those edges from the beginning and the end
of H which also occur in Ci to yield the result Ĥ.
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
C1: C2:
![Page 32: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/32.jpg)
Algorithm: MergeWalkWithTour
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
C1: C2: H:
• Step1: Remove those edges from the beginning and the end of H which also occur in Ci to yield the result Ĥ.
![Page 33: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/33.jpg)
Algorithm: MergeWalkWithTour
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
C1: C2: Ĥ:
• Step1: Remove those edges from the beginning and the end of H which also occur in Ci to yield the result Ĥ.
![Page 34: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/34.jpg)
Algorithm: MergeWalkWithTour
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
C1: C2:
• Step2: Let u and v be the endnodes of Ĥ. Determine the node t on Ci which minimizes w(SP(u, t)) + w(SP(v, t)).
Ĥ:
![Page 35: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/35.jpg)
Algorithm: MergeWalkWithTour
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
C1: C2: Ĥ:
u = v4
• Step2: Let u and v be the endnodes of Ĥ. Determine the node t on Ci which minimizes w(SP(u, t)) + w(SP(v, t)).
![Page 36: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/36.jpg)
Algorithm: MergeWalkWithTour
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
C1: C2: Ĥ:
u = v4
v = v8
• Step2: Let u and v be the endnodes of Ĥ. Determine the node t on Ci which minimizes w(SP(u, t)) + w(SP(v, t)).
![Page 37: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/37.jpg)
Algorithm: MergeWalkWithTour
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
C1: C2: Ĥ:
u = v4
v = v8
t = v4
• Step2: Let u and v be the endnodes of Ĥ. Determine the node t on Ci which minimizes w(SP(u, t)) + w(SP(v, t)).
![Page 38: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/38.jpg)
Algorithm: MergeWalkWithTour
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
C1: C2: Ĥ:
u = v4
v = v8
t = v4
• Step3: The result evolves from splicing SP(t, u), Ĥ, SP(v, t) into Ci at node t.
![Page 39: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/39.jpg)
• Step3: The result evolves from splicing SP(t, u), Ĥ, SP(v, t) into Ci at node t.
Algorithm: MergeWalkWithTour
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
C1: C2: Ĥ:
u = v4
v = v8
t = v4
![Page 40: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/40.jpg)
Algorithm: MergeWalkWithTour
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
C1: C2: Ĥ:
u = v4
v = v8
t = v4
• Step3: The result evolves from splicing SP(t, u), Ĥ, SP(v, t) into Ci at node t.
![Page 41: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/41.jpg)
Required edge and redundant edge• Øi(e) denote the frequency of e which occurs in Ci.
• Ø(e) = Øi(e)
• An edge e is called required for Ci if Øi(e) ≥ 1 and Ø(e) = Øi(e).
• An edge e is called redundant for Ci if Øi(e) ≥ 1 and Ø(e) > Øi(e).
C1: C2:
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
![Page 42: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/42.jpg)
Required edge and redundant edge• Øi(e) denote the frequency of e which occurs in Ci.
• Ø(e) = Øi(e)
• An edge e is called required for Ci if Øi(e) ≥ 1 and Ø(e) = Øi(e).
• An edge e is called redundant for Ci if Øi(e) ≥ 1 and Ø(e) > Øi(e).
(v1, v7) is a required edge for C1.
C1: C2:
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
![Page 43: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/43.jpg)
Required edge and redundant edge• Øi(e) denote the frequency of e which occurs in Ci.
• Ø(e) = Øi(e)
• An edge e is called required for Ci if Øi(e) ≥ 1 and Ø(e) = Øi(e).
• An edge e is called redundant for Ci if Øi(e) ≥ 1 and Ø(e) > Øi(e).
(v4, v6) is a redundant edge for C1.
C1: C2:
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
![Page 44: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/44.jpg)
Improving tours
• Three improvement procedures– RemoveReplicateEdgesKeepingParity– RemoveEvenRedundantEdges– ShortenRequiredEdgeConnections
![Page 45: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/45.jpg)
RemoveReplicateEdgesKeepingParity
• For edge e which occurs n ≥ 3 times in Ci, we can remove n – 2 times (n – 1 times) e if n is even(odd).
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
C1:
C2:
![Page 46: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/46.jpg)
RemoveReplicateEdgesKeepingParity
• For edge e which occurs n ≥ 3 times in Ci, we can remove n – 2 times (n – 1 times) e if n is even(odd).
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
C1:
C2:
![Page 47: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/47.jpg)
RemoveReplicateEdgesKeepingParity
• For edge e which occurs n ≥ 3 times in Ci, we can remove n – 2 times (n – 1 times) e if n is even(odd).
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
C1:
C2:
![Page 48: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/48.jpg)
RemoveEvenRedundantEdges• If edge e is a redundant edge with even frequency, e will be
removed completely from Ci if the remaining of Ci remains connected and still contains the depot node.
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
C1: C2:
![Page 49: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/49.jpg)
RemoveEvenRedundantEdges• If edge e is a redundant edge with even frequency, e will be
removed completely from Ci if the remaining of Ci remains connected and still contains the depot node.
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
C1: C2:
![Page 50: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/50.jpg)
RemoveEvenRedundantEdges• If edge e is a redundant edge with even frequency, e will be
removed completely from Ci if the remaining of Ci remains connected and still contains the depot node.
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
C1: C2:
![Page 51: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/51.jpg)
ShortenRequiredEdgeConnections• Step1: Construct the longest possible walk P (while traversing
Ci) which consists of redundant edges. Let vh be the origin and vj be the terminus of walk P.
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
C1: C2:
C1: {v1, v2, v3, v5, v6, v4, v6, v8, v7, v1, v3, v4, v7, v1}
![Page 52: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/52.jpg)
ShortenRequiredEdgeConnections• Step1: Construct the longest possible walk P (while traversing
Ci) which consists of redundant edges. Let vh be the origin and vj be the terminus of walk P.
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
P:C1: C2:
C1: {v1, v2, v3, v5, v6, v4, v6, v8, v7, v1, v3, v4, v7, v1}
![Page 53: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/53.jpg)
ShortenRequiredEdgeConnections• Step1: Construct the longest possible walk P (while traversing
Ci) which consists of redundant edges. Let vh be the origin and vj be the terminus of walk P.
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
P:C1: C2:
C1: {v1, v2, v3, v5, v6, v4, v6, v8, v7, v1, v3, v4, v7, v1}
![Page 54: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/54.jpg)
ShortenRequiredEdgeConnections• Step1: Construct the longest possible walk P (while traversing
Ci) which consists of redundant edges. Let vh be the origin and vj be the terminus of walk P.
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
vh = v1
P:C1: C2:
C1: {v1, v2, v3, v5, v6, v4, v6, v8, v7, v1, v3, v4, v7, v1}
![Page 55: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/55.jpg)
ShortenRequiredEdgeConnections• Step1: Construct the longest possible walk P (while traversing
Ci) which consists of redundant edges. Let vh be the origin and vj be the terminus of walk P.
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
vh = v1
vj = v3
P:C1: C2:
C1: {v1, v2, v3, v5, v6, v4, v6, v8, v7, v1, v3, v4, v7, v1}
![Page 56: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/56.jpg)
ShortenRequiredEdgeConnections• Step2: Traverse the tour Ci further on to build up walk Q until a redundant
edge (vl, vj) entering vj is found. If such a walk Q = {vj, ..., vl, vj} is found, reverse the orientation of Q in Ci and continue with step 1 starting again at vh
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
vh = v1
vj = v3
P:C1: C2:
C1: {v1, v2, v3, v5, v6, v4, v6, v8, v7, v1, v3, v4, v7, v1}
![Page 57: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/57.jpg)
ShortenRequiredEdgeConnections• Step2: Traverse the tour Ci further on to build up walk Q until a redundant
edge (vl, vj) entering vj is found. If such a walk Q = {vj, ..., vl, vj} is found, reverse the orientation of Q in Ci and continue with step 1 starting again at vh
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
vh = v1
vj = v3
Q:P:C1: C2:
C1: {v1, v2, v3, v5, v6, v4, v6, v8, v7, v1, v3, v4, v7, v1}
![Page 58: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/58.jpg)
ShortenRequiredEdgeConnections• Step2: Traverse the tour Ci further on to build up walk Q until a redundant
edge (vl, vj) entering vj is found. If such a walk Q = {vj, ..., vl, vj} is found, reverse the orientation of Q in Ci and continue with step 1 starting again at vh
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
vh = v1
vj = v3
Q:P:C1: C2:
C1: {v1, v2, v3, v5, v6, v4, v6, v8, v7, v1, v3, v4, v7, v1}
![Page 59: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/59.jpg)
ShortenRequiredEdgeConnections• Step2: Traverse the tour Ci further on to build up walk Q until a redundant
edge (vl, vj) entering vj is found. If such a walk Q = {vj, ..., vl, vj} is found, reverse the orientation of Q in Ci and continue with step 1 starting again at vh
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
vh = v1
vj = v3
Q:P:C1: C2:
C1: {v1, v2, v3, v5, v6, v4, v6, v8, v7, v1, v3, v4, v7, v1}
![Page 60: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/60.jpg)
ShortenRequiredEdgeConnections• Step2: Traverse the tour Ci further on to build up walk Q until a redundant
edge (vl, vj) entering vj is found. If such a walk Q = {vj, ..., vl, vj} is found, reverse the orientation of Q in Ci and continue with step 1 starting again at vh
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
vh = v1
vj = v3
Q:P:C1: C2:
C1: {v1, v2, v3, v5, v6, v4, v6, v8, v7, v1, v3, v4, v7, v1}
![Page 61: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/61.jpg)
ShortenRequiredEdgeConnections• Step2: Traverse the tour Ci further on to build up walk Q until a redundant
edge (vl, vj) entering vj is found. If such a walk Q = {vj, ..., vl, vj} is found, reverse the orientation of Q in Ci and continue with step 1 starting again at vh
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
vh = v1
vj = v3
Q:P:C1: C2:
C1: {v1, v2, v3, v5, v6, v4, v6, v8, v7, v1, v3, v4, v7, v1}
![Page 62: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/62.jpg)
ShortenRequiredEdgeConnections• Step2: Traverse the tour Ci further on to build up walk Q until a redundant
edge (vl, vj) entering vj is found. If such a walk Q = {vj, ..., vl, vj} is found, reverse the orientation of Q in Ci and continue with step 1 starting again at vh
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
vh = v1
vj = v3
Q:P:C1: C2:
C1: {v1, v2, v3, v5, v6, v4, v6, v8, v7, v1, v3, v4, v7, v1}
![Page 63: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/63.jpg)
ShortenRequiredEdgeConnections• Step2: Traverse the tour Ci further on to build up walk Q until a redundant
edge (vl, vj) entering vj is found. If such a walk Q = {vj, ..., vl, vj} is found, reverse the orientation of Q in Ci and continue with step 1 starting again at vh
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
vh = v1
vj = v3
Q:P:C1: C2:
C1: {v1, v2, v3, v5, v6, v4, v6, v8, v7, v1, v3, v4, v7, v1}
![Page 64: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/64.jpg)
ShortenRequiredEdgeConnections• Step2: Traverse the tour Ci further on to build up walk Q until a redundant
edge (vl, vj) entering vj is found. If such a walk Q = {vj, ..., vl, vj} is found, reverse the orientation of Q in Ci and continue with step 1 starting again at vh
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
vh = v1
vj = v3
Q:P:C1: C2:
C1: {v1, v2, v3, v5, v6, v4, v6, v8, v7, v1, v3, v4, v7, v1}
![Page 65: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/65.jpg)
ShortenRequiredEdgeConnections• Step2: Traverse the tour Ci further on to build up walk Q until a redundant
edge (vl, vj) entering vj is found. If such a walk Q = {vj, ..., vl, vj} is found, reverse the orientation of Q in Ci and continue with step 1 starting again at vh
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
vh = v1
vj = v3
Q:P:C1: C2:
C1: {v1, v2, v3, v5, v6, v4, v6, v8, v7, v1, v3, v4, v7, v1}
![Page 66: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/66.jpg)
ShortenRequiredEdgeConnections• Step2: Traverse the tour Ci further on to build up walk Q until a redundant
edge (vl, vj) entering vj is found. If such a walk Q = {vj, ..., vl, vj} is found, reverse the orientation of Q in Ci and continue with step 1 starting again at vh
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
vh = v1
vj = v3
C1: C2:
C1: {v1, v2, v3, v1, v7, v8, v6, v4, v6, v5, v3, v4, v7, v1}
Q:P:
![Page 67: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/67.jpg)
ShortenRequiredEdgeConnections• Step1: Construct the longest possible walk P (while traversing
Ci) which consists of redundant edges. Let vh be the origin and vj be the terminus of walk P.
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
C1: C2:
C1: {v1, v2, v3, v1, v7, v8, v6, v4, v6, v5, v3, v4, v7, v1}
![Page 68: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/68.jpg)
ShortenRequiredEdgeConnections• Step1: Construct the longest possible walk P (while traversing
Ci) which consists of redundant edges. Let vh be the origin and vj be the terminus of walk P.
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
P:C1: C2:
C1: {v1, v2, v3, v1, v7, v8, v6, v4, v6, v5, v3, v4, v7, v1}
![Page 69: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/69.jpg)
ShortenRequiredEdgeConnections• Step1: Construct the longest possible walk P (while traversing
Ci) which consists of redundant edges. Let vh be the origin and vj be the terminus of walk P.
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
P:C1: C2:
C1: {v1, v2, v3, v1, v7, v8, v6, v4, v6, v5, v3, v4, v7, v1}
![Page 70: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/70.jpg)
ShortenRequiredEdgeConnections• Step1: Construct the longest possible walk P (while traversing
Ci) which consists of redundant edges. Let vh be the origin and vj be the terminus of walk P.
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
P:C1: C2:
C1: {v1, v2, v3, v1, v7, v8, v6, v4, v6, v5, v3, v4, v7, v1}
![Page 71: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/71.jpg)
ShortenRequiredEdgeConnections• Step1: Construct the longest possible walk P (while traversing
Ci) which consists of redundant edges. Let vh be the origin and vj be the terminus of walk P.
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
vh = v1
P:C1: C2:
C1: {v1, v2, v3, v1, v7, v8, v6, v4, v6, v5, v3, v4, v7, v1}
![Page 72: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/72.jpg)
ShortenRequiredEdgeConnections• Step1: Construct the longest possible walk P (while traversing
Ci) which consists of redundant edges. Let vh be the origin and vj be the terminus of walk P.
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
vh = v1
vj = v1
P:C1: C2:
C1: {v1, v2, v3, v1, v7, v8, v6, v4, v6, v5, v3, v4, v7, v1}
![Page 73: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/73.jpg)
ShortenRequiredEdgeConnections• Step2: Traverse the tour Ci further on to build up walk Q until a redundant
edge (vl, vj) entering vj is found. If such a walk Q = {vj, ..., vl, vj} is found, reverse the orientation of Q in Ci and continue with step 1 starting again at vh
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
vh = v1
vj = v1
P:C1: C2:
C1: {v1, v2, v3, v1, v7, v8, v6, v4, v6, v5, v3, v4, v7, v1}
![Page 74: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/74.jpg)
ShortenRequiredEdgeConnections• Step2: Traverse the tour Ci further on to build up walk Q until a redundant
edge (vl, vj) entering vj is found. If such a walk Q = {vj, ..., vl, vj} is found, reverse the orientation of Q in Ci and continue with step 1 starting again at vh
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
vh = v1
vj = v1
Q:P:C1: C2:
C1: {v1, v2, v3, v1, v7, v8, v6, v4, v6, v5, v3, v4, v7, v1}
![Page 75: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/75.jpg)
ShortenRequiredEdgeConnections• Step2: Traverse the tour Ci further on to build up walk Q until a redundant
edge (vl, vj) entering vj is found. If such a walk Q = {vj, ..., vl, vj} is found, reverse the orientation of Q in Ci and continue with step 1 starting again at vh
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
vh = v1
vj = v1
Q:P:C1: C2:
C1: {v1, v2, v3, v1, v7, v8, v6, v4, v6, v5, v3, v4, v7, v1}
![Page 76: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/76.jpg)
ShortenRequiredEdgeConnections• Step2: Traverse the tour Ci further on to build up walk Q until a redundant
edge (vl, vj) entering vj is found. If such a walk Q = {vj, ..., vl, vj} is found, reverse the orientation of Q in Ci and continue with step 1 starting again at vh
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
vh = v1
vj = v1
Q:P:C1: C2:
C1: {v1, v2, v3, v1, v7, v8, v6, v4, v6, v5, v3, v4, v7, v1}
![Page 77: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/77.jpg)
ShortenRequiredEdgeConnections• Step2: Traverse the tour Ci further on to build up walk Q until a redundant
edge (vl, vj) entering vj is found. If such a walk Q = {vj, ..., vl, vj} is found, reverse the orientation of Q in Ci and continue with step 1 starting again at vh
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
vh = v1
vj = v1
Q:P:C1: C2:
C1: {v1, v2, v3, v1, v7, v8, v6, v4, v6, v5, v3, v4, v7, v1}
![Page 78: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/78.jpg)
ShortenRequiredEdgeConnections• Step2: Traverse the tour Ci further on to build up walk Q until a redundant
edge (vl, vj) entering vj is found. If such a walk Q = {vj, ..., vl, vj} is found, reverse the orientation of Q in Ci and continue with step 1 starting again at vh
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
vh = v1
vj = v1
Q:P:C1: C2:
C1: {v1, v2, v3, v1, v7, v8, v6, v4, v6, v5, v3, v4, v7, v1}
![Page 79: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/79.jpg)
ShortenRequiredEdgeConnections• Step2: Traverse the tour Ci further on to build up walk Q until a redundant
edge (vl, vj) entering vj is found. If such a walk Q = {vj, ..., vl, vj} is found, reverse the orientation of Q in Ci and continue with step 1 starting again at vh
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
vh = v1
vj = v1
Q:P:C1: C2:
C1: {v1, v2, v3, v1, v7, v8, v6, v4, v6, v5, v3, v4, v7, v1}
![Page 80: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/80.jpg)
ShortenRequiredEdgeConnections• Step2: Traverse the tour Ci further on to build up walk Q until a redundant
edge (vl, vj) entering vj is found. If such a walk Q = {vj, ..., vl, vj} is found, reverse the orientation of Q in Ci and continue with step 1 starting again at vh
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
vh = v1
vj = v1
Q:P:C1: C2:
C1: {v1, v2, v3, v1, v7, v8, v6, v4, v6, v5, v3, v4, v7, v1}
![Page 81: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/81.jpg)
ShortenRequiredEdgeConnections• Step2: Traverse the tour Ci further on to build up walk Q until a redundant
edge (vl, vj) entering vj is found. If such a walk Q = {vj, ..., vl, vj} is found, reverse the orientation of Q in Ci and continue with step 1 starting again at vh
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
vh = v1
vj = v1
Q:P:C1: C2:
C1: {v1, v2, v3, v1, v7, v8, v6, v4, v6, v5, v3, v4, v7, v1}
![Page 82: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/82.jpg)
ShortenRequiredEdgeConnections• Step2: Traverse the tour Ci further on to build up walk Q until a redundant
edge (vl, vj) entering vj is found. If such a walk Q = {vj, ..., vl, vj} is found, reverse the orientation of Q in Ci and continue with step 1 starting again at vh
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
vh = v1
vj = v1
Q:P:C1: C2:
C1: {v1, v2, v3, v1, v7, v8, v6, v4, v6, v5, v3, v4, v7, v1}
![Page 83: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/83.jpg)
ShortenRequiredEdgeConnections• Step2: Traverse the tour Ci further on to build up walk Q until a redundant
edge (vl, vj) entering vj is found. If such a walk Q = {vj, ..., vl, vj} is found, reverse the orientation of Q in Ci and continue with step 1 starting again at vh
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
vh = v1
vj = v1
Q:P:C1: C2:
C1: {v1, v2, v3, v1, v7, v8, v6, v4, v6, v5, v3, v4, v7, v1}
![Page 84: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/84.jpg)
ShortenRequiredEdgeConnectionsStep3: Replace P by the shortest path SP(vh, vj) if w(SP(vh, vj)) <
w(P). Continue with step 1 with the edge following the last edge of P.
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
vh = v1
vj = v1
Q:P:C1: C2:
C1: {v1, v2, v3, v1, v7, v8, v6, v4, v6, v5, v3, v4, v7, v1}
![Page 85: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/85.jpg)
ShortenRequiredEdgeConnectionsStep3: Replace P by the shortest path SP(vh, vj) if w(SP(vh, vj)) <
w(P). Continue with step 1 with the edge following the last edge of P.
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
vh = v1
vj = v1
Q:P:C1: C2:
C1: {v1, v2, v3, v1, v7, v8, v6, v4, v6, v5, v3, v4, v7, v1}
![Page 86: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/86.jpg)
ShortenRequiredEdgeConnectionsStep3: Replace P by the shortest path SP(vh, vj) if w(SP(vh, vj)) <
w(P). Continue with step 1 with the edge following the last edge of P.
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
vh = v1
vj = v1
Q:P:C1: C2:
C1: {v1, v2, v3, v1, v7, v8, v6, v4, v6, v5, v3, v4, v7, v1}
![Page 87: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/87.jpg)
ShortenRequiredEdgeConnectionsStep3: Replace P by the shortest path SP(vh, vj) if w(SP(vh, vj)) <
w(P). Continue with step 1 with the edge following the last edge of P.
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
vh = v1
vj = v1
Q:P:C1: C2:
C1: {v1, v2, v3, v1, v7, v8, v6, v4, v6, v5, v3, v4, v7, v1}
![Page 88: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/88.jpg)
What is Tabu search?
• Tabu search is created by Fred W. Glover in 1986.• Tabu search is used for optimization problem.• Neighborhood is a solution set which improves
the current solution.• If a potential solution has been previously visited
within a certain short-term period or if it has violated a rule, it is marked as "tabu" (forbidden) so that the algorithm does not consider that possibility repeatedly.
![Page 89: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/89.jpg)
Neighborhoods
• Three Neighborhood structures– TwoEdgeExchange– RequiredEdgeWalkExchange– SingleRequiredEdgeExchange
![Page 90: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/90.jpg)
The flow of exchange
The longest tour Ci another tour Cj
![Page 91: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/91.jpg)
The flow of exchange
The longest tour Ci Walk H another tour Cj
Separate
![Page 92: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/92.jpg)
The flow of exchange
The longest tour Ci Walk H
Apply improvement procedure
another tour Cj
Separate
![Page 93: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/93.jpg)
The flow of exchange
The longest tour Ci Walk H
Apply improvement procedure
another tour Cj
Separate Merge
![Page 94: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/94.jpg)
The flow of exchange
The longest tour Ci Walk H
Apply improvement procedure
another tour Cj
Apply improvement procedure
Separate Merge
![Page 95: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/95.jpg)
TwoEdgeExchange• The TwoEdgeExchange neighborhood considers two
consecutive edges e and f in the longest tour Ci.
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
w(C2) = 94
w(C1) = 93
C2:
C1:
![Page 96: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/96.jpg)
TwoEdgeExchange• The TwoEdgeExchange neighborhood considers two
consecutive edges e and f in the longest tour Ci.
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
w(C2) = 94
w(C1) = 93
C2:
C1:
![Page 97: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/97.jpg)
TwoEdgeExchange• The TwoEdgeExchange neighborhood considers two
consecutive edges e and f in the longest tour Ci.
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
w(C2) = 94
w(C1) = 93
C2:
C1:
![Page 98: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/98.jpg)
RequiredEdgeWalkExchange• P is composed of redundant edges.• e is a required edge.• The RequiredEdgeWalkExchange neighborhood considers
walks H = {P1, e, P2} in the longest tour Ci.
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
w(C2) = 94
w(C1) = 93
C2:
C1:
![Page 99: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/99.jpg)
RequiredEdgeWalkExchange• P is composed of redundant edges.• e is a required edge.• The RequiredEdgeWalkExchange neighborhood considers
walks H = {P1, e, P2} in the longest tour Ci.
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
w(C2) = 94
w(C1) = 93
C2:
C1:
![Page 100: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/100.jpg)
RequiredEdgeWalkExchange• P is composed of redundant edges.• e is a required edge.• The RequiredEdgeWalkExchange neighborhood considers
walks H = {P1, e, P2} in the longest tour Ci.
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
w(C2) = 94
w(C1) = 93
C2:
C1:
![Page 101: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/101.jpg)
RequiredEdgeWalkExchange• P is composed of redundant edges.• e is a required edge.• The RequiredEdgeWalkExchange neighborhood considers
walks H = {P1, e, P2} in the longest tour Ci.
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
w(C2) = 94
w(C1) = 93
C2:
C1:
![Page 102: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/102.jpg)
RequiredEdgeWalkExchange• P is composed of redundant edges.• e is a required edge.• The RequiredEdgeWalkExchange neighborhood considers
walks H = {P1, e, P2} in the longest tour Ci.
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
w(C2) = 94
w(C1) = 93
C2:
C1:
![Page 103: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/103.jpg)
SingleRequiredEdgeExchange• The SingleRequiredEdgeExchange neighborhood
considers required edges e in the longest tour Ci.
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
w(C2) = 94
w(C1) = 93
C2:
C1:
![Page 104: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/104.jpg)
SingleRequiredEdgeExchange• The SingleRequiredEdgeExchange neighborhood
considers required edges e in the longest tour Ci.
7
1
1
v2
v1
v5
v3
v6
v4
v7
v8
13
38 8
2 2427
18
7
26
210
w(C2) = 94
w(C1) = 93
C2:
C1:
![Page 105: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/105.jpg)
The tabu search algorithm
• Input: A k-postman tour, the maximum number of iterations without improvement called maxNOfItsWithoutImprovement, a tabu tenure called tabuTenure and a flag called improvementProcedure.
• Output: A possibly improved k-postman tour
![Page 106: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/106.jpg)
The tabu search algorithmA k-postman tour
![Page 107: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/107.jpg)
The tabu search algorithm
Compute a list of neighborhood solutions N in decreasing order of improvement value.
A k-postman tour
![Page 108: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/108.jpg)
The tabu search algorithm
Compute a list of neighborhood solutions N in decreasing order of improvement value.
Select the first solution of the list as current solution if it is non-tabu or tabu but better than the best solution. (if no such solution then the algorithm terminates)
A k-postman tour
![Page 109: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/109.jpg)
The tabu search algorithm
Compute a list of neighborhood solutions N in decreasing order of improvement value.
Select the first solution of the list as current solution if it is non-tabu or tabu but better than the best solution. (if no such solution then the algorithm terminates)
A k-postman tour
If current solution value < best solution value then best solution = current solution.
![Page 110: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/110.jpg)
The tabu search algorithm
Compute a list of neighborhood solutions N in decreasing order of improvement value.
Select the first solution of the list as current solution if it is non-tabu or tabu but better than the best solution. (if no such solution then the algorithm terminates)
If the number of iterations < the max number of iterations then continue this algorithm, or the algorithm terminates.
A k-postman tour
If current solution value < best solution value then best solution = current solution.
![Page 111: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/111.jpg)
Computational results
• Parameters– tabuTenure = 20– maxNOfIterationsWithoutImprovement = 100
![Page 112: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/112.jpg)
Computational results
• Two improvement index– Let x be the value of the best heuristic solution from [2]– Let y be the best solution value obtained by the tabu
search algorithm for all possible configurations of neighborhood structures and improvement procedures.
– Let z be the best lower bound obtained by the lower bounds SPT-LB and CPP/k-LB presented in [2].
– Average impr.(%) = (x - y) * 100 / x– Average gap(%) = (y - z) * 100 / y
![Page 113: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/113.jpg)
Computational results
![Page 114: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/114.jpg)
Computational results
![Page 115: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/115.jpg)
Computational results
![Page 116: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/116.jpg)
Computational results
![Page 117: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/117.jpg)
Computational results
![Page 118: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/118.jpg)
Computational results
![Page 119: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/119.jpg)
Computational results
![Page 120: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/120.jpg)
Computational results
![Page 121: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/121.jpg)
References
![Page 122: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/122.jpg)
References
![Page 123: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/123.jpg)
References
![Page 124: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/124.jpg)
References
![Page 125: A tabu search algorithm for the min max k-chinese postman problem](https://reader036.vdocuments.pub/reader036/viewer/2022081517/58e575051a28abbf5d8b4763/html5/thumbnails/125.jpg)
References