within a multiple depot vehicle routing problem optimization framework. In logistic applications, customers have priority based on some logistic point of view. The priority levels of customers, affect distribution strategy specially in clustering level...

In this paper we develop a greedy randomized adaptive search procedure (GRASP) for solving a transportation problem arising in disaster relief situations. The problem is to satisfy the demand of a given set of customers ...

. This constraint, along with the time windows and multiple visits required by the collection centers, greatly complicate this vehicle routing problem. Anaya Arenas et al. 2015 proposed two mathematical models and fast heuristics to solve the biomedical samples...

This article concerns the location of satellite distribution centers (SDCs) to supply humanitarian aid to the affected people throughout a disaster area. In such situations, it is not possible for the relief teams to visit ...

We address the Open Vehicle Routing Problem (OVRP), a variant of the classical (Capacitated and Distance Constrained) Vehicle Routing Problem (VRP) in which the vehicles are not required to

return to the depot after completing their service...