In most vehicle routing and crew scheduling applications solved by column generation, the subproblem corresponds to a shortest path problem with resource constraints (SPPRC) or one of its variants. This paper proposes a classification and a generic formulation for the SPPRCs, briefly discusses complex modeling issues involving resources, and presents the most commonly used SPPRC solution method...

In most vehicle routing and crew scheduling applications solved by column generation, the subproblem corresponds to a shortest path problem with resource constraints (SPPRC) or one of its variants. This chapter proposes a classification and a generic formulation for the SPPRCs, briefly discusses complex modeling issues involving resources, and presents the most commonly used SPPRC solution meth...

In this paper we consider the vehicle routing problem with hard time windows and stochastic service times (VRPTW-ST); in this variant of the classic VRPTW the service times are random variables. In particular, given a set of vehicle routes, some of the actual service times might not lead to a feasible solution, given the customer time windows. We consider a chance-constrained program to model t...

The objective of the Vehicle Routing Problem (VRP) is to construct a minimum cost set of vehicle routes that visits all customers and satisfies demands without violating the vehicle capacity constraints. The Stochastic Vehicle Routing Problem (SVRP) results when one or more elements of the VRP are modeled as random variables. In this paper, we present a set-partitioning-based modeling framework...

In this work we investigate two variants of the Stochastic Vehicle Routing Problem: The Vehicle Routing Problem with Stochastic Demands and the Vehicle Routing Problem with Stochastic Demands and Customers. We show that under some moderate conditions there is an asymptotic equivalence between the Vehicle Routing Problem with Stochastic Demands and the Traveling Salesman Problem, as well as betw...

the location-routing problem is a relatively new branch of logistics system. its objective is to determine a suitable location for constructing distribution warehouses and proper transportation routing from warehouse to the customer. in this study, the location-routing problem is investigated with considering fuzzy servicing time window for each customer. another important issue in this regard ...

 The Shortest-path problem with timewindows and capacity constraints (SPPTWCC) is a problem used for solving vehicle-routing and crewscheduling applications. The SPPTWCC occurs as a sub-problem used to implicitly generate the set of all feasible routes and schedules in the columngeneration formulation of the vehicle routing problem with time windows (VRPTW) and its variations. The problem is ...

The Capacitated Arc Routing Problem (CARP) is a well-known and fundamental vehicle routing problem. A promising exact solution approach to the CARP is to model it as a set covering problem and solve it via branch-cut-and-price. The bottleneck in this approach is the pricing (column generation) routine. In this paper, we note that most CARP instances arising in practical applications are defined...