IDEAS home Printed from https://ideas.repec.org/a/inm/orinte/v40y2010i5p408-416.html
   My bibliography  Save this article

Optimizing Helicopter Transport of Oil Rig Crews at Petrobras

Author

Listed:
  • Fernanda Menezes

    (Gapso Tecnologia da Decisão, Rio de Janeiro-RJ, 22290-160, Brazil)

  • Oscar Porto

    (Gapso Tecnologia da Decisão, Rio de Janeiro-RJ, 22290-160, Brazil)

  • Marcelo L. Reis

    (Gapso Tecnologia da Decisão, Rio de Janeiro-RJ, 22290-160, Brazil)

  • Lorenza Moreno

    (Departamento de Informática, Pontificia Universidade Católica, Rio de Janeiro-RJ, 22451-900, Brazil)

  • Marcus Poggi de Aragão

    (Departamento de Informática, Pontificia Universidade Católica, Rio de Janeiro-RJ, 22451-900, Brazil)

  • Eduardo Uchoa

    (Departamento de Engenharia de Produção, Universidade Federal Fluminense, Niteroi-RJ, 24210-240, Brazil)

  • Hernán Abeledo

    (Department of Engineering Management and Systems Engineering, George Washington University, Washington, DC 20052)

  • Nelci Carvalho do Nascimento

    (Serviços/Unidades de Serviços de Transporte e Armazenamento, Exploração e Produção, Petrobras, Macaé, Rio de Janeiro-RJ, 27915-012, Brazil)

Abstract

Petrobras produces nearly 90 percent of Brazil's oil at about 80 offshore oil platforms. It transports approximately 1,900 employees daily between these platforms and four mainland bases, using more than 40 helicopters that vary in capacity, operating costs, and performance characteristics. Each day, flight planners must select the helicopter routes and schedules that satisfy passenger demands. We developed a system that requires less than one hour to generate optimized flight plans that meet operational guidelines, improve travel safety, and minimize operating costs. By using this system, Petrobras reduced its number of offshore landings by 18 percent, total flight time by 8 percent, and flight costs by 14 percent, resulting in annual savings of more than $20 million. Our optimization model is a large-scale mixed integer program that generalizes prior helicopter routing models. We designed a column-generation algorithm that exploits the problem structure to overcome its computational difficulties. As part of the solution method, we use a network flow model to optimally assign passengers to selected routes.

