A matheuristic for solving inventory sharing problems
| Autor: | Fouad Riane, Fatima Ezzahra Achamrah, Sabine Limbourg, Christine Di Martinelly |
|---|---|
| Přispěvatelé: | Laboratoire Génie Industriel (LGI), CentraleSupélec-Université Paris-Saclay, Laboratoire d'Informatique pour l'Entreprise et les Systèmes de Production (LIESP), Université Lumière - Lyon 2 (UL2)-École Centrale de Lyon (ECL), Université de Lyon-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA), HEC Liège, Lille économie management - UMR 9221 (LEM), Université d'Artois (UA)-Université catholique de Lille (UCL)-Université de Lille-Centre National de la Recherche Scientifique (CNRS) |
| Jazyk: | angličtina |
| Rok vydání: | 2021 |
| Předmět: |
Matheuristic
Point of sale General Computer Science Operations research Linear programming Computer science Supply chain 0211 other engineering and technologies 02 engineering and technology Management Science and Operations Research computer.software_genre [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI] 03 medical and health sciences 0302 clinical medicine Genetic algorithm Metaheuristic 021103 operations research [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO] Inventory routing problem [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation Transshipment Modeling and Simulation Simulated annealing 030221 ophthalmology & optometry Routing (electronic design automation) computer |
| Zdroj: | Computers and Operations Research Computers and Operations Research, Elsevier, 2021, pp.105605. ⟨10.1016/j.cor.2021.105605⟩ Computers and Operations Research, 2022, 138, pp.105605. ⟨10.1016/j.cor.2021.105605⟩ |
| ISSN: | 0305-0548 1873-765X |
| DOI: | 10.1016/j.cor.2021.105605⟩ |
| Popis: | International audience; In this paper, we addressed a two-level supply chain in which a company manufactures products and sells them through its point of sale network. The problem of concern is a multi-product, multi-vehicle inventory sharing routing problem. We formulated it as a mixed-integer linear programming problem. We also designed a two-phase matheuristic that integrates mathematical modelling strengthened with relevant derived valid inequalities and hybridisation of sophisticated metaheuristics: Genetic Algorithm and Simulated Annealing. We tested 660 best known instances designed for the single and multi-vehicle inventory routing problem, and the results showed that the matheuristic outperformed the best known algorithms regarding computational times and enhanced 156 solutions for large instances. Extra experiments were conducted on a set of data specially designed for the multi-product multi-vehicle inventory sharing routing problem. Computational results highlighted the benefits of sharing inventory on the overall supply chain. Finally, a sensitivity analysis was conducted, which revealed the extent to which inventory sharing among different points of sale can be cost-effective by the savings it brings to reduce lost sales and inventory holding. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect