TITLE

A Doubly Dynamic Schedule-based Assignment Model for Transit Networks

AUTHOR(S)
Nuzzolo, Agostino; Russo, Francesco; Crisalli, Umberto
PUB. DATE
August 2001
SOURCE
Transportation Science;Aug2001, Vol. 35 Issue 3, p268
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
In order to improve the performances of transit modeling and in particular to assess the effects of the introduction of ITS technologies, which imply substantial changes in user behavior, in the last 10 years transit path choice and assignment models that use a schedule-based approach, instead of the traditional frequency-based one, have been developed. This paper presents a schedule-based path choice model for high-frequency transit networks, which allows us to consider the evolution in time of transit services, both within-day and day-to-day, as well as the day-to-day learning process of attributes by which users choose. On the basis of this path choice model a dynamic process assignment model, both within-day and day-to-day (from which the term "doubly dynamic" derives), was developed and tested on a realistically sized network to verify its applicability for operations planning.
ACCESSION #
5658135

 

Related Articles

  • The Intermodal Trailer Assignment Problem. Feo, Thomas A.; González-Velarde, José Luis // Transportation Science;Nov95, Vol. 29 Issue 4, p330 

    The problem of optimally assigning highway trailers to railcar hitches in intermodal transportation is studied. An integer-linear programming formulation is constructed. The problem is formulated using set covering. The resulting formulation is very small, and possesses in practice a tight...

  • DISCRETE-VARIABLE EXTREMUM PROBLEMS. Dantzig, George B. // Operations Research;Apr57, Vol. 5 Issue 2, p266 

    This paper reviews some recent successes in the use of linear programming methods for the solution of discrete-variable extremum problems. One example of the use of the multistage approach of dynamic programming for this purpose is also discussed.

  • On the equivalence of the max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems. Pan, Yunpeng; Shi, Leyuan // Mathematical Programming;Sep2007, Vol. 110 Issue 3, p543 

    New observations are made about two lower bound schemes for single-machine min-sum scheduling problems. We find that the strongest bound of those provided by transportation problem relaxations can be computed by solving a linear program. We show the equivalence of this strongest bound and the...

  • A TARGET-ASSIGNMENT PROBLEM. Manne, Alan S. // Operations Research;May/Jun58, Vol. 6 Issue 3, p346 

    This paper is concerned with a target assignment model of a probabilistic and nonlinear nature, but nevertheless one which is closely related to the 'personnel-assignment' problem It is shown here that, despite the apparent nonlinearities, it is possible to devise a linear programming...

  • Common-Lines and Passenger Assignment in Congested Transit Networks. Cominetti, Roberto; Correa, José // Transportation Science;Aug2001, Vol. 35 Issue 3, p250 

    We analyze a Wardrop equilibrium model for passenger assignment in, general transit networks, including the effects of congestion over the passengers' choices. The model is based on the common-line paradigm, which is applied to general networks using a dynamic programming approach. Congestion is...

  • Minimising total tardiness for the worker assignment scheduling problem in identical parallel-machine models. Po-Chieng Hu // International Journal of Advanced Manufacturing Technology;Mar2004, Vol. 23 Issue 5/6, p383 

    The worker assignment scheduling problem involves both the decisions of job scheduling and worker assignment. In this research, only the performance measure of total tardiness is investigated in the model of identical parallel machines with nonpreemptive jobs. Since the worker assignment...

  • AN EXPERIMENTAL EVALUATION OF SOME METHODS OF SOLVING THE ASSIGNMENT PROBLEM. Florian, Michael; Klein, Morton // CORS Journal;Jul70, Vol. 8 Issue 2, p101 

    Computational experiments were conducted with three methods for solving the assignment problem: Kuhn's Hungarian method, a primal method due to Balinski and Gomory, and a negative cycle method proposed by Klein. The experimental results showed Kuhn's method to be the most efficient (i.e., the...

  • RESOURCE-CONSTRAINED ASSIGNMENT SCHEDULING. Mazzola, Joseph B.; Neebe, Alan W. // Operations Research;Jul/Aug86, Vol. 34 Issue 4, p560 

    Many resource-constrained assignment scheduling problems can be modeled as 0-1 assignment problems with side constraints (APSC). Unlike the well-known assignment problem of linear programming, APSC is NP-complete. In this paper we define a branch-and-bound algorithm for solving APSC to...

  • Simultaneous Vehicle and Crew Scheduling in Urban Mass Transit Systems. Haase, Knut; Desaulniers, Guy; Desrosiers, Jacques // Transportation Science;Aug2001, Vol. 35 Issue 3, p286 

    This paper presents an exact approach for solving the simultaneous vehicle and crew scheduling problem in urban mass transit systems. We consider the single depot case with a homogeneous fleet of vehicles. This approach relies on a set partitioning formulation for the driver scheduling problem...

Share

Read the Article

Courtesy of VIRGINIA BEACH PUBLIC LIBRARY AND SYSTEM

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics