This paper proposes a state-of-the-art branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands (VRPSD). We adapt the model of ...

In this paper we present a comparative study of several strategies that can be applied to achieve the so-called elementary lower bound in vehicle routing p...

Onshore oil fields may contain hundreds of wells that use sophisticated and complex equipments. These equipments need maintenance regularly to keep the...

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 ...

This paper proposes models and algorithms for the pickup and delivery vehicle routing problem with time windows and last-in-first-out (LIFO) loading constr...

Variable neighborhood search (VNS) is a meta-heuristic for solving optimization problems, whose basic idea is a systematic change of neighborhood structure...

The distance Laplacian of a connected graph G is defined by L = Diag(Tr) - D, where D is the distance matrix of G , and Diag(Tr) is the diagonal m...

Dantzig-Wolfe reformulation solved by Column Generation is an approach to obtain improved bounds for Mixed Integer Programs. A downside of this approach is t...

We consider the multicommodity network flow formulation of the Multiple Depot Vehicle Scheduling Problem (MDVSP) and investigate several strategies within a ...

Column generation for solving linear programs with a huge number of variables alternates between solving a master problem and a pricing subproblem to add var...

Scheduling often plays an important role in vehicle routing. This paper describes several applications in which the author has been involved in recent years...

We introduce a Laplacian and a signless Laplacian for the distance matrix of a connected graph, called the <i>distance Laplacian</i> and <i>distance signless...

In this paper we introduce the discrete time window assignment vehicle routing problem. This problem consists of assigning a single time window from a ...

We derive conditions on the functions \(\varphi\), \(\rho\), \(v\) and \(w\) such that the 0-1 fractional programming problem`(\max\limits_{x\in {0...

The purpose of this paper is to study the periodic arc routing problem when the arcs of a network behave as customers, and sufficient material is delivered s...

Application of the dispersion models in order to address the cannibalization phenomenon within franchised chains is a new approach. In this work we have deve...

Community detection in networks has been studied extensively in the last decade. Many criteria, expressing the quality of the partitions obtained, as well ...

Reduced RLT constraints are a special class of Reformulation-Linearization Technique (RLT) constraints. They apply to nonconvex (both continuous and mixed-...

Given a set of entities, cluster analysis aims at finding subsets, also called clusters or communities or modules, entities of which are homogeneous and well...

The production routing problem (PRP) concerns the production and distribution of a single product from a production plant to multiple customers using capacit...