Capacitated transit assignment with loading priorities

Younes Hamdouch, Patrice Marcotte, Sang Nguyen

    Research output: Contribution to journalArticlepeer-review

    29 Citations (Scopus)

    Abstract

    In a transit network involving vehicles with rigid capacities, we advocate the use of strategies for describing consumer behavior. At each boarding node, a user sorts the transit lines in decreasing order of preference, and boards the first vehicle in this list whose residual capacity is nonzero. Since a user's position in the queue varies from day to day, the delay experienced is stochastic. This leads to an equilibrium problem where, at a solution, users are assigned to strategies that minimize their expected delay. This situation is formulated as a variational inequality, whose cost mapping is discontinuous and strongly asymmetric, due to the priority of current passengers over incoming users. We prove that the solution set is nonempty and provide numerical results obtained by an efficient solution algorithm.

    Original languageEnglish
    Pages (from-to)205-230
    Number of pages26
    JournalMathematical Programming
    Volume101
    Issue number1
    DOIs
    Publication statusPublished - Sept 2004

    Keywords

    • Capacities
    • Equilibrium assignment
    • Hyperpath
    • Priorities
    • Strategy
    • Transit networks
    • Variational inequalities

    ASJC Scopus subject areas

    • Software
    • General Mathematics

    Fingerprint

    Dive into the research topics of 'Capacitated transit assignment with loading priorities'. Together they form a unique fingerprint.

    Cite this