| dc.contributor.author | Kloster, Oddvar | |
| dc.contributor.author | Flatberg, Truls | |
| dc.contributor.author | Hasle, Geir | |
| dc.date.accessioned | 2017-02-13T10:00:47Z | |
| dc.date.available | 2017-02-13T10:00:47Z | |
| dc.date.created | 2015-09-24T20:52:56Z | |
| dc.date.issued | 2011 | |
| dc.identifier.citation | NICTA / University of New South Wales | nb_NO |
| dc.identifier.uri | http://hdl.handle.net/11250/2430415 | |
| dc.description.abstract | In maritime inventory routing, a fleet of vessels is employed to transport products that are produced and consumed in different ports with limited storage capacity. The tight coupling between inventory management and routing, and diverse constraints make this a challenging problem. We generate a routing plan using an iterative construction algorithm, starting from an empty plan. In each iteration, a constraint violation, e.g. a stockout, is identified. We generate a number of different journeys that can fix the violation and add the best one. This continues until the plan is feasible or no remaining violation can be fixed. The construction algorithm is reused in the optimization phase, where each iteration consists of removing and then rebuilding a part of the plan. We present results on real world cases. | |
| dc.description.abstract | A heuristic for rich maritime inventory routing problems | |
| dc.language.iso | eng | nb_NO |
| dc.title | A heuristic for rich maritime inventory routing problems | nb_NO |
| dc.type | Lecture | nb_NO |
| dc.identifier.cristin | 1272887 | |
| dc.relation.project | Norges forskningsråd: 205298 | nb_NO |
| cristin.unitcode | 7401,90,11,0 | |
| cristin.unitcode | 7401,60,20,0 | |
| cristin.unitname | Anvendt matematikk | |
| cristin.unitname | Anvendt økonomi | |
| cristin.ispublished | true | |
| cristin.fulltext | postprint | |
