Show simple item record

dc.contributor.authorArchetti, Claudia
dc.contributor.authorChristiansen, Marielle
dc.contributor.authorSperanza, M. Grazia
dc.date.accessioned2018-03-19T09:50:40Z
dc.date.available2018-03-19T09:50:40Z
dc.date.created2018-03-12T12:52:45Z
dc.date.issued2018
dc.identifier.citationEuropean Journal of Operational Research. 2018, 268 (1), 314-324.nb_NO
dc.identifier.issn0377-2217
dc.identifier.urihttp://hdl.handle.net/11250/2490974
dc.description.abstractThis paper introduces a class of problems which integrate pickup and delivery vehicle routing problems (PDPs) and inventory management, and we call them inventory routing problems with pickups and deliveries (IRP-PD). We consider a specific problem of this class, where a commodity is made available at several origins and demanded by several destinations. Time is discretized and transportation is performed by a single vehicle. A mathematical programming model is proposed together with several classes of valid inequalities. The models are solved with a branch-and-cut method. Computational tests are performed to show the effectiveness of the valid inequalities on instances generated from benchmark instances for the inventory routing problem. Results show that the branch-and-cut algorithm is able to solve to optimality 345 over 400 instances with up to 50 customers over 3 periods of time, and 142 over 240 instances with up to 30 customers and 6 periods. From a management perspective, results show that the average cost of a non integrated policy is more than 35% higher than the cost of an integrated policy.nb_NO
dc.language.isoengnb_NO
dc.publisherElseviernb_NO
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 Internasjonal*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/deed.no*
dc.titleInventory routing with pickups and deliveriesnb_NO
dc.typeJournal articlenb_NO
dc.typePeer reviewednb_NO
dc.description.versionacceptedVersionnb_NO
dc.source.pagenumber314-324nb_NO
dc.source.volume268nb_NO
dc.source.journalEuropean Journal of Operational Researchnb_NO
dc.source.issue1nb_NO
dc.identifier.doi10.1016/j.ejor.2018.01.010
dc.identifier.cristin1572121
dc.relation.projectNorges forskningsråd: 263031nb_NO
dc.description.localcode© 2018. This is the authors’ accepted and refereed manuscript to the article. Locked until 9.1.2020 due to copyright restrictions. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/nb_NO
cristin.unitcode194,60,25,0
cristin.unitnameInstitutt for industriell økonomi og teknologiledelse
cristin.ispublishedtrue
cristin.fulltextpostprint
cristin.qualitycode2


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivatives 4.0 Internasjonal
Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivatives 4.0 Internasjonal