Cluster-first route-second methods like the sweep heuristic (Gillett and Miller, 1974) are well
known in vehicle routing. They determine clusters of customers compatible with vehicle …

This paper studies the well-known capacitated vehicle routing problem with two-dimensional
loading constraints (2L-CVRP). It requires designing a set of min-cost routes, starting and …

The current global interest in improving the use of ever-scarcer natural resources calls for
the re-alignment of supply chain operations to include not only economic factors, but …

This paper addresses the capacitated vehicle routing problem with two-dimensional loading
constraints (2L-CVRP), which is a generalized capacitated vehicle routing problem in which …

This paper presents constraint programming-based solution approaches for the three-
dimensional loading capacitated vehicle routing problem (3l-CVRP) that consists of vehicle …

Two-echelon vehicle routing problem (2E-VRP) is a challenging problem that involves both
the strategic and tactical planning decisions on both echelons. The satellite locations and …

This paper studies a particular integration of the Heterogeneous Fleet Vehicle Routing
Problem with three-dimensional loading constraints (3L-HFVRP), which considers …

The paper addresses the heterogeneous fleet vehicle routing problem with three-
dimensional (3D) loading constraints (3L-HFVRP), a new practical variant of the combined …

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 extend the vehicle routing problem with clustered backhauls (VRPCB) to an
integrated routing and three-dimensional loading problem, called VRPCB with 3D loading …