Vis enkel innførsel

dc.contributor.authorHansen, Jone Reinlund
dc.contributor.authorFagerholt, Kjetil
dc.contributor.authorMeisel, Frank
dc.contributor.authorRakke, Jørgen Glomvik
dc.date.accessioned2020-04-24T07:47:57Z
dc.date.available2020-04-24T07:47:57Z
dc.date.created2019-07-30T13:34:55Z
dc.date.issued2019
dc.identifier.citationEURO Journal on Transportation and Logistics. 2019, 8 633-659.en_US
dc.identifier.issn2192-4376
dc.identifier.urihttps://hdl.handle.net/11250/2652338
dc.description.abstractWe consider a new problem of planning interrelated voyages with separation requirements along a single trade in roll-on roll-off shipping. Along a given trade with a sequence of port calls, there is a number of contracts for transportation of cargoes between the different port pairs, where each contract states its service frequency as well as that these services should be evenly separated in time. Instead of visiting all ports every time a trade is serviced, as closely resembles current planning practice, we aim at determining the sailing routes of each voyage along the trade, i.e. which ports to visit when, which contracts to serve, and the sailing speeds, so that all contract requirements regarding frequency and separation are satisfied at minimum cost. We propose and compare two novel mixed integer programming models for the problem, both including a new way of modeling the contracts’ separation requirements. Then we show through a computational study on a set of realistic test instances that significant gains can be obtained compared to current planning practice.en_US
dc.language.isoengen_US
dc.publisherSpringeren_US
dc.titlePlanning interrelated voyages with separation requirements in roll-on roll-off shippingen_US
dc.typePeer revieweden_US
dc.typeJournal articleen_US
dc.description.versionacceptedVersionen_US
dc.source.pagenumber633-659en_US
dc.source.volume8en_US
dc.source.journalEURO Journal on Transportation and Logisticsen_US
dc.identifier.doi10.1007/s13676-019-00140-x
dc.identifier.cristin1713230
dc.relation.projectNorges forskningsråd: 263031en_US
dc.description.localcodeThis is a post-peer-review, pre-copyedit version of an article. Locked until 6.5.2020 due to copyright restrictions. The final authenticated version is available online at: http://dx.doi.org/10.1007/s13676-019-00140-xen_US
cristin.ispublishedtrue
cristin.fulltextpostprint
cristin.qualitycode1


Tilhørende fil(er)

Thumbnail

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

Vis enkel innførsel