Solving a continent-scale inventory routing problem at Renault. Bouvier, L., Dalle, G., Parmentier, A., & Vidal, T. Technical Report arXiv:2209.00412, 2022.
Paper abstract bibtex This paper is the fruit of a partnership with Renault. Their backward logistic requires to solve a continent-scale multi-attribute inventory routing problem (IRP). With an average of $}30{$ commodities, $}16{$ depots, and $}600{$ customers spread across a continent, our instances are orders of magnitude larger than those in the literature. Existing algorithms do not scale. We propose a large neighborhood search (LNS). To make it work, (1) we generalize existing split delivery vehicle routing problem and IRP neighborhoods to this context, (2) we turn a state-of-the art matheuristic for medium-scale IRP into a large neighborhood, and (3) we introduce two novel perturbations: the reinsertion of a customer and that of a commodity into the IRP solution. We also derive a new lower bound based on a flow relaxation. In order to stimulate the research on large-scale IRP, we introduce a library of industrial instances. We benchmark our algorithms on these instances and make our code open-source. Extensive numerical experiments highlight the relevance of each component of our LNS.
@techreport{Bouvier2022,
abstract = {This paper is the fruit of a partnership with Renault. Their backward logistic requires to solve a continent-scale multi-attribute inventory routing problem (IRP). With an average of {\$}30{\$} commodities, {\$}16{\$} depots, and {\$}600{\$} customers spread across a continent, our instances are orders of magnitude larger than those in the literature. Existing algorithms do not scale. We propose a large neighborhood search (LNS). To make it work, (1) we generalize existing split delivery vehicle routing problem and IRP neighborhoods to this context, (2) we turn a state-of-the art matheuristic for medium-scale IRP into a large neighborhood, and (3) we introduce two novel perturbations: the reinsertion of a customer and that of a commodity into the IRP solution. We also derive a new lower bound based on a flow relaxation. In order to stimulate the research on large-scale IRP, we introduce a library of industrial instances. We benchmark our algorithms on these instances and make our code open-source. Extensive numerical experiments highlight the relevance of each component of our LNS.},
archivePrefix = {arXiv},
arxivId = {2209.00412},
author = {Bouvier, L. and Dalle, G. and Parmentier, A. and Vidal, T.},
eprint = {2209.00412},
file = {:C$\backslash$:/Users/Thibaut/Documents/Mendeley-Articles/Bouvier et al/Bouvier et al. - 2022 - Solving a continent-scale inventory routing problem at Renault.pdf:pdf},
institution = {arXiv:2209.00412},
title = {{Solving a continent-scale inventory routing problem at Renault}},
url = {https://arxiv.org/pdf/2209.00412.pdf},
year = {2022}
}
Downloads: 0
{"_id":"KYAPHFhS77bn5F6vz","bibbaseid":"bouvier-dalle-parmentier-vidal-solvingacontinentscaleinventoryroutingproblematrenault-2022","author_short":["Bouvier, L.","Dalle, G.","Parmentier, A.","Vidal, T."],"bibdata":{"bibtype":"techreport","type":"techreport","abstract":"This paper is the fruit of a partnership with Renault. Their backward logistic requires to solve a continent-scale multi-attribute inventory routing problem (IRP). With an average of $}30{$ commodities, $}16{$ depots, and $}600{$ customers spread across a continent, our instances are orders of magnitude larger than those in the literature. Existing algorithms do not scale. We propose a large neighborhood search (LNS). To make it work, (1) we generalize existing split delivery vehicle routing problem and IRP neighborhoods to this context, (2) we turn a state-of-the art matheuristic for medium-scale IRP into a large neighborhood, and (3) we introduce two novel perturbations: the reinsertion of a customer and that of a commodity into the IRP solution. We also derive a new lower bound based on a flow relaxation. In order to stimulate the research on large-scale IRP, we introduce a library of industrial instances. We benchmark our algorithms on these instances and make our code open-source. Extensive numerical experiments highlight the relevance of each component of our LNS.","archiveprefix":"arXiv","arxivid":"2209.00412","author":[{"propositions":[],"lastnames":["Bouvier"],"firstnames":["L."],"suffixes":[]},{"propositions":[],"lastnames":["Dalle"],"firstnames":["G."],"suffixes":[]},{"propositions":[],"lastnames":["Parmentier"],"firstnames":["A."],"suffixes":[]},{"propositions":[],"lastnames":["Vidal"],"firstnames":["T."],"suffixes":[]}],"eprint":"2209.00412","file":":C$\\$:/Users/Thibaut/Documents/Mendeley-Articles/Bouvier et al/Bouvier et al. - 2022 - Solving a continent-scale inventory routing problem at Renault.pdf:pdf","institution":"arXiv:2209.00412","title":"Solving a continent-scale inventory routing problem at Renault","url":"https://arxiv.org/pdf/2209.00412.pdf","year":"2022","bibtex":"@techreport{Bouvier2022,\nabstract = {This paper is the fruit of a partnership with Renault. Their backward logistic requires to solve a continent-scale multi-attribute inventory routing problem (IRP). With an average of {\\$}30{\\$} commodities, {\\$}16{\\$} depots, and {\\$}600{\\$} customers spread across a continent, our instances are orders of magnitude larger than those in the literature. Existing algorithms do not scale. We propose a large neighborhood search (LNS). To make it work, (1) we generalize existing split delivery vehicle routing problem and IRP neighborhoods to this context, (2) we turn a state-of-the art matheuristic for medium-scale IRP into a large neighborhood, and (3) we introduce two novel perturbations: the reinsertion of a customer and that of a commodity into the IRP solution. We also derive a new lower bound based on a flow relaxation. In order to stimulate the research on large-scale IRP, we introduce a library of industrial instances. We benchmark our algorithms on these instances and make our code open-source. Extensive numerical experiments highlight the relevance of each component of our LNS.},\narchivePrefix = {arXiv},\narxivId = {2209.00412},\nauthor = {Bouvier, L. and Dalle, G. and Parmentier, A. and Vidal, T.},\neprint = {2209.00412},\nfile = {:C$\\backslash$:/Users/Thibaut/Documents/Mendeley-Articles/Bouvier et al/Bouvier et al. - 2022 - Solving a continent-scale inventory routing problem at Renault.pdf:pdf},\ninstitution = {arXiv:2209.00412},\ntitle = {{Solving a continent-scale inventory routing problem at Renault}},\nurl = {https://arxiv.org/pdf/2209.00412.pdf},\nyear = {2022}\n}\n","author_short":["Bouvier, L.","Dalle, G.","Parmentier, A.","Vidal, T."],"key":"Bouvier2022","id":"Bouvier2022","bibbaseid":"bouvier-dalle-parmentier-vidal-solvingacontinentscaleinventoryroutingproblematrenault-2022","role":"author","urls":{"Paper":"https://arxiv.org/pdf/2209.00412.pdf"},"metadata":{"authorlinks":{}},"html":""},"bibtype":"techreport","biburl":"https://w1.cirrelt.ca/~vidalt/resources/My Collection.bib","dataSources":["yinfondEAJRbDM9sJ","sempRA6PhmAdGk3yG"],"keywords":[],"search_terms":["solving","continent","scale","inventory","routing","problem","renault","bouvier","dalle","parmentier","vidal"],"title":"Solving a continent-scale inventory routing problem at Renault","year":2022}