Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/13744
DC FieldValueLanguage
dc.contributorDepartment of Civil and Environmental Engineering-
dc.creatorHuang, HJ-
dc.creatorLam, WHK-
dc.date.accessioned2014-12-30T08:39:17Z-
dc.date.available2014-12-30T08:39:17Z-
dc.identifier.issn0160-5682-
dc.identifier.urihttp://hdl.handle.net/10397/13744-
dc.language.isoenen_US
dc.publisherPalgrave Macmillanen_US
dc.subjectDynamic equilibrium assignmenten_US
dc.subjectLogit-based departure time choiceen_US
dc.subjectNon-linear programmingen_US
dc.subjectPedestrian networken_US
dc.subjectTransporten_US
dc.titleQuasi-continuous dynamic equilibrium assignment with departure time choice in congested unidirectional pedestrian networksen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spage97-
dc.identifier.epage107-
dc.identifier.volume53-
dc.identifier.issue1-
dc.identifier.doi10.1057/palgrave/jors/2601267-
dcterms.abstractAlthough walking has been considered as an important transport mode, pedestrian modelling has received little attention in either academic or practising circles. There is an increasing need for methods that can be used to help the planning, design and management of pedestrian traffic systems. This paper presents a nonlinear programming formulation of the dynamic pedestrian equilibrium assignment problem based on the following assumptions. The pedestrian traffic system in a congested urban area can be modelled as a capacitated network with alternative walkway sections. People in this pedestrian network make such decisions as selecting departure time and walking path between origins and destinations (OD). The study horizon is divided equally into shorter time intervals of 5-10 minutes each, for which the pedestrian departure time matrices are given by a logit formula. It is dependent on the predetermined departure time costs and the equilibrium OD walking costs. In the proposed model, a 'quasi-continuous' technique is adopted to smooth out the transitions of various variables between time intervals and to satisfy the first-in-first-out discipline. A heuristic algorithm that generates approximate solutions to the model is presented. The numerical results in a real network shows that the model and algorithm proposed in this paper are able to capture the main characteristics of the departure time and route choices in congested unidirectional pedestrian traffic systems.-
dcterms.bibliographicCitationJournal of the Operational Research Society, 2002, v. 53, no. 1, p. 97-107-
dcterms.isPartOfJournal of the Operational Research Society-
dcterms.issued2002-
dc.identifier.isiWOS:000173256800012-
dc.identifier.scopus2-s2.0-0036240881-
dc.identifier.eissn1476-9360-
dc.identifier.rosgroupidr06369-
dc.description.ros2001-2002 > Academic research: refereed > Publication in refereed journal-
Appears in Collections:Journal/Magazine Article
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page view(s)

137
Last Week
0
Last month
Citations as of Oct 18, 2020

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.