IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v63y2025i17p6339-6363.html
   My bibliography  Save this article

Local search-based meta-heuristics combined with an improved K-Means++ clustering algorithm for unmanned surface vessel scheduling

Author

Listed:
  • Weiyu Tang
  • Kaizhou Gao
  • Zhenfang Ma
  • Zhongjie Lin
  • Hui Yu
  • Wuze Huang
  • Naiqi Wu

Abstract

Unmanned surface vessels (USVs) play an important role in marine field, which can improve the efficiency and safety of task execution in hazardous environments. The applications of artificial intelligence technologies on USV collaboration scheduling can guide the USV cluster intelligence. In this study, the scheduling problems of USVs are solved by five local search-based meta-heuristics combining with an improved K-Means++ algorithm. The objective is to minimise the maximum completion time of USVs. For task assignment of USVs, an improved K-Means++ clustering (IKC) algorithm is proposed. The assignment results are used to initialise the population of meta-heuristics. According to the characteristics of the concerned problems and the structure of the solution space, six local search operators are designed to improve the convergence of meta-heuristics. Finally, the proposed strategies are integrated to five meta-heuristics and their performance are verified by solving 40 instances with different scales. Experimental results and statistical tests prove the strong competitiveness of the proposed algorithms. From the statistical analysis, the local search-based harmony search with the IKC algorithm performs better than the compared ones for solving the concerned problems.

Suggested Citation

  • Weiyu Tang & Kaizhou Gao & Zhenfang Ma & Zhongjie Lin & Hui Yu & Wuze Huang & Naiqi Wu, 2025. "Local search-based meta-heuristics combined with an improved K-Means++ clustering algorithm for unmanned surface vessel scheduling," International Journal of Production Research, Taylor & Francis Journals, vol. 63(17), pages 6339-6363, September.
  • Handle: RePEc:taf:tprsxx:v:63:y:2025:i:17:p:6339-6363
    DOI: 10.1080/00207543.2025.2470991
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2025.2470991
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2025.2470991?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

    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:taf:tprsxx:v:63:y:2025:i:17:p:6339-6363. 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 Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.