File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: COMPUTER MODEL FOR FINDING THE TIME-DEPENDENT MINIMUM PATH IN A TRANSIT SYSTEM WITH FIXED SCHEDULES.

TitleCOMPUTER MODEL FOR FINDING THE TIME-DEPENDENT MINIMUM PATH IN A TRANSIT SYSTEM WITH FIXED SCHEDULES.
Authors
Tong, CORichardson, AJ
Issue Date1984
PublisherJohn Wiley & Sons, Inc.. The Journal's web site is located at http://www.advanced-transport.com
Citation
Journal Of Advanced Transportation, 1984, v. 18 n. 2, p. 145-161 How to Cite?
AbstractThis paper describes the development of a computer model and algorithms for finding the time-dependent minimum path between two stations in a multi-route, multi-mode transit system running to fixed schedules. Selection of the minimum path can be based either on journey time or on weighted time. A worked example using a simple transit network is given to illustrate how the model works. The model has several applications in transport planning: it can be used for generating route schedule information to guide transit users, for assisting in route schedule coordination, and for analyzing transit system accessibility.
Persistent Identifierhttp://hdl.handle.net/10722/149861
ISSN
0197-6729
2021 Impact Factor: 2.249
2020 SCImago Journal Rankings: 0.577

 

DC FieldValueLanguage
dc.contributor.authorTong, COen_US
dc.contributor.authorRichardson, AJen_US
dc.date.accessioned2012-06-26T06:00:12Z-
dc.date.available2012-06-26T06:00:12Z-
dc.date.issued1984en_US
dc.identifier.citationJournal Of Advanced Transportation, 1984, v. 18 n. 2, p. 145-161en_US
dc.identifier.issn0197-6729en_US
dc.identifier.urihttp://hdl.handle.net/10722/149861-
dc.description.abstractThis paper describes the development of a computer model and algorithms for finding the time-dependent minimum path between two stations in a multi-route, multi-mode transit system running to fixed schedules. Selection of the minimum path can be based either on journey time or on weighted time. A worked example using a simple transit network is given to illustrate how the model works. The model has several applications in transport planning: it can be used for generating route schedule information to guide transit users, for assisting in route schedule coordination, and for analyzing transit system accessibility.en_US
dc.languageengen_US
dc.publisherJohn Wiley & Sons, Inc.. The Journal's web site is located at http://www.advanced-transport.comen_US
dc.relation.ispartofJournal of Advanced Transportationen_US
dc.titleCOMPUTER MODEL FOR FINDING THE TIME-DEPENDENT MINIMUM PATH IN A TRANSIT SYSTEM WITH FIXED SCHEDULES.en_US
dc.typeArticleen_US
dc.identifier.emailTong, CO:cotong@hku.hken_US
dc.identifier.authorityTong, CO=rp00178en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-0021449097en_US
dc.identifier.volume18en_US
dc.identifier.issue2en_US
dc.identifier.spage145en_US
dc.identifier.epage161en_US
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridTong, CO=7202715087en_US
dc.identifier.scopusauthoridRichardson, AJ=16053060200en_US
dc.identifier.issnl0197-6729-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats