Service network design in short and local fresh food supply chain
RAIRO - Operations Research - Recherche Opérationnelle, Tome 47 (2013) no. 4, pp. 445-464.

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.

DOI : 10.1051/ro/2013051
Classification : 90B10
Mots-clés : service network design, transshipment, multi-commodity flow, short supply chain, benders decomposition, dynamic slope scaling procedure 
@article{RO_2013__47_4_445_0,
     author = {Ogier, Maxime and Cung, Van-Dat and Boissi\`ere, Julien},
     title = {Service network design in short and local fresh food supply chain},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {445--464},
     publisher = {EDP-Sciences},
     volume = {47},
     number = {4},
     year = {2013},
     doi = {10.1051/ro/2013051},
     mrnumber = {3143763},
     zbl = {1282.90037},
     language = {en},
     url = {http://archive.numdam.org/articles/10.1051/ro/2013051/}
}
TY  - JOUR
AU  - Ogier, Maxime
AU  - Cung, Van-Dat
AU  - Boissière, Julien
TI  - Service network design in short and local fresh food supply chain
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 2013
SP  - 445
EP  - 464
VL  - 47
IS  - 4
PB  - EDP-Sciences
UR  - http://archive.numdam.org/articles/10.1051/ro/2013051/
DO  - 10.1051/ro/2013051
LA  - en
ID  - RO_2013__47_4_445_0
ER  - 
%0 Journal Article
%A Ogier, Maxime
%A Cung, Van-Dat
%A Boissière, Julien
%T Service network design in short and local fresh food supply chain
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 2013
%P 445-464
%V 47
%N 4
%I EDP-Sciences
%U http://archive.numdam.org/articles/10.1051/ro/2013051/
%R 10.1051/ro/2013051
%G en
%F RO_2013__47_4_445_0
Ogier, Maxime; Cung, Van-Dat; Boissière, Julien. Service network design in short and local fresh food supply chain. RAIRO - Operations Research - Recherche Opérationnelle, Tome 47 (2013) no. 4, pp. 445-464. doi : 10.1051/ro/2013051. http://archive.numdam.org/articles/10.1051/ro/2013051/

[1] R.K. Ahuja, T.L. Magnanti and J.B. Orlin, Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs, NJ (1993). | MR | Zbl

[2] C. Barnhart, N. Krishnan, D. Kim and K. Ware, Network design for express shipment delivery. Comput. Opt. Appl. 21 (2002) 239-262. | MR | Zbl

[3] J.F. Benders, Partitioning Procedures for Solving Mixed-Variables Programming Problems. Numer. Math. 4 (1962) 238-252. | MR | Zbl

[4] A.M. Costa, A survey on benders decomposition applied to fixed-charge network design problems. Comput. Oper. Res. 32 (2005) 1429-1450. | MR | Zbl

[5] T.G. Crainic, Service network design in freight transportation. Eur. J. Oper. Res. 122 (2000) 272-288. | Zbl

[6] T.G. Crainic and G. Laporte, Planning models for freight transportation. Eur. J. Oper. Res. 97 (1997) 409-438. | Zbl

[7] B. Gendron, Decomposition methods for network design. Procedia - Social Behavioral Sci. 20 (2011) 31-37.

[8] G. Guisewite and P. Pardalos, Minimum concave-cost network flow problems: Applications, complexity, and algorithms. Annal. Oper. Res. 25 (1990) 75-99. | MR | Zbl

[9] D. Kim and P.M. Pardalos, A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure. Oper. Res. Lett. 24 (1999) 195-203. | MR | Zbl

[10] N. Megiddo and K.J. Supowit, On the complexity of some common geometric location problems. SIAM J. Comput. 13 (1984) 182-196. | MR | Zbl

[11] S. Melkote and M.S. Daskin, Capacitated facility location/network design problems. Eur. J. Oper. Res. 129 (2001) 481-495. | MR | Zbl

[12] F. Ortega and L.A. Wolsey, A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem. Networks 41 (2003) 143-158. | MR | Zbl

[13] S.H. Owen and M.S. Daskin, Strategic facility location: A review. Eur. J. Oper. Res. 111 (1998) 423-447. | Zbl

[14] E. Schlich and U. Fleissner, The ecology of scale: Assessment of regional energy turnover and comparison with global food. Int. J. Life Cycle Assessment 10 (2005) 219-223.

[15] N. Teypaz, S. Schrenk and V.-D. Cung, A decomposition scheme for large-scale Service Network Design with asset management. Transp. Res. Part E 46 (2009) 156-170.

[16] N. Wieberneit, Service network design for freight transportation: a review. OR Spectrum 30 (2008) 77-112. | MR | Zbl

Cité par Sources :