Planning a selective delivery schedule through Adaptive Large Neighborhood Search

- We model a selective delivery schedule problem as a rich Team Orienteering Problem.
- We introduce new real-life constraints on the Team Orienteering Problem.
- We develop a multi-start ALNS algorithm to solve the problem.
- The multi-start ALNS yields better results than the classical ALNS.

We model and solve a real-life distribution problem faced by a fresh fruit supplier. This problem is formulated as a Multi-Product Split Delivery Capacitated Team Orienteering Problem with Incomplete Service and Soft Time Windows. The problem is modeled through a mixed integer linear programming formulation and solved by an Adaptive Large Neighborhood Search (ALNS) metaheuristic. Computational results over a large set of artificial instances show that the combination of ALNS with a multi-start scheme produces better results than a classical implementation of the ALNS in which a single solution is built and improved.