Splitting loads such that the delivery of certain loads is completed in multiple trips rather than
one trip results in opportunities for a reduction in cost and the number of vehicles used …

This paper presents an exact solution framework for solving some variants of the vehicle
routing problem (VRP) that can be modeled as set partitioning (SP) problems with additional …

In this paper, we extend the classical Pickup and Delivery Problem (PDP) to an integrated
routing and three-dimensional loading problem, called PDP with three-dimensional loading …

In this paper, we solve the pickup and delivery problem with time windows and last-in-first-
out (LIFO) loading. LIFO loading minimizes handling while unloading items from the vehicle …

In the multi-pickup and delivery problem with time windows (MPDPTW) a set of vehicles
must be routed to satisfy a set of client requests between given origins and destinations. A …

Pickup and delivery problems with late penalties can be adopted to model a wide range of
practical situations in the field of transportation and logistics. However, the restrictions on the …

This work considers the problem of satisfying transportation requests from a set of suppliers
to a set of customers. Each request calls for moving products between a pick-up and a …

Integrating freight flows with scheduled public transportation services creates attractive
business opportunities as the same transportation needs can be met with fewer operating …

Various forms of the pickup and delivery problem (PDP) have been studied extensively over
the past decades. This paper introduces a new version of the heterogeneous PDP in which …

In this paper, we investigate a new variant of last-mile delivery that integrates the scheduling
of static E-commerce parcels and Online-to-Offline (O2O) parcels. The O2O parcels, such as …