This research present a set-partitioning heuristic to generate populations in a hybrid genetic algorithm (hGA) which is able to solve four different variants of the vehicle routing problem: the multi-depot vehicle routing problem (MDVRP), the heterogeneous fleet and mix decisions (type, size and number of vehicle) (HFMVRP), site dependent vehicle routing problem (SDVRP) and the asymmetric vehic...

We consider the vehicle routing problem with stochastic demands (VRPSD) on tree structured networks with a single depot. The problem we are concerned with in this paper is to find a set of tours for the vehicle with minimum expected length. Every tour begins at the depot, visits a subset of customers and returns to the depot without violating the capacity constraint. Randomized approximation al...

abstractaccidents and natural disasters and crises coming out of them indicate the importance of an integrated planning to reduce their effected. therefore, disaster relief logistics is one of the main activities in disaster management. in this paper, we study the response phase of the disaster management cycle and a bi-objective model has been developed for relief chain logistic in uncertainty...

Cache depot is a performance enhancement technique on cache-coherent non-uniform memory access (CCNUMA) multiprocessors, in which nodes in the system store extra memory blocks on behalf of other nodes. In this way, memory requests from a node can be satisfied by nearby depot nodes without going all the way to the home node. This not only reduces memory access latency and network traffic, but al...

The rapid advancements in information technologies and globalization change the way of distributing goods to customers. Many enterprises have multiple factories, warehouses, distribution centers strive for competitive efficiency operations minimize transportation costs. This study proposed mixed-integer programming (MIP) model multi-depot split-delivery vehicle routing problems (MDSDVRPs) with ...

The Two-Echelon Vehicle Routing Problem (2E-VRP) is an extension of the classical VRP where the delivery from a single depot to customers is managed by routing and consolidating the freight through intermediate depots called satellites. We presented several meta-heuristics based on separating the first and second level routing problems and solving iteratively the two resulting routing subproble...

In this research discusses the problem of distributing goods from a depot to several customer locations minimize travel costs. The is solved by using Vehicle Routing Problem method. data used in secondary with 10 customers and one depot. aim form model that has been obtained determine optimal route based on formed. first step objective function problem, then constraints may occur. After formed,...

The min-max Split Delivery Multi-Depot Vehicle Routing Problem with Minimum Service Time Requirement (min-max SDMDVRP-MSTR) is a variant of the Multi-Depot Vehicle Routing Problem. Each customer requires a specified amount of service time. The service time can be split among vehicles as long as each vehicle spends a minimum amount of service time at a customer. The objective is to minimize the ...

Vehicle routing variants with multiple depots and mixed fleet present intricate combinatorial aspects related to sequencing choices, vehicle type choices, depot choices, and depots positioning. This paper introduces a dynamic programming methodology for efficiently evaluating compound neighborhoods combining sequence-based moves with an optimal choice of vehicle and depot, and an optimal determ...

We study the Multi-Depot Multiple Traveling Salesman Problem (MDMTSP), which is a variant of the very well-known Traveling Salesman Problem (TSP). In the MDMTSP an unlimited number of salesmen have to visit a set of customers using routes that can be based on a subset of available depots. The MDMTSP is an NPhard problem because it includes the TSP as a particular case when there is only one dep...