| dc.contributor.author | Hasle, Geir | |
| dc.contributor.author | Flatberg, Truls | |
| dc.contributor.author | Kloster, Oddvar | |
| dc.contributor.author | Nilssen, Eivind Jodaa | |
| dc.contributor.author | Smedsrud, Morten | |
| dc.date.accessioned | 2017-02-13T09:08:31Z | |
| dc.date.available | 2017-02-13T09:08:31Z | |
| dc.date.created | 2015-09-24T19:58:35Z | |
| dc.date.issued | 2009 | |
| dc.identifier.citation | EURO XXIII - 23rd European Conference on Operational Research | nb_NO |
| dc.identifier.uri | http://hdl.handle.net/11250/2430359 | |
| dc.description.abstract | In the VRP literature, the Arc Routing Problem is often advocated as an adequate model for routing applications such as newspaper delivery and garbage collection. We argue that a better model is the Node Edge Arc Routing Problem (NEARP), combining demand on nodes, edges, and arcs in a transportation network. We describe how we have extended a node based VRP solver to enable modeling and resolution of the NEARP, and network based heuristics for aggregating node-based demand into demands on arcs and edges. Experimental results on standard benchmarks and industrial cases are presented. | |
| dc.description.abstract | The Node Edge Arc Routing Problem - applications and heuristics | |
| dc.language.iso | eng | nb_NO |
| dc.title | The Node Edge Arc Routing Problem - applications and heuristics | nb_NO |
| dc.type | Lecture | nb_NO |
| dc.identifier.cristin | 1271613 | |
| cristin.unitcode | 7401,90,11,0 | |
| cristin.unitname | Anvendt matematikk | |
| cristin.ispublished | true | |
| cristin.fulltext | postprint | |
