Stochastic User Equilibrium Assignment in Schedule-Based Transit Networks with Capacity Constraints
This paper proposes a stochastic user equilibrium (SUE) assignment model for a schedule-based transit network with capacity constraint. We consider a situation in which passengers do not have the full knowledge about the condition of the network and select paths that minimize a generalized cost fun...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2012-01-01
|
| Series: | Discrete Dynamics in Nature and Society |
| Online Access: | http://dx.doi.org/10.1155/2012/910754 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832558496810270720 |
|---|---|
| author | Wangtu Xu Lixin Miao Wei-Hua Lin |
| author_facet | Wangtu Xu Lixin Miao Wei-Hua Lin |
| author_sort | Wangtu Xu |
| collection | DOAJ |
| description | This paper proposes a stochastic user equilibrium (SUE) assignment model for a schedule-based transit network with capacity constraint. We consider a situation in which passengers do not have the full knowledge about the condition of the network and select paths that minimize a generalized cost function encompassing five components: (1) ride time, which is composed of in-vehicle and waiting times, (2) overload delay, (3) fare, (4) transfer constraints, and (5) departure time difference. We split passenger demands among connections which are the space-time paths between OD pairs of the network. All transit vehicles have a fixed capacity and operate according to some preset timetables. When the capacity constraint of the transit line segment is reached, we show that the Lagrange multipliers of the mathematical programming problem are equivalent to the equilibrium passenger overload delay in the congested transit network. The proposed model can simultaneously predict how passengers choose their transit vehicles to minimize their travel costs and estimate the associated costs in a schedule-based congested transit network. A numerical example is used to illustrate the performance of the proposed model. |
| format | Article |
| id | doaj-art-0b111f0048de43ef9068c8908f32d110 |
| institution | Kabale University |
| issn | 1026-0226 1607-887X |
| language | English |
| publishDate | 2012-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Discrete Dynamics in Nature and Society |
| spelling | doaj-art-0b111f0048de43ef9068c8908f32d1102025-02-03T01:32:10ZengWileyDiscrete Dynamics in Nature and Society1026-02261607-887X2012-01-01201210.1155/2012/910754910754Stochastic User Equilibrium Assignment in Schedule-Based Transit Networks with Capacity ConstraintsWangtu Xu0Lixin Miao1Wei-Hua Lin2School of Architecture and Civil Engineering, Xiamen University, Xiamen 361005, ChinaResearch Center for Modern Logistics, Graduate School at Shenzhen, Tsinghua University, Shenzhen 518055, ChinaDepartment of Systems and Industrial Engineering, The University of Arizona, Tucson, AZ 85721, USAThis paper proposes a stochastic user equilibrium (SUE) assignment model for a schedule-based transit network with capacity constraint. We consider a situation in which passengers do not have the full knowledge about the condition of the network and select paths that minimize a generalized cost function encompassing five components: (1) ride time, which is composed of in-vehicle and waiting times, (2) overload delay, (3) fare, (4) transfer constraints, and (5) departure time difference. We split passenger demands among connections which are the space-time paths between OD pairs of the network. All transit vehicles have a fixed capacity and operate according to some preset timetables. When the capacity constraint of the transit line segment is reached, we show that the Lagrange multipliers of the mathematical programming problem are equivalent to the equilibrium passenger overload delay in the congested transit network. The proposed model can simultaneously predict how passengers choose their transit vehicles to minimize their travel costs and estimate the associated costs in a schedule-based congested transit network. A numerical example is used to illustrate the performance of the proposed model.http://dx.doi.org/10.1155/2012/910754 |
| spellingShingle | Wangtu Xu Lixin Miao Wei-Hua Lin Stochastic User Equilibrium Assignment in Schedule-Based Transit Networks with Capacity Constraints Discrete Dynamics in Nature and Society |
| title | Stochastic User Equilibrium Assignment in Schedule-Based Transit Networks with Capacity Constraints |
| title_full | Stochastic User Equilibrium Assignment in Schedule-Based Transit Networks with Capacity Constraints |
| title_fullStr | Stochastic User Equilibrium Assignment in Schedule-Based Transit Networks with Capacity Constraints |
| title_full_unstemmed | Stochastic User Equilibrium Assignment in Schedule-Based Transit Networks with Capacity Constraints |
| title_short | Stochastic User Equilibrium Assignment in Schedule-Based Transit Networks with Capacity Constraints |
| title_sort | stochastic user equilibrium assignment in schedule based transit networks with capacity constraints |
| url | http://dx.doi.org/10.1155/2012/910754 |
| work_keys_str_mv | AT wangtuxu stochasticuserequilibriumassignmentinschedulebasedtransitnetworkswithcapacityconstraints AT lixinmiao stochasticuserequilibriumassignmentinschedulebasedtransitnetworkswithcapacityconstraints AT weihualin stochasticuserequilibriumassignmentinschedulebasedtransitnetworkswithcapacityconstraints |