An assignment-and-routing decomposition matheuristic for the time-dependent Inventory Routing Problem - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2022

An assignment-and-routing decomposition matheuristic for the time-dependent Inventory Routing Problem

Résumé

The inventory routing problem (IRP) integrates two operational problems of the supply chain: inventory management and routing. The objective of the decision-maker is to decide, for each period of the time horizon, whether a client should be replenished, with which quantity and following which route, optimising both the inventory and transportation costs. When evolving in an urban logistics context, one problem that can be faced is the volatility of the travelling times between locations. This volatility is represented in this paper by considering the travelling times as time dependent. As time-dependent problems tend to be harder to solve than their basic counterpart \cite{Gendreau2015}, it is necessary to propose new efficient algorithms. In this paper, a matheuristic that decomposes the problem into first assigning the clients to visit at each period and then solving a time-dependent travelling salesman problem (TD-TSP) is proposed.
Fichier principal
Vignette du fichier
Papier.pdf (832.68 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03595238 , version 1 (03-03-2022)

Identifiants

  • HAL Id : hal-03595238 , version 1

Citer

Fayçal Touzout, Anne-Laure Ladier, Khaled Hadj-Hamou. An assignment-and-routing decomposition matheuristic for the time-dependent Inventory Routing Problem. 23ème congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, INSA Lyon, Feb 2022, Villeurbanne - Lyon, France. ⟨hal-03595238⟩
38 Consultations
49 Téléchargements

Partager

Gmail Facebook X LinkedIn More