A Dynamic Routing Framework for Shared Mobility Services

• DOI: 10.48550/arxiv.1903.11014
• Publication Date: 2019-01-01
• Authors: Yue Guan; Anuradha M. Annas...; Hung‐Wei Tseng
• Keywords: Minification

Travel time in urban centers is a significant contributor to the quality of living its citizens. Mobility on Demand (MoD) services such as Uber and Lyft have revolutionized transportation infrastructure, enabling new solutions for passengers. Shared MoD shown that continuum can be provided between traditional private transport an individual public mass transit based transport, by making use underlying cyber-physical substrate provides advanced, distributed, networked computational communicational support. In this paper, we propose novel shared mobility service using dynamic framework. This framework generates route multi-passenger optimized reduce costs both shuttle passengers designed concept space window. introduces degree freedom helps cost system involved designing optimal route. A specific algorithm Alternating Minimization approach proposed. Its analytical properties are characterized. Detailed experiments carried out demonstrate advantages proposed result order magnitude improvement efficiency with minimal optimality gap when compared standard Mixed Integer Quadratically Constrained Programming algorithm.