The fast and cost-efficient home delivery of goods ordered online is logistically challenging.
Many companies are looking for new ways to cross the last mile to their customers. One …

XII Preface solution as efficiently as possible. Most of the problems we treat have a good
algorithmic solution, but we also show how even difficult problems can be treated (for …

This thesis introduces the novel paradigm of" constraint integer programming"(CIP), which
integrates constraint programming (CP) and mixed integer programming (MIP) modeling …

Reinforcement learning has recently shown promise in learning quality solutions in many
combinatorial optimization problems. In particular, the attention-based encoder-decoder …

We consider the Vehicle Routing Problem, in which a fixed fleet of delivery vehicles of
uniform capacity must service known customer demands for a single commodity from a …

We discuss several issues that arise in the implementation of Martin, Otto, and Felten's
Chained Lin-Kernighan heuristic for large-scale traveling salesman problems …

The traveling salesperson (or, salesman) problem (TSP) is a well known and important
combinatorial optimization problem. The goal is to find the shortest tour that visits each city in …

Given a directed graph G (V, A), the p-Median problem consists of determining p nodes (the
median nodes) minimizing the total distance from the other nodes of the graph. We present a …

This correspondence describes a hybrid genetic algorithm (GA) to find high-quality solutions
for the traveling salesman problem (TSP). The proposed method is based on a parallel …

Dantzig, Fulkerson, and Johnson (1954) introduced the cutting-plane method as a means of
attacking the traveling salesman problem; this method has been applied to broad classes of …