Choice-driven dial-a-ride problem for demand responsive mobility service
Sh Sharif Azadeh (École Polytechnique Fédérale de Lausanne, TU Delft - Transport and Planning, Massachusetts Institute of Technology)
Bilge Atasoy (TU Delft - Transport Engineering and Logistics, Massachusetts Institute of Technology)
Moshe E. Ben-Akiva (Massachusetts Institute of Technology)
M. Bierlaire (École Polytechnique Fédérale de Lausanne)
M. Y. Maknoon (École Polytechnique Fédérale de Lausanne, TU Delft - Transport and Logistics, Massachusetts Institute of Technology)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
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.
help_outline