Choice-driven dial-a-ride problem for demand responsive mobility service

Sh Sharif Azadeh*, Bilge Atasoy, Moshe E. Ben-Akiva, M. Bierlaire, M. Y. Maknoon

*Corresponding author for this work

Research output: Contribution to journalArticleScientificpeer-review

1 Citation (Scopus)
20 Downloads (Pure)

Abstract

Urban mobility services face the challenge of planning their operations efficiently while complying with user preferences. In this paper, we introduce a new mathematical model called a choice-driven dial-a-ride problem (CD-DARP) which is a generalization of the dynamic DARP where passenger behavior is integrated in the operational planning using choice models and assortment optimization. We look at two types of mobility services, private and shared. Our problem extends the dynamic DARP by (i) changing its objective function to profit maximization, where both cost and revenue are variables, and (ii) incorporating assortment optimization with routing decisions in a dynamic setting. We propose a pricing scheme based on a choice model designed to offer service alternatives at the time a customer makes a request. We introduce a tailored algorithm to efficiently solve the dynamic CD-DARP. Computational results indicate that our proposed approach outperforms dynamic DARP in terms of reducing routing costs and improving the number of customers served.

Original languageEnglish
Pages (from-to)128-149
Number of pages22
JournalTransportation Research Part B: Methodological
Volume161
DOIs
Publication statusPublished - 2022

Keywords

  • Assortment optimization
  • Choice-driven dial-a-ride problem
  • Demand responsive mobility
  • Mixed-Integer Linear Problem (MILP)

Fingerprint

Dive into the research topics of 'Choice-driven dial-a-ride problem for demand responsive mobility service'. Together they form a unique fingerprint.

Cite this