This book contains selected papers from the presentations given at the 7th EURO-Working Group Meeting on 'Iransportation, which took place at the Helsinki University of Technology (HUT), Finland, during August 2-4, 1999. Altogether 31 presentations were given and 14 full papers have been selected in this publication through a peer review process coordinated by the editors. The papers in this book cover a wide range of transportation problems from the simulation of railway traffic to optimum congestion tolling and mode choice modeling with stated preference data. In general, the variety of papers clearly demonstrates the wide areas of interest of people who are involved in the research of transportation systems and their operation. They as well demonstrate the importance and possibilities of modeling and theoretical approaches in the analysis of transportation systems and problem solving. Most of the papers are purely theoretical in nature, that is, they present a theoretical model with only a hypothetical example of applica tion. There are, however, some papers, which are closer to the practice or describe applications of and give interesting results of studies made by known methodologies. It is especially noteworthy, that half of the accepted papers deal with planning and operation of public transport.

The scientific monograph of a survey kind presented to the reader's attention deals with fundamental ideas and basic schemes of optimization methods that can be effectively used for solving strategic planning and operations manage ment problems related, in particular, to transportation. This monograph is an English translation of a considerable part of the author's book with a similar title that was published in Russian in 1992. The material of the monograph embraces methods of linear and nonlinear programming; nonsmooth and nonconvex optimization; integer programming, solving problems on graphs, and solving problems with mixed variables; rout ing, scheduling, solving network flow problems, and solving the transportation problem; stochastic programming, multicriteria optimization, game theory, and optimization on fuzzy sets and under fuzzy goals; optimal control of systems described by ordinary differential equations, partial differential equations, gen eralized differential equations (differential inclusions), and functional equations with a variable that can assume only discrete values; and some other methods that are based on or adjoin to the listed ones.

"This book provides a rigorous and comprehensive coverage of transportation models and planning methods and is a must-have to anyone in the transportation community, including students, teachers, and practitioners." Moshe Ben-Akiva, Massachusetts Institute of Technology.

Abstract: "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."

Scheduled transportation networks give rise to very complex and large-scale networkoptimization problems requiring innovative solution techniques and ideas from mathematical optimization and theoretical computer science. Examples of scheduled transportation include bus, ferry, airline, and railway networks, with the latter being a prime application domain that provides a fair amount of the most complex and largest instances of such optimization problems. Scheduled transport optimization deals with planning and scheduling problems over several time horizons, and substantial progress has been made for strategic planning and scheduling problems in all transportation domains. This state-of-the-art survey presents the outcome of an open call for contributions asking for either research papers or state-of-the-art survey articles. We received 24 submissions that underwent two rounds of the standard peer-review process, out of which 18 were finally accepted for publication. The volume is organized in four parts: Robustness and Recoverability, Robust Timetabling and Route Planning, Robust Planning Under Scarce Resources, and Online Planning: Delay and Disruption Management.

This book develops models, results and algorithms for optimizing public transportation from a customer-oriented viewpoint. The methods used are based on graph-theoretic approaches and integer programming. The specific topics are all motivated by real-world examples which occurred in practical projects: location of stops, management of delay, and tariff zone design. An appendix summarizes some of the basics of optimization needed to interpret the material in the book.

"This book provides a rigorous and comprehensive coverage of transportation models and planning methods and is a must-have to anyone in the transportation community, including students, teachers, and practitioners." Moshe Ben-Akiva, Massachusetts Institute of Technology.

Appendices A Rotastore A. l Tabular Results for Different Models A. 2 Tabular Results for Different Algorithms B OptiTrans B. l Input Data B. l. l Input Data Common to all Solution Approaches B. 1. 2 Specific Input Data for the MILP Model and the Column Enumeration Approach B. 1. 3 Specific Input Data for the Heuristic Methods B. 1. 3. 1 Penalty Criteria B. 1. 3. 2 Control Parameters of the OptiTrans Software B. 2 Tabular Results B. 2. 1 Tabular Results for the MILP Model B. 2. 2 Tabular Results for the Heuristic Methods B. 2. 2. 1 Input Data for a Whole Day - Offline Analysis B. 2. 2. 2 Results for CIH and SA References Index Preface This book covers the analysis and development of online algorithms involving exact optimization and heuristic techniques, and their appli- tion to solve two real life problems. The first problem is concerned with a complex technical system: a special carousel based high-speed storage system - Rotastore. It is shown that this logistic problem leads to an NP-hard Batch Presorting Pr- lem (BPSP) which is not easy to solve optimally in offline situations. We consider a polynomial case and develope an exact algorithm for offline situations. Competitive analysis showed that the proposed online - gorithm is 312-competitive. Online algorithms with lookahead improve the online solutions in particular cases. If the capacity constraint on additional storage is neglected the problem has a totally unimodular polyhedron.