A Capacitated Clustering-based Method for Newspaper Delivery Routing
dc.contributor.author | Hasle, Geir | |
dc.contributor.author | Kloster, Oddvar | |
dc.contributor.author | Smedsrud, Morten | |
dc.date.accessioned | 2017-02-13T10:00:17Z | |
dc.date.available | 2017-02-13T10:00:17Z | |
dc.date.created | 2015-09-24T20:53:03Z | |
dc.date.issued | 2011 | |
dc.identifier.citation | IFORS 2011 | nb_NO |
dc.identifier.uri | http://hdl.handle.net/11250/2430413 | |
dc.description.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. | |
dc.description.abstract | A Capacitated Clustering-based Method for Newspaper Delivery Routing | |
dc.language.iso | eng | nb_NO |
dc.title | A Capacitated Clustering-based Method for Newspaper Delivery Routing | nb_NO |
dc.type | Lecture | nb_NO |
dc.identifier.cristin | 1272889 | |
dc.relation.project | Norges forskningsråd: 205298 | nb_NO |
cristin.unitcode | 7401,90,11,0 | |
cristin.unitname | Anvendt matematikk | |
cristin.ispublished | true | |
cristin.fulltext | postprint |
Tilhørende fil(er)
Denne innførselen finnes i følgende samling(er)
-
Publikasjoner fra CRIStin - SINTEF AS [5654]
-
SINTEF Digital [2388]