IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v241y2015i1p99-108.html
   My bibliography  Save this article

Planning safe navigation routes through mined waters

Author

Listed:
  • Babel, Luitpold
  • Zimmermann, Thomas

Abstract

In this paper we investigate the problem of finding a safe transit of a ship through areas threatened by sea mines. The aim is to provide decision-making support by a tool that can be integrated into a naval command and control system. We present a route finding algorithm which avoids regions of risk higher than a given threshold. The algorithm takes into account the technical and operational restrictions of the ship’s movement. It allows to minimize the route length, the traveling time, the number of maneuvers, or other objectives.

Suggested Citation

  • Babel, Luitpold & Zimmermann, Thomas, 2015. "Planning safe navigation routes through mined waters," European Journal of Operational Research, Elsevier, vol. 241(1), pages 99-108.
    • Handle: RePEc:eee:ejores:v:241:y:2015:i:1:p:99-108
    DOI: 10.1016/j.ejor.2014.08.002
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221714006183
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2014.08.002?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
    ---><---

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

    References listed on IDEAS

    as
    1. Ari, Ibrahim & Aksakalli, Vural & Aydogˇdu, Volkan & Kum, Serdar, 2013. "Optimal ship navigation with safety distance and realistic turn constraints," European Journal of Operational Research, Elsevier, vol. 229(3), pages 707-717.
    2. K Fagerholt & S I Heimdal & A Loktu, 2000. "Shortest path in the presence of obstacles: An application to ocean shipping," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 51(6), pages 683-688, June.
    Full references (including those not matched with items on IDEAS)

    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. Andrzej Bochniak & Monika Stoma, 2021. "Estimating the Optimal Location for the Storage of Pellet Surplus," Energies, MDPI, vol. 14(20), pages 1-16, October.
    2. Alan Washburn & Gerald G. Brown, 2016. "An exact method for finding shortest routes on a sphere, avoiding obstacles," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(5), pages 374-385, August.
    3. Ari, Ibrahim & Aksakalli, Vural & Aydogˇdu, Volkan & Kum, Serdar, 2013. "Optimal ship navigation with safety distance and realistic turn constraints," European Journal of Operational Research, Elsevier, vol. 229(3), pages 707-717.
    4. Cerrone, Carmine & Dussault, Benjamin & Wang, Xingyin & Golden, Bruce & Wasil, Edward, 2019. "A two-stage solution approach for the Directed Rural Postman Problem with Turn Penalties," European Journal of Operational Research, Elsevier, vol. 272(2), pages 754-765.
    5. Gerald G. Brown & Jeffrey E. Kline & Richard E. Rosenthal & Alan R. Washburn, 2007. "Steaming on Convex Hulls," Interfaces, INFORMS, vol. 37(4), pages 342-352, August.
    6. Zvyagina, Tatiana & Zvyagin, Petr, 2022. "A model of multi-objective route optimization for a vessel in drifting ice," Reliability Engineering and System Safety, Elsevier, vol. 218(PB).
    7. Marielle Christiansen & Kjetil Fagerholt & David Ronen, 2004. "Ship Routing and Scheduling: Status and Perspectives," Transportation Science, INFORMS, vol. 38(1), pages 1-18, February.

    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:eee:ejores:v:241:y:2015:i:1:p:99-108. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.