03:30 PM - 03:55 PM
Polynomial-Time Separation of Enhanced Reverse Multistar Inequalities
The Vehicle Routing Problem with a minimum number of customers per route concerns the Capacitated Vehicle Routing Problem with unit-demand customers and a lower bound on the number of customers visited by each vehicle. This paper answers two open questions in a previous article, namely finding a compact formulation for the problem such that the corresponding linear programming relaxation implies the Enhanced Reverse Multistar inequalities, and finding a polynomial-time separation algorithm for this class of inequalities.
03:55 PM - 04:20 PM
The Dynamic Dial-a-Chauffeur Problem
We present a real-world problem, where a company offers a service to transport customers from one location to another in the customer's own car. One of many uses for this type of service is people who need to get themselves and their car home safely after drinking too much to drive.
Results from initial computational experiments will be presented.
04:20 PM - 04:45 PM
Tactical Time Slot Management for Home Delivery
We consider a problem found in home delivery applications where time slots for service must be assigned to different geographical zones based on customer demand. A mathematical programming model is first presented,
which allows for split deliveries. Then, an adaptive large neighborhood search framework is proposed to solve the problem.