|
|
1 | (8) |
|
Part I Problem Description |
|
|
|
|
9 | (14) |
|
|
9 | (3) |
|
2.1.1 Evolution of Supply Chains |
|
|
10 | (2) |
|
2.1.2 Increasing (Freight) Traffic |
|
|
12 | (1) |
|
|
12 | (5) |
|
2.2.1 Perspective of Different Stakeholders |
|
|
14 | (1) |
|
2.2.2 Urban Consolidation Centers |
|
|
15 | (1) |
|
2.2.3 City Logistics Initiatives |
|
|
16 | (1) |
|
|
17 | (2) |
|
|
19 | (4) |
|
|
19 | (1) |
|
2.4.2 Architecture of a Planning System |
|
|
20 | (3) |
|
|
23 | (14) |
|
|
23 | (3) |
|
3.2 Types of Last-Mile Delivery |
|
|
26 | (3) |
|
3.3 Customer Time Windows |
|
|
29 | (2) |
|
|
29 | (1) |
|
3.3.2 Operational Planning |
|
|
30 | (1) |
|
|
31 | (6) |
|
Part II Information Models |
|
|
|
4 Knowledge Discovery and Data Mining |
|
|
37 | (22) |
|
4.1 Knowledge Discovery Process |
|
|
37 | (7) |
|
|
39 | (2) |
|
|
41 | (2) |
|
|
43 | (1) |
|
|
44 | (11) |
|
4.2.1 Clustering Approaches |
|
|
46 | (2) |
|
4.2.2 Clustering Algorithms |
|
|
48 | (4) |
|
4.2.3 Validation of Clusterings |
|
|
52 | (3) |
|
4.3 Exploratory Data Analysis |
|
|
55 | (4) |
|
5 Analysis of Floating Car Data |
|
|
59 | (24) |
|
|
61 | (5) |
|
5.1.1 Traditional Approach |
|
|
61 | (1) |
|
5.1.2 Telematics-Based Approach |
|
|
62 | (4) |
|
|
66 | (3) |
|
|
66 | (1) |
|
|
66 | (1) |
|
|
67 | (1) |
|
5.2.4 Temporal Distribution of Measurements |
|
|
68 | (1) |
|
5.2.5 Spatial Distribution of Measurements |
|
|
68 | (1) |
|
5.3 First Level Aggregation |
|
|
69 | (3) |
|
5.4 Second Level Aggregation |
|
|
72 | (3) |
|
|
72 | (1) |
|
5.4.2 Clustering Tendency |
|
|
72 | (1) |
|
5.4.3 Clustering Approach |
|
|
73 | (1) |
|
|
74 | (1) |
|
5.5 Exploratory Data Analysis |
|
|
75 | (8) |
|
5.5.1 First Level Aggregation |
|
|
76 | (2) |
|
5.5.2 Second Level Aggregation |
|
|
78 | (5) |
|
Part III Integration of Information Models |
|
|
|
6 Provision of Distance Matrices |
|
|
83 | (22) |
|
6.1 Static Information Models |
|
|
86 | (4) |
|
|
86 | (3) |
|
|
89 | (1) |
|
6.2 Time-Dependent Information Models |
|
|
90 | (10) |
|
6.2.1 Modeling of Time Dependence |
|
|
91 | (6) |
|
|
97 | (3) |
|
6.3 Computation of Shortest Paths |
|
|
100 | (5) |
|
6.3.1 Shortest Path Problem |
|
|
100 | (2) |
|
6.3.2 Time-Dependent Shortest Path Problem |
|
|
102 | (3) |
|
7 Evaluation of Information Models |
|
|
105 | (14) |
|
|
105 | (2) |
|
|
106 | (1) |
|
|
106 | (1) |
|
|
107 | (1) |
|
7.2 Simulation and Evaluation of Shortest Paths |
|
|
107 | (2) |
|
7.3 Computational Results |
|
|
109 | (10) |
|
7.3.1 Evaluation of Example Itineraries |
|
|
109 | (3) |
|
|
112 | (7) |
|
Part IV Optimization Models |
|
|
|
8 Routing in City Logistics |
|
|
119 | (38) |
|
8.1 Routing of a Single Vehicle |
|
|
120 | (14) |
|
8.1.1 Traveling Salesman Problem |
|
|
120 | (7) |
|
8.1.2 Time-Dependent Traveling Salesman Problem |
|
|
127 | (7) |
|
8.2 Routing of a Fleet of Vehicles |
|
|
134 | (6) |
|
8.2.1 Vehicle Routing Problem |
|
|
134 | (3) |
|
8.2.2 Time-Dependent Vehicle Routing Problem |
|
|
137 | (3) |
|
8.3 Customer Time Windows |
|
|
140 | (17) |
|
8.3.1 Vehicle Routing Problem with Time Windows |
|
|
141 | (4) |
|
8.3.2 Time-Dependent Vehicle Routing Problem with Time Windows |
|
|
145 | (12) |
|
9 Evaluation of Optimization Models |
|
|
157 | (22) |
|
|
157 | (4) |
|
|
158 | (1) |
|
|
158 | (1) |
|
9.1.3 Evaluation of Heuristics |
|
|
159 | (2) |
|
9.2 Routing of a Single Vehicle |
|
|
161 | (7) |
|
9.2.1 Customer Scenario 1 |
|
|
162 | (2) |
|
9.2.2 Customer Scenario 2 |
|
|
164 | (1) |
|
9.2.3 Customer Scenario 3 |
|
|
165 | (3) |
|
9.3 Routing of a Fleet of Vehicles |
|
|
168 | (4) |
|
9.3.1 Performance of Neighborhood Operators |
|
|
168 | (2) |
|
9.3.2 Computational Results |
|
|
170 | (2) |
|
9.4 Customer Time Windows |
|
|
172 | (7) |
|
9.4.1 Role of Customer Time Windows |
|
|
173 | (1) |
|
9.4.2 Simulation of Customer Time Windows |
|
|
173 | (1) |
|
9.4.3 Computational Results |
|
|
174 | (5) |
|
10 Conclusions and Outlook |
|
|
179 | (4) |
References |
|
183 | (12) |
Index |
|
195 | |