Abstract Generalized Vehicle Routing Problem (GVRP) is a challenging operational
research problem which has been widely studied for nearly two decades. In this problem, it …

The joint order batching and picker routing problem (JOBPRP) is a promising approach to
minimize the order picking travel distance in a picker-to-parts warehouse environment. In …

The soft-clustered vehicle routing problem (Soft-CluVRP) is a relaxation of the clustered
vehicle routing problem (CluVRP), which in turn is a variant of the generalized vehicle …

The Generalized Vehicle Routing Problem (GVRP) is an extension of the classical Vehicle
Routing Problem (VRP), in which we are looking for an optimal set of delivery or collection …

The Location-Routing Problem (LRP) becomes a more intricate subject when the limits of
capacities of vehicles and warehouses are considered, which is an NP-hard problem …

In this paper we deal with a selective vehicle routing problem (SVRP), which was proposed
in Posada et al.[20]. In the SVRP each node belongs to one or several clusters. Contrary to …

This article addresses two different pickup and delivery routing problems. In the first one,
called the one-commodity pickup and delivery traveling salesman problem, a known amount …

Warehouses take a vital role in today's supply chains.(Richards, 2021). According to the
Oxford Dictionary, a warehouse is defined as “a building where large quantities of goods are …

Abstract Generalized Vehicle Routing Problem (GVRP) is a NP-hard combinatorial problem.
It consists of finding a set of routes for a number of vehicles with limited capacity on a graph …