A convex reformulation for the cyclic inventory routing problem - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

A convex reformulation for the cyclic inventory routing problem

Résumé

The SV-CIRP is an optimization problem consisting of finding a recurring distribution plan, from a single depot to a selected subset of retailers, that maximizes the collected rewards from the visited retailers while minimizing transportation and inventory costs. One of the main complications in developing solution methods for the SV-CIRP is the non-convexity of the objective function. We demonstrate how the problem can be reformulated so that its continuous relaxation is a convex optimization problem.
Fichier non déposé

Dates et versions

hal-01356224 , version 1 (25-08-2016)

Identifiants

  • HAL Id : hal-01356224 , version 1

Citer

Wouter Lefever, El-Houssaine Aghezzaf, Khaled Hadj-Hamou. A convex reformulation for the cyclic inventory routing problem. 30th Belgian Conference on Operations Research (ORBEL30-2016), Jan 2016, Louvain-la-Neuve, Belgium. ⟨hal-01356224⟩
28 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More