SciELO - Scientific Electronic Library Online

 
vol.28 número3A exploração de gás natural em Mexilhão: análise multicritério pelo método TodimDouble sampling control chart for a first order autoregressive process índice de autoresíndice de assuntospesquisa de artigos
Home Pagelista alfabética de periódicos  

Serviços Personalizados

Journal

Artigo

Indicadores

Links relacionados

Compartilhar


Pesquisa Operacional

versão impressa ISSN 0101-7438versão On-line ISSN 1678-5142

Resumo

MAGATAO, Leandro; ARRUDA, Lúcia Valéria Ramos de  e  NEVES-JR, Flávio. Um modelo híbrido (CLP-MILP) para scheduling de operações em polidutos. Pesqui. Oper. [online]. 2008, vol.28, n.3, pp.511-543. ISSN 0101-7438.  http://dx.doi.org/10.1590/S0101-74382008000300007.

This work is motivated by the need of optimization in the pipeline-oil distribution scenario. The considered problem involves the short-term scheduling of activities in a specific pipeline. The pipeline is 93.5 km in length, and it connects refinery and harbor tankfarms, conveying different types of commodities (gasoline, diesel, kerosene, etc). An optimization model was developed to determine the pipeline scheduling with improved efficiency. Such model combines Constraint Logic Programming (CLP) and Mixed Integer Linear Programming (MILP) in an integrated CLP-MILP framework. The proposed model uses decomposition strategies, continuous time representation, and intervals that represent time constraints (time windows). Real cases were solved in a reduced computational time (order of seconds). The computational results have demonstrated that the model is able to define new operational points to the pipeline, providing significant cost saving. Indeed the CLP-MILP model is an efficient tool to aid the operational decision-making within this real-world pipeline scenario.

Palavras-chave : constraint logic programming (CLP); mixed integer linear programming (MILP); pipeline scheduling.

        · resumo em Português     · texto em Português     · Português ( pdf )

 

Creative Commons License Todo o conteúdo deste periódico, exceto onde está identificado, está licenciado sob uma Licença Creative Commons