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

Optimizing the Path Towards Plastic-Free Oceans

Author

Listed:
  • Dick den Hertog

    (Amsterdam Business School, University of Amsterdam, 1018 TV Amsterdam, Netherlands)

  • Jean Pauphilet

    (Management Science and Operations, London Business School, London NW1 4SA, United Kingdom)

  • Yannick Pham

    (The Ocean Cleanup, 3011 AD Rotterdam, Netherlands)

  • Bruno Sainte-Rose

    (The Ocean Cleanup, 3011 AD Rotterdam, Netherlands)

  • Baizhi Song

    (Management Science and Operations, London Business School, London NW1 4SA, United Kingdom)

Abstract

Increasing ocean plastic pollution is irreversibly harming ecosystems and human economic activities. We partner with a nonprofit organization and use optimization to help clean up oceans from plastic faster. Specifically, we optimize the route of their plastic collection system in the ocean to maximize the quantity of plastic collected over time. We formulate the problem as a longest path problem in a well-structured graph. However, because collection directly impacts future plastic density, the corresponding edge lengths are nonlinear polynomials. After analyzing the structural properties of the edge lengths, we propose a search-and-bound method, which leverages a relaxation of the problem solvable via dynamic programming and clustering, to efficiently find high-quality solutions (within 6% optimal in practice) and develop a tailored branch-and-bound strategy to solve it to provable optimality. On one year of ocean data, our optimization-based routing approach increases the quantity of plastic collected by more than 60% compared with the current routing strategy, hence speeding up the progress toward plastic-free oceans.

Suggested Citation

  • Dick den Hertog & Jean Pauphilet & Yannick Pham & Bruno Sainte-Rose & Baizhi Song, 2025. "Optimizing the Path Towards Plastic-Free Oceans," Operations Research, INFORMS, vol. 73(3), pages 1165-1183, May.
  • Handle: RePEc:inm:oropre:v:73:y:2025:i:3:p:1165-1183
    DOI: 10.1287/opre.2023.0515
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.2023.0515
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.2023.0515?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
    ---><---

    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:73:y:2025:i:3:p:1165-1183. 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: 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.