An Effective VNS for Delivery Districting

This paper deals with the Delivery Territory Design Problem (DTDP), in which n points have to be allocated to p territories, such that balancing and path connectivity requirements are satisfied, while minimizing the maximum diameter over the created territories. The model is inspired by tactical planning situations faced by delivery companies. We propose two best improvement local search procedures and a Basic Variable Neighborhood Search algorithm following the LIMA paradigm. The results suggest that our algorithm is able to find high-quality solutions within a relatively low time.