A Rigorous Mathematical Formulation for the Scheduling of Tree-Structure Pipeline Networks

Autores
Cafaro, Diego Carlos; Cerda, Jaime
Año de publicación
2011
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
Pipeline networks are the dominant mode of conveying a wide variety of oil refined products from refineries to distribution terminals. Pipeline infrastructure usually comprises trunk lines serving high-volume, long-haul transportation requirements, and delivering lines moving smaller volumes over shorter distances. Lots of products are mostly sent through trunk lines to bulk terminals while some portions are branched to delivering lines and supplied to nearby market areas. This work presents a novel continuous-time mixed-integer linear (MILP) formulation for the short-term operational planning of tree-structure pipeline systems. The problem goal is to find the optimal schedule of pumping and delivery operations in order to satisfy all terminal requirements at minimum operating cost. To this end, model constraints strictly monitor the branching of batches and the creation of new interfaces in delivering lines to avoid forbidden sequences and determine additional reprocessing costs. By allowing the transfer of multiple products to delivering lines during a batch injection, longer runs can be executed and fewer ones are needed to find the optimal solution. The new approach has been successfully applied to three examples, one of them involving a real-world pipeline network. Compared with previous contributions, significant improvements in both solution quality and CPU time have been obtained.
Fil: Cafaro, Diego Carlos. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Santa Fe. Instituto de Desarrollo Tecnológico para la Industria Química (i); Argentina. Universidad Nacional del Litoral; Argentina
Fil: Cerda, Jaime. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Santa Fe. Instituto de Desarrollo Tecnológico para la Industria Química (i); Argentina. Universidad Nacional del Litoral; Argentina
Materia
Oil Products Distribution
Split Pipelines
Continuous-Time Scheduling
Rigorous Approach
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
CONICET Digital (CONICET)
Institución
Consejo Nacional de Investigaciones Científicas y Técnicas
OAI Identificador
oai:ri.conicet.gov.ar:11336/13363
Acceder
id CONICETDig_c728bf5549ac8106211e9ae6fe4073df
oai_identifier_str oai:ri.conicet.gov.ar:11336/13363
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling A Rigorous Mathematical Formulation for the Scheduling of Tree-Structure Pipeline NetworksCafaro, Diego CarlosCerda, JaimeOil Products DistributionSplit PipelinesContinuous-Time SchedulingRigorous Approachhttps://purl.org/becyt/ford/2.4https://purl.org/becyt/ford/2Pipeline networks are the dominant mode of conveying a wide variety of oil refined products from refineries to distribution terminals. Pipeline infrastructure usually comprises trunk lines serving high-volume, long-haul transportation requirements, and delivering lines moving smaller volumes over shorter distances. Lots of products are mostly sent through trunk lines to bulk terminals while some portions are branched to delivering lines and supplied to nearby market areas. This work presents a novel continuous-time mixed-integer linear (MILP) formulation for the short-term operational planning of tree-structure pipeline systems. The problem goal is to find the optimal schedule of pumping and delivery operations in order to satisfy all terminal requirements at minimum operating cost. To this end, model constraints strictly monitor the branching of batches and the creation of new interfaces in delivering lines to avoid forbidden sequences and determine additional reprocessing costs. By allowing the transfer of multiple products to delivering lines during a batch injection, longer runs can be executed and fewer ones are needed to find the optimal solution. The new approach has been successfully applied to three examples, one of them involving a real-world pipeline network. Compared with previous contributions, significant improvements in both solution quality and CPU time have been obtained.Fil: Cafaro, Diego Carlos. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Santa Fe. Instituto de Desarrollo Tecnológico para la Industria Química (i); Argentina. Universidad Nacional del Litoral; ArgentinaFil: Cerda, Jaime. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Santa Fe. Instituto de Desarrollo Tecnológico para la Industria Química (i); Argentina. Universidad Nacional del Litoral; ArgentinaAmerican Chemical Society2011-04info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/13363Cafaro, Diego Carlos; Cerda, Jaime; A Rigorous Mathematical Formulation for the Scheduling of Tree-Structure Pipeline Networks; American Chemical Society; Industrial And Engineering Chemistry; 50; 9; 4-2011; 5064-50850019-7866enginfo:eu-repo/semantics/altIdentifier/url/http://dx.doi.org/10.1021/ie101462kinfo:eu-repo/semantics/altIdentifier/url/http://pubs.acs.org/doi/abs/10.1021/ie101462kinfo:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-09-03T09:43:35Zoai:ri.conicet.gov.ar:11336/13363instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-09-03 09:43:36.219CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv A Rigorous Mathematical Formulation for the Scheduling of Tree-Structure Pipeline Networks
title A Rigorous Mathematical Formulation for the Scheduling of Tree-Structure Pipeline Networks
spellingShingle A Rigorous Mathematical Formulation for the Scheduling of Tree-Structure Pipeline Networks
Cafaro, Diego Carlos
Oil Products Distribution
Split Pipelines
Continuous-Time Scheduling
Rigorous Approach
title_short A Rigorous Mathematical Formulation for the Scheduling of Tree-Structure Pipeline Networks
title_full A Rigorous Mathematical Formulation for the Scheduling of Tree-Structure Pipeline Networks
title_fullStr A Rigorous Mathematical Formulation for the Scheduling of Tree-Structure Pipeline Networks
title_full_unstemmed A Rigorous Mathematical Formulation for the Scheduling of Tree-Structure Pipeline Networks
title_sort A Rigorous Mathematical Formulation for the Scheduling of Tree-Structure Pipeline Networks
dc.creator.none.fl_str_mv Cafaro, Diego Carlos
Cerda, Jaime
author Cafaro, Diego Carlos
author_facet Cafaro, Diego Carlos
Cerda, Jaime
author_role author
author2 Cerda, Jaime
author2_role author
dc.subject.none.fl_str_mv Oil Products Distribution
Split Pipelines
Continuous-Time Scheduling
Rigorous Approach
topic Oil Products Distribution
Split Pipelines
Continuous-Time Scheduling
Rigorous Approach
purl_subject.fl_str_mv https://purl.org/becyt/ford/2.4
https://purl.org/becyt/ford/2
dc.description.none.fl_txt_mv Pipeline networks are the dominant mode of conveying a wide variety of oil refined products from refineries to distribution terminals. Pipeline infrastructure usually comprises trunk lines serving high-volume, long-haul transportation requirements, and delivering lines moving smaller volumes over shorter distances. Lots of products are mostly sent through trunk lines to bulk terminals while some portions are branched to delivering lines and supplied to nearby market areas. This work presents a novel continuous-time mixed-integer linear (MILP) formulation for the short-term operational planning of tree-structure pipeline systems. The problem goal is to find the optimal schedule of pumping and delivery operations in order to satisfy all terminal requirements at minimum operating cost. To this end, model constraints strictly monitor the branching of batches and the creation of new interfaces in delivering lines to avoid forbidden sequences and determine additional reprocessing costs. By allowing the transfer of multiple products to delivering lines during a batch injection, longer runs can be executed and fewer ones are needed to find the optimal solution. The new approach has been successfully applied to three examples, one of them involving a real-world pipeline network. Compared with previous contributions, significant improvements in both solution quality and CPU time have been obtained.
Fil: Cafaro, Diego Carlos. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Santa Fe. Instituto de Desarrollo Tecnológico para la Industria Química (i); Argentina. Universidad Nacional del Litoral; Argentina
Fil: Cerda, Jaime. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Santa Fe. Instituto de Desarrollo Tecnológico para la Industria Química (i); Argentina. Universidad Nacional del Litoral; Argentina
description Pipeline networks are the dominant mode of conveying a wide variety of oil refined products from refineries to distribution terminals. Pipeline infrastructure usually comprises trunk lines serving high-volume, long-haul transportation requirements, and delivering lines moving smaller volumes over shorter distances. Lots of products are mostly sent through trunk lines to bulk terminals while some portions are branched to delivering lines and supplied to nearby market areas. This work presents a novel continuous-time mixed-integer linear (MILP) formulation for the short-term operational planning of tree-structure pipeline systems. The problem goal is to find the optimal schedule of pumping and delivery operations in order to satisfy all terminal requirements at minimum operating cost. To this end, model constraints strictly monitor the branching of batches and the creation of new interfaces in delivering lines to avoid forbidden sequences and determine additional reprocessing costs. By allowing the transfer of multiple products to delivering lines during a batch injection, longer runs can be executed and fewer ones are needed to find the optimal solution. The new approach has been successfully applied to three examples, one of them involving a real-world pipeline network. Compared with previous contributions, significant improvements in both solution quality and CPU time have been obtained.
publishDate 2011
dc.date.none.fl_str_mv 2011-04
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/11336/13363
Cafaro, Diego Carlos; Cerda, Jaime; A Rigorous Mathematical Formulation for the Scheduling of Tree-Structure Pipeline Networks; American Chemical Society; Industrial And Engineering Chemistry; 50; 9; 4-2011; 5064-5085
0019-7866
url http://hdl.handle.net/11336/13363
identifier_str_mv Cafaro, Diego Carlos; Cerda, Jaime; A Rigorous Mathematical Formulation for the Scheduling of Tree-Structure Pipeline Networks; American Chemical Society; Industrial And Engineering Chemistry; 50; 9; 4-2011; 5064-5085
0019-7866
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/url/http://dx.doi.org/10.1021/ie101462k
info:eu-repo/semantics/altIdentifier/url/http://pubs.acs.org/doi/abs/10.1021/ie101462k
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
application/pdf
dc.publisher.none.fl_str_mv American Chemical Society
publisher.none.fl_str_mv American Chemical Society
dc.source.none.fl_str_mv reponame:CONICET Digital (CONICET)
instname:Consejo Nacional de Investigaciones Científicas y Técnicas
reponame_str CONICET Digital (CONICET)
collection CONICET Digital (CONICET)
instname_str Consejo Nacional de Investigaciones Científicas y Técnicas
repository.name.fl_str_mv CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas
repository.mail.fl_str_mv dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar
_version_ 1842268612827545600
score 13.13397

Publicaciones similares