Table Of Content

Author In Transportatior 2009 INFORMS Salani, Matteo; see Ceselli, Alberto sStoecher, Wolfgang; see Schmid, Verena salem Habib Haj; see Mammar Salim Storchi, Giovanni; see Crainic, Teodor Gabriel Salvagnin, Domenico; see Fischetti, Matteo Taniguchi, Eiichi; see Yamadg Tadashi see Easwaran, Gopalakris Savelsbergh irtin W. P.; see Schmid, Verena Uster, Halit see Wong, Wai Hung Savelsbergh see Archetti, Claudia Van Hui, Yer Ul : Verter, Vedat; see (¢ rraaiinin I eodor Gadric Schafer, Simon; see Deri os rich wad wigs Wallace, Stein W see Lium, Arnt-Gunr Schmid, Verena; Doerner, Karl | F.; Hartl ard Wong Richard; see Chen, S Martin W. P.; Stoecher, Wolfgang. A Hybrid it. ion I . h for Wong, S. ¢€ see Lu, Yadong R 1d \ r ) ’ 7) Wong, Wai Hung; Zha ng, Ann Seyfried nin; Passon, Oliver; Steffen, Bernhard; Boltes, Maik; C. Optimal Bage Lin Rupprecht, Tobias; Klingsch, Wolfram. Insig Pedes it 355 trian } ott 295 Yamada Shu, Chi-War ‘ 1, Yadong Eiichi 9 Simao, Hi George, Abraham P.; Gif > A rr John, rPr.o ws ' rer ‘ nA} mat , man : rogramming : Zanette, A \rrigo; see Fischetti, Matte , Zhang, Anming; see Wong, Wai Hur ; hang, Dan; Adelman, Danie Sinha, Amit abl “e Chen, Richard | Smith, Barry Chunhua Steffen, Bern! » Seyfried, Armin Stier-Moses, } Ole see Maillé, Patrick TRANSPORTATION SCIENCE inf yur). Vol. 43, No. 4, November 2009, p. 548 ISSN 0041-1655 | EISSN 1526-5447 | 09 |4 304 |0 548 pot 10.1287/ /trsc.1090.0310 ©2009 INFORMS Volume 43—2009 Subject Index Advanced urban freight transportation: 432 Large neighbourhood search: 17 Air cargo transportation: 370 Linear integer programming: 287 Aircraft sizes: 355 Logistics: 244 Airline integrated planning: 2 LWR model: 511 Airline scheduling: 336 Mathematical logic: 98 Analytical solutions: 531 Mathematical programming: 98 Approximate dynamic programming: 178 Metaheuristics: 408 Arc routing problems: 287 Minimum replenishment quantity: 244 Baggage-limit policy: 355 Multimodal freight transport: 129 Benders decomposition: 86, 301 Multiobjective evolutionary algorithms: 198 Braess’ paradox: 117 Network design: 301 Branch and cut: 267 Network flows: 493 Branch and price: 267 Network pricing: 473 Capacitated closed-loop supply chain: 301 Network revenue management: 381 Nonlinear transportation problem: 455 Capacity of bottlenecks: 395 Numerical solutions: 531 Cargo routing: 370 Optimization: 355 Case study: 211 Particle swarm optimization: 27 Cell transmission model: 98 Passenger-cargo allocation: 355 Choice behavior: 381 Pedestrian flow: 395 City logistics: 211, 432 Pickup and delivery: 267 Column generation: 56, 198, 267 Pickup-and-delivery system: 27 Combination airlines: 355 Price of anarchy: 473 Combinatorial auctions: 493 Probabilistic arc routing: 43 Combined neighborhoods: 301 Public policy: 211 Conditional piecewise functions: 98 Rarefaction waves: 531 Contact discontinuities: 531 Ready-mixed concrete delivery: 70 Demand stochasticity: 336 Retail distribution: 211 Design conservation constraints: 158 Riemann problem: 531 Discontinuous flow-density relationship: 511 Robust optimization: 321 Discrete network design: 129 Robust scheduling: 2 Discretisation: 531 Robustness: 144, 321 Dispatch windows: 417 Scale economies: 86 Dispersion-and-store model: 98 Schedule and rotation planning: 370 Door assignment: 198 Scheduling: 144 Driver management: 178 Service network design: 144, 158, 432 Driver scheduling: 417 Shipment consolidation: 244 Drivers’ working hours: 17 Shock waves: 531 Dynamic lot sizing: 244 Small-package local routing: 4 ~5 Dynamic programming: 381 Stackelberg games: 473 Dynamic traffic assignment: 117 Stochastic programming: 144, 321 Dynamic user equilibrium: 117 Subsidies as incentives: 473 Dynamic vehicle routing problem: 27 Supply chain network design: 455 Dynamics scheduling: 336 Survey: 408 EC regulation 561/2006: 17 Sustainability: 211 Editorial: 407 System throughput: 117 Entropy solution: 511 Tabu search: 158, 301 Time windows: 211 Exact algorithms: 408 Timetabling: 321 Experiment: 211 Traffic and crowd dynamics: 395 Fleet management: 178 Traffic control: 117 Flexibility: 144 Traffic flow: 395, 511 Genetic local search: 129 Traveling salesman problem: 408 Heuristics: 408 Truckload procurement: 493 Hours of service: 417 Truckload transportation: 417 Hub-and-spoke networks: 86 Truckload trucking: 178 Hybrid approach: 70 Valid inequalities: 267 Hybrid predictive control: 27 Variable neighborhood search Implicit bidding approach: 493 Vehicle restrictions: 211 Integer multicommodity flow: 7 Vehicle routing: 17, 43, 56, 211, 432 Integer programming: 2, 321 Vehicle routing problem: 408 Integrated short-term planning and management: 432 Vehicle scheduling: 17 Inventory /production: 244 Wardrop equilibrium: 473 Lagrangian relaxation: 455 WENO scheme: 511 aho gSas a: