The Logic of Logistics : Theory, Algorithms, and Applications for Logistics Management (Springer Series in Operations Research)

Preface......Page 6
Contents......Page 10
1.1 What Is Logistics Management?......Page 16
1.2 Examples......Page 18
1.3 Modeling Logistics Problems......Page 21
1.4 Logistics in Practice......Page 22
1.5 Evaluation of Solution Techniques......Page 23
1.6 Additional Topics......Page 24
1.7 Book Overview......Page 25
2.1 Introduction......Page 30
2.2 The Bin-Packing Problem......Page 31
2.3 The Traveling Salesman Problem......Page 37
2.4 Exercises......Page 47
3.1 Introduction......Page 52
3.2 The Bin-Packing Problem......Page 53
3.3 The Traveling Salesman Problem......Page 58
3.4 Exercises......Page 63
4.1 Introduction......Page 66
4.2 An Asymptotically Tight Linear Program......Page 67
4.3 Lagrangian Relaxation......Page 70
4.4 Lagrangian Relaxation and the Traveling Salesman Problem......Page 72
4.5 The Worst-Case Effectiveness of the 1-tree Lower Bound......Page 75
4.6 Exercises......Page 79
5.1 Introduction......Page 84
5.2 Worst-Case Analysis of Heuristics......Page 85
5.3 The Asymptotic Optimal Solution Value......Page 90
5.4 Asymptotically Optimal Heuristics......Page 91
5.5 Exercises......Page 95
6.2 Heuristics for the CVRP......Page 96
6.3 Worst-Case Analysis of Heuristics......Page 100
6.4 The Asymptotic Optimal Solution Value......Page 103
6.5 Probabilistic Analysis of Classical Heuristics......Page 109
6.6 The Uniform Model......Page 114
6.7 The Location-Based Heuristic......Page 117
6.9 Exercises......Page 120
7.2 The Model......Page 122
7.3 The Asymptotic Optimal Solution Value......Page 124
7.4 An Asymptotically Optimal Heuristic......Page 129
7.5 Exercises......Page 137
8.1 Introduction......Page 140
8.2 Solving a Relaxation of the Set-Partitioning Formulation......Page 141
8.3 Solving the Set-Partitioning Problem......Page 145
8.4 The Effectiveness of the Set-Partitioning Formulation......Page 148
8.5 Exercises......Page 153
9.1 Introduction......Page 160
9.2 Multi-Item Inventory Models......Page 166
9.3 A Single Warehouse Multi-Retailer Model......Page 173
9.4 Exercises......Page 178
10.1 The Wagner-Whitin Model......Page 180
10.2 Models with Capacity Constraints......Page 186
10.3 Multi-Item Inventory Models......Page 190
10.4 Exercises......Page 192
11.1 Introduction......Page 194
11.2 Single Period Models......Page 195
11.3 Finite Horizon Models......Page 196
11.4 Quasiconvex Loss Functions......Page 203
11.5 Infinite Horizon Models......Page 207
11.6 Multi-Echelon Systems......Page 210
11.7 Exercises......Page 212
12.1 Introduction......Page 218
12.2 An Algorithm for the p -Median Problem......Page 219
12.3 An Algorithm for the Single-Source Capacitated Facility Location Problem......Page 223
12.4 A Distribution System Design Problem......Page 226
12.5 The Structure of the Asymptotic Optimal Solution......Page 230
12.6 Exercises......Page 231
13.1 Introduction......Page 234
13.2 Single Warehouse Models......Page 236
13.3 Worst-Case Analysis of Direct Shipping Strategies......Page 237
13.4 Asymptotic Analysis of ZIO Policies......Page 240
13.5 Asymptotic Analysis of Cross-Docking Strategies......Page 247
13.6 An Algorithm for Multi-Echelon Distribution Systems......Page 249
13.7 Exercises......Page 250
14.1 Introduction......Page 254
14.2 The Setting......Page 255
14.3 Literature Review......Page 257
14.4 The Problem in New York City......Page 258
14.5 Distance and Time Estimation......Page 260
14.6 The Routing Algorithm......Page 262
14.7 Additional Constraints and Features......Page 266
14.8 The Interactive Mode......Page 268
14.9 Data, Implementation and Results......Page 269
15.1 Introduction......Page 270
15.2 Data Collection......Page 272
15.3 The Baseline Feature......Page 277
15.4 Flexibility and Robustness......Page 278
15.5 Exercises......Page 279
References......Page 280
B......Page 292
H......Page 293
O......Page 294
T......Page 295
Z......Page 296