Dynamic dial-a-ride problems (DDARPs) involve designing routes and schedules for
customers with specific origins and destinations. While the optimization of DDARPs has …

Non-myopic dial-a-ride problem and other related dynamic vehicle routing problems often
ignore the need for non-myopic pricing under the assumption of elastic demand, which …

The dial-a-ride problem (DARP) is a widely studied theoretical challenge related to
dispatching vehicles in demand-responsive transport services, in which customers contact a …

In dial-a-ride problems, a fleet of n vehicles is routed to transport people between pick-up
and delivery locations. We consider an elementary version of the problem where trip …

A novel approach to dynamic switching service design based on a new queuing
approximation formulation is introduced to systematically control conventional buses and …

Abstract Almost all Dial-a-Ride problems (DARP) described in the literature pertain to the
design of optimal routes and schedules for n customers who specify pick-up and drop-off …

In this paper, we argue that a large-scale demand responsive system is the missing element
from the spectrum of the urban transport modes. To this end, we provide a comprehensive …

For the provision of efficient and high-quality public transport services in rural areas with a
low population density, the introduction of Demand Responsive Transport (DRT) services is …

The taxi–passenger problem is more and more prominent in terminal stations; passengers
usually wait in a long queue for taking a taxi in rush hour, and otherwise taxis wait in a …

With the popularity of Big Data and urban informatics, there is increasing interest in ways to
use real time data to improve transportation system operations. In many real-wold …