IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v208y2026ics1366554526000414.html

Drone scheduling optimization for continuous sea area monitoring

Author

Listed:
  • Liu, Yun
  • Xia, Jun
  • Xu, Zhou

Abstract

Drones equipped with industrial sensors offer a promising solution for environmental surveillance. This paper studies a new drone scheduling problem for sea area emission surveillance, where drones are utilized to monitor vessel emissions across a continuous sea area for a given planning horizon. The challenges of this optimization problem stem from the varying monitoring requirements within a continuous area due to vessel dynamics and the operational issues of drone deployment, such as multi-trip operations. To address these issues, we discretize the continuous sea area using hexagonal grids and represent the problem through a time-expanded network, resulting in a mixed-integer linear programming formulation for its optimization. To solve large-scale instances, we propose a Lagrangian relaxation-based approach enhanced with a customized lower bounding heuristic. Numerical experiments demonstrate that our approach is very effective and efficient in obtaining high-quality solutions. We conduct a real-world case study based on the Gulf of Mexico’s AIS data to examine the practical implementation of the proposed optimization tool. Furthermore, we investigate how the drone’s operational factors, including the sensor range, endurance, and operational flexibility, affect the monitoring performance.

Suggested Citation

  • Liu, Yun & Xia, Jun & Xu, Zhou, 2026. "Drone scheduling optimization for continuous sea area monitoring," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 208(C).
  • Handle: RePEc:eee:transe:v:208:y:2026:i:c:s1366554526000414
    DOI: 10.1016/j.tre.2026.104701
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554526000414
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.tre.2026.104701?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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:eee:transe:v:208:y:2026:i:c:s1366554526000414. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description .

    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.