A Multiclass Simultaneous Transportation Equilibrium Model
Single class travel forecasting models assume that all travelers are similar in their travel-decision characteristics, such as their money-value of the time and their sensitivity to travel times in choosing their origin, destination and mode of travel, etc. To obtain more realistic models, travelers are often divided into classes, either by socio-economic attributes (e.g., income level, car availability, etc.) or by the purpose (e.g., home-based-work, non-home-based-work, home-based-shopping, etc.) of their travel, assuming that travel-decision characteristics are the same within each class, but differ among classes. However, the development of this concept of multiple classes increases the mathematical complexity of travel forecasting models. All the existing multiclass combined models consider the trip generation step of transportation planning process is exogenous to the combined prediction process. In this paper we enhance the Simultaneous Transportation Equilibrium Model (STEM) that developed by Safwat and Magnanti in 1988, and explicitly combined trip generation step, to be a multiclass model in terms of socio-economic group, trip purpose, pure and combined transportation modes, as well as departure time, all interacting over a physically unique multimodal network. The developed Multiclass Simultaneous Transportation Equilibrium Model (MSTEM) is formulated as a Variational Inequality problem and a diagonalization algorithm is proposed to solve it. Copyright Springer Science+Business Media, LLC 2007
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 7 (2007)
Issue (Month): 3 (September)
|Contact details of provider:|| Web page: http://www.springer.com|
|Order Information:||Web: http://www.springer.com/economics/regional+science/journal/11067/PS2|
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Florian, Michael & Spiess, Heinz, 1982. "The convergence of diagonalization algorithms for asymmetric network equilibrium problems," Transportation Research Part B: Methodological, Elsevier, vol. 16(6), pages 477-483, December.
- Bar-Gera, Hillel & Boyce, David, 2003. "Origin-based algorithms for combined travel forecasting models," Transportation Research Part B: Methodological, Elsevier, vol. 37(5), pages 405-422, June.
When requesting a correction, please mention this item's handle: RePEc:kap:netspa:v:7:y:2007:i:3:p:197-211. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla)or (Rebekah McClure)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.