To main content

A Capacitated Clustering-based Method for Newspaper Delivery Routing

A Capacitated Clustering-based Method for Newspaper Delivery Routing

Category
Conference lecture and academic presentation
Abstract
We present an efficient solver that produces clustered, balanced, and cost effective routes for distribution in a given geographical area. Through cloud computing, the optimization functionality is used by more than 30 Nordic newspaper distribution companies for solving Large-scale Node Edge Arc Routing Problems (NEARP) with route duration, route balancing, and route compactness constraints. First, we solve a capacitated clustering problem. The corresponding NEARP solution is further optimized through a combination of Iterated Local Search, Variable Neighborhood Search, and Large Neighborhood Search.
Client
  • Norges forskningsråd / 205298
Language
English
Affiliation
  • SINTEF ICT / Anvendt matematikk
Presented at
IFORS 2011
Place
Melbourne, Australia
Date
13.07.2011 - 13.07.2011
Organizer
IFORS
Year
2011