Machine-Learning–Based Arc Selection for Constrained Shortest Path Problems…

Column generation is an iterative method used to solve a variety of optimization problems. It decomposes the problem into two parts: a master problem and one or more pricing problems (PP). The tota…

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 Branch-Price-and-Cut Algorithm for the Two-Echelon Vehicle Routing Problem …

In this paper, we propose an exact branch-price-and-cut (BPC) algorithm for the two-echelon vehicle routing problem with time windows. This problem arises in city logistics when high-capacity and l…

An Improved Integral Column Generation Algorithm Using Machine Learning for A…

The crew-pairing problem (CPP) is solved in the first step of the crew-scheduling process. It consists of creating a set of pairings (sequence of flights, connections, and rests forming one or mult…

Machine-Learning–Based Column Selection for Column Generation

Column generation (CG) is widely used for solving large-scale optimization problems. This article presents a new approach based on a machine learning (ML) technique to accelerate CG. This approach,…

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…

Variable Fixing for Two-Arc Sequences in Branch-Price-and-Cut Algorithms on P…

Integrated Liner Shipping Network Design and Scheduling

Improving Air Crew Rostering by Considering Crew Preferences in the Crew Pair…

Exact Branch-Price-and-Cut Algorithms for Vehicle Routing