Vehicle routing problems have been the focus of extensive research over the past sixty
years, driven by their economic importance and their theoretical interest. The diversity of …

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 …

With the rapid development of logistics industry, vehicle scheduling is the key to the
optimization of transportation links. Vehicle transportation route planning is becoming more …

Abstract The Dynamic Pickup and Delivery Problem (DPDP) is an essential problem in the
logistics domain, which is NP-hard. The objective is to dynamically schedule vehicles …

This paper presents a survey of vehicle routing problems with multiple synchronization
constraints. These problems exhibit, in addition to the usual task covering constraints, further …

Optimization of collaborative multi-depot pickup and delivery logistics networks (CMDPDLN)
with split loads and time windows involves a customer demand splitting strategy and a multi …

This paper is a survey on the vehicle routing problems with split deliveries, a class of routing
problems where each customer may be served by more than one vehicle. Starting from the …

6.1▪ Introduction Pickup-and-Delivery Problems (PDPs) constitute an important family of
routing problems in which goods or passengers have to be transported from different origins …

This paper addresses the design of routes for a fleet of vehicles serving customer requests. It
is a pickup and delivery problem where each customer location can be visited several times …

In the pickup and delivery problem (PDP) a fleet of capacitated vehicles must be routed in
order to satisfy a set of customer requests. In this article, we address a variant of the one-to …