TITLE

Transit Equilibrium Assignment: A Model and Solution Algorithms

AUTHOR(S)
Jia Hao Wu; Florian, Michael; Marcotte, Patrice
PUB. DATE
August 1994
SOURCE
Transportation Science;Aug94, Vol. 28 Issue 3, p193
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
In this paper we propose a model for the transit equilibrium assignment problem (TEAP) and develop two algorithms for its solution. The behavior of the transit users is modeled by using the concept of hyperpaths (strategies) on an appropriate network (general network) which is obtained from the road network and the transit lines by a transformation which makes explicit the walk, wait, in-vehicle, transfer and alight arcs. The waiting (generalized) cost is a function of both frequency of the transit lines and congestion effects due to queues at stops. The TEAP is stated and formulated as a variational inequality problem, in the space of hyperpath flows, and then solved by the linearized Jacobi method and the projection method. We prove the global convergence of these two algorithms for strongly monotone arc cost mappings. The implementation of the algorithms and computational experiments are presented as well.
ACCESSION #
4454164

 

Related Articles

  • A Probabilistic Model of Bus Route Performance. Powell, Warren B. // Transportation Science;Nov83, Vol. 17 Issue 4, p376 

    This paper addresses the problem of describing bus route performance as a first step toward developing strategies for improving service reliability. Previous work in the area has consisted of costly simulation models or analytical treatments of highly simplified problems. An alternative approach...

  • AN EFFICIENT GEOMETRIC SOLUTION TO THE MINIMUM SPANNING CIRCLE PROBLEM. Oommen, B. John // Operations Research;Jan/Feb87, Vol. 35 Issue 1, p80 

    We consider the century-old problem of finding the minimum spanning circle (MSC) of N points in the plane. We propose a computational scheme that incorporates the ideas that motivate three of the best-known primal feasible algorithms. The technique converges in finite time and is extremely fast....

  • Locating an Obnoxious Facility on a Network. Church, Richard L.; Garfinkel, Robert S. // Transportation Science;May78, Vol. 12 Issue 2, p107 

    We deal with the problem of locating a point on a network so as to maximize the sum of its weighted distances to the nodes. It is shown that there is at least one optimal point in a finite set of points which can easily be generated. An algorithm is given for locating an optimal point in this...

  • Competitive transportation problems. Ishii, Hiroaki // Central European Journal of Operations Research;Feb2004, Vol. 12 Issue 1, p71 

    This paper extends the classical transportation model to the competitive one that demand nodes are divided into some groups. In a classical transportation problem all demand nodes cooperate and reduce the total cost of all transportation costs, and so transportation cost of goods into some...

  • Spectral Shifted Jacobi Tau and Collocation Methods for Solving Fifth-Order Boundary Value Problems. Bhrawy, A. H.; Alofi, A. S.; El-Soubhy, S. I. // Abstract & Applied Analysis;2011, Special section p1 

    We have presented an efficient spectral algorithm based on shifted Jacobi taumethod of linear fifth- order two-point boundary value problems (BVPs). An approach that is implementing the shifted Jacobi tau method in combination with the shifted Jacobi collocation technique is introduced for the...

  • High Level Synthesis FPGA Implementation of the Jacobi Algorithm to Solve the Eigen Problem. Bravo, Ignacio; Vázquez, César; Gardel, Alfredo; Lázaro, José L.; Palomar, Esther // Mathematical Problems in Engineering;3/2/2015, Vol. 2015, p1 

    We present a hardware implementation of the Jacobi algorithm to compute the eigenvalue decomposition (EVD). The computation of eigenvalues and eigenvectors has many applications where real time processing is required, and thus hardware implementations are often mandatory. Some of these...

  • A Solution Method for Multistage Stochastic Programs with Recourse with Application to an Energy Investment Problem. Louveaux, Francois V. // Operations Research;Jul/Aug80, Vol. 28 Issue 4, p889 

    We consider a multistage stochastic program with recourse, with discrete distribution, quadratic objective function and linear inequality constraints We show that under reasonable assumptions, solving such a program is equivalent to solving a nested sequence of piecewise quadratic programs and...

  • Cognitive Fit in Requirements Modeling: A Study of Object and Process Methodologies. Agarwal, Ritu; Sinha, Atish P.; Tanniru, Mohan // Journal of Management Information Systems;Fall1996, Vol. 13 Issue 2, p137 

    Requirements modeling constitutes one of the most important phases of the systems development life cycle. Despite the proliferation of methodologies and models for requirements analysis, empirical work examining their relative efficacy is limited. This paper presents an empirical examination of...

  • THE TRANSPORTER SELECTION OPTIMIZATION IN TRANSPORT ISSUE. VULETA, Jovo; ANDZIĆ, Slobodan; ĐORĐEVIĆ, Gordana; JEVTIĆ, Nemanja; ĐORĐEVIĆ, Nada Vignjević // Metalurgia International;2013, Vol. 18 Issue 10, p72 

    This paper presents a specific problem of transporter selection optimization in the transport issue. The main characteristic of this problem is that every route has a capacity limit constraint, while the cost of transport per unit is partitioned and well known in advance. These costs are...

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