Handbooks in Operations Research and Management Science, 8: Network RoutingEdited by
- M.O. Ball, University of Maryland, College Park, MD, USA
- T.L. Magnanti, Sloan School of Management, MIT, Cambridge, MA, USA
- C.L. Monma, Bell Communications Research, Morristown, NJ, USA
- G.L. Nemhauser, Georgia Institute of Technology, Atlanta, GA, USA
The papers in this volume consider a general area of study known as network routing. The underlying problems are conceptually simple, yet mathematically complex and challenging. How can we best route material or people from one place to another? Or, how can we best design a system (e.g. locate facilities) to provide services and goods as efficiently and equitably as possible?
The problems encountered in answering these questions often have an underlying combinatorial structure, for example, either we dispatch a vehicle or we do not, or we use one particular route or another. The problems also typically have an underlying network structure (a communication or transportation network). In addition, models for these problems are often very large with hundreds or thousands of constraints and variables.
A companion volume in the Handbook series, entitled Network Models, treats basic network models such as minimum cost flows, matching and the travelling salesman problem, as well as, several complex network topics, not directly related to routing, such as network design and network reliability.
Handbooks in Operations Research and Management Science
Published: October 1995
- Preface. Vehicle Routing (M. Fisher). First generation research - simple heuristics. Generation two - mathematical programming based heuristics. Generation 3. Time Constrained Routing and Scheduling. (J. Desrosiers et al.). Fixed schedule problems. The travelling salesman problem with time windows. Constrained shortest path problems. The vehicle routing problem with time windows. Pick-up and delivery problems with time windows. A unified framework for fleet and crew scheduling problems. Conclusions and perspectives. Stochastic and Dynamic Networks and Routing. (W.B. Powell, P. Jaillet, A. Odoni). A priori (two-stage) stochastic models. Modelling issues for dynamic problems. Dynamic models in transportation and logistics. Algorithms and formulations for deterministic dynamic networks. Infinite horizon network models. Stochastic programming for networks. Stochastic programming models in networks and routing. Approximations for networks with random arc capacities. Evaluating dynamic models. Analysis of Vehicle Routing and Inventory-Routing Problems (A. Federgruen, D. Simchi-Levi). The capacitated vehicle routing problem (CVRP) with split demands. The CVRP with unequal demands. Inventory-routing models. The multi-depot CVRP. Generalizations and extensions. Arch Routing Methods and Applications. (A.A. Assad, B.L. Golden). The classical postman problems. The rural postman problem. The capacitated arc routing problem. Algorithms for capacitated arc routing problems. 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. Network Equilibrium Models and Algorithms. (M. Florian, D. Hearn). Equivalent problems - existence and uniqueness of solutions. Some optimization reformulations. Algorithms for the symmetric NEM. Solving the asymmetric NEM. Stochastic network equilibrium. Other network equilibrium models. Reference notes. Location on Networks. (M. Labbé, D. Peeters, J.-F. Thisse). The general framework and its properties. The median (minisum) problems. The center (minimax problems). Economic models of location. Discrete location problems. Conclusion. VLSI Network Design. (R.H. Möhring, D. Wagner, F. Wagner). Layout by graph partitioning. The divide & conquer layout algorithm. Bifurcators and separators. Bipartitioning. From planar graphs to switchboxes. Channel routing in the knock-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. Network Models in Economics. (W.W. Sharkey). Cost allocation on networks. Matching models in economics. Optimal pricing and allocation of waiting time in stochastic service systems. Concluding comments. Biographical Information. Subject Index. Contents of Previous Volumes.