著者紹介

内容

目次

Part 1 Vehicle routing, M. Fisher: first generation research - simpleheuristics; generation two - mathematical programming based heuristics;generation 3. Part 2 Time constrained routing and scheduling, J. Desrosierset al: fixed schedule problems; the travelling salesman problem with timewindows; constrained shortest path problems; the vehicle routing problem withtime windows; pick-up and delivery problems with time windows; a unifiedframework for fleet and crew scheduling problems; conclusions andperspectives. Part 3 Stochastic and dynamic networks and routing, W.B. Powellet al: a priori (two-stage) stochastic models; modelling issues for dynamicproblems; dynamic models in transportation and logistics; algorithms andformulations for deterministic dynamic networks; infinite horizon networkmodels; stochastic programming for networks; stochastic programming models innetworks and routing; approximations for networks with random arc capacities;evaluating dynamic models. Part 4 Analysis of vehicle routing andinventory-routing problems, A. Federgruen and D. Simchi-Levi: the capacitatedvehicle routing problem (CVRP) with split demands; the CVRP with unequaldemands; inventory-routing models; the multi-depot CVRP; generalizations andextensions. Part 5 Arch routing methods and applications, A.A. Assad and B.L.Golden: the classical postman problems; the rural postman problem; thecapacitated arc routing problem; algorithms for capacitated arc routingproblems; variants of postman problems; arc routing for sanitation services;postal delivery routing problems; routing for meter reading and snow control;applications in manufacturing and other areas; conclusions. Part 6 Networkequilibrium models and algorithms, M. Florian and D. Hearn: equivalentproblems - existence and uniqueness of solutions; some optimizationreformulations; algorithms for the symmetric NEM; solving the asymmetric NEM;stochastic network equilibrium; other network equilibrium models; referencenotes. Part 7 Location on networks, M. Labbe et al: the general framework andits properties; the median (minisum) problems; the center (minimax problems);economic models of location; discrete location problems; conclusion. Part 8VLSI network design, R.H. Mohring et al: layout by graph partitioning; thedivide and conquer layout algorithm; bifurcators and separators;bipartitioning; from planar graphs to switchboxes; channel routing in theknock-knee mode; layer assignment; Manhattan routing; via minimization;single layer routing; linear layout methods; the VLSI background;graph-theoretic formulations and related problems; complexity results;algorithms. Part 9 Network models in economics, W.W. Sharkey: cost allocationon networks; matching models in economics; optimal pricing and allocation ofwaiting time in stochastic service systems; concluding comments.