IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v51y2003i2p228-239.html
   My bibliography  Save this article

An Oil Pipeline Design Problem

Author

Listed:
  • Jack Brimberg

    (Department of Business Administration, Royal Military College of Canada, P.O. Box 17000, Station Forces, Kingston, Ontario, Canada K7K 7B4, and GERAD)

  • Pierre Hansen

    (GERAD, and École des Hautes Études Commerciales, 3000, chemin de la Côte-Sainte-Catherine, Montréal, Québec, Canada H3T 2A7)

  • Keh-Wei Lin

    (AT&T Labs, 200 South Laurel Avenue, Middletown, New Jersey 07748)

  • Nenad Mladenović

    (Mathematical Institute, Serbian Academy of Sciences, Belgrade, Yugoslavia, and GERAD)

  • MichÈle Breton

    (GERAD, and École des Hautes Études Commerciales, 3000, chemin de la Côte-Sainte-Catherine, Montréal, Québec, Canada H3T 2A7)

Abstract

We consider a given set of offshore platforms and onshore wells producing known (or estimated) amounts of oil to be connected to a port. Connections may take place directly between platforms, well sites, and the port, or may go through connection points at given locations. The configuration of the network and sizes of pipes used must be chosen to minimize construction costs. This problem is expressed as a mixed-integer program, and solved both heuristically by Tabu Search and Variable Neighborhood Search methods and exactly by a branch-and-bound method. Two new types of valid inequalities are introduced. Tests are made with data from the South Gabon oil field and randomly generated problems.

