dc.contributor.author | Skålnes, Jørgen | |
dc.contributor.author | Andersson, Henrik | |
dc.contributor.author | Desaulniers, Guy | |
dc.contributor.author | Stålhane, Magnus | |
dc.date.accessioned | 2022-08-10T07:27:11Z | |
dc.date.available | 2022-08-10T07:27:11Z | |
dc.date.created | 2022-03-28T09:23:03Z | |
dc.date.issued | 2022 | |
dc.identifier.citation | European Journal of Operational Research. 2022, . | en_US |
dc.identifier.issn | 0377-2217 | |
dc.identifier.uri | https://hdl.handle.net/11250/3010975 | |
dc.description.abstract | The Inventory Routing Problem (IRP) is a broad class of complex routing problems where the quanti- ties of delivered products must also be determined. In this paper, we consider the classic IRP where a single supplier must determine when to visit its customers, how much to deliver and how to com- bine the customer visits in each period into routes. We propose a branch-and-cut algorithm based on a new mathematical formulation for the IRP, improving the average lower bound obtained from algorithms based on the branch-and-cut methodology. The new formulation substitutes parts of the original formula- tion with a convex combination of extreme points. We call these extreme points customer schedules and for each customer they contain information about delivery periods and corresponding delivered quanti- ties. We show that this algorithm outperforms a state-of-the-art branch-and-cut algorithm on instances with time-varying demands. The customer schedule-based algorithm obtains better lower bounds, which improves the average optimality gap by 29% and 15% on two new sets of instances with time-varying demands. | en_US |
dc.language.iso | eng | en_US |
dc.publisher | Elsevier | en_US |
dc.rights | Navngivelse 4.0 Internasjonal | * |
dc.rights.uri | http://creativecommons.org/licenses/by/4.0/deed.no | * |
dc.title | An improved formulation for the inventory routing problem with time-varying demands | en_US |
dc.title.alternative | An improved formulation for the inventory routing problem with time-varying demands | en_US |
dc.type | Journal article | en_US |
dc.type | Peer reviewed | en_US |
dc.description.version | publishedVersion | en_US |
dc.source.pagenumber | 13 | en_US |
dc.source.journal | European Journal of Operational Research | en_US |
dc.identifier.doi | 10.1016/j.ejor.2022.02.011 | |
dc.identifier.cristin | 2012882 | |
cristin.ispublished | true | |
cristin.fulltext | original | |
cristin.qualitycode | 2 | |