Publisher Summary Transportation on Demand (TOD) is concerned with the transportation
of passengers or goods between specific origins and destinations at the request of users. In …

When demand for transportation is low or sparse, traditional transit cannot provide efficient
and good-quality service, due to its fixed structure. New transportation alternatives are …

In this paper, we propose a novel, computational efficient, dynamic ridesharing algorithm.
The beneficial computational properties of the algorithm arise from casting the ridesharing …

Abstract The Dial-a-Ride Problem (DARP) consists of designing vehicle routes and
schedules for n users who specify pickup and delivery requests between origins and …

This paper is the second part of a comprehensive survey on routing problems involving
pickups and deliveries. Basically, two problem classes can be distinguished. The first part …

In the dial-a-ride problem, users formulate requests for transportation from a specific origin to
a specific destination. Transportation is carried out by vehicles providing a shared service …

This article describes a tabu search heuristic for the dial-a-ride problem with the following
characteristics. Users specify transportation requests between origins and destinations …

Pickup and delivery problems constitute an important class of vehicle routing problems in
which objects or people have to be collected and distributed. This paper introduces a …

New city logistics approaches are needed to ensure efficient urban mobility for both people
and goods. Usually, these are handled independently in dedicated networks. This paper …

Dial-a-ride problems are concerned with the design of efficient vehicle routes for
transporting individual persons from specific origin to specific destination locations. In real …