Vis enkel innførsel

dc.contributor.authorHasle, Geir
dc.contributor.authorKloster, Oddvar
dc.contributor.authorSmedsrud, Morten
dc.date.accessioned2017-02-13T10:00:17Z
dc.date.available2017-02-13T10:00:17Z
dc.date.created2015-09-24T20:53:03Z
dc.date.issued2011
dc.identifier.citationIFORS 2011nb_NO
dc.identifier.urihttp://hdl.handle.net/11250/2430413
dc.description.abstractWe 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.abstractA Capacitated Clustering-based Method for Newspaper Delivery Routing
dc.language.isoengnb_NO
dc.titleA Capacitated Clustering-based Method for Newspaper Delivery Routingnb_NO
dc.typeLecturenb_NO
dc.identifier.cristin1272889
dc.relation.projectNorges forskningsråd: 205298nb_NO
cristin.unitcode7401,90,11,0
cristin.unitnameAnvendt matematikk
cristin.ispublishedtrue
cristin.fulltextpostprint


Tilhørende fil(er)

Thumbnail

Denne innførselen finnes i følgende samling(er)

Vis enkel innførsel