the inventory routing problem (irp) arises in the context of vendor-managed systems. this problem addresses jointly solving an inventory management problem and a vehicle routing problem. in this paper, we consider a multi-depot multi-vehicle inventory routing problem in which suppliers produce one type of product to be delivered to customers during a finite time horizon. we propose a two-phase ...

one of the important issues in transportation and logistics systems is vehicle routing problem (vrp). the vehicle routing problem is concerned with finding efficient routes of minimum total cost, beginning and ending at a central depot, for a fleet of vehicles to serve a number of customers. on the other hand, as a result of the increasing environmental concerns, economic problems and pressure ...

The elementary shortest path problem with resource constraints (ESPPRC) is a widely used modeling tool in formulating vehicle routing and crew scheduling applications, see e.g. [3]. The ESPPRC consists of finding shortest paths from a source to all other nodes of a network that do not contain any cycles, i.e. duplicate nodes. The ESPPRC occurs as a subproblem of an enclosing problem and is used...

In this paper, we address vehicle routing and crew scheduling problems that can be solved by a branch-and-price approach where the column generation subproblem corresponds to a shortest path problem with or without resource constraints. As surveyed in [1] and [2], branch-and-price approaches have been successfully used to solve a wide variety of vehicle routing and crew scheduling applications ...

The Split Delivery Vehicle Routing Problem (SDVRP) is a relaxation of the Capacitated Vehicle Routing Problem (CVRP) where customers may be assigned to multiple routes. A new construction heuristic is developed for the SDVRP and computational results are given for thirty-two data sets from previous literature. With respect to the total travel distance, the construction heuristic compares favora...

Interior Point Stabilization (IPS) is an acceleration method for Column Generation algorithms. Like previous stabilization techniques, it addresses degeneracy problems and convergence difficulties by preventing dual variables from taking extreme values. IPS is however different since it selects a dual solution inside the optimal dual space rather than retrieving an extreme point solution from t...

This paper deals with a real-life vehicle routing problem concerning the distribution of products to customers. A non-homogenous fleet of trucks with limited capacity and allowed travel time is available to satisfy the stochastic multiple product demand of a set of different types of customers with earliest and latest time for servicing. The objective is to minimize distribution costs while max...

1. Summary 2 1.1 Uncertainty of input parameters . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.2 Availability of input parameters . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.3 Commodity handling patterns . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.4 Classification of methods . . . . . . . . . . . . . ....

We consider stochastic vehicle routing problems on a network with random travel and service times. A fleet of one or more vehicles is available to be routed through the network to service each node. Two versions of the model are developed based on alternative objective functions. We provide bounds on optimal objective function values and conditions under which reductions to simpler models can b...