File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A predictive dynamic traffic assignment model in congested capacity-constrained road networks

TitleA predictive dynamic traffic assignment model in congested capacity-constrained road networks
Authors
Issue Date2000
PublisherPergamon. The Journal's web site is located at http://www.elsevier.com/locate/trb
Citation
Transportation Research Part B: Methodological, 2000, v. 34 n. 8, p. 625-644 How to Cite?
AbstractIn this paper, a predictive dynamic traffic assignment model in congested capacity-constrained road networks is formulated. A traffic simulator is developed to incrementally load the traffic demand onto the network, and updates the traffic conditions dynamically. A time-dependent shortest path algorithm is also given to determine the paths with minimum actual travel time from an origin to all the destinations. The traffic simulator and time-dependent shortest path algorithm are employed in a method of successive averages to solve the dynamic equilibrium solution of the problem. A numerical example is given to illustrate the effectiveness of the proposed method. (C) 2000 Elsevier Science Ltd. All rights reserved. | In this paper, a predictive dynamic traffic assignment model in congested capacity-constrained road networks is formulated. A traffic simulator is developed to incrementally load the traffic demand onto the network, and updates the traffic conditions dynamically. A time-dependent shortest path algorithm is also given to determine the paths with minimum actual travel time from an origin to all the destinations. The traffic simulator and time-dependent shortest path algorithm are employed in a method of successive averages to solve the dynamic equilibrium solution of the problem. A numerical example is given to illustrate the effectiveness of the proposed method.
Persistent Identifierhttp://hdl.handle.net/10722/71581
ISSN
2015 Impact Factor: 3.769
2015 SCImago Journal Rankings: 3.905
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorTong, COen_HK
dc.contributor.authorWong, SCen_HK
dc.date.accessioned2010-09-06T06:33:17Z-
dc.date.available2010-09-06T06:33:17Z-
dc.date.issued2000en_HK
dc.identifier.citationTransportation Research Part B: Methodological, 2000, v. 34 n. 8, p. 625-644en_HK
dc.identifier.issn0191-2615en_HK
dc.identifier.urihttp://hdl.handle.net/10722/71581-
dc.description.abstractIn this paper, a predictive dynamic traffic assignment model in congested capacity-constrained road networks is formulated. A traffic simulator is developed to incrementally load the traffic demand onto the network, and updates the traffic conditions dynamically. A time-dependent shortest path algorithm is also given to determine the paths with minimum actual travel time from an origin to all the destinations. The traffic simulator and time-dependent shortest path algorithm are employed in a method of successive averages to solve the dynamic equilibrium solution of the problem. A numerical example is given to illustrate the effectiveness of the proposed method. (C) 2000 Elsevier Science Ltd. All rights reserved. | In this paper, a predictive dynamic traffic assignment model in congested capacity-constrained road networks is formulated. A traffic simulator is developed to incrementally load the traffic demand onto the network, and updates the traffic conditions dynamically. A time-dependent shortest path algorithm is also given to determine the paths with minimum actual travel time from an origin to all the destinations. The traffic simulator and time-dependent shortest path algorithm are employed in a method of successive averages to solve the dynamic equilibrium solution of the problem. A numerical example is given to illustrate the effectiveness of the proposed method.en_HK
dc.languageengen_HK
dc.publisherPergamon. The Journal's web site is located at http://www.elsevier.com/locate/trben_HK
dc.relation.ispartofTransportation Research Part B: Methodologicalen_HK
dc.titleA predictive dynamic traffic assignment model in congested capacity-constrained road networksen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0191-2615&volume=34B&spage=625 &epage= 644&date=2000&atitle=A+predictive+dynamic+traffic+assignment+model+in+congested+capacity-constrained+road+networksen_HK
dc.identifier.emailTong, CO:cotong@hku.hken_HK
dc.identifier.emailWong, SC:hhecwsc@hku.hken_HK
dc.identifier.authorityTong, CO=rp00178en_HK
dc.identifier.authorityWong, SC=rp00191en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1016/S0191-2615(99)00045-4en_HK
dc.identifier.scopuseid_2-s2.0-0034333576en_HK
dc.identifier.hkuros56385en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0034333576&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume34en_HK
dc.identifier.issue8en_HK
dc.identifier.spage625en_HK
dc.identifier.epage644en_HK
dc.identifier.isiWOS:000089376300002-
dc.publisher.placeUnited Kingdomen_HK
dc.identifier.scopusauthoridTong, CO=7202715087en_HK
dc.identifier.scopusauthoridWong, SC=24323361400en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats