10h30 - 10h55
A Column Generation Approach to the Multi-Vehicle Covering Tour Problem
This presentation is about the solution of the multi-vehicle covering tour problem by means of a column generation approach. While the master problem is a simple set covering problem, the subproblem is more complex. A model and a branch-and-cut algorithm for the latter will be presented.
10h55 - 11h20
The Machine Learning and Traveling Repairman Problem
The Machine Learning and Traveling Repairman Problem is to determine a route to repair nodes on a graph. The repair crew aims to minimize the cost of failures at the nodes, while the failure probabilities must also be estimated/learned. We introduce several formulations for this new class of problems.
11h20 - 11h45
A Branch-And-Cut Algorithm for the Pickup and Delivery Traveling Salesman Problem with Multiple Stacks
We present a branch-and-cut algorithm for solving a pickup and delivery problem for a single vehicle with multiple capacity-constrained LIFO stacks. Results are reported on our own test instances as well as on benchmark instances for some special cases of the problem.
11h45 - 12h10
A Branch-and-Price-and-Cut Method for a Maritime Pickup and Delivery Problem with Time Windows and Split Loads
We present a branch-and-price-and-cut method for a maritime pickup and delivery problem with time windows and split loads. The fleet is heterogeneous with each ship having a different load capacity and cost structure. Each cargo may be transported by one or several ships. Computational results will be presented.