Logistics Systems AnalysisSpringer Science & Business Media, 2005 M04 19 - 296 pages This expanded edition of ALogistics Systems Analysis@ includes new - search results and numerous modifications to enhance comprehensiveness and clarity. It has two new sections, a new appendix, and more than half a dozen new figures. A few references have also been added, but the bibli- raphy is not exhaustive. Much of the new material is based on work by Profs. Alan Erera (Georgia Tech), Karen Smilowitz (Northwestern U. ), and by PhD candidate Yanfeng Ouyang (U. C. Berkeley). Their help is gratefully acknowledged. The financial support of the National Science Foundation and the Volvo Foundations Center of Excellence for the Future of Urban Transportation at U. C. Berkeley is also acknowledged. The new appendix presents the logic behind the traveling salesman and vehicle routing results used in Sec. 4. 2 to describe the transportation ope- tion; Chapter 4 is more self-contained as a result. New section 5. 6 int- duces and evaluates a general method that automatically translates the c- tinuum approximation recipes of Chapters 4 and 5 into discrete system designs. This closes a gap in previous editions. Other additions include an explanation of how to develop system designs that can efficiently acc- modate real-time control strategies to manage uncertainty (new section 4. 6. 3), and extensions of the many-to-many design ideas of Chap. 6 (in - panded section 6. 5. 3). An errata corrigendum will be posted on the - thors=s web site: http://www. ce. berkeley. |
Contents
I | 1 |
II | 2 |
III | 8 |
V | 9 |
VI | 11 |
VII | 15 |
VIII | 17 |
IX | 20 |
LIX | 125 |
LX | 126 |
LXI | 127 |
LXII | 133 |
LXIII | 135 |
LXIV | 136 |
LXV | 140 |
LXVI | 144 |
XI | 23 |
XII | 24 |
XIII | 25 |
XIV | 27 |
XV | 31 |
XVI | 32 |
XVII | 34 |
XVIII | 36 |
XIX | 38 |
XX | 39 |
XXI | 42 |
XXII | 45 |
XXIII | 47 |
XXIV | 49 |
XXVII | 50 |
XXVIII | 51 |
XXX | 52 |
XXXI | 53 |
XXXII | 56 |
XXXIV | 58 |
XXXV | 59 |
XXXVI | 60 |
XXXVII | 64 |
XXXVIII | 69 |
XL | 73 |
XLI | 75 |
XLIII | 76 |
XLIV | 79 |
XLV | 84 |
XLVI | 90 |
XLVII | 93 |
XLVIII | 95 |
XLIX | 97 |
L | 102 |
LI | 105 |
LII | 106 |
LIII | 107 |
LIV | 108 |
LV | 111 |
LVI | 112 |
LVII | 115 |
LVIII | 123 |
LXVIII | 146 |
LXIX | 148 |
LXXI | 150 |
LXXII | 154 |
LXXIII | 158 |
LXXIV | 161 |
LXXV | 162 |
LXXVII | 164 |
LXXVIII | 171 |
LXXX | 173 |
LXXXII | 174 |
LXXXIII | 178 |
LXXXIV | 181 |
LXXXVI | 185 |
LXXXVII | 187 |
LXXXVIII | 192 |
LXXXIX | 195 |
XC | 196 |
XCI | 201 |
XCII | 207 |
XCIII | 213 |
XCIV | 215 |
XCVI | 217 |
XCVII | 220 |
XCVIII | 223 |
XCIX | 224 |
C | 228 |
CI | 232 |
CII | 233 |
CIII | 242 |
CIV | 248 |
CV | 249 |
CVII | 251 |
CVIII | 253 |
CIX | 260 |
CX | 267 |
CXI | 269 |
CXII | 277 |
CXIV | 280 |
CXV | 285 |
289 | |
Other editions - View all
Common terms and phrases
approximation assume average backhauls Chapter concave function constant constraint coordinates cost function cost per item cost per unit curve customers Daganzo decision variables defined delivery lot demand rate density depend depot detailed discussed dispatching distribution dmax example expression fixed flow given handling cost headway hierarchical routing holding cost Imax inbound and outbound increase independent influence area interval line-haul logistics systems lower bound minimize minimum mode motion cost Newell number of items number of stops number of terminals number of vehicle O-D pairs operating optimal cost optimum origins and destinations partition pipeline inventory cost points problem production reduced rent costs result schedules Section service region simulated annealing solution strategy subregion term terminal costs tion total cost total number Trans transportation cost transshipments trigger point trip trucks unit area v'max vehicle routes Vmax warehouse zones
Popular passages
Page 273 - Hall, RW; Distance approximations for routing manual pickers in a warehouse, HE Transactions, 25(4), 76-87, 1993.