Benders decomposition for production routing under demand uncertainty

Operations Research

Volumn 63, Issue 4, 2015, Pages 851-867

  Yossiri, Adulyasak ^a   Cordeau, Jean François ^a   Jans, Raf ^a  

^a HEC MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; BRANCH AND BOUND METHOD; INTEGER PROGRAMMING; PARETO PRINCIPLE; STOCHASTIC SYSTEMS;

BENDERS DECOMPOSITION; BRANCH-AND-CUT ALGORITHMS; CAPACITATED VEHICLES; COMPUTATIONAL EXPERIMENT; FINITE TIME HORIZON; INVENTORY ROUTING PROBLEMS; MULTI-STAGE DECISION PROCESS; SAMPLE AVERAGE APPROXIMATION;

STOCHASTIC PROGRAMMING;

EID: 84937863906     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.2015.1401     Document Type: Article

References (36)

1. Adelman D (2004) A price-directed approach to stochastic inventory/routing. Oper. Res. 52(4):499-514.
2. Adulyasak Y (2012) Models and solution algorithms for production routing problems. Ph.D. thesis, Logistics and Operations Management Department, HEC Montréal.
3. Adulyasak Y, Cordeau J-F, Jans R (2014a) Formulations and branch-andcut algorithms for multi-vehicle production and inventory routing problems. INFORMS J. Comput. 26(1):103-120.
4. Adulyasak Y, Cordeau J-F, Jans R (2014b) Optimization-based adaptive large neighborhood search for the production routing problem. Transportation Sci. 48(1):20-45.
5. Adulyasak Y, Cordeau J-F, Jans R (2015) The production routing problem: A review of formulations and solution algorithms. Comput. Oper. Res. 55:141-152.
6. Andersson H, Hoff A, Christiansen M, Hasle G, Løkketangen A (2010) Industrial aspects and literature survey: Combined inventory management and routing. Comput. Oper. Res. 37:1515-1536.
7. Applegate D, Bixby R, Chvátal V, Cook W (2011) The Concorde TSP Solver website. http://www.math.uwaterloo.ca/tsp/concorde.html.
8. Archetti C, Bertazzi L, Laporte G, Speranza MG (2007) A branch-and-cut algorithm for a vendor-managed inventory-routing problem. Transportation Sci. 41(3):382-391.
9. Archetti C, Bertazzi L, Paletta G, Speranza MG (2011) Analysis of the maximum level policy in a production-distribution system. Comput. Oper. Res. 38:1731-1746.
10. Benders JF (1962) Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik 4:238-252.
11. Bertazzi L, Bosco A, Guerriero F, Laganà D (2013) A stochastic inventory routing problem with stock-out. Transport. Res. C-Emer. 27:89-107.
12. Bertsekas D, Tsitsiklis J, Wu C (1997) Rollout algorithms for combinatorial optimization. J. Heuristics 3:245-262.
13. Birge JR, Louveaux FV (1988) A multicut algorithm for two-stage stochastic linear programs. Eur. J. Oper. Res. 34:384-392.
14. Birge JR, Louveaux FV (2011) Two-stage recourse problems. Introduction to Stochastic Programming, Springer Series in Operations Research and Financial Engineering (Springer, New York), 181-263.
15. Codato G, Fischetti M (2006) Combinatorial Benders' cuts for mixed-integer linear programming. Oper. Res. 54(4):756-766.
16. Coelho LC, Cordeau J-F, Laporte G (2014a) Heuristics for dynamic and stochastic inventory-routing. Comput. Oper. Res. 52:55-67.
17. Coelho LC, Cordeau J-F, Laporte G (2014b) Thirty years of inventory routing. Transportation Sci. 48(1):1-19.
18. Cordeau JF, Soumis F, Desrosiers J (2001) Simultaneous assignment of locomotives and cars to passenger trains. Oper. Res. 49(4):531-548.
19. de Camargo RS, de Miranda Jr. G, Ferreira RPM (2011) A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion. Oper. Res. Lett. 39:329-337.
20. de Camargo RS, de Miranda Jr. G, Luna HP (2008) Benders decomposition for the uncapacitated multiple allocation hub location problem. Comput. Oper. Res. 35:1047-1064.
21. Federgruen A, Zipkin P (1984) A combined vehicle routing and inventory allocation problem. Oper. Res. 32(5):1019-1037.
22. Fortz B, Poss M (2009) An improved Benders decomposition applied to a multi-layer network design problem. Oper. Res. Lett. 37:359-364.
23. nd ed. (Irwin/McGraw-Hill, New York).
24. Hvattum LM, Løkketangen A (2009) Using scenario trees and progressive hedging for stochastic inventory routing problems. J. Heuristics 15:527-557.
25. Hvattum LM, Løkketangen A, Laporte G (2009) Scenario tree-based heuristics for stochastic inventory-routing problems. INFORMS J. Comput. 21(2):268-285.
26. Jaillet P, Bard JF, Huang L, Dror M (2002) Delivery cost approximations for inventory routing problems in a rolling horizon framework. Transportation Sci. 36(3):292-300.
27. Kleywegt AJ, Nori VS, Savelsbergh MWP (2004) Dynamic programming approximations for a stochastic inventory routing problem. Transportation Sci. 38(1):42-70.
28. Kleywegt AJ, Nori VS, Savelsbergh MWP (2002a) The stochastic inventory routing problem with direct deliveries. Transportation Sci. 36(1):94-118.
29. Kleywegt AJ, Shapiro A, de Mello TH (2002b) The sample average approximation method for stochastic discrete optimization. SIAM J. Optim. 12:479-502.
30. Magnanti TL, Wong RT (1981) Accelerating Benders decomposition: Algorithmic enhancement and model selection criteria. Oper. Res. 29(3):464-484.
31. McDaniel D, Devine M (1977) A modified Benders' partitioning algorithm for mixed integer programming. Management Sci. 24(3):312-319.
32. Naoum-Sawaya J, Elhedhli S (2013) An interior-point Benders based branch-and-cut algorithm for mixed integer programs. Ann. Oper. Res. 210:33-55.
33. Shapiro A (2003) Monte Carlo sampling methods. Ruszczynski A, Shapiro A, eds. Stochastic Programming, Vol. 10 of Handbooks in Operations Research and Management Science (Elsevier, Amsterdam), 353-425.
34. Solyali O, Süral H (2011) A branch-and-cut algorithm using a strong formulation and an a priori tour-based heuristic for an inventory-routing problem. Transportation Sci. 45(3):335-345.
35. Solyali O, Cordeau JF, Laporte G (2012) Robust inventory routing under demand uncertainty. Transportation Sci. 46(3):327-340.
36. Van Slyke R, Wets R (1969) L-shaped linear programs with applications to optimal control and stochastic programming. SIAM J. Appl. Math. 17:638-663.