File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Network model of urban taxi services: Improved algorithm

TitleNetwork model of urban taxi services: Improved algorithm
Authors
Issue Date1998
PublisherUS National Research Council, Transportation Research Board. The Journal's web site is located at http://www.trb.org/Publications/Public/PubsTRRJournalPrint.aspx
Citation
Transportation Research Record, 1998 n. 1623, p. 27-30 How to Cite?
AbstractA mathematical model is proposed to describe how vacant and occupied taxis will cruise in a road network to research for customers and provide transportation services. The model assumes that a taxi driver, once having picked up a customer, will move to the customer's destination by the shortest path; and that a taxi driver, once having dropped a customer, will try to minimize individual expected search time required to meet the next customer. The probability that a vacant taxi meets a customer in a particular zone is specified by a logit model by assuming that the e expected search time in each zone is identically distributed random variable due to variation in perceptions and the random arrival of customers. The whole movement of all empty and occupied taxis is formul lated as an optimization model, from which a gravity-type distribution of empty taxis is derived. Consequently, the taxi movement model can be solved efficiently by the established iterative balancing method and can be incorporated into any standard transportation planning package.
Persistent Identifierhttp://hdl.handle.net/10722/150110
ISSN
2015 Impact Factor: 0.522
2015 SCImago Journal Rankings: 0.474
References

 

DC FieldValueLanguage
dc.contributor.authorWong, SCen_US
dc.contributor.authorYang, Hen_US
dc.date.accessioned2012-06-26T06:01:37Z-
dc.date.available2012-06-26T06:01:37Z-
dc.date.issued1998en_US
dc.identifier.citationTransportation Research Record, 1998 n. 1623, p. 27-30en_US
dc.identifier.issn0361-1981en_US
dc.identifier.urihttp://hdl.handle.net/10722/150110-
dc.description.abstractA mathematical model is proposed to describe how vacant and occupied taxis will cruise in a road network to research for customers and provide transportation services. The model assumes that a taxi driver, once having picked up a customer, will move to the customer's destination by the shortest path; and that a taxi driver, once having dropped a customer, will try to minimize individual expected search time required to meet the next customer. The probability that a vacant taxi meets a customer in a particular zone is specified by a logit model by assuming that the e expected search time in each zone is identically distributed random variable due to variation in perceptions and the random arrival of customers. The whole movement of all empty and occupied taxis is formul lated as an optimization model, from which a gravity-type distribution of empty taxis is derived. Consequently, the taxi movement model can be solved efficiently by the established iterative balancing method and can be incorporated into any standard transportation planning package.en_US
dc.languageengen_US
dc.publisherUS National Research Council, Transportation Research Board. The Journal's web site is located at http://www.trb.org/Publications/Public/PubsTRRJournalPrint.aspxen_US
dc.relation.ispartofTransportation Research Recorden_US
dc.titleNetwork model of urban taxi services: Improved algorithmen_US
dc.typeArticleen_US
dc.identifier.emailWong, SC:hhecwsc@hku.hken_US
dc.identifier.authorityWong, SC=rp00191en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-0032154033en_US
dc.identifier.hkuros41091-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0032154033&selection=ref&src=s&origin=recordpageen_US
dc.identifier.issue1623en_US
dc.identifier.spage27en_US
dc.identifier.epage30en_US
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridWong, SC=24323361400en_US
dc.identifier.scopusauthoridYang, H=7406556890en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats