Abstract
We introduce a new model for pipeline transportation of petroleum products with no due dates. We use a directed graph G with n nodes, where arcs represent pipes and nodes represent locations. We also define a set L of r transportation orders and a subset F ⊂ L of further orders. A feasible solution to our model is a pumping sequence that delivers the products corresponding to all orders in L.F. We prove that the problem of finding such a solution is NP-hard, even if G is acyclic. For the special case where the products corresponding to orders in F are initially stored at nodes, we propose the BPA algorithm. This algorithm finds a feasible solution in O(r 2 log r + s 2(rn + logs)) time, where s is the total volume in the arcs of G. We point out that the input size is ω(s). If G is acyclic, then BPA finds a minimum cost solution.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
R. Ahuja, T. Magnanti, and J. Orlin. Network Flows: Theory, Algorithms and Applications. Prentice Hall, 1993.
Eduardo Camponogara. A-teams para um problema de transporte de derivados de petróleo. Master’s thesis, Departamento de Ciência da Computação, IMECC-UNICAMP, December 1995.
T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to algorithms. MIT Press and McGraw-Hill Book Company, 6th edition, 1992.
R.W. Floyd. Algorithm 97: Shortest path. Communications of ACM, 5:345, 1962.
M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979.
Christopher A. Hane and H. Donald Ratliff. Sequencing inputs to multicommodity pipelines. Annals of Operations Research, 57, 1995. Mathematics of Industrial Systems I.
Ruy L. Milidiú, Eduardo S. Laber, Artur A. Pessoa, and Pablo A. Rey. Petroleum products scheduling in pipelines. In The International Workshop on Harbour, Maritime & Industrial Logistics Modeling and Simulation, september 1999.
Ruy L. Milidiú, Artur A. Pessoa, Viviane Braconi, Eduardo S. Laber, and Pablo A. Rey. Um algoritmo grasp para o problema de transporte de derivados de petróleo em oleodutos (to appear). In Anais do XXXIII SBPO, Campos do Jordão, SP, Brazil, november 2001.
Ruy L. Milidiú, Artur A. Pessoa, and Eduardo S. Laber. Pipeline transportation of petroleum products. Technical Report 37, Departamento de Informática, PUCRJ, Rio de Janeiro, Brasil, September 2000.
Ruy L. Milidiú, Artur A. Pessoa, and Eduardo S. Laber. Transporting petroleum products in pipelines (abstract). In ISMP 2000-17th International Symposium on Mathematical Programming, pages 134–135, Atlanta, Georgia, USA, August 2000.
R. E. Tarjan. Depth-first search and linear graph algorithms. SIAM Journal on Computing, 1(2):146–160, 1972.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Milidiú, R.L., Pessoa, A.A., Laber, E.S. (2002). Pipeline Transportation of Petroleum Products with No Due Dates. In: Rajsbaum, S. (eds) LATIN 2002: Theoretical Informatics. LATIN 2002. Lecture Notes in Computer Science, vol 2286. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45995-2_25
Download citation
DOI: https://doi.org/10.1007/3-540-45995-2_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43400-9
Online ISBN: 978-3-540-45995-8
eBook Packages: Springer Book Archive