Suggested Citation

  • Fernanda Menezes & Oscar Porto & Marcelo L. Reis & Lorenza Moreno & Marcus Poggi de Aragão & Eduardo Uchoa & Hernán Abeledo & Nelci Carvalho do Nascimento, 2010. "Optimizing Helicopter Transport of Oil Rig Crews at Petrobras," Interfaces, INFORMS, vol. 40(5), pages 408-416, October.
  • Handle: RePEc:inm:orinte:v:40:y:2010:i:5:p:408-416
    DOI: 10.1287/inte.1100.0517
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/inte.1100.0517
    Download Restriction: no

    File URL: https://libkey.io/10.1287/inte.1100.0517?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. M. T. Fiala Timlin & W. R. Pulleyblank, 1992. "Precedence Constrained Routing and Helicopter Scheduling: Heuristic Design," Interfaces, INFORMS, vol. 22(3), pages 100-111, June.
    2. C. Archetti & R. Mansini & M. G. Speranza, 2005. "Complexity and Reducibility of the Skip Delivery Problem," Transportation Science, INFORMS, vol. 39(2), pages 182-187, May.
    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. Brachner, Markus & Hvattum, Lars Magnus, 2017. "Combined emergency preparedness and operations for safe personnel transport to offshore locations," Omega, Elsevier, vol. 67(C), pages 31-41.
    2. Qian, Fubin & Gribkovskaia, Irina & Laporte, Gilbert & Halskau sr., Øyvind, 2012. "Passenger and pilot risk minimization in offshore helicopter transportation," Omega, Elsevier, vol. 40(5), pages 584-593.
    3. Nascimento, Felipe A.C. & Majumdar, Arnab & Ochieng, Washington Y. & Jarvis, Steve R., 2012. "A multistage multinational triangulation approach to hazard identification in night-time offshore helicopter operations," Reliability Engineering and System Safety, Elsevier, vol. 108(C), pages 142-153.
    4. Gribkovskaia, Irina & Halskau, Oyvind & Kovalyov, Mikhail Y., 2015. "Minimizing takeoff and landing risk in helicopter pickup and delivery operations," Omega, Elsevier, vol. 55(C), pages 73-80.
    5. Qian, Fubin & Strusevich, Vitaly & Gribkovskaia, Irina & Halskau, Øyvind, 2015. "Minimization of passenger takeoff and landing risk in offshore helicopter transportation: Models, approaches and analysis," Omega, Elsevier, vol. 51(C), pages 93-106.
    6. Vieira, Thiago & De La Vega, Jonathan & Tavares, Roberto & Munari, Pedro & Morabito, Reinaldo & Bastos, Yan & Ribas, Paulo César, 2021. "Exact and heuristic approaches to reschedule helicopter flights for personnel transportation in the oil industry," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 151(C).

    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. Fleming, Christopher L. & Griffis, Stanley E. & Bell, John E., 2013. "The effects of triangle inequality on the vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 224(1), pages 1-7.
    2. U Derigs & B Li & U Vogel, 2010. "Local search-based metaheuristics for the split delivery vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(9), pages 1356-1364, September.
    3. C. Archetti & M. G. Speranza & A. Hertz, 2006. "A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem," Transportation Science, INFORMS, vol. 40(1), pages 64-73, February.
    4. Jan Pelikán & Jan Fábry, 2012. "Heuristics for routes generation in pickup and delivery problem," 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. 20(3), pages 463-472, September.
    5. Claudia Archetti & Martin W. P. Savelsbergh & M. Grazia Speranza, 2006. "Worst-Case Analysis for Split Delivery Vehicle Routing Problems," Transportation Science, INFORMS, vol. 40(2), pages 226-234, May.
    6. Nikolakopoulos, Athanassios & Sarimveis, Haralambos, 2007. "A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1911-1929, March.
    7. Alberto Ceselli & Giovanni Righini & Matteo Salani, 2009. "A Column Generation Algorithm for a Rich Vehicle-Routing Problem," Transportation Science, INFORMS, vol. 43(1), pages 56-69, February.
    8. Ertan Yakıcı & Robert F. Dell & Travis Hartman & Connor McLemore, 2018. "Daily aircraft routing for amphibious ready groups," Annals of Operations Research, Springer, vol. 264(1), pages 477-498, May.
    9. Qian, Fubin & Gribkovskaia, Irina & Laporte, Gilbert & Halskau sr., Øyvind, 2012. "Passenger and pilot risk minimization in offshore helicopter transportation," Omega, Elsevier, vol. 40(5), pages 584-593.
    10. Claudia Archetti & M. Grazia Speranza & Martin W. P. Savelsbergh, 2008. "An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem," Transportation Science, INFORMS, vol. 42(1), pages 22-31, February.
    11. Naccache, Salma & Côté, Jean-François & Coelho, Leandro C., 2018. "The multi-pickup and delivery problem with time windows," European Journal of Operational Research, Elsevier, vol. 269(1), pages 353-362.
    12. José-Manuel Belenguer & Enrique Benavent & Nacima Labadi & Christian Prins & Mohamed Reghioui, 2010. "Split-Delivery Capacitated Arc-Routing Problem: Lower Bound and Metaheuristic," Transportation Science, INFORMS, vol. 44(2), pages 206-220, May.

    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:orinte:v:40:y:2010:i:5:p:408-416. 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.