Service network design in short and local fresh food supply chain

Maxime Ogier; Van-Dat Cung; Julien Boissière

RAIRO - Operations Research - Recherche Opérationnelle (2013)

  • Volume: 47, Issue: 4, page 445-464
  • ISSN: 0399-0559

Abstract

top
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.

How to cite

top

Ogier, Maxime, Cung, Van-Dat, and Boissière, Julien. "Service network design in short and local fresh food supply chain." RAIRO - Operations Research - Recherche Opérationnelle 47.4 (2013): 445-464. <http://eudml.org/doc/275016>.

@article{Ogier2013,
abstract = {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.},
author = {Ogier, Maxime, Cung, Van-Dat, Boissière, Julien},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {service network design; transshipment; multi-commodity flow; short supply chain; benders decomposition; dynamic slope scaling procedure; Benders decomposition},
language = {eng},
number = {4},
pages = {445-464},
publisher = {EDP-Sciences},
title = {Service network design in short and local fresh food supply chain},
url = {http://eudml.org/doc/275016},
volume = {47},
year = {2013},
}

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
PB - EDP-Sciences
VL - 47
IS - 4
SP - 445
EP - 464
AB - 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.
LA - eng
KW - service network design; transshipment; multi-commodity flow; short supply chain; benders decomposition; dynamic slope scaling procedure; Benders decomposition
UR - http://eudml.org/doc/275016
ER -

References

top
  1. [1] R.K. Ahuja, T.L. Magnanti and J.B. Orlin, Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs, NJ (1993). Zbl1201.90001MR1205775
  2. [2] C. Barnhart, N. Krishnan, D. Kim and K. Ware, Network design for express shipment delivery. Comput. Opt. Appl.21 (2002) 239–262. Zbl0994.90009MR1882850
  3. [3] J.F. Benders, Partitioning Procedures for Solving Mixed-Variables Programming Problems. Numer. Math.4 (1962) 238–252. Zbl0109.38302MR147303
  4. [4] A.M. Costa, A survey on benders decomposition applied to fixed-charge network design problems. Comput. Oper. Res.32 (2005) 1429–1450. Zbl1071.90009MR2112180
  5. [5] T.G. Crainic, Service network design in freight transportation. Eur. J. Oper. Res.122 (2000) 272–288. Zbl0961.90010
  6. [6] T.G. Crainic and G. Laporte, Planning models for freight transportation. Eur. J. Oper. Res.97 (1997) 409–438. Zbl0919.90055
  7. [7] B. Gendron, Decomposition methods for network design. Procedia – Social Behavioral Sci.20 (2011) 31–37. 
  8. [8] G. Guisewite and P. Pardalos, Minimum concave-cost network flow problems: Applications, complexity, and algorithms. Annal. Oper. Res.25 (1990) 75–99. Zbl0724.90022MR1084424
  9. [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. Zbl0947.90017MR1696916
  10. [10] N. Megiddo and K.J. Supowit, On the complexity of some common geometric location problems. SIAM J. Comput.13 (1984) 182–196. Zbl0534.68032MR731036
  11. [11] S. Melkote and M.S. Daskin, Capacitated facility location/network design problems. Eur. J. Oper. Res.129 (2001) 481–495. Zbl1125.90380MR1807809
  12. [12] F. Ortega and L.A. Wolsey, A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem. Networks41 (2003) 143–158. Zbl1106.90016MR1970120
  13. [13] S.H. Owen and M.S. Daskin, Strategic facility location: A review. Eur. J. Oper. Res.111 (1998) 423–447. Zbl0938.90048
  14. [14] E. Schlich and U. Fleissner, The ecology of scale: Assessment of regional energy turnover and comparison with global food. Int. J. Life Cycle Assessment10 (2005) 219–223. 
  15. [15] N. Teypaz, S. Schrenk and V.-D. Cung, A decomposition scheme for large-scale Service Network Design with asset management. Transp. Res. Part E46 (2009) 156–170. 
  16. [16] N. Wieberneit, Service network design for freight transportation: a review. OR Spectrum30 (2008) 77–112. Zbl1133.90314MR2372941

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.