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 …

Publisher Summary Time constrained routing and scheduling problems are encountered in
a variety of industrial and service sector applications, ranging from logistics and …

Optimization of on-demand transportation systems and ride-sharing services involves
solving a class of complex vehicle routing problems with pickup and delivery with time …

This paper considers the design and analysis of algorithms for vehicle routing and
scheduling problems with time window constraints. Given the intrinsic difficulty of this …

The vehicle routing problem with time windows (VRPTW) is a generalization of the vehicle
routing problem where the service of a customer can begin within the time window defined …

In pickup and delivery problems vehicles have to transport loads from origins to destinations
without transshipment at intermediate locations. In this paper, we discuss several …

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 first part of a comprehensive survey on pickup and delivery problems.
Basically, two problem classes can be distinguished. The first class, discussed in this paper …

The vehicle routing problem (vrp) involves the design of a set of minimum cost routes for a
fleet of vehicles which services exactly once a set of customers with known demands. The …

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 …