File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: An algorithm for finding reasonable paths in transit networks

TitleAn algorithm for finding reasonable paths in transit networks
Authors
KeywordsPath-finding algorithm
Reasonable path
Transit network
Trip planning
Issue Date2007
PublisherJohn Wiley & Sons, Inc.. The Journal's web site is located at http://www.advanced-transport.com
Citation
Journal Of Advanced Transportation, 2007, v. 41 n. 3, p. 285-305 How to Cite?
AbstractIn this paper, reasonable paths in transit networks are defined as possible paths that satisfy the acceptable time criterion and transfer-walk criterion. A recursive algorithm for finding all of the reasonable paths in a transit network that does not involve a rapid increase in program run-time with network size is presented. Realistic transit networks in Hong Kong and Guangzhou were selected as case studies of the different phases of the development of a trip planning system. Transport planning practitioners and potential users were invited to test the system to evaluate its performance. The results of the prototype evaluation were satisfactory, and the viability of the system as a useful tool for supporting decision-making has been confirmed by the positive feedback that was obtained from survey questionnaires.
Persistent Identifierhttp://hdl.handle.net/10722/71640
ISSN
2015 Impact Factor: 1.292
2015 SCImago Journal Rankings: 0.911
References

 

DC FieldValueLanguage
dc.contributor.authorTan, MCen_HK
dc.contributor.authorTong, COen_HK
dc.contributor.authorWong, SCen_HK
dc.contributor.authorXu, JMen_HK
dc.date.accessioned2010-09-06T06:33:49Z-
dc.date.available2010-09-06T06:33:49Z-
dc.date.issued2007en_HK
dc.identifier.citationJournal Of Advanced Transportation, 2007, v. 41 n. 3, p. 285-305en_HK
dc.identifier.issn0197-6729en_HK
dc.identifier.urihttp://hdl.handle.net/10722/71640-
dc.description.abstractIn this paper, reasonable paths in transit networks are defined as possible paths that satisfy the acceptable time criterion and transfer-walk criterion. A recursive algorithm for finding all of the reasonable paths in a transit network that does not involve a rapid increase in program run-time with network size is presented. Realistic transit networks in Hong Kong and Guangzhou were selected as case studies of the different phases of the development of a trip planning system. Transport planning practitioners and potential users were invited to test the system to evaluate its performance. The results of the prototype evaluation were satisfactory, and the viability of the system as a useful tool for supporting decision-making has been confirmed by the positive feedback that was obtained from survey questionnaires.en_HK
dc.languageengen_HK
dc.publisherJohn Wiley & Sons, Inc.. The Journal's web site is located at http://www.advanced-transport.comen_HK
dc.relation.ispartofJournal of Advanced Transportationen_HK
dc.subjectPath-finding algorithmen_HK
dc.subjectReasonable pathen_HK
dc.subjectTransit networken_HK
dc.subjectTrip planningen_HK
dc.titleAn algorithm for finding reasonable paths in transit networksen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0197-6729&volume=41&spage=285&epage=305&date=2007&atitle=An+algorithm+for+finding+reasonable+paths+in+transit+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.1002/atr.5670410305-
dc.identifier.scopuseid_2-s2.0-34548806073en_HK
dc.identifier.hkuros133535en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-34548806073&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume41en_HK
dc.identifier.issue3en_HK
dc.identifier.spage285en_HK
dc.identifier.epage305en_HK
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridTan, MC=7401464871en_HK
dc.identifier.scopusauthoridTong, CO=7202715087en_HK
dc.identifier.scopusauthoridWong, SC=24323361400en_HK
dc.identifier.scopusauthoridXu, JM=7408556725en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats