A Column Generation based Tactical Planning Method for Inventory Routing
| hal.structure.identifier | Laboratoire de Mathématiques Appliquées du Havre [LMAH] | |
| hal.structure.identifier | Reformulations based algorithms for Combinatorial Optimization [Realopt] | |
| dc.contributor.author | MICHEL, Sophie | |
| hal.structure.identifier | Reformulations based algorithms for Combinatorial Optimization [Realopt] | |
| hal.structure.identifier | Institut de Mathématiques de Bordeaux [IMB] | |
| dc.contributor.author | VANDERBECK, François | |
| dc.date.accessioned | 2024-04-04T02:44:44Z | |
| dc.date.available | 2024-04-04T02:44:44Z | |
| dc.date.issued | 2012 | |
| dc.identifier.issn | 0030-364X | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/191428 | |
| dc.description.abstractEn | Inventory routing problems combine the optimization of product deliveries (or pickups) with inventory control at customer sites. Our application concerns the planning of single product pickups over time; each site accumulates stock at a deterministic rate; the stock is emptied on each visit. At the tactical planning stage considered here, our objective is to minimize a surrogate measure of routing cost while achieving some form of regional clustering by partitioning the sites between the vehicles. The fleet size is given but can potentially be reduced. Planning consists in assigning customers to vehicles in each time period, but the routing, i.e., the actual sequence in which vehicles visit customers, is considered as an ''operational'' decision. The planning is due to be repeated over the time horizon with constrained periodicity. We develop a truncated branch-and-price-and-cut algorithm combined with rounding and local search heuristics that yields both primal solutions and dual bounds. On a large scale test problem coming from industry, we obtain a solution within 6.25% deviation from the optimal. A rough comparison between an operational routing resulting from our tactical solution and the industrial practice shows a 10% decrease in number of vehicles as well as in travel distance. The key to the success of the approach is the use of a state-space relaxation technique in formulating the master program to avoid the symmetry in time. | |
| dc.language.iso | en | |
| dc.publisher | INFORMS | |
| dc.subject.en | Symmetry | |
| dc.subject.en | Inventory Routing | |
| dc.subject.en | Branch-and-Price-and-Cut | |
| dc.subject.en | Primal Heuristic | |
| dc.subject.en | Symmetry. | |
| dc.title.en | A Column Generation based Tactical Planning Method for Inventory Routing | |
| dc.type | Article de revue | |
| dc.subject.hal | Informatique [cs]/Recherche opérationnelle [cs.RO] | |
| bordeaux.journal | Operations Research | |
| bordeaux.page | 382-397 | |
| bordeaux.volume | 60 | |
| bordeaux.hal.laboratories | Institut de Mathématiques de Bordeaux (IMB) - UMR 5251 | * |
| bordeaux.issue | 2 | |
| bordeaux.institution | Université de Bordeaux | |
| bordeaux.institution | Bordeaux INP | |
| bordeaux.institution | CNRS | |
| bordeaux.peerReviewed | oui | |
| hal.identifier | inria-00169311 | |
| hal.version | 1 | |
| hal.popular | non | |
| hal.audience | Internationale | |
| hal.origin.link | https://hal.archives-ouvertes.fr//inria-00169311v1 | |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=Operations%20Research&rft.date=2012&rft.volume=60&rft.issue=2&rft.spage=382-397&rft.epage=382-397&rft.eissn=0030-364X&rft.issn=0030-364X&rft.au=MICHEL,%20Sophie&VANDERBECK,%20Fran%C3%A7ois&rft.genre=article |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
|
There are no files associated with this item. |
|||