In this paper, we study the pickup and delivery problem with time windows and multiple compartments (PDPTWMC). The PDPTWMC generalizes the pickup and delive...

Given a set \(\mathcal{N}\) of size \(n\), a non-negative, integer-valued distance matrix \(D\) of dimensions \(n\times n\), an integer `(p\in\mathb...

In this paper, we propose an exact branch-price-and-cut (BPC) algorithm for the two-echelon vehicle routing problem with time windows. This problem arises i...

Traditionally, the design of supply chains for humanitarian operations has been developed distinctly for the different disaster management phases, with littl...

In this paper, we introduce, model and solve the pickup and delivery problem with time windows, multiple stacks, and handling operations (PDPTWMS-H). % In...

We introduce the conditional \(p\)-dispersion problem (c-pDP), an incremental variant of the \(p\)-dispersion problem (pDP). In the c-pDP, one is given a...

This paper introduces two classes of location problems with interconnected facilities. These problems differ from classical location problems in the sense ...

This paper introduces the pickup and delivery problem with time windows and handling operations. In this problem, the loading compartment of a vehicle is mod...

This paper proposes models and algorithms for the pickup and delivery vehicle routing problem with time windows and multiple stacks. Each stack is rear-loade...

In this article, we solve the pickup and delivery problem with time windows and last-in-first-out (LIFO) loading. LIFO loading minimizes handling while unloa...

This paper proposes models and algorithms for the pickup and delivery vehicle routing problem with time windows and last-in-first-out (LIFO) loading constr...