Skip to main content
SpringerLink
Log in

Petroleum supply planning: reformulations and a novel decomposition algorithm

  • Published:
Optimization and Engineering Aims and scope Submit manuscript

Abstract

The petroleum supply planning activity is an important link for the integration of the petroleum supply chain at PETROBRAS as it is responsible for refining the strategic supply planning information to be used at the operational level. In this work we present the best strategies to solve this challenging problem. It is important to note that although the solvers in the last decade have evolved enormously, for this particular application we cannot get solutions with satisfactory quality in reasonable computational time with only the initial proposed model in Rocha et al. (Comput Chem Eng 33(12):2123–2133, 2013). To efficiently solve this problem we propose a novel decomposition algorithm and reformulations based on a cascading knapsack structure that turn out to be applicable in a wide range of problems. We show that the novel decomposition algorithm is the most appropriate method to solve the petroleum supply planning problem if we consider more than two tankers to offload each platform. In the case of one or two tankers to offload each platform, the hull relaxation formulation based on the cascading knapsack structure introduced after an inventory reformulation at platforms is the best option if one is to solve this problem. For the real application, these solution alternatives allow us to implement a general algorithm that automatically switches to the best solution option depending on the structure of the problem. This model is being tested at PETROBRAS and is proving an effective tool to help integrate its petroleum supply chain as well as to do what-if analysis to look for alternative solutions never before thought of.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

References

  • Balas E (1998) Disjunctive programming: properties of the convex hull of feasible points. Discrete Appl Math 89(1–3):3–44

    Article  MathSciNet  MATH  Google Scholar 

  • Balas E, Jeroslow R (1972) Canonical cuts on the unit hypercube. SIAM J Appl Math 23(1):61–69

    Article  MathSciNet  MATH  Google Scholar 

  • Balas E, Ceria S, Cornuéjols G (1996) Mixed 0–1 programming by lift-and-project in a branch-and-cut framework. Manag Sci 42(9):1229–1246

    Article  MATH  Google Scholar 

  • Barnhart C, Johnson EL, Nemhauser GL, Savelsbergh MWP, Vance PH (1996) Branch-and-price: column generation for solving huge integer programs. Oper Res 46:316–329

    Article  MathSciNet  MATH  Google Scholar 

  • Brown GG, Graves GW, Ronen D (1987) Scheduling ocean transportation of crude oil. Manag Sci 33:335–346

    Article  Google Scholar 

  • Charnes A, Cooper WW, Mellon B (1952) Blending aviation gasolines. Econometrica 135(22):135–159

    Article  Google Scholar 

  • Chu Y, Xia Q (2004) Generating benders cuts for a general class of integer programming problems. In: CPAIOR, pp 127–141

  • Fazel-Zarandi MM, Beck JC (2009) Solving a location–allocation problem with logic-based benders’ decomposition. In: CPAIOR, pp 344–351

  • Fischetti M, Lodi A (2003) Local branching. Math Program 98(1–3):23–47

    Article  MathSciNet  MATH  Google Scholar 

  • Fischetti M, Lodi A (2008) Repairing MIP infeasibility through local branching. Comput Oper Res 35(5):1436–1445

    Article  MathSciNet  MATH  Google Scholar 

  • Flippo OE, Rinnooy Kan AHG (1993) Decomposition in general mathematical programming. Math Program 60(3):361–382

    Article  MathSciNet  MATH  Google Scholar 

  • Forrest J, Oettli M (2003) Rigorous simulation supports accurate refinery decisions. In: Grossmann IE, MacDonald CM (eds) Proceedings of fourth international conference on foundations of computer-aided process operations, Coral Springs, FL, USA, pp 273–280

  • Fukasawa R, Longo H, Lysgaard J, Aragão MP, Reis M, Uchoa E, Werneck RF (2006) Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Math Program 106(3):491–511

    Article  MathSciNet  MATH  Google Scholar 

  • Gu Z, Nemhauser GL, Savelsbergh MWP (1998) Lifted cover inequalities for 0–1 integer programs: computation. INFORMS J Comput 10:427–437

    Article  MathSciNet  Google Scholar 

  • Hooker JN (2000) Logic-based methods for optimization: combining optimization and constraint satisfaction. Wiley-Interscience, New York

    Book  MATH  Google Scholar 

  • Hooker JN (2007) Planning and scheduling by logic-based benders decomposition. Oper Res 55(3):588–602

    Article  MathSciNet  MATH  Google Scholar 

  • Hooker JN, Ottosson G (2003) Logic-based benders decomposition. Math Program 96(1):33–60

    Article  MathSciNet  MATH  Google Scholar 

  • Lasschuit W, Thijssen N (2004) Supporting supply chain planning and scheduling decisions in the oil and chemical industry. Comput Chem Eng 28:863–870

    Article  Google Scholar 

  • Lee H, Pinto JM, Grossmann IE, Park S (1996) Mixed-integer linear programming model for refinery short-term scheduling of crude oil unloading with inventory management. Ind Eng Chem Res 35:1630–1641

    Article  Google Scholar 

  • Liberatore MJ, Miller T (1985) A hierarchical production planning system. Interfaces 15(4):1–11

    Article  Google Scholar 

  • Miller DM (1987) An iterative computer-aided ship scheduling system. Eur J Oper Res 32:363–379

    Article  Google Scholar 

  • Pinto JM, Neiro SMS (2004) A general modeling framework for the operational planning of petroleum supply chains. Comput Chem Eng 28:871–896

    Article  Google Scholar 

  • Pinto JM, Joly M, Moro LFL (2000) Planning and scheduling models for refinery operations. Comput Chem Eng 24:2259–2276

    Article  Google Scholar 

  • Rocha R (2004) Problema de alocação de petróleos na petrobras: Modelagem matemática e um algoritmo de solução. Master’s thesis, COPPE-UFRJ

  • Rocha R, Grossmann IE, Poggi de Aragão MVS (2009) Petroleum allocation at petrobras: mathematical model and a solution algorithm. Comput Chem Eng 33(12):2123–2133 (FOCAPO 2008—selected papers from the fifth international conference on foundations of computer-aided process operations)

  • Rocha R, Grossmann I, Poggi de Aragão M (2013) Cascading knapsack inequalities: reformulation of a crude oil distribution problem. Ann Oper Res. doi:10.1007/s10479-011-0857-8

    MATH  Google Scholar 

  • Rockafellar RT (1970) Convexity analysis. Princeton University Press, Princeton

    Book  MATH  Google Scholar 

  • Ropke S, Cordeau JF (2009) Branch and cut and price for the pickup and delivery problem with time windows. Transp Sci 43(3):267–286

    Article  Google Scholar 

  • Sysmonds GH (1955) Linear programming: the solution of refinery problems. Esso Standard Oil Company, New York

    Google Scholar 

  • Tind J, Wolsey LA (1981) An elementary survey of general duality theory in mathematical programming. Math Program 21(1):241–261

    Article  MathSciNet  MATH  Google Scholar 

  • Uchoa E, Fukasawa R, Lysgaard J, Pessoa A, Poggi de Aragão M, Andrade D (2008) Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation. Math Program 112:443–472

    Article  MathSciNet  MATH  Google Scholar 

  • Wenkai L, Hui C, Hua B, Tong Z (2003) Scheduling crude oil unloading, storage and processing. Ind Eng Chem Res 41:6723–6734

    Article  Google Scholar 

  • Wolsey L (1981) A resource decomposition algorithm for general mathematical programs. Math Program Study 14:244–257

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

