This article addresses a vehicle routing problem variant which considers customers to require
simultaneous delivery and pick-up service (VRPSPD). The objective of this problem is to …

We present a metaheuristic methodology for the Capacitated Vehicle Routing Problem with
two-dimensional loading constraints (2L-CVRP). 2L-CVRP is a generalisation of the …

This paper examines a recently addressed practical variant of the capacitated vehicle routing
problem (VRP) called the capacitated vehicle routing problem with 3-D loading constraints (…

This paper deals with a routing problem variant which considers customers to simultaneously
require delivery and pick-up services. The examined problem is referred to as the Vehicle …

We propose a three-step algorithmic framework for solving a new variant of the vehicle-routing
problem (VRP) called the vehicle-routing problem with intermediate replenishment …

This article proposes a local search metaheuristic solution approach for the vehicle routing
problem with simultaneous pick-ups and deliveries (VRPSPD), which models numerous …

This article focuses on the mechanism of evaluating solution neighborhoods, an algorithmic
aspect which plays a crucial role on the efficiency of local-search based approaches. In …

The present paper examines a Vehicle Routing Problem (VRP) of major practical importance
which is referred to as the Load-Dependent VRP (LDVRP). LDVRP is applicable for …

This paper examines a practical transportation model known as the open vehicle routing
problem (OVRP). OVRP aims at designing the minimum cost set of routes originating from a …

We introduce and solve the Vehicle Routing Problem with Simultaneous Pick-ups and Deliveries
and Two-Dimensional Loading Constraints (2L-SPD). The 2L-SPD model covers cases …