Author(s)

A. Pratelli

Abstract

A priori combinatorial optimization tools for transit network planning A. Pratelli Department of Civil Engineering "Vie e Trasporti" University of Pisa, Italy Abstract In the field of transport planning we are often interested in solving combinatorial optimization problems on subsets of network nodes which are requiring visit with a certain probability (for example, this is typical in dial-a-ride problems). Such cases are well suited for the so-called a priori optimization strategy that represents a potential more effective alternative to the traditional reoptimization strategy. Indeed, such strategy copes when there are some stochastic elements expressly enclosed into the basic problem formulation. This is an important feature, because the resulting model is more respondent to the real world characteristics that are always affected by random causes, such as travel times, stop locations, demand fluctuations, and so on. The paper first presents the a priori optimizati

Keywords