I would like to thank PETROBRAS, for giving me the opportunity and time to carry out this research and, in particular, I am grateful to my former manager, Luiz Fernando de Jesus Bernardo, for his motivation, support, enthusiasm and friendship. I also would like to acknowledge my advisor Profs. Marcus V. S. Poggi de Aragão and Ignacio E. Grossmann for their guidance throughout this research.

Author information

Authors and Affiliations

  1. Production and Engineering Department, PETROBRAS Operational Unit at Espírito Santo, Av. Nossa Senhora da Penha, 1648, Barro Vermelho, Vitória, Espírito Santo, Brazil

    Roger Rocha

  2. Chemical Engineering Department, Carnegie Mellon University, 5000 Forbes Av., Pittsburgh, PA, 15213, USA

    Ignacio E. Grossmann

  3. Informatics Department, Pontifical Catholic University of Rio de Janeiro - PUC-Rio, Rua Marquês de São Vicente, 225, Gávea, Rio de Janeiro, Brazil

    Marcus V. S. Poggi de Aragão

Authors
  1. Roger Rocha
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ignacio E. Grossmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Marcus V. S. Poggi de Aragão
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Roger Rocha.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Rocha, R., Grossmann, I.E. & de Aragão, M.V.S.P. Petroleum supply planning: reformulations and a novel decomposition algorithm. Optim Eng 18, 215–240 (2017). https://doi.org/10.1007/s11081-017-9349-2

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11081-017-9349-2

Keywords

Search

Navigation