A mixed integer programming approach for scheduling commodities in a pipeline

Magatão, Leandro; Arruda, Lúcia Valéria Ramos de; Neves, Flávio

doi:10.1016/s0098-1354(03)00165-0

Cited by 115 publications

(54 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Na literatura, os problemas de planejamento são comumente resolvíveis por meio de abordagens exatas ou então por meio de abordagens aproximativas, havendo trabalhos que propõem a junção das duas abordagens em situações de ineficiência dos métodos exatos [1]. As abordagens exatas mais utilizadas para a resolução deste tipo de problema são os baseados em programação matemática, programação dinâmica e programação lógica por restrições (CLP) [1], [29]. Por sua vez, as abordagens aproximativas mais utilizadas referemse aos métodos heurísticos ou meta-heurísticos, com destaque às estratégias gulosas e algoritmos evolutivos (ex.…”

Section: Trabalhos Similaresunclassified

Protocolo de Leilões Simultâneos com Escalonamento: Aplicação ao Problema de Planejamento de Movimentações de Derivados de Petróleo

Banaszewski

Nogueira

Simão

et al. 2012

RITA

View full text Add to dashboard Cite

Resumo: Em cadeias de suprimento da indústria de petróleo, atender a demanda e manter um nível de estoque adequado para várias classes de derivados de petróleo é uma questão crucial. Basicamente, este tipo de cadeia é composta por vários elementos, como bases produtoras, bases consumidoras e terminais intermediários, os quais estão conectados por meio de uma malha de transportes multimodais para prover a movimentação de produtos entre as bases. Estes elementos devem cooperar para alcançar uma solução factível com um baixo tempo de processamento. Para atingir tal objetivo, este artigo apresenta um protocolo de leilões multiagentes para negociações simultâneas com um elemento escalonador. Este protocolo foi aplicado à cadeia supracitada, comportando-se eficientemente ao retornar uma solução factível em um baixo tempo de processamento.

show abstract

Section: Trabalhos Similaresunclassified

Protocolo de Leilões Simultâneos com Escalonamento: Aplicação ao Problema de Planejamento de Movimentações de Derivados de Petróleo

Banaszewski

Nogueira

Simão

et al. 2012

RITA

View full text Add to dashboard Cite

show abstract

“…These can be viewed as product centric approaches that do not require the explicit definition of batches. Product centric mixed‐integer linear programming (MILP) models can also be found inside the decomposition approaches of Magatão and co‐workers and in the full‐space Resource‐Task Network continuous time and volume approach of Castro . In Castro, a collection of complex tasks and resources makes it possible to have multiple products inside a segment but not different batches of the same product, which may compromise feasibility.…”

Section: Introductionmentioning

confidence: 99%

Continuous‐time scheduling formulation for straight pipelines

Mostafaei

Castro

2016

AIChE Journal

View full text Add to dashboard Cite

Pipelines represent the most cost‐effective way of transporting large quantities of refined petroleum products over large distances but can be challenging to operate. In this article, we propose a new mixed‐integer linear programming formulation for scheduling straight pipelines with multiple single and dual purpose nodes. The model allows for simultaneous injections and deliveries, and interacting pumping runs, in which a segment of the pipeline simultaneously receives material from its refinery and upstream segment. In contrast to previous batch centric models, it uses segment dependent coordinates. To make it efficient by design, we rely on generalized disjunctive programming and develop disjunctions for which the convex hull reformulation is simple (roughly the same number of variables and constraints as its big‐M counterpart). Through the solution of a set of test cases from the literature, we show a better utilization of the pipeline capacity that is translated into a lower makespan. © 2016 American Institute of Chemical Engineers AIChE J, 63: 1923–1936, 2017

show abstract

“…The optimization of the network consists in delivering products to different demand points with minimum operational costs (Magatão et al, 2004;Cafaro and Cerdá, 2004), and recent studies have been focused on the time delivery (Yongtu et al, 2012). Therefore, the objective is to deliver each product as fast as possible and the operational costs are represented as constraints.…”

Section: Introductionmentioning

confidence: 99%

Evolutionary computation methods for the schedule optimisation of pipeline networks

Krause

Lopes

2016

IJICA

View full text Add to dashboard Cite

Two evolutionary computation methods are presented in this paper, both variants of the Differential Evolution (DE) algorithm. Their main difference is the encoding process (binary and continuous) and both methods were successfully applied to the pipeline network schedule problem. A binary mathematical model is proposed to represent the flow of oil products in a 48 hours horizon period. In this paper, we introduce new benchmarks of the pipeline scheduling problem for testing the proposed evolutionary algorithms on a specific network topology, but with different products and demands. Although computationally expensive, a Mixed Integer Linear Programming (MILP) approach is used to obtain optimal solutions so as to compare results with the evolutionary methods. MILP results achieved optimal solutions for nine out of the fifteen benchmarks proposed, but it requires far more computational effort than the DE-variants. Even though it is a real-parameter algorithm, the DE can be consider as a good heuristic, which is an alternative for the discrete problem studied. The overall comparison of results between the proposed DE-variants and MILP supports the efficiency, robustness and convergence speed of DE algorithm suggesting its usefulness to real-world problems of limited complexity.

show abstract

A mixed integer programming approach for scheduling commodities in a pipeline

Cited by 115 publications

References 4 publications

Protocolo de Leilões Simultâneos com Escalonamento: Aplicação ao Problema de Planejamento de Movimentações de Derivados de Petróleo

Protocolo de Leilões Simultâneos com Escalonamento: Aplicação ao Problema de Planejamento de Movimentações de Derivados de Petróleo

Continuous‐time scheduling formulation for straight pipelines

Evolutionary computation methods for the schedule optimisation of pipeline networks

Contact Info

Product

Resources

About