Vehicle routing problems (VRPs) are among the most studied problems in operations
research. Nowadays, the leading exact algorithms for solving many classes of VRPs are …

It has been around 30 years since the heterogeneous vehicle routing problem was
introduced, and significant progress has since been made on this problem and its variants …

Heterogeneous fleet vehicles can be used to reduce carbon emissions. We propose an
improved branch-and-price (BAP) algorithm to precisely solve the heterogeneous fleet …

We present an algorithm based on an ant colony system to deal with a broad range of
Dynamic Capacitated Vehicle Routing Problems with Time Windows,(partial) Split Delivery …

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 …

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 …

Besides the transport of containers between transshipment areas, an increasing amount of
containers needs to be moved to value-added logistics and auxiliary service areas leading …

We consider a routing problem where orders are transported just-in-time from several
suppliers to an original equipment manufacturer (OEM). This implies that shipments cannot …

We study the Multi-trip Separate Pickup and Delivery Problem with Time Windows at
Customers and Facilities (MT-PDTWCF), arising in two-tiered city logistics systems. The first …

This paper introduces a variant of the well-known Multi-Depot Periodic Vehicle Routing
Problem, which is inspired by a real situation of a distribution company. The problem …