Vis enkel innførsel

dc.contributor.authorBrekkå, Ivar
dc.contributor.authorRandøy, Solveig
dc.contributor.authorFagerholt, Kjetil
dc.contributor.authorThun, Kristian
dc.contributor.authorVadseth, Simen Tung
dc.date.accessioned2022-06-01T07:26:59Z
dc.date.available2022-06-01T07:26:59Z
dc.date.created2022-03-22T16:10:47Z
dc.date.issued2022
dc.identifier.citationComputers & Operations Research, 2022, 144, 105806en_US
dc.identifier.issn0305-0548
dc.identifier.urihttps://hdl.handle.net/11250/2997131
dc.description.abstractThis paper introduces the fish feed production routing problem (FFPRP) faced by Norwegian salmon feed producers. The FFPRP is comprised of a production scheduling problem and a rich vehicle routing problem (VRP) and thus denotes a variant of the integrated production scheduling and vehicle routing problem. We present a discrete time mixed integer programming (MIP) model of the FFPRP. Specifically, the model incorporates a multi-product, multi-trip, and multi-depot setting, where orders are produced at production lines at factories, and delivered within their respective time windows to customers by a heterogeneous fleet of vessels. The main objective is to minimize total costs, including production costs, routing costs, and costs of not delivering orders. We propose a heuristic, combining decomposition and the adaptive large neighborhood search (ALNS) heuristic, to solve the FFPRP. The decomposition-based ALNS heuristic is tested on a number of test instances which are generated based on vessel, factory, and order data from two of Norway’s largest fish feed producers. For small problem instances, for which the commercial MIP solver often is able to prove optimality, the average optimality gaps of the proposed heuristic are relatively small, while for the larger problem instances, the heuristic significantly outperforms the commercial MIP solver both in terms of solution quality and run time.en_US
dc.language.isoengen_US
dc.publisherElsevieren_US
dc.rightsNavngivelse 4.0 Internasjonal*
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/deed.no*
dc.subjectHeuristicen_US
dc.subjectCase studyen_US
dc.subjectMulti-depoten_US
dc.subjectProduction routingen_US
dc.subjectMaritime logisticsen_US
dc.titleThe Fish Feed Production Routing Problemen_US
dc.title.alternativeThe Fish Feed Production Routing Problemen_US
dc.typePeer revieweden_US
dc.typeJournal articleen_US
dc.description.versionpublishedVersionen_US
dc.rights.holder© 2022 The Author(s). Published by Elsevier Ltden_US
dc.source.pagenumber1-20en_US
dc.source.volume144en_US
dc.source.journalComputers & Operations Researchen_US
dc.identifier.doi10.1016/j.cor.2022.105806
dc.identifier.cristin2011799
dc.source.articlenumber105806en_US
cristin.ispublishedtrue
cristin.fulltextoriginal
cristin.qualitycode2


Tilhørende fil(er)

Thumbnail

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

Vis enkel innførsel

Navngivelse 4.0 Internasjonal
Med mindre annet er angitt, så er denne innførselen lisensiert som Navngivelse 4.0 Internasjonal