Planning and Scheduling the Operation of a Very Large Oil Pipeline Network

  • Arnaldo V. Moura
  • Cid C. de Souza
  • Andre A. Cire
  • Tony M. T. Lopes
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5202)

Abstract

Brazilian petrobras is one of the world largest oil companies. Recurrently, it faces a very difficult over-constrained planning challenge: how to operate a large pipeline network in order to adequately transport oil derivatives and biofuels from refineries to local markets. In spite of being more economical and environmentally safer, the use of a complex pipeline network poses serious operational difficulties. The network has a complex topology, with around 30 interconnecting pipelines, over 30 different products in circulation, and about 14 distribution depots which harbor more than 200 tanks, with a combined capacity for storing up to 65 million barrels. The problem is how to schedule individual pumping operations, given the daily production and demand of each product, at each location in the network, over a given time horizon. We describe a solution based on a two-phase problem decomposition strategy. A novel Constraint Programming (CP) model plays a key role in modeling operational constraints that are usually overlooked in literature, but that are essential in order to guarantee viable solutions. The use of CP was crucial, since it allowed the modeling of complex constraints, including nonlinearities. The full strategy was implemented and produced very adequate results when tested over large real instances. In contrast, other approaches known from the literature failed, even when applied to much less complex networks.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Rejowski, R., Pinto, J.M.: Efficient MILP formulations and valid cuts for multiproduct pipeline scheduling. Comput. Chem. Eng. 28(8), 1511–1528 (2004)Google Scholar
  2. 2.
    Cafaro, D.C., Cerdá, J.: Optimal scheduling of multiproduct pipeline systems using a non-discrete MILP formulation. Comput. Chem. Eng. 28(10), 2053–2058 (2004)CrossRefGoogle Scholar
  3. 3.
    Relvas, S., Barbosa-Póvoa, A.P.F.D., Matos, H.A., Fialho, J., Pinheiro, A.S.: Pipeline scheduling and distribution centre management - a real-world scenario at clc. In: 16th Eur. Symp. Comput. Aided Process Eng. and 9th Int. Symp. Process Syst. Eng., pp. 2135–2140. Garmisch-Partenkirchen, Germany (2006)CrossRefGoogle Scholar
  4. 4.
    Relvas, S., Matos, H.A., Barbosa-Póvoa, A.P.F.D., Fialho, J., Pinheiro, A.S.: Pipeline scheduling and inventory management of a multiproduct distribution oil system. Ind. Eng. Chem. Res. 45(23), 7841–7855 (2006)CrossRefGoogle Scholar
  5. 5.
    Rejowski, R., Pinto, J.M.: A novel continuous time representation for the scheduling of pipeline systems with pumping yield rate constraints. Comput. Chem. Eng. 32, 1042–1066 (2008)CrossRefGoogle Scholar
  6. 6.
    Relvas, S., Matos, H.A., Barbosa-Póvoa, A.P.F.D., Fialho, J.: Reactive scheduling framework for a multiproduct pipeline with inventory management. Ind. Eng. Chem. Res. 46(17), 5659–5672 (2007)CrossRefGoogle Scholar
  7. 7.
    Crane, D.S., Wainwright, R.L., Schoenefeld, D.A.: Scheduling of multi-product fungible liquid pipelines using genetic algorithms. In: Proc. of the 1999 ACM Symposium on Applied Computing, San Antonio, USA, pp. 280–285 (1999)Google Scholar
  8. 8.
    Camponogara, E.: A-Teams para um problema de transporte de derivados de petróleo. Master’s thesis, Instituto de Matemática, Estatística e Ciência da Computação, Universidade Estadual de Campinas, Campinas, Brazil (1995)Google Scholar
  9. 9.
    Moura, A.V., de Souza, C.C., Cire, A.A., Lopes, T.M.T.: Heuristics and constraint programming hybridizations for a real pipeline planning and scheduling problem. In: Proc. IEEE 11th Int. Conf. Comput. Sci. Eng., São Paulo, Brazil (to appear, 2008)Google Scholar
  10. 10.
    Hooker, J.N.: Integrated Methods for Optimization (International Series in Operations Research & Management Science). Springer, Secaucus (2006)Google Scholar
  11. 11.
    Cheng, B.M.W., Choi, K.M.F., Lee, J.H.M., Wu, J.C.K.: Increasing constraint propagation by redundant modeling: an experience report. Constraints 4(2), 167–192 (1999)MATHCrossRefGoogle Scholar
  12. 12.
    ILOG: ILOG Scheduler 6.2: User’s Manual (2006)Google Scholar
  13. 13.
    Marriot, K., Stuckey, P.: Programming with Constraints: An Introduction, 1st edn. MIT Press, Cambridge (1998)Google Scholar
  14. 14.
    Kautz, H., Horvitz, E., Ruan, Y., Gomes, C., Selman, B.: Dynamic restarts policies. In: Proc. of the 18th Nat. Conf. on Artif. Intell., Edmonton, Alberta (July 2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Arnaldo V. Moura
    • 1
  • Cid C. de Souza
    • 1
  • Andre A. Cire
    • 1
  • Tony M. T. Lopes
    • 1
  1. 1.Institute of ComputingUniversity of CampinasCampinasBrazil

Personalised recommendations