1
\relax 
2
\catcode`"\active
3
\providecommand\HyperFirstAtBeginDocument{\AtBeginDocument}
4
\HyperFirstAtBeginDocument{\ifx\hyper@anchor\@undefined
5
\global\let\oldcontentsline\contentsline
6
\gdef\contentsline#1#2#3#4{\oldcontentsline{#1}{#2}{#3}}
7
\global\let\oldnewlabel\newlabel
8
\gdef\newlabel#1#2{\newlabelxx{#1}#2}
9
\gdef\newlabelxx#1#2#3#4#5#6{\oldnewlabel{#1}{{#2}{#3}}}
10
\AtEndDocument{\ifx\hyper@anchor\@undefined
11
\let\contentsline\oldcontentsline
12
\let\newlabel\oldnewlabel
13
\fi}
14
\fi}
15
\global\let\hyper@last\relax 
16
\gdef\HyperFirstAtBeginDocument#1{#1}
17
\providecommand*\HyPL@Entry[1]{}
18
\HyPL@Entry{0<</S/r>>}
19
\select@language{finnish}
20
\@writefile{toc}{\select@language{finnish}}
21
\@writefile{lof}{\select@language{finnish}}
22
\@writefile{lot}{\select@language{finnish}}
23
\select@language{english}
24
\@writefile{toc}{\select@language{english}}
25
\@writefile{lof}{\select@language{english}}
26
\@writefile{lot}{\select@language{english}}
27
\HyPL@Entry{1<</S/r>>}
28
\HyPL@Entry{3<</S/r>>}
29
\citation{dantzig_truck_1959}
30
\citation{nagata_edge_2009}
31
\citation{talbi_metaheuristics_2009}
32
\citation{mester_active_2005,prins_simple_2004}
33
\citation{moscato_evolution_1989}
34
\citation{nagata_penalty-based_2010,nagata_edge_2009,prins_simple_2004,prins_two_2009}
35
\HyPL@Entry{4<</S/D>>}
36
\@writefile{toc}{\contentsline {section}{\numberline {1}Introduction}{1}{section.1}}
37
\@writefile{toc}{\contentsline {section}{\numberline {2}The Vehicle Routing Problem}{2}{section.2}}
38
\newlabel{thevrp}{{2}{2}{The Vehicle Routing Problem\relax }{section.2}{}}
39
\@writefile{lof}{\contentsline {figure}{\numberline {1}{\ignorespaces The vehicle routing problem with three separate routes.}}{2}{figure.1}}
40
\newlabel{vrpfig}{{1}{2}{The vehicle routing problem with three separate routes}{figure.1}{}}
41
\citation{toth_exact_1998}
42
\citation{toth_exact_1998}
43
\newlabel{obj}{{2}{4}{The Vehicle Routing Problem\relax }{equation.2.2}{}}
44
\newlabel{exactlyonce}{{3}{4}{The Vehicle Routing Problem\relax }{equation.2.3}{}}
45
\newlabel{indegree}{{4}{4}{The Vehicle Routing Problem\relax }{equation.2.4}{}}
46
\newlabel{outdegree}{{5}{4}{The Vehicle Routing Problem\relax }{equation.2.5}{}}
47
\newlabel{arrivaldeparture}{{6}{4}{The Vehicle Routing Problem\relax }{equation.2.6}{}}
48
\newlabel{capacity}{{7}{4}{The Vehicle Routing Problem\relax }{equation.2.7}{}}
49
\newlabel{integrity}{{8}{4}{The Vehicle Routing Problem\relax }{equation.2.8}{}}
50
\citation{toth_vehicle_2002}
51
\@writefile{toc}{\contentsline {section}{\numberline {3}Strategies for the Vehicle Routing Problem}{5}{section.3}}
52
\newlabel{solving}{{3}{5}{Strategies for the Vehicle Routing Problem\relax }{section.3}{}}
53
\@writefile{toc}{\contentsline {subsection}{\numberline {3.1}Heuristics}{5}{subsection.3.1}}
54
\newlabel{heuristics}{{3.1}{5}{Heuristics\relax }{subsection.3.1}{}}
55
\citation{mole_sequential_1976}
56
\citation{clarke_scheduling_1964}
57
\@writefile{lof}{\contentsline {figure}{\numberline {2}{\ignorespaces \relax \fontsize  {10.95}{13.6}\selectfont  \abovedisplayskip 11\p@ plus3\p@ minus6\p@ \abovedisplayshortskip \z@ plus3\p@ \belowdisplayshortskip 6.5\p@ plus3.5\p@ minus3\p@ \def \leftmargin \leftmargini \parsep 5\p@ plus2.5\p@ minus\p@ \topsep 10\p@ plus4\p@ minus6\p@ \itemsep 5\p@ plus2.5\p@ minus\p@ {\leftmargin \leftmargini \topsep 9\p@ plus3\p@ minus5\p@ \parsep 4.5\p@ plus2\p@ minus\p@ \itemsep \parsep }\belowdisplayskip \abovedisplayskip {An example of a heuristic, the insertion heuristic. The vertex $3$ is added to the route and the route from 1 to 2 removed.}}}{6}{figure.2}}
58
\newlabel{insertionfig}{{2}{6}{\small {An example of a heuristic, the insertion heuristic. The vertex $3$ is added to the route and the route from 1 to 2 removed.}\relax }{figure.2}{}}
59
\@writefile{lof}{\contentsline {figure}{\numberline {3}{\ignorespaces \relax \fontsize  {10.95}{13.6}\selectfont  \abovedisplayskip 11\p@ plus3\p@ minus6\p@ \abovedisplayshortskip \z@ plus3\p@ \belowdisplayshortskip 6.5\p@ plus3.5\p@ minus3\p@ \def \leftmargin \leftmargini \parsep 5\p@ plus2.5\p@ minus\p@ \topsep 10\p@ plus4\p@ minus6\p@ \itemsep 5\p@ plus2.5\p@ minus\p@ {\leftmargin \leftmargini \topsep 9\p@ plus3\p@ minus5\p@ \parsep 4.5\p@ plus2\p@ minus\p@ \itemsep \parsep }\belowdisplayskip \abovedisplayskip {Routes are merged into one in the savings heuristic.}}}{6}{figure.3}}
60
\newlabel{savings}{{3}{6}{\small {Routes are merged into one in the savings heuristic.}\relax }{figure.3}{}}
61
\citation{lin_computer_1965}
62
\citation{or_traveling_1976}
63
\@writefile{loa}{\contentsline {algorithm}{\numberline {1}{\ignorespaces Local\_Search(C)}}{7}{algorithm.1}}
64
\newlabel{alg:localsearch}{{1}{7}{Heuristics\relax }{ALC@unique.7}{}}
65
\@writefile{toc}{\contentsline {subsection}{\numberline {3.2}Metaheuristics}{7}{subsection.3.2}}
66
\newlabel{metaheuristics}{{3.2}{7}{Metaheuristics\relax }{subsection.3.2}{}}
67
\citation{chiang_reactive_1997,mester_active_2005,pisinger_general_2007}
68
\citation{braeysy_vehicle_2005}
69
\citation{laporte_classical_2002}
70
\citation{braeysy_vehicle_2005,gendreau_metaheuristics_2002}
71
\citation{glover_handbook_2003,talbi_metaheuristics_2009}
72
\citation{cordeau_guide_2002,laporte_classical_2000}
73
\@writefile{toc}{\contentsline {section}{\numberline {4}Evolutionary Algorithms}{8}{section.4}}
74
\newlabel{eas}{{4}{8}{Evolutionary Algorithms\relax }{section.4}{}}
75
\citation{darwin_origin_1859}
76
\citation{fogel_artificial_1966}
77
\citation{holland_adaptation_1975}
78
\citation{talbi_metaheuristics_2009}
79
\@writefile{toc}{\contentsline {subsection}{\numberline {4.1}Background and Principles of Evolutionary Algorithms}{9}{subsection.4.1}}
80
\newlabel{background}{{4.1}{9}{Background and Principles of Evolutionary Algorithms\relax }{subsection.4.1}{}}
81
\@writefile{lof}{\contentsline {figure}{\numberline {4}{\ignorespaces A generation in evolutionary algorithms. \cite  {talbi_metaheuristics_2009}}}{9}{figure.4}}
82
\newlabel{eageneration}{{4}{9}{A generation in evolutionary algorithms. \cite {talbi_metaheuristics_2009}\relax }{figure.4}{}}
83
\citation{holland_adaptation_1975}
84
\citation{talbi_metaheuristics_2009}
85
\@writefile{toc}{\contentsline {subsection}{\numberline {4.2}The Genetic Algorithm}{10}{subsection.4.2}}
86
\newlabel{ga}{{4.2}{10}{The Genetic Algorithm\relax }{subsection.4.2}{}}
87
\citation{rechenberg_evolutionsstrategie:_1973}
88
\citation{mester_active_2005}
89
\newlabel{geneticalgorithm}{{4.2}{11}{The Genetic Algorithm\relax }{subsection.4.2}{}}
90
\@writefile{loa}{\contentsline {algorithm}{\numberline {2}{\ignorespaces The genetic algorithm.}}{11}{algorithm.2}}
91
\@writefile{toc}{\contentsline {subsection}{\numberline {4.3}Evolutionary Strategies}{11}{subsection.4.3}}
92
\newlabel{es}{{4.3}{11}{Evolutionary Strategies\relax }{subsection.4.3}{}}
93
\@writefile{lof}{\contentsline {figure}{\numberline {5}{\ignorespaces The distinction between the genotype and the phenotype. \cite  {talbi_metaheuristics_2009}}}{11}{figure.5}}
94
\newlabel{genotypevsphenotype}{{5}{11}{The distinction between the genotype and the phenotype. \cite {talbi_metaheuristics_2009}\relax }{figure.5}{}}
95
\citation{mester_active_2005}
96
\citation{homberger_two_1999}
97
\citation{beyer_evolution_2002}
98
\citation{ong_classification_2006}
99
\citation{moscato_evolution_1989}
100
\citation{ong_classification_2006}
101
\citation{dawkins_selfish_1976}
102
\@writefile{toc}{\contentsline {subsection}{\numberline {4.4}Discussion}{12}{subsection.4.4}}
103
\newlabel{discussion}{{4.4}{12}{Discussion\relax }{subsection.4.4}{}}
104
\citation{nagata_penalty-based_2010,nagata_edge_2009,lima_memetic_2004,prins_two_2009}
105
\citation{krasnogor_tutorial_2005}
106
\citation{krasnogor_tutorial_2005}
107
\@writefile{toc}{\contentsline {subsection}{\numberline {4.5}The Memetic Algorithm}{13}{subsection.4.5}}
108
\newlabel{ma}{{4.5}{13}{The Memetic Algorithm\relax }{subsection.4.5}{}}
109
\@writefile{loa}{\contentsline {algorithm}{\numberline {3}{\ignorespaces The memetic algorithm}}{13}{algorithm.3}}
110
\newlabel{alg:memeticalgorithm}{{3}{13}{The Memetic Algorithm\relax }{ALC@unique.31}{}}
111
\citation{cowling_hyperheuristic_2001}
112
\citation{ong_meta-lamarckian_2004}
113
\citation{ong_classification_2006}
114
\citation{nagata_edge_2007}
115
\@writefile{toc}{\contentsline {section}{\numberline {5}Genetic and Memetic Algorithms in the VRP}{14}{section.5}}
116
\@writefile{toc}{\contentsline {subsection}{\numberline {5.1}Encoding Routing Problems}{14}{subsection.5.1}}
117
\newlabel{genvrp}{{5.1}{14}{Encoding Routing Problems\relax }{subsection.5.1}{}}
118
\citation{oliver_study_1987}
119
\@writefile{toc}{\contentsline {subsection}{\numberline {5.2}Recombination Procedures}{15}{subsection.5.2}}
120
\newlabel{crossover}{{5.2}{15}{Recombination Procedures\relax }{subsection.5.2}{}}
121
\@writefile{lof}{\contentsline {figure}{\numberline {7}{\ignorespaces One-point crossover producing invalid routes.}}{15}{figure.7}}
122
\newlabel{onepoint crossover}{{7}{15}{One-point crossover producing invalid routes}{figure.7}{}}
123
\@writefile{lof}{\contentsline {figure}{\numberline {6}{\ignorespaces RAR mutation.}}{15}{figure.6}}
124
\newlabel{rar mutation}{{6}{15}{RAR mutation}{figure.6}{}}
125
\citation{potvin_review_2009}
126
\citation{nagata_edge_1997}
127
\citation{nagata_edge_2007}
128
\citation{nagata_edge_2007}
129
\citation{nagata_edge_2007}
130
\citation{nagata_edge_2007}
131
\citation{nagata_edge_2009}
132
\citation{nagata_edge_2009,nagata_penalty-based_2010}
133
\citation{thangiah_genetic_1991}
134
\citation{thangiah_adaptive_1995}
135
\citation{braeysy_evolutionary_2004,potvin_review_2009}
136
\@writefile{lof}{\contentsline {figure}{\numberline {8}{\ignorespaces Order crossover (OX)}}{16}{figure.8}}
137
\newlabel{order crossover}{{8}{16}{Order crossover (OX)\relax }{figure.8}{}}
138
\citation{nagata_powerful_2009}
139
\citation{nagata_edge_2009}
140
\citation{nagata_penalty-based_2010}
141
\citation{prins_simple_2004}
142
\citation{prins_two_2009}
143
\@writefile{loa}{\contentsline {algorithm}{\numberline {4}{\ignorespaces EAX for the CVRP}}{17}{algorithm.4}}
144
\newlabel{alg:eaxalg}{{4}{17}{Recombination Procedures\relax }{ALC@unique.38}{}}
145
\@writefile{toc}{\contentsline {subsection}{\numberline {5.3}Recent Results from Literature}{17}{subsection.5.3}}
146
\newlabel{buildingma}{{5.3}{17}{Recent Results from Literature\relax }{subsection.5.3}{}}
147
\@writefile{lot}{\contentsline {table}{\numberline {1}{\ignorespaces A comparison of different MAs in the VRP.}}{17}{table.1}}
148
\newlabel{comparisontable}{{1}{17}{A comparison of different MAs in the VRP}{table.1}{}}
149
\citation{nagata_edge_2009}
150
\citation{nagata_edge_2007}
151
\citation{nagata_penalty-based_2010}
152
\citation{nagata_powerful_2009}
153
\citation{prins_simple_2004}
154
\citation{golden_impact_1998}
155
\citation{prins_two_2009}
156
\citation{prins_simple_2004}
157
\citation{oliver_study_1987}
158
\citation{taillard_heuristic_1996}
159
\citation{prins_two_2009}
160
\citation{cordeau_new_2005}
161
\@writefile{toc}{\contentsline {section}{\numberline {6}Conclusion and Further Research}{18}{section.6}}
162
\newlabel{conclusion}{{6}{18}{Conclusion and Further Research\relax }{section.6}{}}
163
\citation{ong_classification_2006}
164
\citation{garrido_dvrp:_2010}
165
\bibstyle{amsplain}
166
\bibdata{bsc}
167
\bibcite{beyer_evolution_2002}{1}
168
\bibcite{braeysy_evolutionary_2004}{2}
169
\bibcite{braeysy_vehicle_2005}{3}
170
\bibcite{chiang_reactive_1997}{4}
171
\bibcite{clarke_scheduling_1964}{5}
172
\bibcite{cordeau_new_2005}{6}
173
\bibcite{cordeau_guide_2002}{7}
174
\bibcite{cowling_hyperheuristic_2001}{8}
175
\bibcite{dantzig_truck_1959}{9}
176
\bibcite{darwin_origin_1859}{10}
177
\bibcite{dawkins_selfish_1976}{11}
178
\bibcite{fogel_artificial_1966}{12}
179
\@writefile{toc}{\contentsline {section}{\numberline {7}References}{19}{section.7}}
180
\bibcite{garrido_dvrp:_2010}{13}
181
\bibcite{gendreau_metaheuristics_2002}{14}
182
\bibcite{glover_handbook_2003}{15}
183
\bibcite{golden_impact_1998}{16}
184
\bibcite{holland_adaptation_1975}{17}
185
\bibcite{homberger_two_1999}{18}
186
\bibcite{krasnogor_tutorial_2005}{19}
187
\bibcite{laporte_classical_2000}{20}
188
\bibcite{laporte_classical_2002}{21}
189
\bibcite{lima_memetic_2004}{22}
190
\bibcite{lin_computer_1965}{23}
191
\bibcite{mester_active_2005}{24}
192
\bibcite{mole_sequential_1976}{25}
193
\bibcite{moscato_evolution_1989}{26}
194
\bibcite{nagata_edge_2007}{27}
195
\bibcite{nagata_edge_2009}{28}
196
\bibcite{nagata_powerful_2009}{29}
197
\bibcite{nagata_penalty-based_2010}{30}
198
\bibcite{nagata_edge_1997}{31}
199
\bibcite{oliver_study_1987}{32}
200
\bibcite{ong_meta-lamarckian_2004}{33}
201
\bibcite{ong_classification_2006}{34}
202
\bibcite{or_traveling_1976}{35}
203
\bibcite{pisinger_general_2007}{36}
204
\bibcite{potvin_review_2009}{37}
205
\bibcite{prins_simple_2004}{38}
206
\bibcite{prins_two_2009}{39}
207
\bibcite{rechenberg_evolutionsstrategie:_1973}{40}
208
\bibcite{taillard_heuristic_1996}{41}
209
\bibcite{talbi_metaheuristics_2009}{42}
210
\bibcite{thangiah_adaptive_1995}{43}
211
\bibcite{thangiah_genetic_1991}{44}
212
\bibcite{toth_exact_1998}{45}
213
\bibcite{toth_vehicle_2002}{46}
214
\newlabel{TotPages}{{25}{21}{}{page.21}{}}