A hybrid model for a multiproduct pipeline planning and scheduling problem

  • Authors:
  • Tony Minoru Lopes;Andre Augusto Ciré;Cid Carvalho Souza;Arnaldo Vieira Moura

  • Affiliations:
  • Institute of Computing, University of Campinas, Campinas, Brazil 13084-971;Institute of Computing, University of Campinas, Campinas, Brazil 13084-971;Institute of Computing, University of Campinas, Campinas, Brazil 13084-971;Institute of Computing, University of Campinas, Campinas, Brazil 13084-971

  • Venue:
  • Constraints
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Brazilian petrobras is one of the world largest oil companies. Recurrently, it faces a very difficult planning and scheduling problem: 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 related to resource allocation and temporal constraints. The current approaches known from the literature only consider a few types of constraints and restricted topologies, hence they are far from being applicable to real instances from petrobras. We propose a hybrid framework based on a two-phase problem decomposition strategy. A novel Constraint Programming (CP) model plays a key role in modelling operational constraints that are usually overlooked in literature, but that are essential in order to guarantee viable solutions. The full strategy was implemented and produced very adequate results when tested over large real instances.