%PDF-1.5
%
4 0 obj
<< /S /GoTo /D (chapter.1) >>
endobj
7 0 obj
(Introduction)
endobj
8 0 obj
<< /S /GoTo /D (section.1.1) >>
endobj
11 0 obj
(Objectives)
endobj
12 0 obj
<< /S /GoTo /D (chapter.2) >>
endobj
15 0 obj
(The Two Dimensional Pre-Marshalling Problem)
endobj
16 0 obj
<< /S /GoTo /D (section.2.1) >>
endobj
19 0 obj
(Pre-Marshalling Problem)
endobj
20 0 obj
<< /S /GoTo /D (section*.10) >>
endobj
23 0 obj
(Problem parameters)
endobj
24 0 obj
<< /S /GoTo /D (section.2.2) >>
endobj
27 0 obj
(Two Dimensional Pre-Marshalling Problem)
endobj
28 0 obj
<< /S /GoTo /D (section*.13) >>
endobj
31 0 obj
(Problem parameters extension)
endobj
32 0 obj
<< /S /GoTo /D (section.2.3) >>
endobj
35 0 obj
(Assumptions)
endobj
36 0 obj
<< /S /GoTo /D (section.2.4) >>
endobj
39 0 obj
(Problem representation)
endobj
40 0 obj
<< /S /GoTo /D (section*.15) >>
endobj
43 0 obj
(Problem input)
endobj
44 0 obj
<< /S /GoTo /D (section*.17) >>
endobj
47 0 obj
(Solution)
endobj
48 0 obj
<< /S /GoTo /D (section.2.5) >>
endobj
51 0 obj
(Note on complexity)
endobj
52 0 obj
<< /S /GoTo /D (chapter.3) >>
endobj
55 0 obj
(Related work)
endobj
56 0 obj
<< /S /GoTo /D (chapter.4) >>
endobj
59 0 obj
(Heuristic algorithms)
endobj
60 0 obj
<< /S /GoTo /D (section.4.1) >>
endobj
63 0 obj
(Evaluation functions)
endobj
64 0 obj
<< /S /GoTo /D (section*.19) >>
endobj
67 0 obj
(Blocking count evaluation function)
endobj
68 0 obj
<< /S /GoTo /D (section*.20) >>
endobj
71 0 obj
(Penalty evaluation function)
endobj
72 0 obj
<< /S /GoTo /D (section.4.2) >>
endobj
75 0 obj
(Random and Greedy construction algorithms)
endobj
76 0 obj
<< /S /GoTo /D (section.4.3) >>
endobj
79 0 obj
(Two Dimensional Lowest Priority First Heuristic)
endobj
80 0 obj
<< /S /GoTo /D (section*.22) >>
endobj
83 0 obj
(Original LPFH)
endobj
84 0 obj
<< /S /GoTo /D (section*.23) >>
endobj
87 0 obj
(Main changes)
endobj
88 0 obj
<< /S /GoTo /D (section*.26) >>
endobj
91 0 obj
(2D-LPFH)
endobj
92 0 obj
<< /S /GoTo /D (chapter.5) >>
endobj
95 0 obj
(Metaheuristic algorithms)
endobj
96 0 obj
<< /S /GoTo /D (section.5.1) >>
endobj
99 0 obj
(PILOT method)
endobj
100 0 obj
<< /S /GoTo /D (section*.28) >>
endobj
103 0 obj
(Using a strategic sub-heuristic and compound moves)
endobj
104 0 obj
<< /S /GoTo /D (section.5.2) >>
endobj
107 0 obj
(Ant Colony Optimization)
endobj
108 0 obj
<< /S /GoTo /D (section*.29) >>
endobj
111 0 obj
(Double bridge experiment)
endobj
112 0 obj
<< /S /GoTo /D (section*.31) >>
endobj
115 0 obj
(From colony to algorithm)
endobj
116 0 obj
<< /S /GoTo /D (section.5.3) >>
endobj
119 0 obj
(Max-Min Ant System)
endobj
120 0 obj
<< /S /GoTo /D (section*.34) >>
endobj
123 0 obj
(Pheromone models)
endobj
124 0 obj
<< /S /GoTo /D (section*.35) >>
endobj
127 0 obj
(State based pheromone model)
endobj
128 0 obj
<< /S /GoTo /D (section*.37) >>
endobj
131 0 obj
(Move based pheromone model)
endobj
132 0 obj
<< /S /GoTo /D (section*.39) >>
endobj
135 0 obj
(Initializing, evaporating and updating pheromone values)
endobj
136 0 obj
<< /S /GoTo /D (section*.40) >>
endobj
139 0 obj
(Ant construction algorithm)
endobj
140 0 obj
<< /S /GoTo /D (section*.41) >>
endobj
143 0 obj
(Using a strategic heuristic and compound moves)
endobj
144 0 obj
<< /S /GoTo /D (section*.42) >>
endobj
147 0 obj
(MMAS algorithm)
endobj
148 0 obj
<< /S /GoTo /D (chapter.6) >>
endobj
151 0 obj
(Local search algorithm)
endobj
152 0 obj
<< /S /GoTo /D (section.6.1) >>
endobj
155 0 obj
(Shortcut heuristic)
endobj
156 0 obj
<< /S /GoTo /D (chapter.7) >>
endobj
159 0 obj
(Experimental evaluation)
endobj
160 0 obj
<< /S /GoTo /D (section.7.1) >>
endobj
163 0 obj
(Instances)
endobj
164 0 obj
<< /S /GoTo /D (section.7.2) >>
endobj
167 0 obj
(Testing environment)
endobj
168 0 obj
<< /S /GoTo /D (section.7.3) >>
endobj
171 0 obj
(Experiments)
endobj
172 0 obj
<< /S /GoTo /D (section*.46) >>
endobj
175 0 obj
(Result analysis)
endobj
176 0 obj
<< /S /GoTo /D (section.7.4) >>
endobj
179 0 obj
(Random and greedy construction heuristics experiment)
endobj
180 0 obj
<< /S /GoTo /D (section.7.5) >>
endobj
183 0 obj
(2D-LPFH experiments)
endobj
184 0 obj
<< /S /GoTo /D (section*.49) >>
endobj
187 0 obj
(Lambda values)
endobj
188 0 obj
<< /S /GoTo /D (section*.54) >>
endobj
191 0 obj
(Extended run time)
endobj
192 0 obj
<< /S /GoTo /D (section.7.6) >>
endobj
195 0 obj
(PILOT experiments)
endobj
196 0 obj
<< /S /GoTo /D (section*.61) >>
endobj
199 0 obj
(Random and Greedy sub-heuristics)
endobj
200 0 obj
<< /S /GoTo /D (section*.63) >>
endobj
203 0 obj
(2D-LPFH sub-heuristic)
endobj
204 0 obj
<< /S /GoTo /D (section.7.7) >>
endobj
207 0 obj
(MMAS experiments)
endobj
208 0 obj
<< /S /GoTo /D (section*.67) >>
endobj
211 0 obj
(Ant count)
endobj
212 0 obj
<< /S /GoTo /D (section*.69) >>
endobj
215 0 obj
(Alpha and beta values)
endobj
216 0 obj
<< /S /GoTo /D (section*.71) >>
endobj
219 0 obj
(Heuristic algorithms)
endobj
220 0 obj
<< /S /GoTo /D (section.7.8) >>
endobj
223 0 obj
(Comparative analysis of best configurations)
endobj
224 0 obj
<< /S /GoTo /D (chapter.8) >>
endobj
227 0 obj
(Conclusion)
endobj
228 0 obj
<< /S /GoTo /D (section.8.1) >>
endobj
231 0 obj
(Critical reflection)
endobj
232 0 obj
<< /S /GoTo /D (section.8.2) >>
endobj
235 0 obj
(Future work)
endobj
236 0 obj
<< /S /GoTo /D (section.8.3) >>
endobj
239 0 obj
(Solution Network Analysis Procedure)
endobj
240 0 obj
<< /S /GoTo /D (appendix.A) >>
endobj
243 0 obj
(Instance samples)
endobj
244 0 obj
<< /S /GoTo /D (section*.92) >>
endobj
247 0 obj
(Bibliography)
endobj
248 0 obj
<< /S /GoTo /D [249 0 R /Fit] >>
endobj
252 0 obj <<
/Length 915
/Filter /FlateDecode
>>
stream
xڝUrF+IЉ*EWQ@*}fKThUJ'lOOO,%OJeH2o&
#WMp IfK-PVbd __U7&C_mfmsmyh_v'b-iI!X#"h`kj|e=.e3Ve]Wc<}Ծ X!LN`)P:xĻ̨K!%$]LzOdRp Jج\T'n1>',p1ǧMmii ǣ'x2\sjâ#"b90\}4ۡ/؟c;p6I
"<6wOU:ÅQpEaCfl=̀ѷe;V[|݆MSCIHA2*Z`E!05|6Zb %]1WPBTA4\b{֠gT#TJ_jTwʏ:g3!е?R.ZAqmFNpm
] ( 8qբ>'muL-0eBL{]tL88gai/>mZ3.zvE "5:ѯ(YG$YC&30fog##ͩ_p:t@225xQ0L=?D RRoZeR>W+&%Hu,셹IF[hIO#
Ic[N ʁ'e:7xSGiuOB
mi"5V`
z.cxa~أ`PΡ_Z_.d4
endstream
endobj
249 0 obj <<
/Type /Page
/Contents 252 0 R
/Resources 251 0 R
/MediaBox [0 0 595.276 841.89]
/Parent 258 0 R
>> endobj
250 0 obj <<
/Interpolate false
/Type /XObject
/Subtype /Form
/FormType 1
/PTEX.FileName (D:/Code/triumph-thesis/thesis-tex/tikz/thesis-figure0.pdf)
/PTEX.PageNumber 1
/PTEX.InfoDict 259 0 R
/BBox [0 0 514.673 73.449]
/Resources <<
/ColorSpace <<
/pgfprgb [/Pattern/DeviceRGB]
>>/Pattern <<
>>/ExtGState <<
>>/XObject <<
/Im1 260 0 R
/Im2 261 0 R
>>/ProcSet [ /PDF ]
>>
/Length 158
/Filter /FlateDecode
>>
stream
xڕ1 EwN/G:rh/Pu0_XqS{!kJN62Pe-B6qj~boItml1rP{엌oMQy
m$=Oǟi =Dc
d2|CO8vRo*F
endstream
endobj
259 0 obj
<<
/Author ()
/Title ()
/Subject ()
/Creator (LaTeX with hyperref package)
/Producer (pdfTeX-1.40.14)
/Keywords ()
/CreationDate (D:20140526002936+02'00')
/ModDate (D:20140526002936+02'00')
/Trapped /False
/PTEX.Fullbanner (This is MiKTeX-pdfTeX 2.9.4902 \(1.40.14\))
>>
endobj
260 0 obj
<<
/Type /XObject
/Subtype /Form
/FormType 1
/PTEX.FileName (D:/Code/triumph-thesis/thesis-tex/figures/titlepage/dokumentenkopf__klein.pdf)
/PTEX.PageNumber 1
/PTEX.InfoDict 262 0 R
/BBox [ 0 0 511 47]
/Resources <<
/ProcSet [/PDF]
/ExtGState <<
/Gs1 263 0 R
/Gs2 264 0 R
>>
>>
/Length 219
/Filter /FlateDecode
>>
stream
x]PIn1|ś^sN} iT1")Yw\q+0UJ{;~py{>x`\}N?1
on0iļQ$cʮ^20Y8JkȊ`T
M51τH:CyïLst `}f5gI}lu/![8
endstream
endobj
261 0 obj
<<
/Type /XObject
/Subtype /Form
/FormType 1
/PTEX.FileName (D:/Code/triumph-thesis/thesis-tex/figures/titlepage/INF_Logo_typo_grau.pdf)
/PTEX.PageNumber 1
/PTEX.InfoDict 265 0 R
/BBox [ 0 0 171 46]
/Resources <<
/ProcSet [/PDF]
/ExtGState <<
/Gs1 266 0 R
/Gs2 267 0 R
>>
>>
/Length 5748
/Filter /FlateDecode
>>
stream
xmI,Inq
_ky8AkxP'}$#S(U64NFa|02{k?o[f[=k
=W5\{?φ},۰2i[:|obf㺶eƶzm|oaޖcI ^2äV(?b!|oCZYU]8W%])$ \Ƃj!0BSfTYK\uꃿa?9rWǶ6%>ap7!T}tb^'=/5Za Zغ5,{^yrk$0,~l?0^Y{_
/7ɒ:er:BW+F$)_)__9Vp`el 1Ɇ 5n%
3H
1僊`oZo¦}Pܤkb:vt_#
FnBj
y.ZOhhqЁX=}ܥrݴ{xFN3o=5u7D!=_OcgTv4ك3ttPi(U?H