The Fragility-Constrained Vehicle Routing Problem with Time Windows

We study a new variant of the well-studied vehicle routing problem with time windows (VRPTW), called the fragility-constrained VRPTW, which assumes that (1) the capacity of a vehicle is organized i…

A Convex Reformulation and an Outer Approximation for a Large Class of Binary…

In this paper, we propose a general modeling and solving framework for a large class of binary quadratic programs subject to variable partitioning constraints. Problems in this class have a wide ra…

The Single-Line Design Problem for Demand-Adaptive Transit Systems : A Modeli…

When demand for transportation is low or sparse, traditional transit cannot provide efficient and good-quality service, because of its fixed structure. For this reason, mass transit is evolving tow…

Branch-Price-and-Cut Algorithms for the Vehicle Routing Problem with Stochast…

In this paper, we consider a version of the capacitated vehicle routing problem (CVRP) where travel times are assumed to be uncertain and statistically correlated (CVRP-SCT). In particular, we supp…

A Benders Decomposition Approach for the Symmetric TSP with Generalized Laten…

Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows

Modeling demand uncertainty in two-tier city logistics tactical planning