Optimization of Transportation Systems

The world has experienced two hundred years of unprecedented advances in vehicle technology, transport system development, and traffic network extension. Technical progress continues but seems to have reached some limits. Congestion, pollution, and increasing costs have created, in some parts of the world, a climate of hostility against transportation technology. Mobility, however, is still increasing. What can be done? There is no panacea. Interdisciplinary cooperation is necessary, and we are going to argue in this paper that Mathematics can contribute significantly to the solution of some of the problems. We propose to employ methods developed in the Theory of Optimization to make better use of resources and existing technology. One way of optimization is better planning. We will point out that Discrete Mathematics provides a suitable framework for planning decisions within transportation systems. The mathematical approach leads to a better understanding of problems. Precise and quantitative models, and advanced mathematical tools allow for provable and reproducible conclusions. Modern computing equipment is suited to put such methods into practice. At present, mathematical methods contribute, in particular, to the solution of various problems of operational planning. We report about encouraging results achieved so far.

[1]  Karl-Heinz Hoffmann,et al.  Mathematik Schlüsseltechnologie für die Zukunft , 1997 .

[2]  Gerhard Reinelt,et al.  Traveling salesman problem , 2012 .

[3]  M. Padberg,et al.  Solving airline crew scheduling problems by branch-and-cut , 1993 .

[4]  A. Löbel Optimale Vehicle Scheduling in Public Transit , 1997 .

[5]  Gang Yu,et al.  OPERATIONS RESEARCH IN THE AIRLINE INDUSTRY. , 1998 .

[6]  Michael R. Bussieck,et al.  Discrete optimization in public rail transport , 1997, Math. Program..

[7]  R. Borndörfer,et al.  Aspects of Set Packing, Partitioning, and Covering , 1998 .

[8]  A. Bachem,et al.  Optimale Linienführung und Routenplanung in Verkehrssystemen , 1997 .

[9]  David K. Smith Theory of Linear and Integer Programming , 1987 .

[10]  Kasteleyn Nagel-Schreckenberg Gipps,et al.  TOWARDS A UNIFIED VIEW OF MICROSCOPIC TRAFFIC FLOW THEORIES , 1997 .

[11]  Warren B. Powell,et al.  Models and Algorithms for Distribution Problems with Uncertain Demands , 1996, Transp. Sci..

[12]  Michael Schreckenberg,et al.  Two lane traffic simulations using cellular automata , 1995, cond-mat/9512119.

[13]  David K. Smith Network Flows: Theory, Algorithms, and Applications , 1994 .

[14]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[15]  Matteo Fischetti,et al.  Algorithms for railway crew management , 1997, Math. Program..

[16]  Warren B. Powell,et al.  Stochastic and dynamic networks and routing , 1995 .

[17]  Mauro Dell'Amico,et al.  Annotated Bibliographies in Combinatorial Optimization , 1997 .

[18]  R. Weiner Lecture Notes in Economics and Mathematical Systems , 1985 .

[19]  J. Desrosiers,et al.  Lagrangian relaxation methods for solving the minimum fleet size multiple traveling salesman problem with time windows , 1988 .