A scalable non-myopic dynamic dial-a-ride and pricing problem

Hamid R. Sayarshad, Joseph Y.J. Chow

Research output: Contribution to journalArticle

Abstract

Non-myopic dial-a-ride problem and other related dynamic vehicle routing problems often ignore the need for non-myopic pricing under the assumption of elastic demand, which leads to an overestimation of the benefits in level of service and resulting inefficiencies. To correct this problem, a new dynamic dial-a-ride policy is introduced, one that features non-myopic pricing based on optimal tolling of queues to fit with the multi-server queueing approximation method proposed by Hyttiä et al. (2012) for large-scale systems. By including social optimal pricing, the social welfare of the resulting system outperforms the marginal pricing assumed for previous approaches over a range of test instances. In the examples tested, improvements in social welfare of the non-myopic pricing over the myopic pricing were in the 20-31% range. For a given demand function, we can derive the optimal fleet size to maximize social welfare. Sensitivity tests to the optimal price confirm that it leads to an optimal social welfare while the marginal pricing policy does not. A comparison of single passenger taxis to shared-taxis shows that system cost may reduce at the expense of decreased social welfare, which agrees with the results of Jung et al. (2013).

Original languageEnglish (US)
Pages (from-to)539-554
Number of pages16
JournalTransportation Research Part B: Methodological
Volume81
DOIs
StatePublished - Nov 1 2015

Keywords

  • Approximate dynamic programming
  • Dynamic dial a ride problem
  • Dynamic pricing
  • Flexible transport services
  • Last mile problem
  • Multiserver queue

ASJC Scopus subject areas

  • Civil and Structural Engineering
  • Transportation

Fingerprint Dive into the research topics of 'A scalable non-myopic dynamic dial-a-ride and pricing problem'. Together they form a unique fingerprint.

  • Cite this