TITLE

To Wait or Not to Wait? The Bicriteria Delay Management Problem in Public Transportation

AUTHOR(S)
Ginkel, Andreas; Schöbel, Anita
PUB. DATE
November 2007
SOURCE
Transportation Science;Nov2007, Vol. 41 Issue 4, p527
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
Assume that a train reaches a station with delay. At the station there is a bus ready to depart. The question of whether the bus should wait for the delayed train or depart on time is called the delay management problem. Different single objective functions for this problem have been introduced and analyzed. In this paper, we present a bicriteria model for the delay management problem, taking into account both the delay of the vehicles and the number of passengers who miss a connection. Our model does not depend on detailed data about the passengers and hence can be easily implemented in practice. To analyze the problem, we present an integer programming formulation and a graph-theoretic approach that is based on discrete time/cost trade-off project networks. Using results of project planning, we develop an efficient solution method. We tested our procedure using real-world data. The results show the applicability of the approach.
ACCESSION #
28031260

 

Related Articles

  • The Minisum Multipurpose Trip Location Problem on Networks. Berman, Oded; Rongbing Huang // Transportation Science;Nov2007, Vol. 41 Issue 4, p500 

    We investigate multipurpose trip location problems on networks with two different types of facilities and three groups of customers, two of which need only one type of service, while the third group needs both types of service in a single trip. The objective is to minimize the total weighted...

  • EXACT SOLUTION OF THE FIXED-CHARGE TRANSPORTATION PROBLEM. Gray, Paul // Operations Research;Oct71, Vol. 19 Issue 6, p1529 

    In the fixed-charge transportation problem, a fixed charge is associated with each route that can be opened, in addition to the variable transportation cost proportional to the amount of goods shipped. This note presents an exact solution of this mixed integer programming problem by decomposing...

  • Network Design and Transportation Planning: Models and Algorithms. Magnanti, T. L.; Wong, R. T. // Transportation Science;Feb84, Vol. 18 Issue 1, p1 

    Numerous transportation applications as diverse as capital investment decision- making, vehicle fleet planning, and traffic light signal setting all involve some form of (discrete choice) network design. In this paper, we review some of the uses and limitations of integer programming-based...

  • Solving Singly Constrained Trasshipment Problems. Glover, F.; Karney, D.; Kljngman, D.; Russell, R. // Transportation Science;Nov78, Vol. 12 Issue 4, p277 

    This paper develops a primal simplex procedure to solve transshipment problems with an arbitrary additional constraint. The procedure incorporates efficient methods for pricing-out the basis, determining certain key vector representations, and implementing the change of basis. These methods...

  • Hub Arc Location Problems: Part I--Introduction and Results. Campbell, J. F.; Ernst, A. T.; Krishnamoorthy, M. // Management Science;Oct2005, Vol. 51 Issue 10, p1540 

    Hub networks play an important role in many transportation and telecommunications systems. This paper introduces a new model called the hub arc location model. Rather than locate discrete hub facilities, this model locates hub arcs, which have reduced unit flow costs. Four special cases of the...

  • Train Stop Scheduling in a High-Speed Rail Network by Utilizing a Two-Stage Approach. Huiling Fu; Lei Nie; Sperry, Benjamin R.; Zhenhuan He // Mathematical Problems in Engineering;2012, Vol. 2012, Special section p1 

    Among the most commonly used methods of scheduling train stops are practical experience and various "one-step" optimal models. These methods face problems of direct transferability and computational complexity when considering a large-scale high-speed rail (HSR) network such as the one in China....

  • Train Stop Scheduling in a High-Speed Rail Network by Utilizing a Two-Stage Approach. Huiling Fu; Lei Nie; Sperry, Benjamin R.; Zhenhuan He // Mathematical Problems in Engineering;2012, Vol. 2012, Special section p1 

    Among the most commonly used methods of scheduling train stops are practical experience and various "one-step" optimal models. These methods face problems of direct transferability and computational complexity when considering a large-scale high- speed rail (HSR) network such as the one in...

  • A Multivehicle Tanker Scheduling Problem. Bellmore, M.; Bennigton, G.; Lubore, S. // Transportation Science;Feb71, Vol. 5 Issue 1, p36 

    The Dantzig and Fulkerson Tanker Scheduling Problem is concerned with the determination of the minimum size and optimal routing of a fleet of homogeneous tankers needed to meet a prescribed schedule of deliveries. This problem has been formulated as a network flow problem. Later formulations...

  • The Group-Theoretic Structure in the Fixed-Charge Transportation Problem. Kennington, J. L.; Unger, V. E. // Operations Research;Sep/Oct73, Vol. 21 Issue 5, p1142 

    The multiparametric integer programming problem for the right-hand side is to minimize c′t subject to At=b(y), t≧0, t=0 (mod 1), where b(y) can be expressed in the form b(y) = b+F(y), where F is a matrix of constant coefficients, and y is an integer vector parameter. The group...

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