An adjustable sample average approximation algorithm for the stochastic production-inventory-routing problem

Networks

Volumn 72, Issue 1, 2018, Pages 5-24

  Agra, Agostinho ^a   Requejo, Cristina ^a   Rodrigues, Filipe ^a  

^a UNIVERSITY OF AVEIRO   (Portugal)

Author keywords

adaptive heuristic; demand uncertainty; hybrid heuristic; inventory routing; iterated local search; sample average approximation algorithm; stochastic programming

Indexed keywords

HEURISTIC ALGORITHMS; HEURISTIC PROGRAMMING; ROUTING ALGORITHMS; STOCHASTIC PROGRAMMING; STOCHASTIC SYSTEMS;

ADAPTIVE HEURISTIC; DEMAND UNCERTAINTY; HYBRID HEURISTICS; INVENTORY ROUTING; ITERATED LOCAL SEARCH; SAMPLE AVERAGE APPROXIMATION;

APPROXIMATION ALGORITHMS;

EID: 85034775305     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.21796     Document Type: Article

References (44)

1. N. Absi et al., A two-phase iterative heuristic approach for the production routing problem, Transp. Sci. 49 (2015), 784–795
2. Y. Adulyasak, J. F. Cordeau, and R. Jans, Formulations and branch-and-cut algorithms for multi-vehicle production and inventory routing problems, INFORMS J. Comput. 26 (2014), 103–120
3. Y. Adulyasak, J. F. Cordeau, and R. Jans, Benders decomposition for production routing under demand uncertainty, Oper. Res. 63 (2015), 851–867
4. Y. Adulyasak, J. F. Cordeau, and R. Jans, The production routing problem: A review of formulations and solution algorithms, Comput. Oper. Res. 55 (2015), 141–152
5. E. H. Aghezzaf, Robust distribution planning for supplier-managed inventory agreements when demand rates and travel times are stationary, J. Oper. Res. Soc. 59 (2008), 1055–1065
6. A. Agra, A. Cerveira, and C. Requejo, Lagrangian relaxation bounds for a production-inventory-routing problem, Proc. Int. Workshop on Machine Learning, Optim. and Big Data, vol. 10122 of Lecture Notes in Computer Science, Springer International Publishing, 2016, pp. 236–245
7. A. Agra et al., A maritime inventory routing problem with stochastic sailing and port times, Comput. Oper. Res. 61 (2015), 18–30
8. A. Agra et al., A MIP based local search heuristic for a stochastic maritime inventory routing problem, Comput. Logist., vol. 9855 of Lecture Notes in Computer Science, Springer International Publishing, 2016, pp. 18–34
9. A. Agra et al., Combined ship routing and inventory management in the salmon farming industry, Ann. Oper. Res. 253 (2017), 799–823
10. A. Agra, C. Requejo, and F. Rodrigues, A hybrid heuristic for a stochastic production-inventory-routing problem, Electron Notes Discrete Math. 64 (2018), 345–354
11. P. Avella, M. Boccia, and L. A. Wolsey, Single-period cutting planes for inventory routing problems, Transp. Sci. https://doi.org/10.1287/trsc.2016.0729
12. P. Avella, M. Boccia, and L. A. Wolsey, Single-item reformulations for a vendor managed inventory routing problem: Computational experience with benchmark instances, Networks 65 (2015), 129–138
13. L. Bertazzi et al., A stochastic inventory routing problem with stock-out, Transp. Res. Part C Emerg. Technol. 27 (2013), 89–107
14. N. Brahimi and T. Aouam, Multi-item production routing problem with backordering: A MILP approach, Int. J. Prod. Res. 54 (2016), 1076–1093
15. Y. Cardona-Valdés, A. Álvarez, and J. Pacheco, Metaheuristic procedure for a bi-objective supply chain design problem with uncertainty, Transp Res Part B Methodological 60 (2014), 66–84
16. M. Chitsaz, J. F. Cordeau, and R. Jans, A unified decomposition matheuristic for assembly, production and inventory routing, Les cahiers du GERAD G–2017–03, GERAD HEC Montréal, Montréal (Québec), Canada 2017
17. M. Chitsaz, A. Divsalar, and P. Vansteenwegen, A two-phase algorithm for the cyclic inventory routing problem, Eur. J. Oper. Res. 254 (2016), 410–426
18. Concorde, Concorde-03.12.19, University of Waterloo, 2003
19. M. Darvish, H. Larrain, and L. C. Coelho, A dynamic multi-plant lot-sizing and distribution problem, Int. J. Prod. Res. 54 (2016), 6707–6717
20. G. Desaulniers, J. G. Rakke, and L. C. Coelho, A branch-price-and-cut algorithm for the inventory-routing problem, Transp. Sci. 50 (2016), 1060–1076
21. M. Fischetti and A. Lodi, Local branching, Math. Program. 98 (2003), 23–47
22. F. Glover, Tabu search and adaptive memory programming – advances, applications and challenges, Interfaces Comput. Sci. Oper. Res.: Adv. Metaheuristics, Optim., Stochastic Modeling Technologies, vol. 7, Springer, Boston, 1997, pp. 1–75
23. C. Gounaris et al., An adaptive memory programming framework for the robust capacitated vehicle routing problem, Transp. Sci. 50 (2014), 1239–1260
24. M. Gruson, J. F. Cordeau, and R. Jans, A computational comparison of formulations for an integrated three-level lot sizing and transportation problem with a distribution structure, Les cahiers du GERAD G–2017–59, GERAD HEC Montréal, Montréal (Québec) Canada, 2017
25. F. Hein and C. Almeder, Quantitative insights into the integrated supply vehicle routing and production planning problem, Int. J. Prod. Econ. 177 (2016), 66–76
26. S.D. Jena, J. F. Cordeau, and B. Gendron, Lagrangian heuristics for large-scale dynamic facility location with generalized modular capacities, INFORMS J. Comput. 29 (2017), 388–404
27. M. Kaut and S. Wallace, Evaluation of scenario-generation methods for stochastic programming, Pacific J. Optim. 3 (2007), 257–271
28. A. J. Kleywegt, A. Shapiro, and T. H. de Mello, The sample average approximation method for stochastic discrete optimization, SIAM J. Optim. 12 (2001), 479–502
29. P. L. Miranda, R. Morabito, and D. Ferreira, Optimization model for a production, inventory, distribution and routing problem in small furniture companies, TOP 26 (2018), 30–67
30. G. L. Nemhauser and L. A. Wolsey, Integer and Combinatorial Optimization, John Wiley & Sons, New York, 1988
31. M. Padberg, T. V. Roy, and L. Wolsey, Valid linear inequalities for fixed charge problems, Oper. Res. 33 (1985), 842–861
32. Y. Pochet and L. A. Wolsey, Production Planning by Mixed Integer Programming, Springer, New York, 2006
33. Y. Qiu, J. Qiao, and P. M. Pardalos, A branch-and-price algorithm for production routing problems with carbon cap-and-trade, Omega 68 (2017), 49–61
34. M. K. I. A. Rahim et al., Modelling and solving the multiperiod inventory-routing problem with stochastic stationary demand rates, Int. J. Prod. Res. 52 (2014), 4351–4363
35. Y. Rochat and É. Taillard, Probabilistic diversification and intensification in local search for vehicle routing, J. Heuristics 1 (1995), 147–167
36. K. Rosing and C. ReVelle, Heuristic concentration: Two stage solution construction, Eur. J. Oper. Res. 97 (1997), 75–86
37. M. Ruokokoski et al., Efficient formulations and a branch-and-cut algorithm for a production-routing problem, Les cahiers du GERAD G–2010–66, GERAD HEC Montréal, Montréal (Québec), Canada, 2010
38. R. A. Russell, Mathematical programming heuristics for the production routing problem, Int. J. Prod. Econ. 193 (2017), 40–49
39. O. Solyali, J. F. Cordeau, and G. Laporte, Robust inventory routing under demand uncertainty, Transp. Sci. 46 (2012), 327–340
40. O. Solyali and H. Süral, A multi-phase heuristic for the production routing problem, Comput. Oper. Res. 87 (2017), 114–124
41. C. Tarantilis, Solving the vehicle routing problem with adaptive memory programming methodology, Comput. Oper. Res. 32 (2005), 2309–2327
42. J. Velarde and R. Marti, Adaptive memory programing for the robust capacitated international sourcing problem, Comput. Oper. Res. 35 (2008), 797–806
43. B. Verweij et al., The sample average approximation method applied to stochastic routing problems: A computational study, Comput. Optim. Appl. 24 (2003), 289–333
44. Q. Zhang et al., Multiscale production routing in multicommodity supply chains with complex production facilities, Comput. Oper. Res. 79 (2017), 207–222