Service Network Design in Short and Local Fresh Food Supply Chain
Résumé
This paper aims at developing efficient solving methods for an original service network design problem imbued with sustainable issues. Indeed the network has to be designed for short and local supply chain and for fresh food products. The original features of the problem are the seasonality of supply, the limitation of transshipments for a product and no possibility of storage between consecutive periods. Decisions at strategic and tactical level are (1) decisions on a subset of hubs to open among a given set of potential locations, (2) transportation services to open between the actors and (3) flow quantities for the fresh food products. We propose for this problem a Mixed Integer Programming formulation and two solving techniques: Benders Decomposition and Dynamic Slope Scaling Procedure. These techniques are adapted to the problem and some experimental tests are conducted in order to compare the approaches on large-scale instances.