There has been a resurgence of interest in demand-responsive shared-ride systems,
motivated by concerns for the environment and also new developments in technologies …

Dial-a-ride problems consist of designing vehicle routes and time schedules in a system of
demand-dependent, collective people transportation. In the standard problem, operational …

Abstract The Dial-a-Ride Problem (DARP) consists of designing vehicle routes and
schedules for customers with special needs and/or disabilities. The DARP with Electric …

In the dial-a-ride problem, user-specified transport requests from origin to destination points
have to be served by a fleet of homogeneous vehicles. The problem variant we consider …

Dedicated algorithm and modeling improvements continue to advance the state of the art
with respect to vehicle routing problems (VRPs). Despite these academic achievements …

This paper proposes a new mixed integer programming formulation and branch and cut
(BC) algorithm to solve the dial-a-ride problem (DARP). The DARP is a route-planning …

This paper investigates the Heterogeneous Dial-A-Ride Problem (H-DARP) that consists of
determining a vehicle route planning for heterogeneous users' transportation with a …

The introduction of public transport services by fully automated vehicles can potentially
change the way public transit services will be operated, as they allow shifting from rigid …

This paper introduces a fleet size and mix dial-a-ride problem with multiple passenger types
and a heterogeneous fleet of reconfigurable vehicles. In this new variant of the dial-a-ride …

Dial-a-ride services provide collective on-demand transportation, usually tailored to the
needs of people with reduced mobility. This paper investigates the operational effects of …