A Capacitated Clustering-based Method for Newspaper Delivery Routing
Lecture
Permanent lenke
http://hdl.handle.net/11250/2430413Utgivelsesdato
2011Metadata
Vis full innførselSamlinger
- Publikasjoner fra CRIStin - SINTEF AS [5583]
- SINTEF Digital [2379]
Originalversjon
IFORS 2011Sammendrag
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. A Capacitated Clustering-based Method for Newspaper Delivery Routing