IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v67y2016i1p148-158.html
   My bibliography  Save this article

A heuristic approach to stowing general cargo into platform supply vessels

Author

Listed:
  • Michel Povlovitsch Seixas

    (Department of Naval Architecture and Ocean Engineering - University of Sao Paulo, São Paulo, Brazil)

  • André Bergsten Mendes

    (Department of Naval Architecture and Ocean Engineering - University of Sao Paulo, São Paulo, Brazil)

  • Marcos Ribeiro Pereira Barretto

    (Department of Mechatronics Engineering - University of Sao Paulo, São Paulo, Brazil)

  • Claudio Barbieri da Cunha

    (Department Transportation Engineering - University of Sao Paulo, São Paulo, Brazil)

  • Marco Antonio Brinati

    (Department of Naval Architecture and Ocean Engineering - University of Sao Paulo, São Paulo, Brazil)

  • Roberto Edward Cruz

    (CENPES Petrobras, Rio de Janeiro, Brazil)

  • Yue Wu

    (School of Management, University of Southampton, Southampton, UK)

  • Philip A Wilson

    (Faculty of Engineering and the Environment, Engineering Centre of Excellence, University of Southampton, Southampton, UK)

Abstract

This paper addresses a practical problem encountered in the oil industry, related to the supplying of general cargo to offshore rigs and production units. For a given route assigned to a supply vessel we seek to determine the optimal two-dimensional positioning of deck cargoes such that the overall profit is maximized, while ensuring that several safety and operational constraints are respected. In terms of mathematical modelling, the resulting problem can be seen as a rich variation of the two-dimensional knapsack problem, since some cargoes may wait for a later trip. Furthermore, given that the trip may serve many offshore units and that a substantial number of items must also return from these units, the problem becomes even more complex and can be viewed as a pickup and delivery allocation problem. We propose a probabilistic constructive procedure combined with a local search heuristic to solve this problem. We also report the results of computational experiments with randomly generated instances. These results evidence that our proposed heuristic can effectively help ship planners when dealing with such large-scale allocation problems, with many operational constraints.

Suggested Citation

  • Michel Povlovitsch Seixas & André Bergsten Mendes & Marcos Ribeiro Pereira Barretto & Claudio Barbieri da Cunha & Marco Antonio Brinati & Roberto Edward Cruz & Yue Wu & Philip A Wilson, 2016. "A heuristic approach to stowing general cargo into platform supply vessels," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 67(1), pages 148-158, January.
    • Handle: RePEc:pal:jorsoc:v:67:y:2016:i:1:p:148-158
    as

    Download full text from publisher

    File URL: http://www.palgrave-journals.com/jors/journal/v67/n1/pdf/jors201562a.pdf
    File Function: Link to full text PDF
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: http://www.palgrave-journals.com/jors/journal/v67/n1/full/jors201562a.html
    File Function: Link to full text HTML
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Zhijuan Kang & Ming Gao & Wei Dang & Jiajie Wang, 2024. "Optimization Model and Solution Algorithm for Space Station Cargo Supply Planning under Complex Constraints," Sustainability, MDPI, vol. 16(15), pages 1-26, July.
    2. Cruz, Roberto & Bergsten Mendes, André & Bahiense, Laura & Wu, Yue, 2019. "Integrating berth allocation decisions in a fleet composition and periodic routing problem of platform supply vessels," European Journal of Operational Research, Elsevier, vol. 275(1), pages 334-346.
    3. Jone R. Hansen & Kjetil Fagerholt & Magnus Stålhane & Jørgen G. Rakke, 2020. "An adaptive large neighborhood search heuristic for the planar storage location assignment problem: application to stowage planning for Roll-on Roll-off ships," Journal of Heuristics, Springer, vol. 26(6), pages 885-912, December.
    4. Maciel M. Queiroz & André Bergsten Mendes, 2020. "Critical Success Factors of the Brazilian Offshore Support Vessel Industry: A Flexible Systems Approach," Global Journal of Flexible Systems Management, Springer;Global Institute of Flexible Systems Management, vol. 21(1), pages 33-48, June.

    More about this item

    Statistics

    Access and download statistics

    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:pal:jorsoc:v:67:y:2016:i:1:p:148-158. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    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.