A Modeling Framework for Passenger Assignment on a Transport Network with Timetables

Sang Nguyen, Stefano Pallottino and Federico Malucelli
Additional contact information
Sang Nguyen: Département d'informatique et de recherche opérationnelle and Centre de recherche sur les transports, Université de Montréal, c.p. 6128, succ. centre ville, Montréal, Canada H3C 3J7
Stefano Pallottino: Dipartimento di Informatica, Università di Pisa, 40 corso Italia, 56125 Pisa, Italy
Federico Malucelli: Dipartimento di Elettronica e Informazione, Politecnico di Milano, P. le L. da Vinci 32, Milano, Italy

Transportation Science, 2001, vol. 35, issue 3, 238-249

Abstract: This paper presents a new graph theoretic framework for the passenger assignment problem that encompasses simultaneously the departure time and the route choice. The implicit FIFO access to transit lines is taken into account by the concept of available capacity. This notion of flow priority has not been considered explicitly in previous models. A traffic equilibrium model is described and a computational procedure based on asymmetric boarding penalty functions is suggested.

Date: 2001
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (23)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.35.3.238.10152 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:35:y:2001:i:3:p:238-249

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().