-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathappendix.tex
More file actions
74 lines (62 loc) · 7 KB
/
Copy pathappendix.tex
File metadata and controls
74 lines (62 loc) · 7 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
% !TeX root = thesis.tex
%% appendix.tex
%%
%% ==============================
%\chapter{Appendix}
%\label{ch:Appendix}
%% ==============================
\appendix
\iflanguage{english}
{\addchap{Appendix}} % english style
{\addchap{Anhang}} % german style
\section{List of Abbreviations\label{app:abb}}
\begin{tabular}{rp{0.85\textwidth}}
EU & European Union \\
EC & European Commission \\
EEC & European Economic Community \\
US & United States \\
HOS & Hours of Services \\
DTC & Driving Time Constraint \\
OSM & Open Street Map \\
HGV & Heavy Goods Vehicle \\
CH & Contraction Hierarchy \\
IQR & Interquartile Range \\
MILP & Mixed-Integer Linear Programming \\
\vspace{2\baselineskip} \\
SPP & Shortest Path Problem \\
TDSP & Truck Driver Scheduling Problem \\
MD-TDSP & Minimum Duration Truck Driver Scheduling Problem \\
TDRP & Truck Driver Routing Problem \\
TDRP-1DTC & Restriction of the Truck Driver Routing Problem to one driving time constraint \\
TDRP-2DTC & Restriction of the Truck Driver Routing Problem to two driving time constraints \\
TDRP-mDTC & Truck Driver Routing Problem with an unrestricted number of driving time constraints \\
TDSRP & Truck Driver Scheduling and Routing Problem \\
TD-TDSRP & Time-Dependent Truck Driver Scheduling and Routing Problem \\
TD-TDSRP-2B & Time-Dependent Truck Driver Scheduling and Routing Problem with two types of breaks (two types of driving time restrictions) \\
VRTDSPIS & Truck Driver Scheduling Problem with Intermediate Stops \\
LH-TDRP & Long-Haul Truck Driver Routing Problem \\
\vspace{2\baselineskip}
\end{tabular}
\section{List of Symbols and Designations}
\label{app:symbols}
We use Greek symbols for theoretical and abstract concepts such as the shortest distance between two nodes or an arbitrary node potential. Concrete functions and procedures, i.e., those with definitions, have verbose names. Algorithmic functions and procedures for which pseudocode is provided use \algofunction{SmallCaps}.
\begin{tabular}{rp{0.79\textwidth}}
$\potential_t(v)$ & A node potential to $t$ \\
$\distance(s,t)$ & Shortest distance between $s$ and $t$ \\
$\traveltime(s,t)$ & Shortest travel time between $s$ and $t$ \\
$\breakTime(v)$ & A function which assigns each node of a route the length of the break at the node or zero, if the route does not take a break at the node.
\\
$\route$ & A route consisting of a path and a function $\breakTime(v)$ \\
$\restr$ & A driving time constraint \\
$c^d$ & Maximum allowed driving time of a driving time constraint $c$ \\
$c^b$ & Minimum pause time of a driving time constraint $\restr$ \\
$\restrset$ & A set of one or more driving time constraints \\
$L(v)$ & The label set of a node $v$ \\
$\breakDist_i(l)$ & Distance since the last break of a label with a duration of at least $c_i^b$ or distance since the last break if the index $i$ is omitted \\
$\pred(l)$ & Predecessor label of a label $l$ \\
$\concretett(l)$ & Travel time of a label $l$ \\
$\concretepotential(l,v)$ & The potential of a label $l \in L(v)$ as defined in Section \ref{section:potential_n_csp} \\
$\len((u,v))$ & The weight, respectively length of an edge $(u,v)$, alternatively used for the length $\len(p)$ of a path $p$ \\
$\ch$ & A contraction hierarchy with nodes $\chv$ and edges $\che$ \\
$\corech$ & A core contraction hierarchy with nodes $\corechv$ and edges $\coreche$ \\
\end{tabular}