This paper aims at developing efficient solving methods for an original service networkdesign problem imbued with sustainable issues. Indeed the network has to be designed forshort and local supply chain and for fresh food products. The original features of theproblem are the seasonality of supply, the limitation of transshipments for a product andno possibility of storage between consecutive periods. Decisions at strategic and tacticallevel are (1) decisions on a subset of hubs to open among a given set of potentiallocations, (2) transportation services to open between the actors and (3) flow quantitiesfor the fresh food products. We propose for this problem a Mixed Integer Programmingformulation and two solving techniques: Benders Decomposition and Dynamic Slope ScalingProcedure. These techniques are adapted to the problem and some experimental tests areconducted in order to compare the approaches on large-scale instances.
