7 citations · 15 across the 6 of their papers we have counts for
Showing 2020 · math.OCShow all
2 papers · 2 filters
math.OC2020
A chance-constrained dial-a-ride problem with utility-maximizing demand and multiple pricing structures
Xiaotong Dong, Joseph YJ Chow, S Travis Waller +1
The classic Dial-A-Ride Problem (DARP) aims at designing the minimum-cost routing that accommodates a set of user requests under constraints at an operations planning level, where…
math.OC2020
Incentive-compatible mechanisms for online resource allocation in mobility-as-a-service systems
Haoning Xi, Wei Liu, David Rey +2
In the context of `Everything-as-a-Service', the transportation sector has been evolving towards user-centric business models in which customized services and mode-agnostic mobilit…