Escolar Documentos
Profissional Documentos
Cultura Documentos
Anang Z.Gani
Department of Industrial Engineering
Institut Teknologi Bandung
Bandung, Indonesia 2012
ganiaz@gmail.com
ganiaz@mail.ti.itb.ac.id
AZG
2012
INTRODUCTION
OBJECTIVE
BACKGROUND
INTERACTION THEORY
COMPUTATIONAL
EXPERIENCES AND
EXAMPLE
CONCLUSION
AZG
2012
INTRODUCTIO
N
3
AZG
2012
AZG
2012
AZG
2012
4
123-4
1233-1
1324-1
AZG
2012
AZG
2012
AZG
2012
AZG
2012
SOAL 33 KOTA
AZG
2012
150 CITIES
11
AZG
2012
150 CITIES
12
AZG
2012
OBJECTIVE
13
AZG
2012
7 (tujuh)
problem
matematik
a pada
millenium
ini
AZG
2012
. "The P versus NP
Problem" is considered
one of the seven greatest
unsolved mathematical
problems
15
AZG
2012
One important statement about the NPcomplete problem (Papadimitriou & Steiglitz) :
a. No NP-complete problem can be solved by
any known polynomial algorithm (and this
is the resistance despite efforts by many
brilliant researchers for many decades).
b. If there is a polynomial algorithm for any
NP-complete problem, then there are
polynomial algorithms for all NP-complete
problems.
16
AZG
2012
BACKGROUND
17
AZG
2012 HAMILTON (1800)
MENGER (1920)
LINEAR
PROGREMING
1. EXACT SOLUTIONS
LP, IP, BB , C.P, DP,
ELIPSOIND &
PROJECTIVE
SCALING.
2. HEURISTIC
. CONSTRUCTIVE
. IMPROEV METHOD
. METAHEURISTICS
. BIOPLOGICAL
BEHAVIOR
3. COMPUTER
TECHNOLOGY
P VS NP
P = NP OR P NP
NEW PARADIGM
INTERACTION THEORY (P = NP)
18
AZG
2012
19
AZG
2012
NEW PARADIGM
(BREAKTHROUGH)
20
AZG
2012
PARADIGM
OLD
NEW
1. LP & DERIVATIVES
2. HEURISTIC
(PROBABILISTIC)
3. PROCEDURE IS
COMPLICATED
4. NEEDS RESOURCES OF
TIME AND MEMORY
UNLIMITED
5. CHECKING ALL
ELEMENTS
1. INTERACTION THEORY
2. DETERMINISTIC
3. PROCEDURE IS SO
SIMPLE
4. RESOURCES NEED IS
LIMITED
6. P = NP VS P NP ?
7. KNOWLEDGE IS HIGH
8. LONG OPERATING
TIME
5. CHECKING LIMITED
ELEMENTS (PRIORITY)
6. P=NP
7. SIMPLE ARITHMATIC
8. SHORT OPERATING
TIME (EFFICIENT AND
EFFECTIVE)
21
AZG
2012
Research Team
Size of Instance
1954
49 cities
1971
64 cities
1975
67 cities
1977
M. Grtschel
120 cities
1980
318 cities
1987
1987
1987
2,392 cities
1994
D. Applegate, R. Bixby, V.
Chvtal, and W. Cook
7,397 cities
1998
D. Applegate, R. Bixby, V.
Chvtal, and W. Cook
13,509 cities
(4 Years)
532 cities
(109,5 secon)
666 cities
22
AZG
2012
Research Team
Size of Instance
2001
15,112 cities
(ca. 22 Years)
2004
24,978 cities
2006
85,900 cities
2009
1,904,711 cities
2009
Yuichi Nagata
100.000
Mona Lisa
23
AZG
2012
TECHNIQUE
TECHNIQUE AND
AND METHOD
METHOD
FOR
FOR SOLVING
SOLVING TSP
TSP
HEURISTIC
NEURAL
NEURALNETWORK
NETWORK
GENETIC
GENETICALGORITHM
ALGORITHM
SIMULATED
SIMULATEDANNEALING
ANNEALING
ARTIFICIAL
INTELLEGENT
ARTIFICIAL INTELLEGENT
EXPERT
EXPERTSYSTEM
SYSTEM
FRACTAL
FRACTAL
TABU
TABUSEARCH
SEARCH
NEAREST
NEARESTNEIGBOR
NEIGBOR
THRESHOLD
THRESHOLDALGORITHM
ALGORITHM
ANT
ANTCOLONY
COLONYOPTIMIZATION
OPTIMIZATION
EXACT SOLUTION
LINEAR
LINEARPROGRAMMING
PROGRAMMING
INTEGER
INTEGERPROGRAMMING
PROGRAMMING
CUTTING
CUTTINGPLANE
PLANE
DYNAMIC
DYNAMICPROGRAMMING
PROGRAMMING
THE
MINIMUM
THE MINIMUMSPANNING
SPANNING
TREE
TREE
LAGRANGE
LAGRANGERELAXATION
RELAXATION
ELLIPSOID
ELLIPSOIDALGORITHM
ALGORITHM
PROJECTIVE
PROJECTIVESCALING
SCALING
ALGORITHM
ALGORITHM
BRANCH
BRANCHAND
ANDBOUND
BOUND
ASAINMENT
ASAINMENT
24
AZG
2012
OBJECTIVE FUNCTION
n
z x(i, j)d(i, j)
i1 j 1
25
Constraints
AZG
2012
n
x(i, j) 1 , i 1,2,...,n
j 1
n
x(i, j) 1 , j 1,2,...,n
i 1
i , jS
S = subset of cities
|S| = cardinality of S (# of elements in S)
There are 2n such sets !!!!!!!
AZG
2012
NUMBER OF LINIER
INEQUALITIES AS CONSTRAINS
IN TSP
If
If n=15
n=15 the
the number
number of
of
countraints
countraints is
is 1.993.711.339.620
1.993.711.339.620
If
If n=50
n=50 the
the number
number of
of
60
countraints
10
countraints 1060
If
If n=120
n=120 the
the number
number of
of
179
countraints
2
x
10
countraints 2 x 10179 or
or to
to be
be
exact
exact ::
26792549076063489375554618994821987399
26792549076063489375554618994821987399
57886903776870780484651943295772470308
57886903776870780484651943295772470308
62734015632117088075939986913459296483
62734015632117088075939986913459296483
64341894253344564803682882554188736242
64341894253344564803682882554188736242
799920969079258554704177287
799920969079258554704177287
Grotschel
27
AZG
2008
FORMULASI MODEL PERSOALAN
DENGAN METODA ZERO - ONE
>>
>> Min
Min 1000X111+
1000X111+ 93X121+
93X121+ 82X131+
82X131+ 44X141+
44X141+ 68X151+
68X151+ 93X211+
93X211+
1000X221+
150X231+
137X241+
62X251+
82X311+
150X321+
1000X221+ 150X231+ 137X241+ 62X251+ 82X311+ 150X321+
1000X331+
1000X331+38X341+
38X341+99X351+
99X351+44X411+
44X411+137X421+
137X421+38X431+
38X431+1000X441+
1000X441+
88X451+
88X451+ 68X511+
68X511+ 62X521+
62X521+ 99X531+
99X531+ 88X541+1000X551+
88X541+1000X551+ 1000X112+
1000X112+
93X122+
82X132+
44X142+
68X152+
93X212+
1000X222+
93X122+ 82X132+ 44X142+ 68X152+ 93X212+ 1000X222+ 150X232+
150X232+
137X242+
62X252+
82X312+
150X322+
1000X332+
38X342+
137X242+ 62X252+ 82X312+ 150X322+ 1000X332+ 38X342+ 99X352+
99X352+
44X412+
137X422+
38X432+
1000X442+
88X452+
68X512+
62X522+
44X412+ 137X422+ 38X432+ 1000X442+ 88X452+ 68X512+ 62X522+
99X532+
99X532+ 88X542+
88X542+ 1000X552+
1000X552+ 1000X113+
1000X113+ 93X123+
93X123+ 82X133+
82X133+ 44X143+
44X143+
68X153+
68X153+ 93X213+
93X213+ 1000X223+
1000X223+ 150X233+
150X233+ 137X243+
137X243+ 62X253+
62X253+ 82X313+
82X313+
150X323+
1000X333+
38X343+
99X353+
44X413+
137X423+
38X433+
150X323+ 1000X333+ 38X343+ 99X353+ 44X413+ 137X423+ 38X433+
1000X443+
1000X443+ 88X453+
88X453+ 68X5134
68X5134 62X523+
62X523+ 99X533+
99X533+ 88X543
88X543 ++ 1000X554+
1000X554+
1000X114+
93X124+
82X134+
44X144+
68X154+
93X214+
1000X224+
1000X114+ 93X124+ 82X134+ 44X144+ 68X154+ 93X214+ 1000X224+
150X234+
150X234+137X244+
137X244+62X254+
62X254+82X314+
82X314+150X324+
150X324+1000X334+
1000X334+38X344+
38X344+
99X354+
99X354+ 44X414+
44X414+ 137X424+
137X424+ 38X434+
38X434+ I000X444+
I000X444+ 88X454+
88X454+ 68X514+
68X514+
62X524+
99X534+
88X544+
1000X554+
I000X115+
93X125+
82X135+
62X524+ 99X534+ 88X544+ 1000X554+ I000X115+ 93X125+ 82X135+
44X145+
44X145+ 68X155+
68X155+ 93X215+
93X215+ 1000X225+
1000X225+ 150X235+
150X235+ 137X245+
137X245+ 62X255+
62X255+
82X315+
150X325+
1000X335+38X345+
99X355+
44X415+
137X425+
82X315+ 150X325+ 1000X335+38X345+ 99X355+ 44X415+ 137X425+
38X435+
1000X445+
38X435+
1000X445+
88X455+68X515+62X525+99X535+88X545+1000X555
88X455+68X515+62X525+99X535+88X545+1000X555
28
AZG
2008
>>Subjed
>>Subjedtoto
>>(1)1X121+1X131+1X141+1X151=1
>>(1)1X121+1X131+1X141+1X151=1
>>(2)1X215+1X315+1X415+1X515=1
>>(2)1X215+1X315+1X415+1X515=1
>>(3)1X232+1X242+1X252+1X322+1X342+1X352+1X422+1X432+1X452+1X522+1X532+1X542=1
>>(3)1X232+1X242+1X252+1X322+1X342+1X352+1X422+1X432+1X452+1X522+1X532+1X542=1
>>(4)1X233+1X243+1X253+1X323+1X343+1X353+1X423+1X433+1X453+1X523+1X533+1X543=1
>>(4)1X233+1X243+1X253+1X323+1X343+1X353+1X423+1X433+1X453+1X523+1X533+1X543=1
>>(5)1X234+1X244+1X254+1X324+1X344+1X354+1X424+1X434+1X454+1X524+1X534+1X544=1
>>(5)1X234+1X244+1X254+1X324+1X344+1X354+1X424+1X434+1X454+1X524+1X534+1X544=1
>>(6)1X251+1X232+1X242+1X223+1X233+1X243+1X224+1X234+1X244+1X215=1
>>(6)1X251+1X232+1X242+1X223+1X233+1X243+1X224+1X234+1X244+1X215=1
>>(7)1X351+1X322+1X342+1X323+1X343+1X324+1X344+1X315=1
>>(7)1X351+1X322+1X342+1X323+1X343+1X324+1X344+1X315=1
>>(8)1X451+1X422+1X432+1X423+1X433-1X424+1X415=1
>>(8)1X451+1X422+1X432+1X423+1X433-1X424+1X415=1
>>(9)1X522+1X532+1X542+1X523+1X533+1X543+1X524+1X534+1X544+1X515=1
>>(9)1X522+1X532+1X542+1X523+1X533+1X543+1X524+1X534+1X544+1X515=1
>>(10)1X121+1X322+1X422+1X522+1X223+1X323+1X423+1X523+1X224+1X324+1X424+1X524=1
>>(10)1X121+1X322+1X422+1X522+1X223+1X323+1X423+1X523+1X224+1X324+1X424+1X524=1
>>(11)1X131+1X232+1X332+1X432+1X532+1X233+1X433+1X533+1X224+1X324+1X424+1X524=
>>(11)1X131+1X232+1X332+1X432+1X532+1X233+1X433+1X533+1X224+1X324+1X424+1X524=11
>>(12)1X141+1X242+1X342+1X542+1X243+1X343+1X543+1X244+1X344+1X544=1
>>(12)1X141+1X242+1X342+1X542+1X243+1X343+1X543+1X244+1X344+1X544=1
>>(13)1X151+1X252+1X352+1X452+1X253+1X353+1X453+1X254+1X354+1X454=1
>>(13)1X151+1X252+1X352+1X452+1X253+1X353+1X453+1X254+1X354+1X454=1
>>(14)1X121-1X232-1X242-1X252+1X322=0
>>(14)1X121-1X232-1X242-1X252+1X322=0
>>(15)1X131-lX322>>(15)1X131-lX322-lX342-1X352=0
lX342-1X352=0
>>(16)1X141-1X422-1X432-1X452=0
>>(16)1X141-1X422-1X432-1X452=0
>>(17)1X151-1X522-1X532-1X542=0
>>(17)1X151-1X522-1X532-1X542=0
>>(18)1X322+1X422+1X522-1X233-1X243-1X253=0
>>(18)1X322+1X422+1X522-1X233-1X243-1X253=0
>>(19)1X232+1X332+1X432+1X532-1X323-1X343-1X353=0
>>(19)1X232+1X332+1X432+1X532-1X323-1X343-1X353=0
>>(20)1X242+1X342+1X542-1X423-1X433-1X453=0
>>(20)1X242+1X342+1X542-1X423-1X433-1X453=0
>>(21)1X252+1X352+1X452-1X523-1X533-1X543=0
>>(21)1X252+1X352+1X452-1X523-1X533-1X543=0
>>(22)1X323+1X423+1X523-1X234-1X244-1X254=0
>>(22)1X323+1X423+1X523-1X234-1X244-1X254=0
>>(23)1X233+1X433+1X533>>(23)1X233+1X433+1X533-lX324lX324-lX344lX344-lX354=0
lX354=0
>>(24)1X243+1X343+1X543+1X424+1X434+1X454=0
>>(24)1X243+1X343+1X543+1X424+1X434+1X454=0
>>(25)1X253+1X353+1X453-1X524-1X534-1X544=0
>>(25)1X253+1X353+1X453-1X524-1X534-1X544=0
>>(26)1X324+1X424+1X524-1X215=0
>>(26)1X324+1X424+1X524-1X215=0
>>(27)1X234+1X434+1X534-1X315=0
>>(27)1X234+1X434+1X534-1X315=0
>>(28)1X244+1X344+1X544-1X415=0
>>(28)1X244+1X344+1X544-1X415=0
>>(29)1X254+1X354+1X454-1X515=0
>>(29)1X254+1X354+1X454-1X515=0
>>(29)1X254+1X354+1X454-1X515=0
>>(29)1X254+1X354+1X454-1X515=0
29
AZG
2012
INTERACTION THEORY
30
AZG
2012
INTERACTION THEORY
In 1965 Anang Z. Gani [28] did research on the Facilities Planning
problem as a special project (Georgia Tach in 1965)
Supervision James Apple
Later, J. M. Devis and K. M. Klein further continued the original
work of Anang Z. Gani
Then M. P. Deisenroth PLANET direction of James Apple
(Georgia Tech in1971)
Since 1966, Anang Z. Gani has been continuing his research and
further developed a new concept which is called The Interaction
Theory (INSTITUT TEKNOLOGI BANDUNG)
The model is the From - To chart the which provides quantitative
information of the movement between departments
31
AZG
2012
AZG
2012
AZG
2012
34
AZG
2012
700
10
20
800
15
10
10
30
RELATIVE VALUE
35
AZG
2012
36
AZG
2012
37
AZG
2012
The algorithm is
divided into two
general phases:
Preparation phase
Processing phase
38
AZG
2012
1. Preparation phase
consists of main 5
steps:
o Defining distance between cities or the
interaction matrix (IMAT)
o Normalization of IMAT (NIMAT)
o Calculating the interaction coefficient
matrix (ICOM)
o Sorting the interaction coefficient as the
sorted ICOM (SICOM)
o Prioritizing the interaction between
cities using the delta interaction matrix
(DIM)
39
AZG
2012
Total
m
1
x11
x1j
xin
Xi.
xii
x1j
xin
Xi.
xm1
Total
xmn
X.j
Xi..
40
AZG
2012
41
AZG
2012
42
AZG
2012
c11
cij
cin
ci1
cij
cin
cm1
cmj
cmn
43
AZG
2012
*
*
SICOM
1
=
i
1, .,n-1
= 1, .,m
..
c(1,2)
c(1,5)
c(1,3)
10
11
c(k,10)
c(k,4)
c(k,11)
17
c(m,3)
c(m,17)
c(m,2)
..
..
k
..
m
Note of the element: The top value is the original ICOM column number
The bottom value is the sorted interaction coefficient
44
AZG
2012
DIM
1
1
2
2
5
..
l
3
..
d(1,2)= c(1,2)c(1,2)=0
d(1,5)= c(1,5)-c(1,2)
d(1,3)= c(1,3)c(1,2)
10
11
d(k,10)= c(k,10)c(k,10)=0
d(k,4)= c(k,4)c(k,10)
d(k,11)= c(k,11)c(k,10)
17
d(m,3)= c(m,3)c(m,3)=0
d(m,17)= c(m,17)c(m,3)
d(m,2)= c(m,2)c(m,3)
..
k
..
m
AZG
2012
2. Processing
phase
Processing phase is searching process is
to choose the shortest path.
The searching process is to choose the
shortest path. The searching is related to
the priority
Guide line to use the DIM for
determining the optimal solution (8
Columns)
46
AZG
2012
COMPUTATIONAL
EXPERIENCES AND
EXAMPLE
47
AZG
2012
Total
900
420
876
788
988
876
4848
677
767
410
865
777
698
4194
777
411
658
898
956
633
4333
689
876
764
411
784
560
4084
888
390
768
650
736
390
3822
427
843
879
747
698
856
4450
987
733
677
747
987
289
4420
Total
4445
4153
4275
4088
4647
4530
4013
30151
48
AZG
2012
Total
11000
10900
10420
10876
10788
10988
10876
75848
10677
11000
10767
10410
10865
10777
10698
75194
10777
10411
11000
10658
10898
10956
10633
75333
10689
10876
10764
11000
10411
10784
10560
75084
10888
10390
10768
10650
11000
10736
10390
74822
10427
10843
10879
10747
10698
11000
10856
75450
10987
10733
10677
10747
10987
10289
11000
75420
Total
75445
75153
75275
75088
75647
75530
75013
527151
109002
= 20.843
76848 x 75445
49
AZG
2012
3. The Interaction
Coefficient Matrix (ICOM)
7X7
1
AZG
2012
3
19.016
4
19.193
2
19.144
5
19.082
2
19.197
1
19.099
6
18.584
5
20.283
1
20.094
7
20.007
7
19.799
7
19.233
5
20.051
3
20.079
4
20.769
7
20.290
4
20.081
1
20.169
4
20.188
4
20.386
2
20.324
7
20.790
6
20.449
1
20.435
3
20.499
6
20.395
2
20.734
4
20.394
2
20.843
3
20.481
5
20.840
6
20.506
3
20.586
7
20.823
5
21.158
6
21.075
5
20.753
6
21.095
2
20.962
1
21.000
3
20.838
1
21.214
1
21.145
2
21.411
3
21.337
4
21.461
5
21.377
6
21.232
7
21.387
51
AZG
2012
3
0
4
0
2
0
5
0
2
0
1
0
6
0
5
1.267
1
901
7
863
7
717
7
36
5
952
3
1.495
4
1.753
7
1.097
4
937
1
1.087
4
991
4
1.287
2
1.740
7
1.774
6
1.256
1
1.291
3
1.417
6
1.198
2
1.635
4
1.810
2
1.827
3
1.288
5
1.696
6
1.424
3
1.389
7
1.724
5
2.574
6
2.059
5
1.560
6
1.951
2
1.880
1
1.803
3
1.739
1
2.630
1
2.129
2
2.218
3
2.193
4
2.379
5
2.180
6
2.133
7
2.803
52
AZG
2012
Computational experiences
Breakthrough for a TSP algorithm
53
AZG
2012
TSP
TSP
INTERACTIO
N
THEORY
GENERA
L
P=N
P
AZG
2012
AZG
2012 THE
Road Trips
Mapping Genomes
Constructing universal DNA linkers
Aiming Telescopes, X-rays, and Lasers
Guiding Industrial Machines
Organizing Data
X-ray Crytallography
Tests for Microprocessors
Scheduling Jobs
Planning hiking path in a nature park
Gathering geophysical seismic data
Customized Computer Chip
57
AZG
2012
Graph
Decision
Making
Scheduling
Clustering
TSP
(Symmetric & Asymmetric
Layout
Problems
Routing
Location
Problems
Financial
Analysis
Assignment
Problems
Network Problems
Data Mining
58
AZG
2012
Operations Research
Transportasi
Computer Science
Industri
Telekomunikasi
Militer
Ekonomi
Distribusi / Logistik
Kimia
Strategi
Sosial
Fisika
Finansial
Psikologi
Biologi
59
AZG
90
2012
64
80
65
66
63
49
70
71
20
19
60
90
11
36
32
10
62
35
30
51
70
34
47
81
48
88
82
50
31
33
69
50
46
8
45
76
52
18
5
99
61
30
85
16
93
96
101
94
59
98
91
86
68
53
92
37
26
54
58
55
40
21
97
73
87
42
44
24
80
13
95
100
20
25
72
74
22
57
56
39
75
14
38
10
29
12
17
79
28
89
60
84
77
27
83
40
78
15
43
23
41
67
0
0
10
20
30
40
50
60
70
80
AZG
2012
AZG
2012
62
AZG
2012
CONCLUSION
AZG
2012
SIMPLICITY IS
POWER
THANK
YOU
64
65
66
67