Suggested Citation

  • Jack Brimberg & Pierre Hansen & Keh-Wei Lin & Nenad Mladenović & MichÈle Breton, 2003. "An Oil Pipeline Design Problem," Operations Research, INFORMS, vol. 51(2), pages 228-239, April.
    • Handle: RePEc:inm:oropre:v:51:y:2003:i:2:p:228-239
    DOI: 10.1287/opre.51.2.228.12786
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.51.2.228.12786
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.51.2.228.12786?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Schreck, H. & Tinhofer, G., 1985. "An O(n2) simplex algorithm for a class of linear programs with tree structure," European Journal of Operational Research, Elsevier, vol. 21(2), pages 225-232, August.
    2. Hansen, Pierre & Mladenovic, Nenad, 2001. "Variable neighborhood search: Principles and applications," European Journal of Operational Research, Elsevier, vol. 130(3), pages 449-467, May.
    3. Fred Glover, 1989. "Tabu Search---Part I," INFORMS Journal on Computing, INFORMS, vol. 1(3), pages 190-206, August.
    4. Hansen, Pierre & de Luna Pedrosa Filho, Eugenio & Carneiro Ribeiro, Celso, 1992. "Location and sizing of offshore platforms for oil exploration," European Journal of Operational Research, Elsevier, vol. 58(2), pages 202-214, April.
    5. Daniel Bienstock & Oktay Günlük, 1996. "Capacitated Network Design---Polyhedral Structure and Computation," INFORMS Journal on Computing, INFORMS, vol. 8(3), pages 243-259, August.
    6. BIENSTOCK, Daniel & CHOPRA, Sunil & GÜNLÜK, Oktay & TSAI, Chih-Yang, 1998. "Minimum cost capacity installation for multicommodity network flows," LIDAM Reprints CORE 1391, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    7. BOUSBA, Choaib & WOLSEY, Laurence A., 1991. "Finding minimum cost directed trees with demands and capacities," LIDAM Reprints CORE 966, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    8. B. Rothfarb & H. Frank & D. M. Rosenbaum & K. Steiglitz & D. J. Kleitman, 1970. "Optimal Design of Offshore Natural-Gas Pipeline Systems," Operations Research, INFORMS, vol. 18(6), pages 992-1020, December.
    9. B. Rothfarb & M. Goldstein, 1971. "The One-Terminal TELPAK Problem," Operations Research, INFORMS, vol. 19(1), pages 156-169, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Michael Bussieck & Alexander Meeraus, 2007. "Algebraic modeling for IP and MIP (GAMS)," Annals of Operations Research, Springer, vol. 149(1), pages 49-56, February.
    2. Jean André & Stéphane Auray & Daniel de Wolf & Mohamed-Mahmoud Memmah & Antoine Simonnet, 2014. "Time development of new hydrogen transmission pipeline networks for France," Post-Print halshs-02396799, HAL.
    3. Massol, Olivier & Tchung-Ming, Stéphane & Banal-Estañol, Albert, 2015. "Joining the CCS club! The economics of CO2 pipeline projects," European Journal of Operational Research, Elsevier, vol. 247(1), pages 259-275.
    4. Sungwoo Lee & Hyoungtae Kim & Tae Hyun Kim & Hansol Shin & Wook Kim, 2019. "Fault Current Constraint Transmission Expansion Planning Based on the Inverse Matrix Modification Lemma and a Valid Inequality," Energies, MDPI, vol. 12(24), pages 1-17, December.
    5. Martina Fischetti & Matteo Fischetti, 2023. "Integrated Layout and Cable Routing in Wind Farm Optimal Design," Management Science, INFORMS, vol. 69(4), pages 2147-2164, April.
    6. Cazzaro, Davide & Fischetti, Martina & Fischetti, Matteo, 2020. "Heuristic algorithms for the Wind Farm Cable Routing problem," Applied Energy, Elsevier, vol. 278(C).
    7. Thapalia, Biju K. & Crainic, Teodor Gabriel & Kaut, Michal & Wallace, Stein W., 2012. "Single-commodity network design with random edge capacities," European Journal of Operational Research, Elsevier, vol. 220(2), pages 394-403.
    8. Massol, Olivier & Banal-Estañol, Albert, 2014. "Export diversification through resource-based industrialization: The case of natural gas," European Journal of Operational Research, Elsevier, vol. 237(3), pages 1067-1082.
    9. André, Jean & Auray, Stéphane & Brac, Jean & De Wolf, Daniel & Maisonnier, Guy & Ould-Sidi, Mohamed-Mahmoud & Simonnet, Antoine, 2013. "Design and dimensioning of hydrogen transmission pipeline networks," European Journal of Operational Research, Elsevier, vol. 229(1), pages 239-251.
    10. Christopher Yeates & Cornelia Schmidt-Hattenberger & Wolfgang Weinzierl & David Bruhn, 2021. "Heuristic Methods for Minimum-Cost Pipeline Network Design – a Node Valency Transfer Metaheuristic," Networks and Spatial Economics, Springer, vol. 21(4), pages 839-871, December.
    11. Gust, Gunther & Schlüter, Alexander & Feuerriegel, Stefan & Úbeda, Ignacio & Lee, Jonathan T. & Neumann, Dirk, 2024. "Designing electricity distribution networks: The impact of demand coincidence," European Journal of Operational Research, Elsevier, vol. 315(1), pages 271-288.
    12. Pierre Hansen & Nenad Mladenović & José Moreno Pérez, 2010. "Variable neighbourhood search: methods and applications," Annals of Operations Research, Springer, vol. 175(1), pages 367-407, March.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ioannis Gamvros & Bruce Golden & S. Raghavan, 2006. "The Multilevel Capacitated Minimum Spanning Tree Problem," INFORMS Journal on Computing, INFORMS, vol. 18(3), pages 348-365, August.
    2. Agarwal, Y.K. & Aneja, Y.P. & Jayaswal, Sachin, 2022. "Directed fixed charge multicommodity network design: A cutting plane approach using polar duality," European Journal of Operational Research, Elsevier, vol. 299(1), pages 118-136.
    3. Yogesh K. Agarwal, 2002. "Design of Capacitated Multicommodity Networks with Multiple Facilities," Operations Research, INFORMS, vol. 50(2), pages 333-344, April.
    4. Healy, Patrick & Moll, Robert, 1995. "A new extension of local search applied to the Dial-A-Ride Problem," European Journal of Operational Research, Elsevier, vol. 83(1), pages 83-104, May.
    5. J Brimberg & P Hansen & G Laporte & N Mladenović & D Urošević, 2008. "The maximum return-on-investment plant location problem with market share," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(3), pages 399-406, March.
    6. Sophie D. Lapierre & Angel B. Ruiz & Patrick Soriano, 2004. "Designing Distribution Networks: Formulations and Solution Heuristic," Transportation Science, INFORMS, vol. 38(2), pages 174-187, May.
    7. Marinakis, Yannis & Migdalas, Athanasios & Sifaleras, Angelo, 2017. "A hybrid Particle Swarm Optimization – Variable Neighborhood Search algorithm for Constrained Shortest Path problems," European Journal of Operational Research, Elsevier, vol. 261(3), pages 819-834.
    8. Andrew P. Armacost & Cynthia Barnhart & Keith A. Ware, 2002. "Composite Variable Formulations for Express Shipment Service Network Design," Transportation Science, INFORMS, vol. 36(1), pages 1-20, February.
    9. Keely L. Croxton & Bernard Gendron & Thomas L. Magnanti, 2007. "Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs," Operations Research, INFORMS, vol. 55(1), pages 146-157, February.
    10. Majid Taghavi & Kai Huang, 2016. "A multi‐stage stochastic programming approach for network capacity expansion with multiple sources of capacity," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(8), pages 600-614, December.
    11. Nicholas T. Boardman & Brian J. Lunday & Matthew J. Robbins, 2017. "Heterogeneous surface-to-air missile defense battery location: a game theoretic approach," Journal of Heuristics, Springer, vol. 23(6), pages 417-447, December.
    12. Mervat Chouman & Teodor Gabriel Crainic & Bernard Gendron, 2018. "The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 6(2), pages 143-184, June.
    13. Ayşegül Altın & Hande Yaman & Mustafa Ç. Pınar, 2011. "The Robust Network Loading Problem Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations," INFORMS Journal on Computing, INFORMS, vol. 23(1), pages 75-89, February.
    14. Grolimund, Stephan & Ganascia, Jean-Gabriel, 1997. "Driving Tabu Search with case-based reasoning," European Journal of Operational Research, Elsevier, vol. 103(2), pages 326-338, December.
    15. Mladenovic, Nenad & Brimberg, Jack & Hansen, Pierre & Moreno-Perez, Jose A., 2007. "The p-median problem: A survey of metaheuristic approaches," European Journal of Operational Research, Elsevier, vol. 179(3), pages 927-939, June.
    16. Yang Wang & Jin-Kao Hao & Fred Glover & Zhipeng Lü & Qinghua Wu, 2016. "Solving the maximum vertex weight clique problem via binary quadratic programming," Journal of Combinatorial Optimization, Springer, vol. 32(2), pages 531-549, August.
    17. Zachariadis, E.E. & Kiranoudis, C.T., 2011. "Local search for the undirected capacitated arc routing problem with profits," European Journal of Operational Research, Elsevier, vol. 210(2), pages 358-367, April.
    18. Morten Riis & Kim Allan Andersen, 2002. "Capacitated Network Design with Uncertain Demand," INFORMS Journal on Computing, INFORMS, vol. 14(3), pages 247-260, August.
    19. Jorge Ruiz-Vanoye & Ocotlán Díaz-Parra, 2011. "Similarities between meta-heuristics algorithms and the science of life," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 19(4), pages 445-466, December.
    20. Grit Claßen & Arie M. C. A. Koster & David Coudert & Napoleão Nepomuceno, 2014. "Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks," INFORMS Journal on Computing, INFORMS, vol. 26(4), pages 893-909, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:51:y:2003:i:2:p:228-239. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.