Powered by OpenAIRE graph
Found an issue? Give us feedback
addClaim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

Community Shared Mobility Service

Community Shared Mobility Service

Abstract

1. Introduction / 2. Demand Responsive Transportation / 2.1. The DRT Problem: Effectiveness of Demand Responsive Transport / 2.2. Trip Scheduling Approaches / 3. Social Services on Wheels / 3.1. Demand Responsive Mobility as a Service / 3.1.1. Vehicle Reservation / 3.1.2. Vehicle Dispatching and Routing / 4. Experiment, Results and Evaluation / 4.1. Time Performance / 4.2. Cost Performance / 4.2.1. Passenger trips per revenue hour / 4.2.2. Operating cost per revenue hour / 5. Community Shared Mobility Service Experiment in Dhaka / 5.1. Overview of transport situation in Dhaka, Bangladesh / 5.2. Experiment Profile / 5.3. Evaluation of Community Shared Mobility Service experiment / 6. Conclusion / References Low population areas and low-income people often face unreliable public transport characterized by long waiting times. Meanwhile, a private vehicle in the same area, on average, will remain inactive for long periods of time. Recent research in shared mobility systems addresses this situation. Specifically, Demand Responsive Transport, DRT, a transport alternative between a bus and taxi, and which has many specification variations, has pioneered provision of an alternative transport solution geared to reach under-served minorities. Solutions to DRT trip scheduling and costing mechanisms usually include constraints specific to the variation of DRT specifications. / We aim to maximize use of a vehicle and we propose a design of a Community shared mobility service model that provides centralized management and ICT support in in delivering multiple services in a vehicle. Our design adds time constraints of vehicle schedule to the DRT problem. We also consider cost sharing mechanism. / We focus on reducing waiting time and propose a trip scheduling and cost sharing algorithm. We base our approach on a DRT heuristic algorithm. We also consider time windows. We propose a new cost sharing mechanism, based on traditional distance costing techniques but considering, seat capacity, an approach unique to the specifications of our design.

Related Organizations
Powered by OpenAIRE graph
Found an issue? Give us feedback
Related to Research communities