TITLE

A Variable Trip Time Model for Cyclic Railway Timetabling

AUTHOR(S)
Kroon, Leo G.; Peeters, Leon W.P.
PUB. DATE
May 2003
SOURCE
Transportation Science;May2003, Vol. 37 Issue 2, p198
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
In this paper we describe how variable trip times can be included into an existing cyclic railway timetabling model based on the well-known periodic event scheduling problem (PESP). Thereby we provide an extension of the existing model because in the existing model it is assumed that the trip times of all trains on all tracks of the railway network are known a priori. However, the latter may be too restrictive in practice. The solution space of the extended model that we present is larger because small deviations from the fixed trip times are allowed. This is especially useful when a feasible solution to the fixed trip time model does not exist. The solutions obtained from the extended model are proven to be correct under certain necessary and sufficient conditions. Furthermore, the extended model has the same general structure as the original model. Therefore, solution methods developed for the original fixed trip time model can be applied to the extended model as well.
ACCESSION #
9908597

 

Related Articles

  • Vehicle Routing and Scheduling with Full Truckloads. Arunapuram, Sundararajan; Mathur, Kamlesh; Solow, Daniel // Transportation Science;May2003, Vol. 37 Issue 2, p170 

    Truckload carriers are constantly faced with the problem of shipping full truckloads of goods at minimum cost between pairs of cities or customers, using a fleet of trucks located at one or more depots. In this paper, a new branch-and-bound algorithm for solving an integer-programming...

  • Detecting Dynamic Traffic Assignment Capacity Paradoxes in Saturated Networks. Akamatsu, Takashi; Heydecker, Benjamin // Transportation Science;May2003, Vol. 37 Issue 2, p123 

    Creation of a new link or increase in capacity of an existing link can reduce the efficiency of a congested network as measured by the total travel cost. This phenomenon, of which an extreme example is given by Braess paradox, has been examined in conventional studies within the framework of...

  • A GA-based household scheduler. Meister, Konrad; Frick, Martin; Axhausen, Kay // Transportation;Sep2005, Vol. 32 Issue 5, p473 

    One way of making activity-based travel analysis operational for transport planning is multi-agent micro-simulation. Modelling activity and trip generation based on individual and social characteristics are central steps in this method. The model presented here generates complete daily activity...

  • Scheduling the factory pick-up of new cars. Mellentien, Christoph; Schwindt, Christoph; Trautmann, Norbert // OR Spectrum;Oct2004, Vol. 26 Issue 4, p579 

    Car manufacturers increasingly offer delivery programs for the factory pick-up of new cars. Such a program consists of a broad range of event-marketing activities. In this paper we investigate the problem of scheduling the delivery program activities of one day such that the sum of the...

  • Subgradient Methods for the Service Network Design Problem. Farvolden, Judith M.; Powell, Warren B. // Transportation Science;Aug94, Vol. 28 Issue 3, p256 

    We present local-improvement heuristics for a Service Network Design Problem encountered in the motor carrier industry. The scheduled set of vehicle departures determines the right hand side of the capacity constraints of the shipment routing subproblem which is modeled as a multicommodity...

  • The 'Hub' and 'Wheel' Scheduling Problems I. Arisawa, Sanji; Salah E. Elmaghraby // Transportation Science;May77, Vol. 11 Issue 2, p124 

    The problem is that of scheduling truck movement (loaded and empty) belween a central depot (the hub) and a number of outlying cities. Current demand is known, deterministically, but future demand is uncertain. The myopic case treats two periods only: the current period and one future period....

  • RESEARCH REPORTS. Daskin, Mark S. // Industrial Engineer: IE;Apr2003, Vol. 35 Issue 4, p49 

    Discusses research projects in the area of scheduling and logistics. Impact of increasing user expectations on machine replacement; Inventory and transshipment integration; Advantages of assemble-to-order manufacturing strategies.

  • A GEOMETRIC MODEL AND A GRAPHICAL ALGORITHM FOR A SEQUENCING PROBLEM. Hardgrave, William W.; Nemhauser, George L. // Operations Research;Nov/Dec63, Vol. 11 Issue 6, p889 

    Describes a geometric model and a graphical algorithm for a sequencing problem. Scheduling of N jobs on M machines so that the total time needed to complete the processing of all jobs is minimized; Focus on the case of two jobs for which the algorithm developed is simple and efficient.

  • A Tandem Network of Queues with Deterministic Service and Intermediate Arrivals. Shalmon, Michael; Kaplan, Michael A. // Operations Research;Jul/Aug84, Vol. 32 Issue 4, p753 

    We present a complete analysis of delays for a tandem network of queues with deterministic service and multiple, interfering sources. The model is of a packet-based data collection system consisting of some finite, but arbitrary, number of stations connected in tandem by a unidirectional,...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

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

Try another library?
Sign out of this library

Other Topics