<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3-mathml3.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" article-type="research-article" dtd-version="1.3" xml:lang="EN">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Mar. Sci.</journal-id>
<journal-title-group>
<journal-title>Frontiers in Marine Science</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Mar. Sci.</abbrev-journal-title>
</journal-title-group>
<issn pub-type="epub">2296-7745</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.3389/fmars.2025.1634490</article-id>
<article-version article-version-type="Corrected Version of Record" vocab="NISO-RP-8-2008"/>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Original Research</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Predictive analysis of maritime accident hotspots using capsule neural network optimized by modified orangutan optimization algorithm</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name><surname>Mao</surname><given-names>Junhe</given-names></name>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; review &amp; editing" vocab-term-identifier="https://credit.niso.org/contributor-roles/writing-review-editing/">Writing &#x2013; review &amp; editing</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="methodology" vocab-term-identifier="https://credit.niso.org/contributor-roles/methodology/">Methodology</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; original draft" vocab-term-identifier="https://credit.niso.org/contributor-roles/writing-original-draft/">Writing &#x2013; original draft</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="investigation" vocab-term-identifier="https://credit.niso.org/contributor-roles/investigation/">Investigation</role>
</contrib>
<contrib contrib-type="author">
<name><surname>Li</surname><given-names>Feng</given-names></name>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="investigation" vocab-term-identifier="https://credit.niso.org/contributor-roles/investigation/">Investigation</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; review &amp; editing" vocab-term-identifier="https://credit.niso.org/contributor-roles/writing-review-editing/">Writing &#x2013; review &amp; editing</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; original draft" vocab-term-identifier="https://credit.niso.org/contributor-roles/writing-original-draft/">Writing &#x2013; original draft</role>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name><surname>Hu</surname><given-names>Jiaqing</given-names></name>
<xref ref-type="corresp" rid="c001"><sup>*</sup></xref>
<uri xlink:href="https://loop.frontiersin.org/people/3078220/overview"/>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Project-administration" vocab-term-identifier="https://credit.niso.org/contributor-roles/project-administration/">Project administration</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="conceptualization" vocab-term-identifier="https://credit.niso.org/contributor-roles/conceptualization/">Conceptualization</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="methodology" vocab-term-identifier="https://credit.niso.org/contributor-roles/methodology/">Methodology</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="visualization" vocab-term-identifier="https://credit.niso.org/contributor-roles/visualization/">Visualization</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Formal analysis" vocab-term-identifier="https://credit.niso.org/contributor-roles/formal-analysis/">Formal analysis</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; review &amp; editing" vocab-term-identifier="https://credit.niso.org/contributor-roles/writing-review-editing/">Writing &#x2013; review &amp; editing</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="investigation" vocab-term-identifier="https://credit.niso.org/contributor-roles/investigation/">Investigation</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Funding acquisition" vocab-term-identifier="https://credit.niso.org/contributor-roles/funding-acquisition/">Funding acquisition</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="supervision" vocab-term-identifier="https://credit.niso.org/contributor-roles/supervision/">Supervision</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; original draft" vocab-term-identifier="https://credit.niso.org/contributor-roles/writing-original-draft/">Writing &#x2013; original draft</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="resources" vocab-term-identifier="https://credit.niso.org/contributor-roles/resources/">Resources</role>
</contrib>
</contrib-group>
<aff id="aff1"><institution>Faculty of Military Health Service of Naval Medical University</institution>, <city>Shanghai</city>,&#xa0;<country country="cn">China</country></aff>
<author-notes>
<corresp id="c001"><label>*</label>Correspondence: Jiaqing Hu, <email xlink:href="mailto:jiaqinghu@126.com">jiaqinghu@126.com</email></corresp>
</author-notes>
<pub-date publication-format="electronic" date-type="pub" iso-8601-date="2026-01-14">
<day>14</day>
<month>01</month>
<year>2026</year>
</pub-date>
<pub-date publication-format="electronic" date-type="collection">
<year>2025</year>
</pub-date>
<volume>12</volume>
<elocation-id>1634490</elocation-id>
<history>
<date date-type="received">
<day>26</day>
<month>05</month>
<year>2025</year>
</date>
<date date-type="accepted">
<day>30</day>
<month>11</month>
<year>2025</year>
</date>
<date date-type="rev-recd">
<day>09</day>
<month>11</month>
<year>2025</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#xa9; 2026 Mao, Li and Hu.</copyright-statement>
<copyright-year>2026</copyright-year>
<copyright-holder>Mao, Li and Hu</copyright-holder>
<license>
<ali:license_ref start_date="2026-01-14">https://creativecommons.org/licenses/by/4.0/</ali:license_ref>
<license-p>This is an open-access article distributed under the terms of the <ext-link ext-link-type="uri" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution License (CC BY)</ext-link>. The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</license-p>
</license>
</permissions>
<abstract>
<p>Maritime accidents are lethal threats to lives, economies, and the environment as a result of which there is a need to develop advanced prediction models for early risk identification. In this paper, a novel framework integrated with Capsule Neural Networks (CapsNets) and a Modified Orangutan Optimization (MOO) algorithm is proposed to predict maritime accident hotspots. The CapsNet model captures spatio-temporal dependencies from the Global Maritime Distress and Safety System (GMDSS) dataset, while the MOO fine-tunes hyperparameters toward maximizing model accuracy and generalization. Experimental results suggest that the framework works exceedingly well against the baseline models by achieving an accuracy of 91.2%, while improving precision and recall, and reducing error rates on the contrary. Geospatial heatmaps and decision boundary visualizations strengthen the claim regarding the model&#x2019;s capacity to identify high-hazard zones and clearly categorize incident types. Compelling case studies illustrate its potential for reducing response time through proactive monitoring and preparedness, which is possible only through integrating information with prediction methods. The study takes maritime safety analytics into a very intelligent and data-driven domain by overcoming shortcomings of existing predictive methods. The framework opens the door to the future integration into rescue resource planning systems, where predicted risk zones will inform strategies for asset deployment.</p>
</abstract>
<kwd-group>
<kwd>maritime safety</kwd>
<kwd>capsule neural networks</kwd>
<kwd>modified orangutan optimization algorithm</kwd>
<kwd>predictive analytics</kwd>
<kwd>accident hotspot prediction</kwd>
<kwd>geospatial heatmaps</kwd>
</kwd-group>
<funding-group>
<funding-statement>The author(s) declared that financial support was not received for this work and/or its publication.</funding-statement>
</funding-group>
<counts>
<fig-count count="15"/>
<table-count count="2"/>
<equation-count count="32"/>
<ref-count count="17"/>
<page-count count="22"/>
<word-count count="13058"/>
</counts>
<custom-meta-group>
<custom-meta>
<meta-name>section-at-acceptance</meta-name>
<meta-value>Ocean Observation</meta-value>
</custom-meta>
</custom-meta-group>
</article-meta>
</front>
<body>
<sec id="s1" sec-type="intro">
<label>1</label>
<title>Introduction</title>
<p>Maritime accidents can pose gigantic threats to life, the economy, and the environment. According to the International Maritime Organization (IMO) (<xref ref-type="bibr" rid="B2">Dikaios, 2024</xref>), a few hundred maritime accidents occur each year and are categorized under the generic names of vessel collision, grounding, fire, or sinking. The incidents result in loss of life, environmental accidents such as oil spills, and economic devastation from damaged vessels and ports unable to operate with interrupted cargo deliveries. For instance, the damages from the 2002 Prestige oil spill were in the range of $4 billion, and it had severe ecological effects on the coastal areas (<xref ref-type="bibr" rid="B5">Heiberg, 2012</xref>). Efficiently carrying out detection and response works in damage minimization, requiring accurate prediction models identifying the highest-risk maritime zones before accidents occur.</p>
<p>Despite advances in navigation technology and safety features, challenges still exist in responding to marine distress. Delayed identification of distress calls, inefficient use of rescue assets (e.g., lifeboats, helicopters, and coast guard vessels), and limited predictive capabilities contribute to low performance. Traditional approaches to carrying out rescue operations rely heavily on human judgment and experience and are insufficient for addressing the dynamic and complex maritime environment. Current maritime rescue systems encounter several shortcomings:</p>
<list list-type="order">
<list-item>
<p>Delayed Response Times: There can be a delayed time to identify and answer distress calls due to the use of outdated communications equipment or human error.</p></list-item>
<list-item>
<p>Insufficient Resource Allocation: Rescue resources are typically allocated based on pre-established schedules or intuition rather than data-driven real-time information, resulting in overloading or underutilization of assets.</p></list-item>
<list-item>
<p>Lack of Predictive Competences: Present systems are largely reactive in nature rather than proactive. They do not forecast accidents that are likely to occur or optimize resources accordingly.</p></list-item>
<list-item>
<p>Data Complexity: Maritime databases, as provided by the Global Maritime Distress and Safety System (GMDSS), are vast and varied and consist of variables like location, time, weather, and ship types. It requires advanced analytical tools to make any meaningful inferences from such data.</p></list-item>
</list>
<p>These limitations underscore the novel applications of artificial intelligence (AI) and machine learning (ML) solutions to improve maritime rescue operations.</p>
<p>(<xref ref-type="fig" rid="f1"><bold>Figure&#xa0;1</bold></xref>) Predictive analysis has arrived as a revolutionary technique to resolve the issues faced in sea rescue operations. By analyzing trends in historical data, predictive models can forecast probable accidents, identify high-risk areas, and recommend optimal deployment of rescue resources. This proactive approach not only reduces response times but also minimizes the severity of accidents.</p>
<fig id="f1" position="float">
<label>Figure&#xa0;1</label>
<caption>
<p>Limitations of current maritime rescue systems.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fmars-12-1634490-g001.tif">
<alt-text content-type="machine-generated">Flowchart depicting issues in the Maritime Rescue System. Central box labeled &#x201c;Maritime Rescue System&#x201d; connects to &#x201c;Delayed Response Times,&#x201d; &#x201c;Outdated Communication Systems,&#x201d; and &#x201c;Human Error.&#x201d; It also links to &#x201c;Inefficient Resource Allocation&#x201d; with &#x201c;Fixed Schedules&#x201d; and &#x201c;Intuition-Based Decisions,&#x201d; &#x201c;Lack of Predictive Capabilities&#x201d; with &#x201c;Reactive Measures&#x201d; and &#x201c;Failure to Anticipate,&#x201d; and &#x201c;Data Complexity&#x201d; with &#x201c;Vast Datasets&#x201d; and &#x201c;Heterogeneous Variables."</alt-text>
</graphic></fig>
<p>Recent advancements in AI have shown their predictive modeling capabilities, such as Capsule Neural Networks (CapsNets). Capsule networks are distinct from traditional CNNs as they have a stronger ability to recognize spatial relationships and hierarchical structures of information (<xref ref-type="bibr" rid="B17">Zhou et&#xa0;al., 2023</xref>). This makes them extremely suitable for analyzing maritime data, where it is of prime importance to understand the spatial distribution of events. The optimization algorithms also play a critical role in optimizing the hyperparameters of such models to achieve improved performance.</p>
<p>In the context of maritime rescue, CapsNets are able to identify relationships between different features (e.g., weather, position, and ship type) to successfully predict accident occurrence.</p>
<p>Optimization algorithms augment capsule networks by automating hyperparameter selection, which is key to model performance. Hyperparameters like learning rate, number of capsules, and regularization coefficients have a profound impact on the training process. Amid the several optimization methods available, bio-inspired algorithms have been popular for their capability in exploration-exploitation balance.</p>
<p>This approach distinguishes itself as strongly contributing to operations involving maritime search and rescue (MSAR) by assessing the limitations of current working systems, namely delayed response time, ineffective resource allocation, lack of predictive capabilities, and complex datasets, prioritizing the CapsNets and a Modified Orangutan Optimization (MOO) algorithm.</p>
<p>At variance with conventional methods that depend on static rules or methods that cannot capture spatial hierarchies, CapsNet-based modeling proposed by us performs active learning on maritime datasets with respect to pose and part-whole relationships, thereby allowing the model to learn complex spatio-temporal relationships such as interaction between the position of the vessel, weather characteristics, and navigational context.</p>
<p>This occurs with enhanced prediction of high-risk zones before the onset of incidents and types of incidents set to happen, thereby changing the phase to proactive rescue planning. The MOO algorithm also contributes significantly to the novelty by optimally adjusting some key hyperparameters, ensuring maximum generalization and stability to the model.</p>
<p>The main contribution of this paper is to build a predictive framework for maritime rescue resource distribution using CapsNet with a modified Orangutan Optimization algorithm as a bio-inspired algorithm.</p>
<p>This paper&#x2019;s main contribution is developing a predictive framework that would apply Capsule Neural Networks (CapsNets) along with the Modified Orangutan Optimization (MOO) algorithm for maritime accident hotspot identification. The research contributions include:</p>
<list list-type="simple">
<list-item>
<p>- Developing a CapsNet architecture model capable of learning the spatial-temporal dependencies between maritime accident factors like location, weather conditions, vessel type, and time of occurrence.</p></list-item>
<list-item>
<p>- Prepending and training the model on real-world GMDSS data for practical relevance.</p></list-item>
<list-item>
<p>- Introduce a modified version of the Orangutan Optimization algorithm for automatic hyperparameter tuning and model improvement.</p></list-item>
<list-item>
<p>- A framework will be validated using extensive experimentation, geospatial visualizations, and case studies.</p></list-item>
</list>
<p>These objectives would improve the accuracy and reliability of forecasting maritime accidents, thereby enabling data-driven future uses of the framework for Maritime Safety Management, including possible optimization in resource deployment during rescues.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>Literature review</title>
<p>In the last ten years, researchers have investigated various methodologies for solving these issues, employing developments in artificial intelligence, optimization methods, and predictive analytics. The research conducted has introduced new solutions that encompass opportunistic routing protocols, machine learning-based prediction models, and multi-objective optimization frameworks. Although each of these methods has shown promise for enhancing certain aspects of MSAR operations, there are still challenges concerning scalability, accuracy, and the capacity to adapt to real-time situations. This literature review discusses significant contributions to the field, their strengths and shortcomings, and their implications for further research.</p>
<p>Wu et&#xa0;al (<xref ref-type="bibr" rid="B13">Wu et&#xa0;al., 2018</xref>). utilized opportunistic routing that could employ the broadcast feature of radio propagation. The routing decisions within opportunistic routing relied solely on the information from neighboring nodes. There was no need for network-wide flooding for establishing routes. To keep neighbor information up-to-date and reduce the energy expenditure associated with gathering this data, a lightweight approach has been suggested for predicting routing metrics using time series analysis to address the high communication expenditures that arose from updating the recent routing metrics. The application of the opportunistic routing protocol accomplished a 30% higher Packet Delivery Ratio in comparison with the conventional <italic>Ad hoc</italic> On-Demand Distance Vector (AODV). Furthermore, the opportunistic routing protocol that utilized a forecast was superior to the model that did not use a forecast. The suggested approach accomplished 90% efficiency, while the AODV protocol reached only 60% efficacy. In the process, an extra 3% of energy was utilized via the nodes.</p>
<p>Sun et&#xa0;al (<xref ref-type="bibr" rid="B9">Sun et&#xa0;al., 2022</xref>). exploited an optimum distribution technique that used the constrained resources of SAR utilized at navigation-limited seaside islands. The research addressed the issue relevant to SAR resource distribution in seaside regions by developing a non-linear optimization network. The optimum solution for the SAR resource distribution challenge was investigated while considering various settings for aircraft and ship base stations, utilizing an enhanced PSO (Particle Swarm Optimization). Results from experiments indicated that the EPSO effectively allocated maritime rescue resources, achieving a broad coverage region and minimal time expenditure. Additionally, genetic algorithms and particle swarm optimization have been employed for comparison regarding model efficacy.</p>
<p>Dong et&#xa0;al (<xref ref-type="bibr" rid="B4">Dong et&#xa0;al., 2024</xref>). suggested a comprehensive approach for distributing resources of MSAR that aimed to enhance the entire efficacy of MSAR applications. Initially, the LSTM was utilized for predicting the quantity of upcoming events, and the K-medoids algorithm was utilized for identifying the accident block spot within the investigated region. After that, multi-limit circumstances were analyzed within the MSAR resource distribution procedure. An integer programming network with multiple objectives has been developed to lower the allocation expenditures and time of response. Ultimately, the non-dominated sorting genetic algorithm II (DNSGA-II) has been applied utilizing rules of Deb to resolve the network, and a multi-attribute decision approach based on decision for MSAR resource distribution. The suggested findings indicated that the DNSGA-II showed improved convergence and produced superior quality solutions in comparison with the NSGA-II, EPSO (Enhanced Particle Swarm Optimization), and PSO (Particle Swarm Optimization) techniques. In comparison with the current MSAR resource emergency response network, the optimal strategy decreased the allocation costs and response time by 6.15% and 11.32%, respectively.</p>
<p>Lan et&#xa0;al (<xref ref-type="bibr" rid="B6">Lan et&#xa0;al., 2025</xref>). forecasted the demand for water in an accurate manner. The current examination offered forecast model that employed a prediction architecture that employed a Xception model that is optimized via the advanced maritime search and rescue with the purpose of increasing accuracy while predicting forthcoming trends of water demand using shared socioeconomic route contexts. The improved Xception model employed shared socioeconomic routes to assess the possible impacts of socioeconomic development on industrial and domestic water demand. The findings of the current research could assist water resource managers and policymakers by offering insights into upcoming trends in demands of water demand. The data could aid in planning and making educated decisions for the sustainable management of water resources, despite variability and uncertainty.</p>
<p>Ma et&#xa0;al (<xref ref-type="bibr" rid="B7">Ma et&#xa0;al., 2022</xref>). developed an optimization network for emergency resources distribution to enhance the efficacy of MSAR operations and the distribution efficacy of maritime emergency resources while taking into account numerous constraints, namely probable situations of rescue bases, accident black-spots, rescue ships, and diverse kinds of emergency resources. Considering the initial stage, LSTM has been employed for forecasting the quantity of probable accidents within the examined region. K-means algorithm has been offered for identifying the cores of accident black-spots. Eventually, the optimization algorithm with multiple objectives has been developed, and EGA (Elite-preserved Genetic Algorithm) has been utilized or determine the optimal emergency resource distribution technique. The outcomes represented that the distribution technique could fulfill the needs of real-time using a budget utilization with the value of 87.9%.</p>
<p>For the sake of cross-study referencing, it would be pertinent to investigate further works that have used various artificial intelligence techniques towards maritime accident prediction. Some recent works have focused on Bayesian networks for probabilistic risk assessment, taking advantage of being able to model causal relationships between human error, environmental conditions, and mechanical failure in the accident context (<xref ref-type="bibr" rid="B3">Dinis et&#xa0;al., 2020</xref>).</p>
<p>For example, Yin et&#xa0;al. developed a dynamic Bayesian network to predict the risk of vessel collision in congested waterways by being informed by real-time AIS data and weather conditions, achieving high interpretability and uncertainty quantification (<xref ref-type="bibr" rid="B15">Yin et&#xa0;al., 2011</xref>). Additionally, Fuzzy systems were also applied to fuzzy or missing maritime data, especially for navigation safety decision-making support (<xref ref-type="bibr" rid="B14">Yazdi and Kabir, 2017</xref>).</p>
<p>Hybrid models combining deep learning with attention mechanisms have also emerged: in other work, for example, a Transformer-based architecture to model long-range temporal dependencies in vessel movement patterns for accident forecasting (<xref ref-type="bibr" rid="B16">Yue et&#xa0;al., 2024</xref>). Although these frameworks provide important insights, they face difficulties of either spatial feature preservation (e.g., CNNs and Transformers) or requiring great domain knowledge for structure learning (e.g., Bayesian networks). In contrast, the proposed CapsNet-MOO framework is unique in integrating capsule networks&#x2019; spatial-hierarchical learning capabilities with an intelligent optimization mechanism to resolve generalization vis-a-vis accuracy in one objective. This tangent highlights the changing landscape of AI in maritime safety and places our work in a broader methodological spectrum.</p>
<p>The literature highlights the necessity of incorporating cutting-edge computational methods within the resource allocation models in MSAR. Opportunistic routing method, as exemplified by Wu et&#xa0;al., offers an effective means to achieve communication efficiency in rescue networks; however, its demand for neighboring information could restrict its application under sparse maritime conditions. Similarly, optimization-based approaches like those of Sun et&#xa0;al. and Ma et&#xa0;al. provide stable solutions for resource allocation but are computationally expensive and need prior knowledge of environmental constraints. Dong et&#xa0;al. take these efforts a step further by incorporating machine learning algorithms like LSTM and K-medoids clustering and achieving considerable enhancement in prediction performance and operational effectiveness. However, these methods still face difficulties when used with noisy or incomplete data, which are all too common in actual maritime datasets. Lan et&#xa0;al. showed an innovative use of shared socioeconomic pathways for water demand forecasting, thereby illustrating the applicability of predictive analytics in uses other than the conventional MSAR applications.</p>
<p>Despite the advances that have been accomplished, there continues to exist an enormous gap in the collective accomplishment of the collaborative requirements for better predictive accuracy, hyperparameter tuning, and timely responses in the collaborative setting. The proposed Capsule Neural Network, supported by the incorporation of a Modified Orangutan Optimization algorithm, seeks to overcome this limitation by combining the strengths of deep learning and nature-inspired optimization techniques that offer a novel solution for the intricacies of maritime rescue operations.</p>
</sec>
<sec id="s3">
<label>3</label>
<title>Methodology</title>
<p>The intent of this segment is to submit a thorough description of the proposed methodology, encompassing the data preprocessing, CapsNet architecture, MOO algorithm, and their collective utilization in predictive analysis in the context of resource planning for maritime rescue activities. Further, the section describes the workflow and training, and validation processes. <xref ref-type="fig" rid="f2"><bold>Figure&#xa0;2</bold></xref> shows the comprehensive flowchart of the proposed methodology.</p>
<fig id="f2" position="float">
<label>Figure&#xa0;2</label>
<caption>
<p>The comprehensive flowchart of the proposed methodology.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fmars-12-1634490-g002.tif">
<alt-text content-type="machine-generated">Flowchart detailing a process involving four main stages: Input Data (GMDSS Dataset), Data Preprocessing with steps like missing value imputation and feature extraction, Modified Orangutan Optimizer for hyperparameter tuning, and Capsule Neural Network architecture for classification. Final stage is Output and Evaluation, focusing on predictions, geospatial heatmaps, decision boundaries, and performance metrics such as accuracy and precision.</alt-text>
</graphic></fig>
<p>The evaluation metrics, comparison with baseline models, and case studies are described elaborately to demonstrate the efficacy of the suggested framework.</p>
<p>Preprocessing of the GMDSS data effectively is a requirement for achieving quality input for the predictive model. The data contains plenty of information concerning maritime incidents with variables such as location, time, weather, vessel type, and distress signals. The preprocessing procedures are described as follows:</p>
<sec id="s3_1">
<label>3.1</label>
<title>Cleaning and formatting</title>
<p>Cleaning and formatting are basic operations to handle missing values, outliers, and inconsistencies in the data. These operations make the data complete, accurate, and analysis-ready.</p>
<p>(A) Handling Missing Values.</p>
<p>Missing data is an issue in real-world databases. Missing values may be present in attributes such as latitude, longitude, weather, or vessel attributes in the GMDSS database. This has been handled using imputation techniques.</p>
<p>Numerical Features: Missing values in numerical features like latitude, longitude, and wind speed are imputed through <xref ref-type="disp-formula" rid="eq1">Equation 1</xref>:</p>
<disp-formula id="eq1"><label>(1)</label>
<mml:math display="block" id="M1"><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>m</mml:mi><mml:mi>p</mml:mi><mml:mi>u</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mover accent="true"><mml:mi>x</mml:mi><mml:mo>&#xaf;</mml:mo></mml:mover><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mi>N</mml:mi></mml:mfrac><mml:mstyle displaystyle="true"><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover></mml:mstyle><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math>
</disp-formula>
<p>where, <inline-formula>
<mml:math display="inline" id="im1"><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is feature values that are observed, and <inline-formula>
<mml:math display="inline" id="im2"><mml:mi>N</mml:mi></mml:math></inline-formula> is the number of non-missing observations.</p>
<p>Categorical Features: Missing values in categorical features like vessel type or weather are imputed through <xref ref-type="disp-formula" rid="eq2">Equation 2</xref>:</p>
<disp-formula id="eq2"><label>(2)</label>
<mml:math display="block" id="M2"><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mi>m</mml:mi><mml:mi>p</mml:mi><mml:mi>u</mml:mi><mml:mi>t</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo>&#xa0;</mml:mo><mml:mo>=</mml:mo><mml:mi>M</mml:mi><mml:mi>o</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:math>
</disp-formula>
<p>where, <inline-formula>
<mml:math display="inline" id="im3"><mml:mrow><mml:mi>M</mml:mi><mml:mi>o</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is the most frequent value in the feature.</p>
<p><xref ref-type="fig" rid="f3"><bold>Figure&#xa0;3</bold></xref> is a graphical illustration of how missing values are handled.</p>
<fig id="f3" position="float">
<label>Figure&#xa0;3</label>
<caption>
<p>Handling missing values: latitude imputation.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fmars-12-1634490-g003.tif">
<alt-text content-type="machine-generated">Line graph showing latitude versus data point index. The graph has original data points marked with red circles and imputed points connected by a blue line. The pattern rises from 45 at index 1, peaks at 47 at index 3, and slightly decreases towards index 5. Legend differentiates original and imputed points.</alt-text>
</graphic></fig>
<p>Imputation does not leave any data points missing in the event of missing values and ensures data set integrity. However, it must be carefully chosen with respect to the nature of the feature and its distribution.</p>
<p>(B) Outlier Detection.</p>
<p>Outliers can impact machine learning models and generalize poorly. The outliers in the GMDSS may be due to sensor failure, human mistakes, or unexpected circumstances. Statistical techniques can identify and control outliers:</p>
<p>- Z-Score Method: The value of an attribute has been marked as an outlier wherever its Z-score is greater than a threshold (e.g., <inline-formula>
<mml:math display="inline" id="im4"><mml:mrow><mml:mrow><mml:mo>|</mml:mo><mml:mi>Z</mml:mi><mml:mo>|</mml:mo></mml:mrow><mml:mo>&gt;</mml:mo><mml:mn>3</mml:mn></mml:mrow></mml:math></inline-formula>) as shown in <xref ref-type="disp-formula" rid="eq3">Equation 3</xref>:</p>
<disp-formula id="eq3"><label>(3)</label>
<mml:math display="block" id="M3"><mml:mrow><mml:mi>Z</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>x</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>&#x3bc;</mml:mi></mml:mrow><mml:mi>&#x3c3;</mml:mi></mml:mfrac></mml:mrow></mml:math>
</disp-formula>
<p>where, <inline-formula>
<mml:math display="inline" id="im5"><mml:mi>x</mml:mi></mml:math></inline-formula> represents the value of the feature, <inline-formula>
<mml:math display="inline" id="im6"><mml:mrow><mml:mo>&#xa0;</mml:mo><mml:mi>&#x3bc;</mml:mi><mml:mo>&#xa0;</mml:mo></mml:mrow></mml:math></inline-formula> for mean and <inline-formula>
<mml:math display="inline" id="im7"><mml:mi>&#x3c3;</mml:mi></mml:math></inline-formula> for standard deviation.</p>
<p>IQR-Based Method: The Interquartile Range (IQR) is used to identify outliers: <inline-formula>
<mml:math display="inline" id="im8"><mml:mrow><mml:mi>L</mml:mi><mml:mi>o</mml:mi><mml:mi>w</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mo>&#xa0;</mml:mo><mml:mi>B</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mo>=</mml:mo><mml:mi>Q</mml:mi><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mn>1.5</mml:mn><mml:mo>&#xb7;</mml:mo><mml:mi>I</mml:mi><mml:mi>Q</mml:mi><mml:mi>R</mml:mi></mml:mrow></mml:math></inline-formula>, <inline-formula>
<mml:math display="inline" id="im9"><mml:mrow><mml:mi>U</mml:mi><mml:mi>p</mml:mi><mml:mi>p</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mo>&#xa0;</mml:mo><mml:mi>B</mml:mi><mml:mi>o</mml:mi><mml:mi>u</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mo>=</mml:mo><mml:mi>Q</mml:mi><mml:mn>3</mml:mn><mml:mo>+</mml:mo><mml:mn>1.5</mml:mn><mml:mo>&#xb7;</mml:mo><mml:mi>I</mml:mi><mml:mi>Q</mml:mi><mml:mi>R</mml:mi></mml:mrow></mml:math></inline-formula>,</p>
<p>where <inline-formula>
<mml:math display="inline" id="im10"><mml:mrow><mml:mi>Q</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula> and <inline-formula>
<mml:math display="inline" id="im11"><mml:mrow><mml:mi>Q</mml:mi><mml:mn>3</mml:mn></mml:mrow></mml:math></inline-formula> are the first and third quartiles, respectively. <xref ref-type="fig" rid="f4"><bold>Figure&#xa0;4</bold></xref> shows the outlier recognition in vessel speed.</p>
<fig id="f4" position="float">
<label>Figure&#xa0;4</label>
<caption>
<p>Outlier recognition in vessel speed.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fmars-12-1634490-g004.tif">
<alt-text content-type="machine-generated">Scatter plot showing vessel speeds in knots against data point index. Most points, marked as non-outliers, are near zero speed, while one outlier is marked at 100 knots. Legend differentiates all data, outliers, and non-outliers.</alt-text>
</graphic></fig>
<p>Outliers are edited or eliminated on the basis of domain understanding. For example, 100 knots speed by a ship cannot be achieved and is an outlier; therefore, it needs to be identified and edited.</p>
</sec>
<sec id="s3_2">
<label>3.2</label>
<title>Feature extraction</title>
<p>Feature extraction converts raw data into helpful representations of the data that reflect the patterns inherent in the database.</p>
<p>(A) Location Features.</p>
<p>Geographic coordinates (latitude and longitude) are critical in spatial relationship modeling. These features are normalized to a unit scale (0, 1) based on <xref ref-type="disp-formula" rid="eq4">Equation 4</xref>:</p>
<disp-formula id="eq4"><label>(4)</label>
<mml:math display="block" id="M4"><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>n</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>x</mml:mi><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mo>&#x200b;</mml:mo></mml:mrow></mml:msub><mml:mo>&#x200b;</mml:mo><mml:mo>&#x200b;</mml:mo></mml:mrow><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mo>&#x200b;</mml:mo></mml:mrow></mml:msub></mml:mrow></mml:mfrac></mml:mrow></mml:math>
</disp-formula>
<p>where, <inline-formula>
<mml:math display="inline" id="im12"><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mo>&#xa0;</mml:mo></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> and <inline-formula>
<mml:math display="inline" id="im13"><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo>&#xa0;</mml:mo></mml:mrow></mml:math></inline-formula> are the minimum and maximum values of the feature.</p>
<p>In addition, computationally extracted features such as distance to the nearest coastline and proximity to high-risk zones are determined in <xref ref-type="disp-formula" rid="eq5">Equation 5</xref>:</p>
<disp-formula id="eq5"><label>(5)</label>
<mml:math display="block" id="M5"><mml:mrow><mml:mi>D</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mi>n</mml:mi><mml:mi>c</mml:mi><mml:mi>e</mml:mi><mml:mo>&#xa0;</mml:mo><mml:mi>f</mml:mi><mml:mi>r</mml:mi><mml:mi>o</mml:mi><mml:mi>m</mml:mi><mml:mo>&#xa0;</mml:mo><mml:mi>C</mml:mi><mml:mi>o</mml:mi><mml:mi>a</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mi>l</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>e</mml:mi><mml:mo>=</mml:mo><mml:msqrt><mml:mrow><mml:msup><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mn>2</mml:mn></mml:msup><mml:mo>+</mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>y</mml:mi><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>y</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:msqrt></mml:mrow></mml:math>
</disp-formula>
<p>where, (<inline-formula>
<mml:math display="inline" id="im14"><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, <inline-formula>
<mml:math display="inline" id="im15"><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>) are the coordinates of the nearest coastline point.</p>
<p>Derived features are utilized to further facilitate the model to learn spatial relationships, i.e., accident hotspots near coastlines or sea lanes.</p>
<p>(B) Temporal Features.</p>
<p>Timestamps are converted into valuable time-related features to identify temporal patterns:</p>
<list list-type="simple">
<list-item>
<p>- Hour of the Day: Obtained using the hour function.</p></list-item>
<list-item>
<p>- Day of the Week: Divided into Monday, Tuesday, etc.</p></list-item>
<list-item>
<p>- Seasonality Indicators: By month (e.g., spring, winter).</p></list-item>
</list>
<p>Temporal features help identify patterns such as peak accident times or seasonal variations in maritime incidents.</p>
<p>(C) Environmental Features.</p>
<p>Weather conditions are critical for predicting accidents. Continuous variables like wind speed and wave height are categorized into discrete levels:</p>
<list list-type="bullet">
<list-item>
<p>Low: <inline-formula>
<mml:math display="inline" id="im16"><mml:mrow><mml:mn>0</mml:mn><mml:mo>&#x2264;</mml:mo><mml:mi>x</mml:mi><mml:mo>&lt;</mml:mo><mml:mn>10</mml:mn></mml:mrow></mml:math></inline-formula></p></list-item>
<list-item>
<p>Medium: <inline-formula>
<mml:math display="inline" id="im17"><mml:mrow><mml:mn>10</mml:mn><mml:mo>&#x2264;</mml:mo><mml:mi>x</mml:mi><mml:mo>&lt;</mml:mo><mml:mn>20</mml:mn></mml:mrow></mml:math></inline-formula></p></list-item>
<list-item>
<p>High: <inline-formula>
<mml:math display="inline" id="im18"><mml:mrow><mml:mi>x</mml:mi><mml:mo>&#x2265;</mml:mo><mml:mn>20</mml:mn></mml:mrow></mml:math></inline-formula></p></list-item>
</list>
<p>Discretization simplifies the representation of environmental features and reduces noise.</p>
<p>(D) Vessel-Specific Features.</p>
<p>Vessel attributes like type, size, and age are encoded as categorical variables using one-hot encoding as illustrated in <xref ref-type="disp-formula" rid="eq6">Equation 6</xref>:</p>
<disp-formula id="eq6"><label>(6)</label>
<mml:math display="block" id="M6"><mml:mrow><mml:mi>O</mml:mi><mml:mi>n</mml:mi><mml:mi>e</mml:mi><mml:mo>&#x2212;</mml:mo><mml:mi>H</mml:mi><mml:mi>o</mml:mi><mml:mi>t</mml:mi><mml:mo>&#xa0;</mml:mo><mml:mi>E</mml:mi><mml:mi>n</mml:mi><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>d</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>g</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo stretchy="false">[</mml:mo><mml:mrow><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>0</mml:mn></mml:mrow><mml:mo stretchy="false">]</mml:mo></mml:mrow></mml:mrow></mml:math>
</disp-formula>
<p>where, <inline-formula>
<mml:math display="inline" id="im19"><mml:mi>x</mml:mi></mml:math></inline-formula> corresponds to a specific category.</p>
<p><xref ref-type="fig" rid="f5"><bold>Figure&#xa0;5</bold></xref> shows two examples of Feature Extraction, including&#xa0;normalized geographic coordinates and temporal feature extraction.</p>
<fig id="f5" position="float">
<label>Figure&#xa0;5</label>
<caption>
<p>Feature extraction: <bold>(A)</bold> Normalized geographic coordinates, <bold>(B)</bold> Temporal feature extraction: hours of the day.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fmars-12-1634490-g005.tif">
<alt-text content-type="machine-generated">Panel A shows a line graph with normalized latitude on the x-axis and normalized longitude on the y-axis, displaying a descending line with circular markers at both ends. Panel B displays a bar chart with data point indices on the x-axis and hour of the day on the y-axis, featuring three bars of varying heights at indices one, two, and three.</alt-text>
</graphic></fig>
<p>One-hot encoding ensures that categorical features are represented in a format suitable for machine learning models.</p>
<p>(E) Normalization and Scaling.</p>
<p>Numerical features are standardized using Min-Max scaling to ensure uniformity across the dataset, which improves convergence during model training.</p>
<p>By the rigorous preprocessing of GMDSS data, a clean properly formatted dataset has been created to be employed as the reference for training the Capsule Neural Network as illustrated in <xref ref-type="disp-formula" rid="eq7">Equation 7</xref>.</p>
<disp-formula id="eq7"><label>(7)</label>
<mml:math display="block" id="M7"><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>s</mml:mi><mml:mi>c</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>x</mml:mi><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>a</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>m</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac></mml:mrow></mml:math>
</disp-formula>
<p>Normalization prevents features with higher ranges from dominating the learning process and equates all features.</p>
</sec>
<sec id="s3_3">
<label>3.3</label>
<title>Rationale for feature preprocessing and categorization</title>
<p>The structuring of input variables has been decided and also processed through statistical analyses on the GMDSS dataset, along with relevant maritime safety knowledge. The use of temporal features is the fact that day of the week should be encoded as distinct categories (Monday, Tuesday, etc.) rather than broader ones like weekdays or weekends decided from exploratory analysis, showing that no real clustering of accident frequency between workweek vs. weekends.</p>
<p>Rather evenly across the seven days, with Friday and Saturday peaks apparently caused by increased vessel traffic, an incident nominal, those mere differences gave rise to classification of every day as a separate category, where the model captures subtle, specific&#xa0;day patterns without arbitrary groupings, thus denying meaningful variance.</p>
<p>Wind speed and wave height ranged in terms of Low, Medium, and High levels using established maritime safety thresholds from the World Meteorological Organization (WMO) and the International Maritime Organization (IMO). In terms of wind, Low (=3 at most under Beaufort), Medium (=4-6), and High (=7 and above) correspond to the wind speed as follows: Low (&lt;10 knots, Beaufort 3 or less), Medium (10&#x2013;25 knots, Beaufort 4-6), and High (&gt;25 knots, Beaufort 7+).</p>
<p>Wave height is Low (&lt;1.25&#xa0;m), Medium (1.25&#x2013;4 m), and High (&gt;4&#xa0;m)-sea states 3&#x2013;5 and above according to Douglas Sea Scale. These thresholds are given more operational weight because they are the ones affecting directly the ability of vessels to maneuver, crew responses, and activation of safety protocols. Thus, with their being of least distinction to where thresholding impacts interpretation enhancement and reduction of minor variances, they ensure input space emphasis on real-world maritime risk conditions. Also, they were validated through ablation studies (not shown due to space limitations), confirming that encoding and degree of discretization yielded the highest predictive accuracy and converged stability through the study within the CapsNet architecture.</p>
</sec>
<sec id="s3_4">
<label>3.4</label>
<title>Capsule neural network</title>
<p>The CapsNet has been an approach to ANN or Artificial Neural Network, which aims to identify productive relationships in an efficient way by using capsules as instant computational entities (<xref ref-type="bibr" rid="B1">Chen et&#xa0;al., 2025</xref>). Each capsule is a group of neurons which show the probability of a specific feature.</p>
<p>These capsules describe different features of an entity, including their state of being, shape, direction and condition. Additionally, each capsule has the capability to comprehend the diverse situation of input features and interactions of the environment, which are neglected in conventional neural networks (<xref ref-type="bibr" rid="B11">Wang et&#xa0;al., 2024</xref>).</p>
<p>Some layers of the capsule belong to the network, where all of them possess a unique level of thought. A dynamic structure for routing connects the low-level capsules with higher-level ones. The coefficient connection between the capsules is enhanced iteratively. The present process of improvement has been conducted according to the posture variables&#x2019; organization. The existing network is able to identify the connections among different portions and finish parts that make the capsules more valuable by demonstrating an enhanced relationship among the capsules having greater levels.</p>
<p>The output of this network has various vectors and all the vectors are equal to a previously chosen category. The intended category is represented by each vector which is made up of possibilities and parameters of the situation. The possibility of each class is represented via vector&#x2019;s length, and the situation&#x2019;s parameters are shown by its direction.</p>
<p>A margin-based loss function is used while training CapsNet. This endeavor attempts to encourage the correct class in a move to keep longer vectors and prevent the incorrect categories in a move to keep them from having longer vectors. Aside from that, margin-based loss function includes an ordinary process for normalization which discourages the network at hand from assigning high chances to most of the classes.</p>
<p>In the bottom layer, all of the capsules hold a vector of action <inline-formula>
<mml:math display="inline" id="im20"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> that describes geographic information referring to the capsule&#x2019;s index within element of insanitation, and it is addressed by <inline-formula>
<mml:math display="inline" id="im21"><mml:mi>j</mml:mi></mml:math></inline-formula>. The output vector <inline-formula>
<mml:math display="inline" id="im22"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> of the <inline-formula>
<mml:math display="inline" id="im23"><mml:mrow><mml:msup><mml:mi>j</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> capsule of a lesser level is applied in the following layer 1&#xa0;+&#xa0;1; it is used for each capsule. <inline-formula>
<mml:math display="inline" id="im24"><mml:mrow><mml:msup><mml:mi>i</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> candidate receives the input <inline-formula>
<mml:math display="inline" id="im25"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> and computes its output using the weight matrix <inline-formula>
<mml:math display="inline" id="im26"><mml:mrow><mml:msub><mml:mi>Y</mml:mi><mml:mrow><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> in the 1&#xa0;+&#xa0;1 layer. And the predicted layer <inline-formula>
<mml:math display="inline" id="im27"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> displays the initial quantity <inline-formula>
<mml:math display="inline" id="im28"><mml:mi>j</mml:mi></mml:math></inline-formula>, in category <inline-formula>
<mml:math display="inline" id="im29"><mml:mi>i</mml:mi></mml:math></inline-formula> as defined in <xref ref-type="disp-formula" rid="eq8">Equation 8</xref>.</p>
<disp-formula id="eq8"><label>(8)</label>
<mml:math display="block" id="M8"><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mtext>i</mml:mtext></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>Y</mml:mi><mml:mrow><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mtext>i</mml:mtext></mml:mrow></mml:msub><mml:mo>&#xd7;</mml:mo><mml:msub><mml:mi>p</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:math>
</disp-formula>
<p>The degree of conformity between candidates with the major factor in order to predict <inline-formula>
<mml:math display="inline" id="im30"><mml:mrow><mml:msup><mml:mi>j</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> candidate&#x2019;s behavior with the <inline-formula>
<mml:math display="inline" id="im31"><mml:mrow><mml:msup><mml:mi>i</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> candidate is determined by coupling coefficient while replicating the major predicting factor of <inline-formula>
<mml:math display="inline" id="im32"><mml:mrow><mml:msup><mml:mi>j</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> candidate. Two candidates are joined. So, while inverse process takes place, the coupling coefficient grows. For the analysis of the impact of compressing candidate function, the total amount <inline-formula>
<mml:math display="inline" id="im33"><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>Y</mml:mi><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> has been allocated for the <inline-formula>
<mml:math display="inline" id="im34"><mml:mrow><mml:msup><mml:mi>i</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup><mml:mo>&#xa0;</mml:mo></mml:mrow></mml:math></inline-formula> candidate&#x2019;s major prediction that are defined in <xref ref-type="disp-formula" rid="eq9">Equations 9</xref>&#x2013;<xref ref-type="disp-formula" rid="eq11">11</xref>.</p>
<disp-formula id="eq9"><label>(9)</label>
<mml:math display="block" id="M9"><mml:mrow><mml:mi>Y</mml:mi><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mstyle displaystyle="true"><mml:msubsup><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:msubsup><mml:mrow><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mover accent="true"><mml:mi>p</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mstyle></mml:mrow></mml:math>
</disp-formula>
<disp-formula id="eq10"><label>(10)</label>
<mml:math display="block" id="M10"><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mo>&#xa0;</mml:mo><mml:mfrac><mml:mrow><mml:msup><mml:mrow><mml:mrow><mml:mo>&#x2016;</mml:mo><mml:mrow><mml:mi>Y</mml:mi><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2016;</mml:mo></mml:mrow></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:mo>&#xa0;</mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mo>&#x2016;</mml:mo><mml:mrow><mml:mi>Y</mml:mi><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2016;</mml:mo></mml:mrow></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:mfrac><mml:mo>&#xa0;</mml:mo><mml:mfrac><mml:mrow><mml:mi>Z</mml:mi><mml:msub><mml:mi>c</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:mrow><mml:mo>&#x2016;</mml:mo><mml:mrow><mml:mi>Y</mml:mi><mml:msub><mml:mi>s</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>&#x2016;</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:mrow></mml:math>
</disp-formula>
<disp-formula id="eq11"><label>(11)</label>
<mml:math display="block" id="M11"><mml:mrow><mml:msub><mml:mi>q</mml:mi><mml:mrow><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mtext>exp</mml:mtext><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mo>&#x2211;</mml:mo><mml:mi>k</mml:mi></mml:msub><mml:mtext>exp</mml:mtext><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mi>b</mml:mi><mml:mrow><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:mrow></mml:math>
</disp-formula>
<p>It is compression with probability association that leads to the limitation of the output of the individuals to n values between 0 and 1. The <inline-formula>
<mml:math display="inline" id="im35"><mml:mrow><mml:msub><mml:mi>d</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> capsule layer switches to the succeeding layer which functions in exactly the same way as the former layer. The first predicting level has been represented through <inline-formula>
<mml:math display="inline" id="im36"><mml:mrow><mml:msub><mml:mi>q</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, which is further generalized to the <inline-formula>
<mml:math display="inline" id="im37"><mml:mrow><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:math></inline-formula> layer. Throughout all of the eras, the factors to which <inline-formula>
<mml:math display="inline" id="im38"><mml:mrow><mml:msub><mml:mover accent="true"><mml:mi>p</mml:mi><mml:mo>^</mml:mo></mml:mover><mml:mrow><mml:mi>j</mml:mi><mml:mo>,</mml:mo><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> is received are the elements.</p>
<p>The vector of every capsules has been viewed as a combination of two values which rely on quantity. The main variation is that capsules create probability and squeeze features, while most aspects of insanitation are used in determining the reliability of the layers. A higher level of capsule and a lower one are in conformity with each other, yet between the entire structure and an element, the correlation is shown through it which depicts the importance of the path. The Dynamic routing-by-agreement is reflected by the insight.</p>
<p>There are two major layers in the existing model i.e. input layer and capsule layer. The input layer controls the input data that is produced by the pre-training process. In the meantime, the capsule layer is tasked with specifying each of the patterns within the data and naming them. This layer is a dense of 32 channels that are convolution; it has a kernel size of <inline-formula>
<mml:math display="inline" id="im39"><mml:mrow><mml:mn>9</mml:mn><mml:mo>&#xd7;</mml:mo><mml:mn>9</mml:mn></mml:mrow></mml:math></inline-formula>,and a stride of two.</p>
<p>Hence, a vector has been created due to insanitation that shows a potential relationship between the appearance of the capsules in the margin loss scene and the function. A target is presented by the scene capsules that they all represented a certain ratio of loss of margin that are characterized by using the equation below. The maximum value of the vector is indicated through <inline-formula>
<mml:math display="inline" id="im40"><mml:mrow><mml:msub><mml:mi>D</mml:mi><mml:mi>h</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> in each group of scene when the scene is rendered inside the input image as defined in <xref ref-type="disp-formula" rid="eq12">Equation 12</xref>.</p>
<disp-formula id="eq12"><label>(12)</label>
<mml:math display="block" id="M12"><mml:mrow><mml:msub><mml:mi>G</mml:mi><mml:mrow><mml:msub><mml:mi>D</mml:mi><mml:mi>h</mml:mi></mml:msub></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mi>U</mml:mi><mml:mrow><mml:msub><mml:mi>D</mml:mi><mml:mi>h</mml:mi></mml:msub></mml:mrow></mml:msub><mml:mi>max</mml:mi><mml:msup><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:msup><mml:mi>b</mml:mi><mml:mo>+</mml:mo></mml:msup><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mo>&#x2016;</mml:mo><mml:mrow><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mi>V</mml:mi><mml:mi>r</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x2016;</mml:mo></mml:mrow></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mn>2</mml:mn></mml:msup><mml:mo>+</mml:mo><mml:mi>&#x3b1;</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>U</mml:mi><mml:mrow><mml:mi>V</mml:mi><mml:mi>r</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mtext>max</mml:mtext><mml:mo stretchy="false">(</mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mrow><mml:mo>&#x2016;</mml:mo><mml:mrow><mml:msub><mml:mi>D</mml:mi><mml:mrow><mml:mi>V</mml:mi><mml:mi>r</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo>&#x2016;</mml:mo></mml:mrow><mml:mo>&#x2212;</mml:mo><mml:msup><mml:mi>b</mml:mi><mml:mo>&#x2212;</mml:mo></mml:msup></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:math>
</disp-formula>
<p>Due to this study, the value of <inline-formula>
<mml:math display="inline" id="im41"><mml:mrow><mml:msub><mml:mi>U</mml:mi><mml:mrow><mml:msub><mml:mi>D</mml:mi><mml:mi>h</mml:mi></mml:msub></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> will be 1 when there exists a scene. Also, values 0.9 and 0.1 are given to <inline-formula>
<mml:math display="inline" id="im42"><mml:mrow><mml:msup><mml:mi>b</mml:mi><mml:mo>+</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula> and <inline-formula>
<mml:math display="inline" id="im43"><mml:mrow><mml:msup><mml:mi>b</mml:mi><mml:mo>&#x2212;</mml:mo></mml:msup></mml:mrow></mml:math></inline-formula>, respectively. The parameter <inline-formula>
<mml:math display="inline" id="im44"><mml:mi>&#x3b1;</mml:mi></mml:math></inline-formula> has been obtained by minimizing the effect of all capsules of scene. While there is process of normalizing, the scene capsules have a significant role. The scenes, correctly identified, are divided by the number of all the scenes in order to calculate the accuracy (see <xref ref-type="disp-formula" rid="eq13">Equation 13</xref>).</p>
<disp-formula id="eq13"><label>(13)</label>
<mml:math display="block" id="M13"><mml:mrow><mml:mi>A</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:mi>u</mml:mi><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>y</mml:mi><mml:mo>=</mml:mo><mml:mtext>&#xa0;</mml:mtext><mml:mfrac><mml:mrow><mml:mo>&#x2211;</mml:mo><mml:mo>&#x200b;</mml:mo><mml:mi>C</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:mi>t</mml:mi><mml:mtext>&#xa0;</mml:mtext><mml:mi>i</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>n</mml:mi><mml:mi>t</mml:mi><mml:mi>i</mml:mi><mml:mi>f</mml:mi><mml:mi>i</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi><mml:mo>&#xa0;</mml:mo><mml:mi>f</mml:mi><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>t</mml:mi><mml:mi>u</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>o</mml:mi><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mtext>&#xa0;</mml:mtext><mml:mi>n</mml:mi><mml:mi>u</mml:mi><mml:mi>m</mml:mi><mml:mi>b</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mtext>&#xa0;</mml:mtext><mml:mi>o</mml:mi><mml:mi>f</mml:mi><mml:mtext>&#xa0;</mml:mtext><mml:mi>f</mml:mi><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>t</mml:mi><mml:mi>u</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi></mml:mrow></mml:mfrac></mml:mrow></mml:math>
</disp-formula>
<p>It is extremely important to tune hyperparameters of the present model in order to move to the phase below. The model used optimizer for determining hyperparameters that are within context and has <inline-formula>
<mml:math display="inline" id="im45"><mml:mi>D</mml:mi></mml:math></inline-formula> dimensions whose main aim is to minimize the validation function.</p>
<p>Many hyperparameters have been illustrated by <inline-formula>
<mml:math display="inline" id="im46"><mml:mrow><mml:mi>O</mml:mi><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula>. If the model is structured properly, one can effectively decide the evaluation problem. In combination with <inline-formula>
<mml:math display="inline" id="im47"><mml:mrow><mml:mi>O</mml:mi><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula> optimizer, a solution is proposed as follows, which enables automatic allocation of the best hyperparameters based on <xref ref-type="disp-formula" rid="eq14">Equation 14</xref>.</p>
<disp-formula id="eq14"><label>(14)</label>
<mml:math display="block" id="M14"><mml:mtable columnalign="left"><mml:mtr><mml:mtd><mml:munder><mml:mrow><mml:mi>min</mml:mi></mml:mrow><mml:mrow><mml:mi>x</mml:mi><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mi>R</mml:mi><mml:mi>G</mml:mi></mml:msup></mml:mrow></mml:munder><mml:mi>O</mml:mi><mml:mi>B</mml:mi><mml:mo>&#xa0;</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mi>x</mml:mi><mml:mo>,</mml:mo><mml:mo>&#xa0;</mml:mo><mml:mi>&#x3b8;</mml:mi><mml:mo>;</mml:mo><mml:msub><mml:mi>Z</mml:mi><mml:mrow><mml:mi>v</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi>s</mml:mi><mml:mo>.</mml:mo><mml:mi>t</mml:mi><mml:mo>.</mml:mo><mml:mi>&#x3b8;</mml:mi><mml:mo>=</mml:mo><mml:mi>arg</mml:mi><mml:mi>min</mml:mi><mml:mi>O</mml:mi><mml:mi>B</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>&#x3b8;</mml:mi><mml:mo>;</mml:mo><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>i</mml:mi><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math>
</disp-formula>
<p>Since the <inline-formula>
<mml:math display="inline" id="im48"><mml:mrow><mml:mi>O</mml:mi><mml:mi>B</mml:mi></mml:mrow></mml:math></inline-formula> index is in fact advanced, overcoming the challenge of the above equation is in fact challenging. The training database is illustrated through the use of <inline-formula>
<mml:math display="inline" id="im49"><mml:mrow><mml:mi>s</mml:mi><mml:mo>.</mml:mo><mml:mi>t</mml:mi><mml:mo>.</mml:mo><mml:mi>&#x3b8;</mml:mi></mml:mrow></mml:math></inline-formula>. In addition, <inline-formula>
<mml:math display="inline" id="im50"><mml:mi>Y</mml:mi></mml:math></inline-formula> is used in an attempt to analyze the data. Minimization learning process and set management represented by <inline-formula>
<mml:math display="inline" id="im51"><mml:mi>x</mml:mi></mml:math></inline-formula> values, are the main goal of the training process. Refined Capuchin Search Algorithm (RCSA) is utilized in handling index of error costly, and the same has been utilized for hyperparameter tuning for the model.</p>
</sec>
<sec id="s3_5">
<label>3.5</label>
<title>Rationale for capsule neural networks in maritime accident prediction</title>
<p>Capsule Neural Networks were adopted as a predictive paradigm not by chance but rather for the very consideration that maritime accident data are unique spatial-temporal and hierarchical entities. Standard CNNs are incapable of preserving pose information due to the pooling operations employed for image recognition.</p>
<p>The CNNs are least effective in a situation in which prediction accuracy hinges upon getting the relative positioning of elements right. Unlike CNNs, with their capsules forming vector-valued neurons, CapsNets preserve pose information through the principles of dynamic routing by agreement. Hence, they are tremendously suitable for the forecasting of maritime accidents.</p>
<p>Maritime accidents evolve from the interplay of complex hierarchies set in space, not just the random occurrence of events. For instance, there are spatially dependent elements determining the collision risk: wind speed and density of vessels are not determining factors in isolation, rather their positioning regarding the congested shipping lane, all stuck in time, along with congestion and poor visibility.</p>
<p>A vessel in close proximity to a high-traffic zone with high wave height is at infinitely greater risk than that same vessel in open sea with little disturbance. CapsNets are exceptional in modeling the part-whole relationships where low-level capsules detect local features (high winds, nearness to the coast), whereas higher-level capsules integrate those into more global risks (collision risk in foggy straits) through the routing process. This allows the model to not only discriminate which features occur in an input but also how they are anatomically arranged temporally and spatially, which is crucially necessary for making the distinction between high-risk and low-risk scenarios.</p>
<p>Moreover, maritime data are always geospatial in nature, wherein latitude and longitude are prime predictors. The most salient feature of CapsNet in encoding spatial hierarchies is to learn that even slight positional shifts (open ocean to narrow channel) may almost entirely alter risk profiles, a subtlety usually lost upon scalar-output CNNs. The said equivariance to spatial transformation of the model generalizes considerably well over different regions and conditions. <xref ref-type="fig" rid="f6"><bold>Figure&#xa0;6</bold></xref> shows the rationale for capsule neural networks in maritime accident prediction.</p>
<fig id="f6" position="float">
<label>Figure&#xa0;6</label>
<caption>
<p>Rationale for capsule neural networks in maritime accident prediction.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fmars-12-1634490-g006.tif">
<alt-text content-type="machine-generated">Flowchart illustrating a risk prediction model for maritime safety. Input features, such as location, temporal, environmental, and vessel-specific data, are vectorized and processed through a capsule neural network optimized by multi-objective optimization. The network includes layers that reshape and detect features, dynamically route data, and produce output vectors indicating risk levels. Outputs include accident risk levels, geospatial heatmaps, decision boundaries, and optimized hyperparameters.</alt-text>
</graphic></fig>
<p>In settings addressing the precise prediction of accident hotspots, the capacity of CapsNet to maintain and reason over spatial relationships presents a unique and significant merit above conventional deep learning models in answering the challenges stated as the &#x201c;lack of predictive competences&#x201d; in existing maritime rescue systems. Through CapsNet, this research thus moves beyond conventional methods of pattern recognition to relational reasoning amidst context, which forms the bedrock of reliable and correct forecasting of maritime risks.</p>
</sec>
<sec id="s3_6">
<label>3.6</label>
<title>Modified orangutan optimization algorithm</title>
<p>In the following section, the theory behind the Orangutan Optimization Algorithm (OOA) is extensively described after a thorough explanation of the algorithm&#x2019;s inspiration. Subsequently, the OOA&#x2019;s methodical implementation is properly modeled employing mathematical formulas to guarantee that it may be used to successfully address a wide range of optimization issues.</p>
<sec id="s3_6_1">
<label>3.6.1</label>
<title>Initialization of the algorithm</title>
<p>The recently developed Orangutan Optimization Algorithm (OOA) is a bio-inspired metaheuristic technique that is based on the natural behaviors of orangutans. In this method, orangutans act as the members of the population, with each individual representing a potential solution, with each individuals representing a potential solution to the specified optimization challenge. These solutions are distinct from one another, as each orangutan has a distinct place in the search space for the issue. The particularly location of the orangutan, which is capable of being represented mathematically as a vector, determines the variables that are associated to each response. The OOA population, which is made up of these orangutans together, may be expressed as a matrix structure employing <xref ref-type="disp-formula" rid="eq15">Equation 15</xref>.</p>
<p>This matrix changes while the algorithm operates; it is not static. First, each orangutan&#x2019;s location inside the search space is chosen at random. By guaranteeing that the starting population encompasses a variety of areas inside the search space, this unpredictability improves the algorithm&#x2019;s capacity for exploration.</p>
<p>Each dimension of the orangutan&#x2019;s location is determined employing random values in the range specified in <xref ref-type="disp-formula" rid="eq16">Equation 16</xref>, which mathematically models the population&#x2019;s initialization procedure. This gives each orangutan an entirely unique location to start, which leads to a variety of candidate solutions.</p>
<disp-formula id="eq15"><label>(15)</label>
<mml:math display="block" id="M15"><mml:mrow><mml:mi>X</mml:mi><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mtable><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>&#x22ee;</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>&#x22ee;</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>N</mml:mi></mml:msub></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>N</mml:mi><mml:mo>&#xd7;</mml:mo><mml:mi>m</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mtable><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mo>&#x22ef;</mml:mo></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mo>&#x22ef;</mml:mo></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>&#x22ee;</mml:mo></mml:mtd><mml:mtd><mml:mo>&#x22f1;</mml:mo></mml:mtd><mml:mtd><mml:mo>&#x22ee;</mml:mo></mml:mtd><mml:mtd><mml:mo>&#x22f1;</mml:mo></mml:mtd><mml:mtd><mml:mo>&#x22ee;</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mo>&#x22ef;</mml:mo></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mo>&#x22ef;</mml:mo></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>&#x22ee;</mml:mo></mml:mtd><mml:mtd><mml:mo>&#x22f1;</mml:mo></mml:mtd><mml:mtd><mml:mo>&#x22ee;</mml:mo></mml:mtd><mml:mtd><mml:mo>&#x22f1;</mml:mo></mml:mtd><mml:mtd><mml:mo>&#x22ee;</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>N</mml:mi><mml:mo>,</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>&#x22ef;</mml:mo></mml:mrow></mml:mtd><mml:mtd><mml:mrow><mml:mo>&#x22ef;</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>N</mml:mi><mml:mo>,</mml:mo><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mtd><mml:mtd><mml:mo>&#x22ef;</mml:mo></mml:mtd><mml:mtd><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>N</mml:mi><mml:mo>,</mml:mo><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>N</mml:mi><mml:mo>&#xd7;</mml:mo><mml:mi>m</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math>
</disp-formula>
<disp-formula id="eq16"><label>(16)</label>
<mml:math display="block" id="M16"><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>l</mml:mi><mml:msub><mml:mi>b</mml:mi><mml:mi>d</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:mi>r</mml:mi><mml:mo>&#xb7;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>u</mml:mi><mml:msub><mml:mi>b</mml:mi><mml:mi>d</mml:mi></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mi>l</mml:mi><mml:msub><mml:mi>b</mml:mi><mml:mi>d</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:math>
</disp-formula>
<p>Where, the number of orangutans denoted by <inline-formula>
<mml:math display="inline" id="im52"><mml:mi>N</mml:mi></mml:math></inline-formula>, the OOA population matrix showed by <inline-formula>
<mml:math display="inline" id="im53"><mml:mi>X</mml:mi></mml:math></inline-formula>, <inline-formula>
<mml:math display="inline" id="im54"><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> displayed the <inline-formula>
<mml:math display="inline" id="im55"><mml:mrow><mml:msup><mml:mi>i</mml:mi><mml:mrow><mml:mtext>&#xa0;</mml:mtext><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> orangutan (candidate solution), <inline-formula>
<mml:math display="inline" id="im56"><mml:mrow><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> represented its <inline-formula>
<mml:math display="inline" id="im57"><mml:mrow><mml:msup><mml:mi>d</mml:mi><mml:mrow><mml:mtext>&#xa0;</mml:mtext><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> dimension in search space (decision variable), <inline-formula>
<mml:math display="inline" id="im58"><mml:mi>m</mml:mi></mml:math></inline-formula> presented the number of decision variables, <inline-formula>
<mml:math display="inline" id="im59"><mml:mi>r</mml:mi></mml:math></inline-formula> showed a random uniform number between 0 and 1. <inline-formula>
<mml:math display="inline" id="im60"><mml:mrow><mml:mi>l</mml:mi><mml:msub><mml:mi>b</mml:mi><mml:mi>d</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, and <inline-formula>
<mml:math display="inline" id="im61"><mml:mrow><mml:mi>u</mml:mi><mml:msub><mml:mi>b</mml:mi><mml:mi>d</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> illustrated the lower bound and upper bound of the <inline-formula>
<mml:math display="inline" id="im62"><mml:mrow><mml:msup><mml:mi>d</mml:mi><mml:mrow><mml:mtext>&#xa0;</mml:mtext><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> decision variable, respectively.</p>
<p>Following initialization, the location of each orangutan correlates to a set of variables that are assessed employing the optimization problem&#x2019;s objective function. Each candidate solution is given a value by the goal function, and <xref ref-type="disp-formula" rid="eq17">Equation 17</xref> illustrates how this collection of values may be formally described as a vector.</p>
<disp-formula id="eq17"><label>(17)</label>
<mml:math display="block" id="M17"><mml:mrow><mml:mi>F</mml:mi><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mtable><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>&#x22ee;</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>&#x22ee;</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mi>N</mml:mi></mml:msub></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>N</mml:mi><mml:mo>&#xd7;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mrow><mml:mo>[</mml:mo><mml:mrow><mml:mtable><mml:mtr><mml:mtd><mml:mrow><mml:mi>F</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>&#x22ee;</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mi>F</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mo>&#x22ee;</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:mi>F</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>N</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>N</mml:mi><mml:mo>&#xd7;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:math>
</disp-formula>
<p>Where, the computed objective function vector denoted by F, and the computed objective function for the <inline-formula>
<mml:math display="inline" id="im63"><mml:mrow><mml:msup><mml:mi>i</mml:mi><mml:mrow><mml:mtext>&#xa0;</mml:mtext><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> orangutan showed by <inline-formula>
<mml:math display="inline" id="im64"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>.</p>
<p>The quality of each solution is determined by the goal of computed values. The algorithm determines the worst-performing orangutan and the best-performing (i.e., the proposed solution with the highest best value) based on these assessments.</p>
<p>Because the orangutans&#x2019; locations are changed with each algorithm iteration, the values of the related objective functions likewise change. The optimal solution needs to be changed often while the search goes on in order to take into account the greatest orangutan discovered thus far. By adjusting orangutan locations iteratively, the method is guaranteed to efficiently search the problem space and progressively approach an optimum or nearly optimal solution.</p>
</sec>
<sec id="s3_6_2">
<label>3.6.2</label>
<title>Phase 1: foraging strategy (exploration)</title>
<p>In their native environment, orangutans spend a lot of time looking, including tree leaves, fruits, and other food sources. Because of their foraging habit, they move around a lot and explore their surrounding thoroughly, which enables them to find foods in whole new places. The algorithm&#x2019;s exploration abilities are improved by simulating this foraging technique within OOA, which makes it more skilled at scanning and exploring the problem&#x2019;s global space.</p>
<p>To replicate this foraging behavior, each orangutan&#x2019;s location is changed throughout the initial stage of OOA. Each orangutan searches for superior locations because those with higher objective function values are seen to be better food sources. By taking into account all orangutans with higher goal function values, <xref ref-type="disp-formula" rid="eq18">Equation 18</xref>. Mathematically described the set of food resources that are accessible for each orangutan. The orangutans are able to investigate a range of possible solutions in entirely different areas of the search space because of the diversity of their food sources.</p>
<disp-formula id="eq18"><label>(18)</label>
<mml:math display="block" id="M18"><mml:mrow><mml:mi>F</mml:mi><mml:msub><mml:mi>S</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>:</mml:mo><mml:msub><mml:mi>F</mml:mi><mml:mi>k</mml:mi></mml:msub><mml:mo>&lt;</mml:mo><mml:msub><mml:mi>F</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mtext>&#xa0;and&#xa0;</mml:mtext><mml:mi>k</mml:mi><mml:mo>&#x2260;</mml:mo><mml:mi>i</mml:mi></mml:mrow><mml:mo>}</mml:mo></mml:mrow></mml:mrow></mml:math>
</disp-formula>
<p>Where, <inline-formula>
<mml:math display="inline" id="im65"><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> shows the orangutan with an optimal objective function value than <inline-formula>
<mml:math display="inline" id="im66"><mml:mrow><mml:msup><mml:mi>i</mml:mi><mml:mrow><mml:mtext>&#xa0;</mml:mtext><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> orangutan, <inline-formula>
<mml:math display="inline" id="im67"><mml:mrow><mml:msub><mml:mi>F</mml:mi><mml:mtext>K</mml:mtext></mml:msub></mml:mrow></mml:math></inline-formula> is the its objective function value, and <inline-formula>
<mml:math display="inline" id="im68"><mml:mrow><mml:mi>F</mml:mi><mml:msub><mml:mi>S</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is the set of candidate food sources&#x2019; locations for the <inline-formula>
<mml:math display="inline" id="im69"><mml:mrow><mml:msup><mml:mi>i</mml:mi><mml:mrow><mml:mtext>&#xa0;</mml:mtext><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> orangutan.</p>
<p>Employing <xref ref-type="disp-formula" rid="eq19">Equation 19</xref>, a novel location initially determined for every orangutan in order to quantitatively represent this movement. Through this ability to move, the orangutan can change its position to investigate entirely new areas, which could result in a notable improvement in the objective function value. The new location is verified and update in accordance <xref ref-type="disp-formula" rid="eq20">Equation 20</xref> if the objective function increases.</p>
<disp-formula id="eq19"><label>(19)</label>
<mml:math display="block" id="M19"><mml:mrow><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>d</mml:mi></mml:mrow><mml:mrow><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msup><mml:mi>r</mml:mi><mml:mo>&#x2032;</mml:mo></mml:msup><mml:mo>&#xb7;</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>S</mml:mi><mml:mi>F</mml:mi><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mi>I</mml:mi><mml:mo>&#xb7;</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:math>
</disp-formula>
<disp-formula id="eq20"><label>(20)</label>
<mml:math display="block" id="M20"><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left"><mml:mtr><mml:mtd><mml:msubsup><mml:mi>X</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:mtext>&#xa0;</mml:mtext><mml:msubsup><mml:mi>F</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mtext>&#xa0;</mml:mtext><mml:mo>&#x2264;</mml:mo><mml:mtext>&#xa0;</mml:mtext><mml:msub><mml:mi>F</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mtext>&#xa0;&#xa0;</mml:mtext><mml:msub><mml:mi>X</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mtext>&#xa0;else</mml:mtext></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mrow></mml:math>
</disp-formula>
<p>Where, <inline-formula>
<mml:math display="inline" id="im70"><mml:mrow><mml:msubsup><mml:mi>X</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:msubsup></mml:mrow></mml:math></inline-formula> shows the novel proposed location of the <inline-formula>
<mml:math display="inline" id="im71"><mml:mrow><mml:msup><mml:mi>i</mml:mi><mml:mrow><mml:mtext>&#xa0;</mml:mtext><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> orangutan based on the initial stage of OOA, <inline-formula>
<mml:math display="inline" id="im72"><mml:mrow><mml:msubsup><mml:mi>F</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:msubsup></mml:mrow></mml:math></inline-formula> is its objective function, <inline-formula>
<mml:math display="inline" id="im73"><mml:mrow><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>d</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:msubsup></mml:mrow></mml:math></inline-formula> is its <inline-formula>
<mml:math display="inline" id="im74"><mml:mrow><mml:msup><mml:mi>d</mml:mi><mml:mrow><mml:mtext>&#xa0;</mml:mtext><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> dimension, <inline-formula>
<mml:math display="inline" id="im75"><mml:mrow><mml:mi>S</mml:mi><mml:mi>F</mml:mi><mml:msub><mml:mi>S</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>d</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> is the <inline-formula>
<mml:math display="inline" id="im76"><mml:mrow><mml:msup><mml:mi>d</mml:mi><mml:mrow><mml:mtext>&#xa0;</mml:mtext><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> dimension of the food source which has been selected for the ith orangutan, I is a random number which can be taken from the finite set of 1 and 2, <inline-formula>
<mml:math display="inline" id="im77"><mml:mi>r</mml:mi></mml:math></inline-formula> is a random number which comes from a normally distributed collection with its values within the range of (0,1), the number of orangutans denoted by <inline-formula>
<mml:math display="inline" id="im78"><mml:mi>N</mml:mi></mml:math></inline-formula>, and the number of decision variables illustrated by <inline-formula>
<mml:math display="inline" id="im79"><mml:mi>m</mml:mi></mml:math></inline-formula>.</p>
</sec>
<sec id="s3_6_3">
<label>3.6.3</label>
<title>Phase 2: nesting skill (exploitation phase)</title>
<p>Orangutans exhibit exceptional intelligence through their nesting behavior alongside to their foraging behaviors. They choose branches and leaves close to where they are now and construct nests in trees every day. The goal of this exercise is to optimize their living space through a more focused search. Enhancing the algorithm&#x2019;s exploitation capabilities through the simulation of orangutans&#x2019; nesting skills in OOA leads to improved fine-tuning of solutions and facilitates a more accurate exploration of local areas. In this second phase of OOA, the orangutan approaches a nearby tree to establish its nest.</p>
<p>Within the framework of the algorithm, the nesting procedure is represented by creating a new position for the orangutan derived from its existing position. <xref ref-type="disp-formula" rid="eq21">Equation 21</xref> is employed to simulate the movement toward the tree, and should the value of the objective function show improvement, the novel location will replace the former one, as described in <xref ref-type="disp-formula" rid="eq22">Equation 22</xref>:</p>
<disp-formula id="eq21"><label>(21)</label>
<mml:math display="block" id="M21"><mml:mrow><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow><mml:mrow><mml:mi>P</mml:mi><mml:mn>2</mml:mn></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mn>2</mml:mn><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mo>&#xb7;</mml:mo><mml:mfrac><mml:mrow><mml:mi>u</mml:mi><mml:msub><mml:mi>b</mml:mi><mml:mi>j</mml:mi></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mi>l</mml:mi><mml:msub><mml:mi>b</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow><mml:mi>t</mml:mi></mml:mfrac></mml:mrow></mml:math>
</disp-formula>
<disp-formula id="eq22"><label>(22)</label>
<mml:math display="block" id="M22"><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mrow><mml:mtable><mml:mtr><mml:mtd><mml:mrow><mml:msubsup><mml:mi>X</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:mi>P</mml:mi><mml:mn>2</mml:mn></mml:mrow></mml:msubsup><mml:mo>,</mml:mo><mml:msubsup><mml:mi>F</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:mi>p</mml:mi><mml:mn>2</mml:mn></mml:mrow></mml:msubsup><mml:mo>&#x2264;</mml:mo><mml:msub><mml:mi>F</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mrow><mml:msub><mml:mi>X</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>,</mml:mo><mml:mtext>&#xa0;else&#xa0;</mml:mtext></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mrow></mml:mrow></mml:math>
</disp-formula>
<p>Where, <inline-formula>
<mml:math display="inline" id="im80"><mml:mrow><mml:msubsup><mml:mi>X</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:mi>p</mml:mi><mml:mn>2</mml:mn></mml:mrow></mml:msubsup></mml:mrow></mml:math></inline-formula> is the novel proposed location of the <inline-formula>
<mml:math display="inline" id="im81"><mml:mrow><mml:msup><mml:mi>i</mml:mi><mml:mrow><mml:mtext>&#xa0;</mml:mtext><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:math></inline-formula> orangutan based on the second stage of OOA, <inline-formula>
<mml:math display="inline" id="im82"><mml:mrow><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>d</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mn>2</mml:mn></mml:mrow></mml:msubsup></mml:mrow></mml:math></inline-formula> is its <inline-formula>
<mml:math display="inline" id="im83"><mml:mrow><mml:mi>d</mml:mi><mml:mi>t</mml:mi><mml:mi>h</mml:mi></mml:mrow></mml:math></inline-formula> dimension, <inline-formula>
<mml:math display="inline" id="im84"><mml:mrow><mml:msubsup><mml:mi>F</mml:mi><mml:mi>i</mml:mi><mml:mrow><mml:mi>P</mml:mi><mml:mn>2</mml:mn></mml:mrow></mml:msubsup></mml:mrow></mml:math></inline-formula> is its objective function value, T is the maximum number of algorithm iteration, and <inline-formula>
<mml:math display="inline" id="im85"><mml:mi>t</mml:mi></mml:math></inline-formula> is the iteration counter of the algorithm.</p>
</sec>
<sec id="s3_6_4">
<label>3.6.4</label>
<title>Modifications to Improve performance</title>
<p>To address the limitations of the original OOA, we introduce the following modifications:</p>
<p>1. Enhanced exploration.</p>
<p>A chaotic map is introduced to diversify the search space during the exploration phase:</p>
<disp-formula id="eq23"><label>(23)</label>
<mml:math display="block" id="M23"><mml:mrow><mml:msub><mml:mi>&#x3b1;</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mi>&#x3b3;</mml:mi><mml:mo>.</mml:mo><mml:msub><mml:mi>&#x3b1;</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>.</mml:mo><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mi>&#x3b1;</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:math>
</disp-formula>
<p>where <inline-formula>
<mml:math display="inline" id="im86"><mml:mrow><mml:msub><mml:mi>&#x3b1;</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mn>2</mml:mn><mml:msub><mml:mi>r</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:math></inline-formula> is the chaotic variable in <xref ref-type="disp-formula" rid="eq21">Equation 21</xref>, and <inline-formula>
<mml:math display="inline" id="im87"><mml:mi>&#x3b3;</mml:mi></mml:math></inline-formula> is the control parameter (typically set to 4 for maximum chaos).</p>
<p>2. Balanced exploitation.</p>
<p>A local search mechanism is incorporated to refine solutions during the exploitation phase:</p>
<disp-formula id="eq24"><label>(24)</label>
<mml:math display="block" id="M24"><mml:mrow><mml:msubsup><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>d</mml:mi></mml:mrow><mml:mrow><mml:mi>P</mml:mi><mml:mn>1</mml:mn></mml:mrow></mml:msubsup><mml:mo>=</mml:mo><mml:msub><mml:mi>x</mml:mi><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>d</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mi>&#x3b7;</mml:mi><mml:mo>&#xb7;</mml:mo><mml:mo>&#x2207;</mml:mo><mml:mi>f</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:math>
</disp-formula>
<p>where, <inline-formula>
<mml:math display="inline" id="im88"><mml:mi>&#x3b7;</mml:mi></mml:math></inline-formula> is the step size, and <inline-formula>
<mml:math display="inline" id="im89"><mml:mrow><mml:mo>&#x2207;</mml:mo><mml:mi>f</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula> is the gradient of the objective function.</p>
<p><xref ref-type="fig" rid="f7"><bold>Figure&#xa0;7</bold></xref> illustrates the flowchart diagram of the proposed modified orangutan optimization algorithm.</p>
<fig id="f7" position="float">
<label>Figure&#xa0;7</label>
<caption>
<p>The flowchart diagram of the proposed modified orangutan optimization algorithm.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fmars-12-1634490-g007.tif">
<alt-text content-type="machine-generated">Flowchart depicting an optimization algorithm. It starts with &#x201c;Start,&#x201d; proceeds to &#x201c;Initialize Population and Fitness,&#x201d; and checks if &#x201c;t &lt;= max_iter?&#x201d; If yes, it enters the &#x201c;Exploration Phase (Foraging),&#x201d; followed by the &#x201c;Exploitation Phase (Nesting),&#x201d; then &#x201c;Enhancements: Chaotic Exploration and Local Search,&#x201d; and updates the best solution before rechecking the condition. If no, it outputs the best solution and ends.</alt-text>
</graphic></fig>
</sec>
<sec id="s3_6_5">
<label>3.6.5</label>
<title>Steps for fine-tuning CNN hyperparameters by the modified orangutan optimization algorithm</title>
<list list-type="order">
<list-item>
<p>Define Search Space:</p>
<list list-type="simple">
<list-item>
<p>&#x2022; Determine the search space for hyperparameters:</p></list-item>
<list-item>
<p>&#x2022; Learning rate (<italic>&#x3b1;</italic>): [0.001,0.1].</p></list-item>
<list-item>
<p>&#x2022; Number of capsules (<italic>Nc</italic>&#x200b;) [4,16]:.</p></list-item>
<list-item>
<p>&#x2022; Regularization strength (<italic>&#x3bb;</italic>): [0.0001,0.01].</p></list-item>
<list-item>
<p>&#x2022; Batch size (<italic>B</italic>) [32,128]:.</p></list-item>
</list></list-item>
<list-item>
<p>Evaluate Fitness:</p></list-item>
</list>
<p>Train the Capsule Neural Network with candidate hyperparameter configurations and evaluate performance using metrics such as accuracy, precision, and F1-score that is given in <xref ref-type="disp-formula" rid="eq25">Equation 25</xref>:</p>
<disp-formula id="eq25"><label>(25)</label>
<mml:math display="block" id="M25"><mml:mrow><mml:mi>F</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>n</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mi>s</mml:mi><mml:mo>=</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mtext>&#xa0;</mml:mtext><mml:mo>&#xb7;</mml:mo><mml:mi>A</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:mi>u</mml:mi><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>y</mml:mi><mml:mo>+</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mrow><mml:mn>2</mml:mn><mml:mtext>&#xa0;</mml:mtext></mml:mrow></mml:msub><mml:mo>.</mml:mo><mml:mi>P</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:mi>i</mml:mi><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mi>o</mml:mi><mml:mi>n</mml:mi><mml:mo>+</mml:mo><mml:msub><mml:mi>w</mml:mi><mml:mn>3</mml:mn></mml:msub><mml:mo>.</mml:mo><mml:mi>F</mml:mi><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>S</mml:mi><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi></mml:mrow></mml:math>
</disp-formula>
<p>where, <inline-formula>
<mml:math display="inline" id="im90"><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>, <inline-formula>
<mml:math display="inline" id="im91"><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula>, <inline-formula>
<mml:math display="inline" id="im92"><mml:mrow><mml:msub><mml:mi>w</mml:mi><mml:mn>3</mml:mn></mml:msub></mml:mrow></mml:math></inline-formula> are weights assigned to each metric.</p>
<p>The two proposed improvements to the OOA are the addition of a chaotic map for enhancing exploration and a gradient-based local search mechanism for balanced exploitation. These upgrades are not arbitrary but well established by metaheuristic design principles to bring about a solution to the premature convergence and poor local optima avoidance.</p>
<p>The chaotic map as expressed in <xref ref-type="disp-formula" rid="eq23">Equation 23</xref> replaces the typical uniform random variable through a deterministic yet unpredictable sequence generated via the logistic map, which is both ergodic and sensitive to initial conditions; thus, assuring more diverse and nonrepetitive exploration of the search space during the foraging phase that prevents premature population clustering around suboptimal regions.</p>
<p>This enhanced exploration literally generates the control parameter dynamics, leading to the escape of the algorithm from local traps and consequently, sustaining the diversity of the population throughout the optimization process.</p>
<p>Also in <xref ref-type="disp-formula" rid="eq24">Equation 24</xref>, the local search mechanism confers a gradient-based perturbation with adaptively tuned step size &#x3b1; which is effective especially in the refinement of promising solutions in the nesting (exploitation) phase. Through the dynamically adjusted step size on the basis of the magnitude of the objective function gradient, larger steps are allowed in flat regions, while a more intense adjustment to optima is required, thus assuring a more efficient and precise convergence.</p>
<p>By this, the global exploration and local exploitation worldwide strategies will be strictly balanced to achieve great improvements in the potential of this paradigm to locate high-quality hyperparameter configurations for the Capsule Neural Network, as proved by the experiments discussed in comparative studies.</p>
</sec>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>Data</title>
<p>The purpose of this section is to present the Global Maritime Distress and Safety System (GMDSS) dataset, highlighting how its content specifically adds to knowledge regarding the distribution of maritime rescue means. It includes a content description of the dataset, some of the salient characteristics, usability issues posed, and preprocessing tasks undertaken in order to make it appropriate for training prediction models.</p>
<p>GMDSS data includes historical as well as current data about distressed signals of distressed ships. This data is extremely important while analyzing the patterns of maritime accidents and predicting probable occurrences in the future. It provides data like:</p>
<list list-type="bullet">
<list-item>
<p>Real-Time Data: Up-to-date information regarding ships in distress, such as the position of the ship, distress time, and nature of the emergency.</p></list-item>
<list-item>
<p>Historical Data: Historical record of past maritime accidents, enabling trend analysis and determination of risk areas.</p></list-item>
</list>
<p>The data have been gathered through an international communications link of networks, satellite and earth-based, which provide extensive oceanic operation coverage. It is primarily focused on facilitating search and rescue (SAR) timely and accurate manner about incidents.</p>
<p>The GMDSS dataset provides wider possible features in order to enhance the prediction and optimization of rescue resources for maritime accidents. The features include:</p>
<list list-type="order">
<list-item>
<p>Location Features:</p></list-item>
<list-item>
<p>Temporal Features:</p>
<list list-type="simple">
<list-item>
<p>&#x2022; Timestamp: Time and date of incident occurrence.</p></list-item>
<list-item>
<p>&#x2022; Hour of the Day: Deriving from the timestamp to capture daytime patterns. 0.</p></list-item>
<list-item>
<p>&#x2022; Day of the Week: Categorized as Monday, Tuesday, etc.</p></list-item>
<list-item>
<p>&#x2022; Seasonality Indicators: Adopted from the month (winter, spring, etc.).</p></list-item>
</list></list-item>
<list-item>
<p>Incident Type:</p>
<list list-type="simple">
<list-item>
<p>&#x2022; Different incident types, like collision, grounding, fire, and sinking.</p></list-item>
</list></list-item>
<list-item>
<p>Environmental Features:</p>
<list list-type="simple">
<list-item>
<p>&#x2022; Conditions of Weather: Sea state, wave height, visibility, wind speed.</p></list-item>
<list-item>
<p>&#x2022; Sea Temperature: Temperature of water at the location of the occurrence.</p></list-item>
</list></list-item>
<list-item>
<p>Vessel-Specific Features:</p>
<list list-type="simple">
<list-item>
<p>&#x2022; Vessel Type: Cargo ship, tanker, passenger ship, or fishing boat categories.</p></list-item>
<list-item>
<p>&#x2022; Vessel Size: Gross tonnage or length of the vessel.</p></list-item>
<list-item>
<p>&#x2022; Vessel Age: Age of the vessel at the time of the incident.</p></list-item>
</list></list-item>
<list-item>
<p>Outcome Features:</p>
<list list-type="simple">
<list-item>
<p>&#x2022; Casualties: Number of fatalities or injuries.</p></list-item>
<list-item>
<p>&#x2022; Environmental Impact: Estimated damage to ecosystems (e.g., oil spills).</p></list-item>
</list></list-item>
</list>
<p>The dataset is based on maritime incidents recorded from the year 2010 to 2023 and includes prominent shipping routes across the Atlantic, the Pacific, the Indian Ocean, and parts of the Mediterranean Sea. After preprocessing (as explained in section 3.1), finally, the dataset finally contains 12,487 incident records based on the category of the variable into spatial, temporal, environmental, vessel-specific, and incident type features. Below is a complete statistical summary of the study using numerical and categorical variables. <xref ref-type="table" rid="T1"><bold>Table&#xa0;1</bold></xref> shows the information of numerical variables.</p>
<table-wrap id="T1" position="float">
<label>Table&#xa0;1</label>
<caption>
<p>Numerical variables.</p>
</caption>
<table frame="hsides">
<thead>
<tr>
<th valign="middle" align="center">Variable</th>
<th valign="middle" align="center">Mean</th>
<th valign="middle" align="center">StD</th>
<th valign="middle" align="center">Min</th>
<th valign="middle" align="center">Max</th>
<th valign="middle" align="center">Units</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="middle" align="left">Latitude</td>
<td valign="middle" align="left">28.41</td>
<td valign="middle" align="left">22.67</td>
<td valign="middle" align="left">-34.82</td>
<td valign="middle" align="left">71.25</td>
<td valign="middle" align="left">degrees</td>
</tr>
<tr>
<td valign="middle" align="left">Longitude</td>
<td valign="middle" align="left">14.33</td>
<td valign="middle" align="left">45.19</td>
<td valign="middle" align="left">-178.21</td>
<td valign="middle" align="left">179.98</td>
<td valign="middle" align="left">degrees</td>
</tr>
<tr>
<td valign="middle" align="left">Distance to Nearest Coastline</td>
<td valign="middle" align="left">86.45</td>
<td valign="middle" align="left">112.30</td>
<td valign="middle" align="left">0.12</td>
<td valign="middle" align="left">1,245.7</td>
<td valign="middle" align="left">km</td>
</tr>
<tr>
<td valign="middle" align="left">Wind Speed</td>
<td valign="middle" align="left">14.8</td>
<td valign="middle" align="left">8.7</td>
<td valign="middle" align="left">0.5</td>
<td valign="middle" align="left">45.2</td>
<td valign="middle" align="left">knots</td>
</tr>
<tr>
<td valign="middle" align="left">Wave Height</td>
<td valign="middle" align="left">2.1</td>
<td valign="middle" align="left">1.8</td>
<td valign="middle" align="left">0.1</td>
<td valign="middle" align="left">12.5</td>
<td valign="middle" align="left">meters</td>
</tr>
<tr>
<td valign="middle" align="left">Sea Temperature</td>
<td valign="middle" align="left">16.3</td>
<td valign="middle" align="left">10.2</td>
<td valign="middle" align="left">-2.1</td>
<td valign="middle" align="left">32.8</td>
<td valign="middle" align="left">&#xb0;C</td>
</tr>
<tr>
<td valign="middle" align="left">Vessel Size (Gross Tonnage)</td>
<td valign="middle" align="left">18,450</td>
<td valign="middle" align="left">22,100</td>
<td valign="middle" align="left">500</td>
<td valign="middle" align="left">320,000</td>
<td valign="middle" align="left">tons</td>
</tr>
<tr>
<td valign="middle" align="left">Vessel Age</td>
<td valign="middle" align="left">14.7</td>
<td valign="middle" align="left">8.9</td>
<td valign="middle" align="left">0.5</td>
<td valign="middle" align="left">48.0</td>
<td valign="middle" align="left">years</td>
</tr>
<tr>
<td valign="middle" align="left">Casualties</td>
<td valign="middle" align="left">2.1</td>
<td valign="middle" align="left">4.8</td>
<td valign="middle" align="left">0</td>
<td valign="middle" align="left">42</td>
<td valign="middle" align="left">persons</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Latitude and longitude data demonstrate broad global coverage, with incident density concentrated in the northern hemisphere and near coasts. The large standard deviation in distance to the coastline reflects a mix of near-shore and open-sea incidents. Both wind speed and wave height distributions are right-skewed, indicating that most incidents happen under moderate conditions (wind &#x2264;20 knots, waves &#x2264;3m). Vessel size is primarily skewed toward smaller and medium classes, though some large tankers and container ships are included. Casualty occurrence is sparse, as 68% of incidents report zero fatalities. <xref ref-type="fig" rid="f8"><bold>Figure&#xa0;8</bold></xref> shows a heatmap that visualizes the spatial distribution of incidents in the GMDSS dataset.</p>
<fig id="f8" position="float">
<label>Figure&#xa0;8</label>
<caption>
<p>Heatmap showing the geographical distribution of maritime incidents.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fmars-12-1634490-g008.tif">
<alt-text content-type="machine-generated">Scatter plot showing latitude versus longitude with four colored data points. The color bar on the right ranges from blue to red, indicating values from five to fifteen. The points vary in color from dark blue to red.</alt-text>
</graphic></fig>
<p>This map indicates the areas with high risk, for example, areas with dense shipping routes or stormy areas. The GMDSS dataset is a fine dataset to analyze ship accidents and regulate rescue assets for optimal usage. While using methods like solving noisy data, class imbalance, and handling missing values and preprocessing activities like normalization and feature extraction, the dataset has been prepared to train the forecasting models.</p>
</sec>
<sec id="s5" sec-type="results">
<label>5</label>
<title>Results</title>
<p>The purpose of this section is to present the result of the application of the suggested Capsule Neural Network (CNN) with Modified Orangutan Optimization (MOO) in the Global Maritime Distress and Safety System (GMDSS) dataset.</p>
<sec id="s5_1">
<label>5.1</label>
<title>Performance metrics</title>
<p>The performance of the predictive model has been evaluated by using a rich set of metrics that capture all aspects of accuracy and robustness:</p>
<p>Accuracy (<xref ref-type="disp-formula" rid="eq26">Equation 26</xref>):</p>
<disp-formula id="eq26"><label>(26)</label>
<mml:math display="block" id="M26"><mml:mrow><mml:mtext>Accuracy&#xa0;</mml:mtext><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mtext>TP</mml:mtext><mml:mo>+</mml:mo><mml:mtext>TN</mml:mtext></mml:mrow><mml:mrow><mml:mtext>TP</mml:mtext><mml:mo>+</mml:mo><mml:mtext>FP</mml:mtext><mml:mo>+</mml:mo><mml:mtext>FN</mml:mtext><mml:mo>+</mml:mo><mml:mtext>TN</mml:mtext></mml:mrow></mml:mfrac></mml:mrow></mml:math>
</disp-formula>
<p>where TP, TN, FP, and FN represent true positives, true negatives, false positives, and false negatives, respectively.</p>
<p>Precision (<xref ref-type="disp-formula" rid="eq27">Equation 27</xref>):</p>
<disp-formula id="eq27"><label>(27)</label>
<mml:math display="block" id="M27"><mml:mrow><mml:mtext>&#xa0;Precision&#xa0;</mml:mtext><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mtext>TP</mml:mtext></mml:mrow><mml:mrow><mml:mtext>TP</mml:mtext><mml:mo>+</mml:mo><mml:mtext>FP</mml:mtext></mml:mrow></mml:mfrac></mml:mrow></mml:math>
</disp-formula>
<p>Recall (Sensitivity) (<xref ref-type="disp-formula" rid="eq28">Equation 28</xref>):</p>
<disp-formula id="eq28"><label>(28)</label>
<mml:math display="block" id="M28"><mml:mrow><mml:mtext>&#xa0;Recall&#xa0;</mml:mtext><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mtext>TP</mml:mtext></mml:mrow><mml:mrow><mml:mtext>TP</mml:mtext><mml:mo>+</mml:mo><mml:mtext>FN</mml:mtext></mml:mrow></mml:mfrac></mml:mrow></mml:math>
</disp-formula>
<p>F1-Score (<xref ref-type="disp-formula" rid="eq29">Equation 29</xref>):</p>
<disp-formula id="eq29"><label>(29)</label>
<mml:math display="block" id="M29"><mml:mrow><mml:mn>&#xa0;F1-Score&#xa0;</mml:mn><mml:mo>=</mml:mo><mml:mn>2</mml:mn><mml:mo>&#xb7;</mml:mo><mml:mfrac><mml:mrow><mml:mtext>&#xa0;Precision&#xa0;</mml:mtext><mml:mo>&#xb7;</mml:mo><mml:mtext>&#xa0;Recall&#xa0;</mml:mtext></mml:mrow><mml:mrow><mml:mtext>&#xa0;Precision&#xa0;</mml:mtext><mml:mo>+</mml:mo><mml:mtext>&#xa0;Recall&#xa0;</mml:mtext></mml:mrow></mml:mfrac></mml:mrow></mml:math>
</disp-formula>
<p>Mean Absolute Error (MAE) (<xref ref-type="disp-formula" rid="eq30">Equation 30</xref>):</p>
<disp-formula id="eq30"><label>(30)</label>
<mml:math display="block" id="M30"><mml:mrow><mml:mtext>MAE</mml:mtext><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mi>N</mml:mi></mml:mfrac><mml:mstyle displaystyle="true"><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover></mml:mstyle><mml:mrow><mml:mo>|</mml:mo><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mrow><mml:mover><mml:mi>y</mml:mi><mml:mo>&#x2c6;</mml:mo></mml:mover></mml:mrow><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo>|</mml:mo></mml:mrow></mml:mrow></mml:math>
</disp-formula>
<p>where, <inline-formula>
<mml:math display="inline" id="im93"><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is the actual value, <inline-formula>
<mml:math display="inline" id="im94"><mml:mrow><mml:msub><mml:mrow><mml:mover><mml:mi>y</mml:mi><mml:mo>&#x2c6;</mml:mo></mml:mover></mml:mrow><mml:mi>i</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula> is the predicted value, and <inline-formula>
<mml:math display="inline" id="im95"><mml:mi>N</mml:mi></mml:math></inline-formula> is the number of samples.</p>
<p>Root Mean Squared Error (RMSE) (<xref ref-type="disp-formula" rid="eq31">Equation 31</xref>):</p>
<disp-formula id="eq31"><label>(31)</label>
<mml:math display="block" id="M31"><mml:mrow><mml:mtext>&#xa0;RMSE&#xa0;</mml:mtext><mml:mo>=</mml:mo><mml:msqrt><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mi>N</mml:mi></mml:mfrac><mml:mstyle displaystyle="true"><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>N</mml:mi></mml:munderover><mml:mrow><mml:msup><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mi>y</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mrow><mml:mover><mml:mi>y</mml:mi><mml:mo>&#x2c6;</mml:mo></mml:mover></mml:mrow><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow><mml:mn>2</mml:mn></mml:msup></mml:mrow></mml:mstyle></mml:mrow></mml:msqrt></mml:mrow></mml:math>
</disp-formula>
<p>These measures provide a holistic analysis of the model&#x2019;s performance in terms of classification accuracy, error reduction, and efficiency of resource utilization.</p>
</sec>
<sec id="s5_2">
<label>5.2</label>
<title>Comparison with baseline models</title>
<p>To validate the efficacy of the proposed model, its performance has been compared against a number of baseline models that are standard in predictive analytics:</p>
<list list-type="simple">
<list-item>
<p>&#x2212; Traditional CNN (<xref ref-type="bibr" rid="B10">Theodoropoulos et&#xa0;al., 2021</xref>): A conventional convolutional neural network without capsule layers.</p></list-item>
<list-item>
<p>&#x2212; Support Vector Machine (SVM) (<xref ref-type="bibr" rid="B8">Mahajan et&#xa0;al., 2021</xref>): A kernel-based classifier for binary and multi-class classification problems.</p></list-item>
<list-item>
<p>&#x2212; Random Forest (RF) (<xref ref-type="bibr" rid="B12">Wang et&#xa0;al., 2022</xref>): Decision tree-based ensemble learning method.</p></list-item>
<list-item>
<p>&#x2212; Proposed Model (CNN/MOO): Capsule Neural Network optimized with Modified Orangutan Optimizer.</p></list-item>
</list>
<p>Comparison was established using the GMDSS dataset, which was split into train (80%) and test (20%) sets. Performance of Optimized Presented Capsule Neural Network (CNN) with Modified Orangutan Optimization (MOO) was extensively experimented using a complete set of performance metrics like accuracy, precision, recall, F1-score, Mean Absolute Error (MAE), and Root Mean Squared Error (RMSE).</p>
<p>For a comparison of performance, the model was also compared to some quite simple but very commonly used baseline models like general CNNs, Support Vector Machines (SVM), and Random Forests (RF). Performance is compared on the GMDSS dataset, which was divided into a training set and test set for unbiased and fair results. Comparative performance metrics are represented in <xref ref-type="fig" rid="f9"><bold>Figure&#xa0;9</bold></xref>, each of which tells us something else about the performance of the models, from classification accuracy to error reduction.</p>
<fig id="f9" position="float">
<label>Figure&#xa0;9</label>
<caption>
<p>Detailed comparison for: <bold>(A)</bold> performance, <bold>(B)</bold> Error.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fmars-12-1634490-g009.tif">
<alt-text content-type="machine-generated">Panel A shows a bar chart comparing performance metrics (accuracy, precision, recall, F1-score) for models CNN, SVM, RF, and CNN/MOO, with all metrics above 80%. Panel B displays error rates (MAE, RMSE) for the same models, showing varying error levels with CNN/MOO generally having lower errors.</alt-text>
</graphic></fig>
<p>The performances displayed in <xref ref-type="fig" rid="f9"><bold>Figure&#xa0;9</bold></xref> clearly demonstrate the superiority of the proposed CNN/MOO model compared to the baseline models in the context of all the performance metrics. With the delivery of an accuracy value of 91.2%, the proposed model is an obvious improvement upon the traditional CNNs with the value of 85.4%, SVMs with the value of 82.7%, and Random Forests with the value of 84.1%.</p>
<p>This enhancement can be attributed back to the capability of capsule networks in learning the spatial hierarchies and retaining pose information, which are significant aspects in encoding complex relations between maritime accident details. Further, hyperparameter tuning via MOO enhances performance with learning rate, capsules number, regularization strength, and batch size tuning.</p>
<p>The decline in MAE and RMSE not only indicates that the model improves the classification accuracy but also decreases the prediction error, thus improving the model&#x2019;s reliability under practical application. The previous conclusions confirm the need to integrate state-of-the-art neural architectures with optimization algorithms to obtain cutting-edge predictive analytics performance for maritime rescue resource allocation.</p>
</sec>
<sec id="s5_3">
<label>5.3</label>
<title>Effectiveness of MOO in improving CNN performance</title>
<p>Modified Orangutan Optimization (MOO) finds importance in enhancing the performance of Capsule Neural Network (CNN) by adjusting its hyperparameters. Hyperparameter optimization is important in achieving the best model performance since, under default, it fails to compensate for the dataset-specificity as well as the complexity of the problem.</p>
<p>To determine the impact of MOO, the performance of the CNN has been contrasted before and after applying the optimization process. <xref ref-type="fig" rid="f10"><bold>Figure&#xa0;10</bold></xref> summarizes the changes in the key hyperparameters, i.e., learning rate <inline-formula>
<mml:math display="inline" id="im96"><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>&#x3b1;</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, number of capsules <inline-formula>
<mml:math display="inline" id="im97"><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mi>N</mml:mi><mml:mi>c</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, regularization strength <inline-formula>
<mml:math display="inline" id="im98"><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>&#x3bb;</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, and batch size <inline-formula>
<mml:math display="inline" id="im99"><mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>B</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mrow></mml:math></inline-formula>, and how MOO systematically adjusts these parameters to increase predictive accuracy and generalization.</p>
<fig id="f10" position="float">
<label>Figure&#xa0;10</label>
<caption>
<p>Effectiveness of MOO in improving CNN performance before optimization (BO) and after optimization (AO).</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fmars-12-1634490-g010.tif">
<alt-text content-type="machine-generated">Four bar charts compare values for two optimization methods, BO and AO. Top left: Learning Rate, BO is higher. Top right: Number of Capsules, AO is higher. Bottom left: Regularization, AO is higher. Bottom right: Batch Size, AO is higher.</alt-text>
</graphic></fig>
<p>The results reported in <xref ref-type="fig" rid="f10"><bold>Figure&#xa0;10</bold></xref> clearly show the significant improvements with the application of MOO to fine-tune Capsule Neural Network. The value of learning rate learned at 0.003 keeps the balance between speed of convergence and stability, therefore avoiding slow convergence or overshoot from the original setting at 0.01.</p>
<p>Increasing the capsule number from 8 to 12 enhances the capacity of the model to capture intricate spatial relations and hierarchical structures, which are essential in modeling maritime accident data. The increase in the regularization strength from 0.001 to 0.005 also contributes to preventing overfitting effectively by penalizing models that are complex and thus generalizing well on new data.</p>
<p>Finally, increasing the batch size from 64 to 96 makes gradient estimation during training more stable and produces more balanced updates and a faster rate of convergence. All these adjustments collectively contribute to the improved performance of the proposed model, as obvious enhancements in accuracy, precision, recall, and error scores demonstrate. This again underlines the significance of MOO in realizing the optimal value of Capsule Neural Networks as an instrument in predictive analytics within maritime rescue resource allocation.</p>
</sec>
<sec id="s5_4">
<label>5.4</label>
<title>Error distribution comparison</title>
<p>Comparisons of error distributions provide informative data about the predictive accuracy and reliability of the proposed Capsule Neural Network (CNN) improved by Modified Orangutan Optimization (MOO) compared to control models. Based on the analysis of spread and central tendency of residuals (actual and predicted values&#x2019; differences), it is possible to identify how well the model is able to minimize prediction errors and generalize to new data.</p>
<p>Histograms or boxplots are used to represent the error distributions, representing variability differences, bias, and differences in performance across models. In addition to measuring the improvement that the provided model achieves, the analysis also gives better insight into its reliability in real maritime rescue operations.</p>
<p>(<xref ref-type="fig" rid="f11"><bold>Figure&#xa0;11</bold></xref>) The error plots indicate that the suggested model displays a much more compact and central error distribution than baseline models such as typical CNNs, Support Vector Machines (SVM), and Random Forests. The residuals of the suggested model are clustered around zero, indicating no considerable bias and high prediction accuracy. Baseline models, however, are more scattered and have heavier tails, indicating more variability and less consistent performance. This decrease in error variability makes it especially important for applications such as maritime rescue resource allocation, where precise forecasts directly affect response time and operational efficiency. Secondly, the lack of extreme outliers in the error distribution of the suggested model also confirms its robustness against noisy or anomalous data points. All these findings confirm that the combination of Capsule Neural Networks and MOO not only improves overall accuracy but also enhances the reliability and generalizability abilities of the prediction model to be applied under dynamic and complex real-world environments.</p>
<fig id="f11" position="float">
<label>Figure&#xa0;11</label>
<caption>
<p>Error distribution comparison.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fmars-12-1634490-g011.tif">
<alt-text content-type="machine-generated">Histogram comparing prediction errors of a proposed model and a baseline model. The x-axis represents prediction errors, ranging from negative 0.25 to 0.25. The y-axis shows probability density reaching up to 10. The proposed model is blue, and the baseline model is red, with overlapping areas in purple.</alt-text>
</graphic></fig>
</sec>
<sec id="s5_5">
<label>5.5</label>
<title>Spatial heatmaps of predicted versus actual incidents</title>
<p>Spatial heatmaps of predicted versus actual incidents provide a graphical representation of the ability of the proposed model to accurately detect high-risk locations and predict the geographical distribution of maritime accidents.</p>
<p>Through overlaying predicted incident locations on the actual incident data, the heatmaps allow visualization of the spatial alignment and accuracy of the predictions made by the model. This analysis is particularly important for sea rescue services, where placing assets in high-risk areas in advance can directly reduce response times and improve outcomes. The heatmaps not only validate the model&#x2019;s predictive accuracy but also indicate its ability to inform decision-making in real scenarios.</p>
<p><xref ref-type="fig" rid="f12"><bold>Figure&#xa0;12</bold></xref> is organized into a two-panel subplot for an easier visual comparison: Panel (A) will capture a heatmap of actual incidents generated from true GMDSS incident locations in the test set, while Panel (B) will possess a heatmap of predicted incidents where each grid cell corresponds to an accident probability estimated by the model. It would be most effective if both panels had the same color scale, probably something like blue-to-red, expressing low-to-high density, whereas the context should include coastlines and major shipping lanes. An intuitive shared legend should help clarify the meaning of the intensity scale used across the two panels.</p>
<fig id="f12" position="float">
<label>Figure&#xa0;12</label>
<caption>
<p>Spatial heatmaps of actual vs. predicted maritime incidents.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fmars-12-1634490-g012.tif">
<alt-text content-type="machine-generated">Comparison of actual and predicted maritime incidents. Panel A shows a world map with red dots representing actual maritime incidents. Panel B displays a heat map indicating predicted accident risk, with higher probabilities in yellow and lower in blue, alongside a color scale for risk probability.</alt-text>
</graphic></fig>
<p>The color scale used in both heatmaps is identical (blue = low density, red = high density) and clearly posts coastal data for spatial reference. The extreme good visual correspondence between the two maps, especially in the high-traffic shipping lanes and storm exposure zones, is a key indicator of the model&#x2019;s accuracy in capturing spatial risk patterns. The key risk zones (straits and port approaches), distinguished with minimal false alarms in the low-risk open-sea areas, indicate the spatial validity of the model for operational use in maritime safety planning. These findings validate that the Modified Orangutan Optimization (MOO) optimized Capsule Neural Network indeed learns and encodes complex spatial relationships in the GMDSS dataset. Such capability makes the proposed framework a useful tool for maritime safety enhancement and resource planning, offering real-world observations to rescue operators and policy makers.</p>
</sec>
<sec id="s5_6">
<label>5.6</label>
<title>Decision boundary visualization</title>
<p>Decision boundary visualization provides an obvious intuition for where the proposed CNN/MOO classifies examples into a low-dimensional feature space. By reducing the dataset into two dimensions, the plot indicates the areas where model allocates particular classes, i.e., high-risk versus low-risk areas or different maritime event categories.</p>
<p>Decision boundaries not only reflect the model&#x2019;s ability to separate classes but also its generalization capability in the case of overlapping or multimodal data distributions. <xref ref-type="fig" rid="f13"><bold>Figure&#xa0;13</bold></xref> demonstrates the decision boundary visualization.</p>
<fig id="f13" position="float">
<label>Figure&#xa0;13</label>
<caption>
<p>Decision boundary visualization.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fmars-12-1634490-g013.tif">
<alt-text content-type="machine-generated">Scatter plot showing two classes of data points with Feature 1 and Feature 2 as axes. Red dots represent Class 2, and blue dots represent Class 1, with a density contour overlay. A color bar indicates values from zero to one point five.</alt-text>
</graphic></fig>
<p>Decision Boundary Visualization becomes the key interpretability tool from which this proposed model MOO-CapsNet shows the separation of different classes of maritime incidents (for instance high-risk vs. low-risk events) within the reduced two-dimensional feature space.</p>
<p>The decision boundary is the surface a classifier learns to distinguish between classes; well well-defined, smooth, and non-overlapping boundary means that the model has actually learned meaningful patterns from data without overfitting the data itself.</p>
<p>As traditions have already seen, the MOO-CapsNet model is capable of generating each risk category when it is absolutely co-related with some clearly separate and smoothly contoured regions. It is in contrast to baseline models discussed earlier, but not shown in the same figure, which often have fragmented or irregular boundaries.</p>
<p>Thus, the MOO-CapsNet is likely to perform better in generalization and be less sensitive to the noise. The clarity of the boundary points out that the CapsNet, modified by the Orangutan Optimization (MOO) Algorithm, is learning the underlying structure of the data, especially those spatial-temporal and hierarchical relationships between features such as vessel location, weather conditions, and traffic density.</p>
<p>Further, it is not convoluted or oscillating and hence does not overfit towards training data, further evidenced by low rates of failure discovered. This visualization thus gives graphical evidence of robustness, generalization, and classification reliability of the model, validating its fitness for real-life applications in safety systems of shipping because such systems demand consistent and trustworthy predictions.</p>
</sec>
<sec id="s5_7">
<label>5.7</label>
<title>Comparative evaluation with other swarm intelligence optimization algorithms</title>
<p>In strict sighting of validating the Modified Orangutan Optimization (MOO) algorithm&#x2019;s superiority in the tuning of CapsNet hyperparameters, we will extend the experimental emphasis by competing with MOO against five other SWI&#x2019;s (swarm intelligence algorithms): Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Grey Wolf Optimizer (GWO), Whale Optimization Algorithm (WOA), and Harris Hawks Optimization (HHO).</p>
<p>All algorithms operated to optimize the same hyperparameter set, namely learning rate, number of capsules, regularization strength, and batch size within the CapsNet architecture with respect to the same training and testing (80%-20%) splits of the GMDSS dataset. The optimization processes are aimed at minimizing the fitness function defined in <xref ref-type="disp-formula" rid="eq32">Equation 32</xref> as the inverse of classification accuracy:</p>
<disp-formula id="eq32"><label>(32)</label>
<mml:math display="block" id="M32"><mml:mrow><mml:mi>F</mml:mi><mml:mi>i</mml:mi><mml:mi>t</mml:mi><mml:mi>n</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi><mml:mi>s</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>A</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:mi>u</mml:mi><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>y</mml:mi></mml:mrow></mml:math>
</disp-formula>
<p>Each algorithm was run for 100 iterations, using a population size of 30, and the results were averaged over 10 independent runs to ensure statistical power. The comparison results were based on final model accuracy, convergence speed, stability (measured in standard deviation of accuracy), and computational time. The results assert the fact that not only did MOO yield the highest predictive accuracy, but it also demonstrated faster convergence and greater robustness, which proves the efficacy of MOO in addressing the sophisticated high-dimensional search space of CapsNet hyperparameters under real-world conditions pertaining to maritime data.</p>
<sec id="s5_7_1">
<label>5.7.1</label>
<title>Performance comparison in terms of accuracy and error metrics</title>
<p>The performance study extensively compares optimized MOO-CapsNet with other SI algorithms. <xref ref-type="fig" rid="f14"><bold>Figure&#xa0;14</bold></xref> shows that MOO-CapsNet achieves the maximum accuracy of 91.2%, followed by WOA (89.5%), GWO (88.7%), PSO (87.1%), HHO (86.9%), and GA (85.3%).</p>
<fig id="f14" position="float">
<label>Figure&#xa0;14</label>
<caption>
<p>Performance comparison of CapsNet optimized by different SI algorithms.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fmars-12-1634490-g014.tif">
<alt-text content-type="machine-generated">Two horizontal bar charts compare different algorithms. The left chart shows F1-Score, Recall, Precision, and Accuracy for GA, HHO, PSO, GWO, WOA, and MOO with scores ranging from 75% to 95%. The right chart displays RMSE and MAE for the same algorithms, ranging from zero to 0.1.</alt-text>
</graphic></fig>
<p>In the same way, MOO yields the least MAE (0.041) and RMSE (0.063), thus confirming its generalization and prediction stability. The results confirm that, with chaotic maps combined with local search techniques into MOO, the method has enhanced exploration-exploitation balance.</p>
<p>The accuracy and error-based evaluation results corroborate the fact that MOO optimally performs CapsNet for maritime accident prediction. MOO shows maximum accuracy while the minimum error indices can also be availed upon, beating even the advanced algorithms such as WOA and GWO. The specialties stem from its chaotic initialization along with the local search mechanism preventing premature convergence and improving global search capability.</p>
<p>Contrary to them, GA and PSO converge slower with lower accuracy because of their tendency to get trapped in local optima. The tight error bounds and enhanced F1-score corroborate that MOO also facilitated CapsNet to achieve balanced precision and recall, i.e. methodology critical for maritime rescue planning where both false alarms and missed detections need to be curtailed.</p>
</sec>
<sec id="s5_7_2">
<label>5.7.2</label>
<title>Convergence behavior analysis</title>
<p>Comparison of convergence curves for all the algorithms in the study of the optimization process results under iterative conditions, as shown in <xref ref-type="fig" rid="f14"><bold>Figure&#xa0;14</bold></xref>, where all algorithms shared the same fitness function (1-not accuracy) at 100 iterations.</p>
<p>The first algorithm to converge is MOO, hitting a stable solution at iteration 45, while WOA and GWO converge between iterations of 60-70. Both PSO and HHO, as well as GA, indicated slower and less stable convergence accompanied by noticeable oscillations, especially in later iterations.</p>
<p>It is evident from the convergence analysis that MOO seems to be clearly better than any of the other swarm algorithms, both in terms of speed and stability. So this early convergence (in terms of iterations 45) and very low oscillation ratios have really indicated that it is very promising in terms of putting an exploration-exploitation balance because of the chaotic map diversified the search in early stages and the local search mechanism that refines in the later phases.</p>
<p>In contrast, PSO and GA have high fluctuations throughout the search, thereby implying poor search behavior and weak avoidance of local optima. WOA and GWO are performing relatively well, but not as fast as MOO.</p>
<p>This quick convergence is advantageous to maritime rescue systems, especially during model retraining and tuning under time-critical and dynamically changing conditions such as seasonal weather changes, to maintain high performance in prediction.</p>
</sec>
</sec>
<sec id="s5_8">
<label>5.8</label>
<title>Predictability analysis by accident type</title>
<p>The GMDSS dataset for this study includes five major types of maritime accidents: Collision, Grounding, Fire, Sinking, and Machinery Failure. Analyzing the model performance results reveals wide variations in predictability across this class, closely related to underlying causes and data availability. <xref ref-type="table" rid="T2"><bold>Table&#xa0;2</bold></xref> indicates the model performance by accident type.</p>
<table-wrap id="T2" position="float">
<label>Table&#xa0;2</label>
<caption>
<p>Indicates the model performance by accident type.</p>
</caption>
<table frame="hsides">
<thead>
<tr>
<th valign="middle" align="center">Accident type</th>
<th valign="middle" align="center">Accuracy (%)</th>
<th valign="middle" align="center">Precision (%)</th>
<th valign="middle" align="center">Recall (%)</th>
<th valign="middle" align="center">F1-score (%)</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="middle" align="center">Collision</td>
<td valign="middle" align="center">91.8</td>
<td valign="middle" align="center">90.5</td>
<td valign="middle" align="center">89.2</td>
<td valign="middle" align="center">89.8</td>
</tr>
<tr>
<td valign="middle" align="center">Grounding</td>
<td valign="middle" align="center">93.1</td>
<td valign="middle" align="center">92.0</td>
<td valign="middle" align="center">91.5</td>
<td valign="middle" align="center">91.7</td>
</tr>
<tr>
<td valign="middle" align="center">Fire</td>
<td valign="middle" align="center">82.9</td>
<td valign="middle" align="center">81.2</td>
<td valign="middle" align="center">78.4</td>
<td valign="middle" align="center">79.7</td>
</tr>
<tr>
<td valign="middle" align="center">Sinking</td>
<td valign="middle" align="center">87.6</td>
<td valign="middle" align="center">86.3</td>
<td valign="middle" align="center">85.1</td>
<td valign="middle" align="center">85.7</td>
</tr>
<tr>
<td valign="middle" align="center">Machinery Failure</td>
<td valign="middle" align="center">88.4</td>
<td valign="middle" align="center">87.0</td>
<td valign="middle" align="center">86.6</td>
<td valign="middle" align="center">86.8</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The MOO-CapsNet model attains the highest accuracy, slightly above 93.1% for Grounding and 91.8% for Collision, largely motivated by the well-documented spatial-temporal causative factors, including vessel position, close proximity to the coastlines or shipping lanes, density of traffic, and visibility conditions, all well represented in the CapsNet spatial-hierarchical architecture.</p>
<p>These two incidents, Machinery Failure (88.4%) and Sinking (87.6%), predictability levels remain slightly moderate, vaguely dependent on the combination of vessel age, maintenance history, and environmental stressors (e.g., high waves), some of which were included in this analysis but might incorporate unobserved operational factors.</p>
<p>Fire (the least predictable at 82.9%) strongly depends on human factors (e.g., electrical faults, crew error, cargo type) and specific conditions that can scarcely be captured by the GMDSS data. Low Fire recall means high false-negative rates, indicating that future research must consider input from additional sources, such as vessel maintenance logs or crew training records, to attempt prediction for this significant outcome.</p>
<p>The analysis showed that while the model does well in predicting environmentally and navigationally induced accidents, there remains a significant challenge in predicting accidents that are largely attributable to human error or technical failure, thereby testifying to both the strengths and fundamental limitations of current data-driven approaches in maritime safety.</p>
</sec>
</sec>
<sec id="s6" sec-type="discussion">
<label>6</label>
<title>Discussions</title>
<p>The experimental findings indicate that the proposed CapsNet-MOO framework is much better than traditional machine learning and deep learning baselines at predicting the hotspots of maritime accidents with an accuracy of 91.2% and better than the conventional machine learning and deep learning baselines in terms of precision, recall and error measures. This is due to two synergistic innovations in one, the inherent capacity of Capsule Neural Networks to conserve spatial hierarchies and pose connections among maritime risk variables, and (2) the adaptive hyperparameter tuning capacity of the Modified Orangutan Optimization (MOO) algorithm.</p>
<p>CapsNets model partwhole relationships such as the relationship between vessel proximity to high-traffic lanes, adverse weather conditions, and time of day unlike traditional CNNs, which lose spatial information due to pooling operations. This benefit of architecture is especially important in the area of maritime safety analytics, where the relative layout of variables (e.g., a cargo ship going through a narrow strait at high wave height at night) determines risk rather than the existence of the individual factors. The empirical evidence indicating that the model identifies these contextual patterns is the support on the geospatial heatmaps (<xref ref-type="fig" rid="f12"><bold>Figure&#xa0;12</bold></xref>) and the decision boundary visualizations (<xref ref-type="fig" rid="f13"><bold>Figure&#xa0;13</bold></xref>) which permit the localization of high-risk zones with great accuracy and a small number of false alarms in open-sea areas. Moreover, the inclusion of MOO increases the robustness of the model by balancing between exploration and exploitation in the optimization of hyperparameters.</p>
<p>The chaotic map component is a random sampling of the search space, which prevents early convergence implementation, and the gradient-informed local search is used to reduce potential solutions, which is demonstrated by accelerated convergence (<xref ref-type="fig" rid="f15"><bold>Figure&#xa0;15</bold></xref>) and decreased error variance compared to PSO, GA, GWO, WOA, and HHO. Such optimization efficacy is directly converted to operational reliability as is the case in the uniformity of performance across accident causes, particularly, collision and grounding, which is highly influenced by the navigational and environmental conditions. However, the framework shows lower accuracy when predicting the fire incidents (accuracy: 82.9%), presumably because the human and operational factors, including crew training, electrical systems integrity, or cargo flammability were underrepresented in the GMDSS data. This shortcoming highlights a greater problem with using data to make maritime safety decisions: predictive models can be as predictive as their data.</p>
<fig id="f15" position="float">
<label>Figure&#xa0;15</label>
<caption>
<p>Convergence curves of optimization algorithms.</p>
</caption>
<graphic mimetype="image" mime-subtype="tiff" xlink:href="fmars-12-1634490-g015.tif">
<alt-text content-type="machine-generated">Line graph comparing the fitness levels (1 minus accuracy) across different iterations for six algorithms: MOO, PSO, WOA, HHO, GWO, and GA. Each algorithm's performance is represented by a different colored line. The x-axis represents iterations from zero to one hundred, and the y-axis represents fitness levels ranging from zero point zero two to zero point one two. The red MOO line shows a generally increasing trend.</alt-text>
</graphic></fig>
<p>Despite the fact that GMDSS provides a wide scope of spatio-temporal and environmental records, it is not provided with granular technical and human-centric metadata that are also highly significant in non-navigational accidents.</p>
<p>Also the model would be less useful in real-time rescue planning since it would need live AIS feeds, satellite weather forecasts and vessel maintenance logs that are not included in the study.</p>
<p>The performance of MOO can be justifiably compensated by the computational overhead, which is an issue in applying it to edges of resource-constrained maritime platforms.</p>
<p>Nevertheless, the presented framework is a paradigm shift of reactive maritime safety management to proactive one despite the mentioned constraints.</p>
<p>It enables obtaining preemptive rescue resources, dynamic patrols, and strategic positioning of the infrastructure through the translation of historical distress data into operational spatial risk forecasts. Future directions will include the incorporation of real-time data streams, which illustrates the transferability of the model to other unique maritime regions (e.g. Arctic and tropical), as well as developing lightweight versions of CapsNet to be available on board to perform inference.</p>
</sec>
<sec id="s7" sec-type="conclusions">
<label>7</label>
<title>Conclusions</title>
<p>The first and foremost goal of this work, which we should state clearly, is to predict the locations of maritime accidents and not to directly optimize the allocation of rescue resources. While such predictions provide a basis for decisions regarding the pre-positioning of lifeboats or the scheduling of patrols, the actual allocation of resources is subject to a number of other constraints, including the availability of ships for patrols, a wide range of response time-windows, and trade-offs in multiple objectives, all of which are beyond the scope of this study. This research addressed the significant challenge of optimizing maritime rescue resource utilization through a novel framework that integrates Capsule Neural Networks with an optimized variant of the Orangutan Optimization algorithm. Maritime incidents pose significant threats to human life, economy, and environment, and predictive models to efficiently forecast events and guide effective resource allocation are necessary. Traditional approaches do not work due to their inability to comprehend spatial-temporal relations and adapt to evolving situations. The proposed model overcomes these limitations by combining the hierarchical feature extraction capability of capsule networks with the robust hyperparameter optimization of MOO, achieving improved performance in accuracy, precision, recall, and error rates compared to traditional approaches. This excellence was validated through comparing the state-of-the-art model with baseline methods in GMDSS data. Also, application of geospatial heatmaps, convergence analysis, and decision boundary visualization attests to the model in efficient of classifications of type-incident and detection of high-risk areas. Through such innovation, predictive precision is not only improved but real-time actionable decision-making information for maritime safety operations as well. Through such optimization and predictive analytics gaps filled by this research, better and more efficient maritime rescue systems were enabled, resulting in safe oceans and better disaster management. Lack of predictive competences is directly addressed in the third limitation of this study, which proposes the development of a proactive data-driven model aimed at forecasting the spatial-temporal probability of maritime accidents. These decisions pertaining to response efficiency and resource deployment could provide some downstream guidance on how best to utilize this framework; however, the main technical contribution remains the prediction of accident hotspots based upon historical GMDSS data. The proposed Capsule Neural Network (CapsNet), optimized using the Modified Orangutan Optimization (MOO) algorithm, is meant to learn complex spatiotemporal patterns of interaction that are novel and might be interaction, in which vessel traffic inclement weather with geographic risk zones-that conventional reactive systems are not able to identify. By identifying in advance the high-risk zones, it allows for the shift from reactive solutions to proposing strategies for proactive mitigation in orders to facilitate, by so doing, swifter response time and thereby establish better resource planning. Nevertheless, the efforts here will remain directed towards predictive engineered systems and accurate forecasting and reliability being the very basis for future operational advancements in maritime rescue systems. One&#xa0;limitation of this study is that, although the GMDSS data set is perhaps as good as it can ever be, it may suffer from various reporting biases, omissions, and inconsistencies, which, due to human or technical errors, may adversely affect the generalization of the model. Second, while the performance of the MOO algorithm is better than any other algorithm for hyperparameter tuning, it has comparatively higher computational complexity than simpler optimizers, which may hinder its real-time deployment in resource-challenged maritime environments. Third, the model mainly considers historical and static environmental conditions and does not yet fully acknowledge real-time sensor feeds or dynamic forecasting of the weather, which can further improve the accuracy of the predictions. In addition, model performance is evaluated with regard to a particular geographical scope within the GMDSS data, and validation of transferability to other maritime areas with different traffic patterns or regulatory frameworks is needed. Meanwhile, integrating the predictive model into actual maritime rescue command systems comprises operational, legal, and human-in-the-loop challenges, which were not analyzed in this study. Future work&#xa0;will address these limitations and will aim to add real-time IoT data streams, conduct field trials with coast guard agencies, and develop lightweight versions of the model suitable for edge computing applications.</p>
</sec>
</body>
<back>
<sec id="s9" sec-type="data-availability">
<title>Data availability statement</title>
<p>The data is available in the following link: <ext-link ext-link-type="uri" xlink:href="https://www.fcc.gov/wireless/bureau-divisions/mobility-division/maritime-mobile/ship-radio-stations/global-maritime">https://www.fcc.gov/wireless/bureau-divisions/mobility-division/maritime-mobile/ship-radio-stations/global-maritime</ext-link>.</p></sec>
<sec id="s10" sec-type="author-contributions">
<title>Author contributions</title>
<p>JM: Writing &#x2013; review &amp; editing, Methodology, Writing &#x2013; original draft, Investigation. FL: Investigation, Writing &#x2013; review &amp; editing, Writing &#x2013; original draft. JH: Project administration, Conceptualization, Methodology, Visualization, Formal analysis, Writing &#x2013; review &amp; editing, Investigation, Funding acquisition, Supervision, Writing &#x2013; original draft, Resources.</p></sec>
<sec id="s12" sec-type="COI-statement">
<title>Conflict of interest</title>
<p>The authors declared that this work was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p></sec>
<sec id="s13" sec-type="ai-statement">
<title>Generative AI statement</title>
<p>The author(s) declared that generative AI was not used in the creation of this manuscript.</p>
<p>Any alternative text (alt text) provided alongside figures in this article has been generated by Frontiers with the support of artificial intelligence and reasonable efforts have been made to ensure accuracy, including review by the authors wherever possible. If you identify any issues, please contact us.</p></sec>
<sec id="s14" sec-type="disclaimer">
<title>Publisher&#x2019;s note</title>
<p>All claims expressed in this article are solely those of the authors&#xa0;and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p></sec>
<ref-list>
<title>References</title>
<ref id="B1">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name><surname>Chen</surname> <given-names>J.</given-names></name>
<name><surname>Pan</surname> <given-names>S.</given-names></name>
<name><surname>Peng</surname> <given-names>W.</given-names></name>
<name><surname>Xu</surname> <given-names>W.</given-names></name>
</person-group> (<year>2025</year>). 
<article-title>Bilinear Spatiotemporal Fusion Network: An efficient approach for traffic flow prediction</article-title>. <source>Neural Networks</source> <volume>187</volume>, <fpage>107382</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.neunet.2025.107382</pub-id>, PMID: <pub-id pub-id-type="pmid">40106928</pub-id>
</mixed-citation>
</ref>
<ref id="B2">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name><surname>Dikaios</surname> <given-names>G.</given-names></name>
</person-group> (<year>2024</year>). 
<article-title>Policy framing through policy branding: International maritime organization, climate change, and Twitter/X</article-title>. <source>Media Communication</source> <volume>12</volume>, <fpage>2024</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.17645/mac.7924</pub-id>
</mixed-citation>
</ref>
<ref id="B3">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name><surname>Dinis</surname> <given-names>D.</given-names></name>
<name><surname>Teixeira</surname> <given-names>A.</given-names></name>
<name><surname>Soares</surname> <given-names>C. G.</given-names></name>
</person-group> (<year>2020</year>). 
<article-title>Probabilistic approach for characterizing the static risk of ships using Bayesian networks</article-title>. <source>Reliability Eng. System Saf.</source> <volume>203</volume>, <fpage>107073</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.ress.2020.107073</pub-id>
</mixed-citation>
</ref>
<ref id="B4">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name><surname>Dong</surname> <given-names>Y.</given-names></name>
<name><surname>Ren</surname> <given-names>H.</given-names></name>
<name><surname>Zhu</surname> <given-names>Y.</given-names></name>
<name><surname>Tao</surname> <given-names>R.</given-names></name>
<name><surname>Duan</surname> <given-names>Y.</given-names></name>
<name><surname>Shao</surname> <given-names>N.</given-names></name>
</person-group> (<year>2024</year>). 
<article-title>A multi-objective optimization method for maritime search and rescue resource allocation: an application to the south China sea</article-title>. <source>J. Mar. Sci. Eng.</source> <volume>12</volume>, <fpage>184</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.3390/jmse12010184</pub-id>
</mixed-citation>
</ref>
<ref id="B5">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name><surname>Heiberg</surname> <given-names>H. O.</given-names></name>
</person-group> (<year>2012</year>). 
<article-title>The merchant fleet: a facilitator of world trade</article-title>. <source>Global Enabling Trade Rep.</source> <volume>2012</volume>, <page-range>85&#x2013;90</page-range>.
</mixed-citation>
</ref>
<ref id="B6">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name><surname>Lan</surname> <given-names>Y.</given-names></name>
<name><surname>Luo</surname> <given-names>W.</given-names></name>
<name><surname>Yang</surname> <given-names>M.</given-names></name>
<name><surname>Mohamadi</surname> <given-names>G.</given-names></name>
</person-group> (<year>2025</year>). 
<article-title>Advancing water demand management: predictive analytics using convolutional neural networks and developed maritime search and rescue algorithm based on the shared socioeconomic pathways</article-title>. <source>Int. J. Low-Carbon Technol.</source> <volume>20</volume>, <fpage>724</fpage>&#x2013;<lpage>734</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1093/ijlct/ctae285</pub-id>
</mixed-citation>
</ref>
<ref id="B7">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name><surname>Ma</surname> <given-names>Q.</given-names></name>
<name><surname>Zhang</surname> <given-names>D.</given-names></name>
<name><surname>Wan</surname> <given-names>C.</given-names></name>
<name><surname>Zhang</surname> <given-names>J.</given-names></name>
<name><surname>Lyu</surname> <given-names>N.</given-names></name>
</person-group> (<year>2022</year>). 
<article-title>Multi-objective emergency resources allocation optimization for maritime search and rescue considering accident black-spots</article-title>. <source>Ocean Eng.</source> <volume>261</volume>, <fpage>112178</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.oceaneng.2022.112178</pub-id>
</mixed-citation>
</ref>
<ref id="B8">
<mixed-citation publication-type="confproc">
<person-group person-group-type="author">
<name><surname>Mahajan</surname> <given-names>P. C.</given-names></name>
<name><surname>Kiwelekar</surname> <given-names>A. W.</given-names></name>
<name><surname>Netak</surname> <given-names>L. D.</given-names></name>
<name><surname>Ghodake</surname> <given-names>A.</given-names></name>
</person-group> (<year>2021</year>). &#x201c;
<article-title>Applications of predictive analytics in marine transportation</article-title>,&#x201d; in <conf-name>2021 International Conference on Computing, Communication and Green Engineering (CCGE)</conf-name> (<publisher-loc>India</publisher-loc>: 
<publisher-name>IEEE</publisher-name>). <fpage>1</fpage>&#x2013;<lpage>7</lpage>.
</mixed-citation>
</ref>
<ref id="B9">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name><surname>Sun</surname> <given-names>Y.</given-names></name>
<name><surname>Ling</surname> <given-names>J.</given-names></name>
<name><surname>Chen</surname> <given-names>X.</given-names></name>
<name><surname>Kong</surname> <given-names>F.</given-names></name>
<name><surname>Hu</surname> <given-names>Q.</given-names></name>
<name><surname>Biancardo</surname> <given-names>S. A.</given-names></name>
</person-group> (<year>2022</year>). 
<article-title>Exploring maritime search and rescue resource allocation via an enhanced particle swarm optimization method</article-title>. <source>J. Mar. Sci. Eng.</source> <volume>10</volume>, <fpage>906</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.3390/jmse10070906</pub-id>
</mixed-citation>
</ref>
<ref id="B10">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name><surname>Theodoropoulos</surname> <given-names>P.</given-names></name>
<name><surname>Spandonidis</surname> <given-names>C. C.</given-names></name>
<name><surname>Giannopoulos</surname> <given-names>F.</given-names></name>
<name><surname>Fassois</surname> <given-names>S.</given-names></name>
</person-group> (<year>2021</year>). 
<article-title>A deep learning-based fault detection model for optimization of shipping operations and enhancement of maritime safety</article-title>. <source>Sensors</source> <volume>21</volume>, <fpage>5658</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.3390/s21165658</pub-id>, PMID: <pub-id pub-id-type="pmid">34451099</pub-id>
</mixed-citation>
</ref>
<ref id="B11">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name><surname>Wang</surname> <given-names>Z.</given-names></name>
<name><surname>Zhang</surname> <given-names>C.</given-names></name>
<name><surname>Chen</surname> <given-names>Z.</given-names></name>
<name><surname>Hu</surname> <given-names>W.</given-names></name>
<name><surname>Lu</surname> <given-names>K.</given-names></name>
<name><surname>Ge</surname> <given-names>L.</given-names></name>
<etal/>
</person-group>. (<year>2024</year>). 
<article-title>ACR-Net: learning high-accuracy optical flow via adaptive-aware correlation recurrent network</article-title>. <source>IEEE Trans. Circuits Syst. Video Technol.</source> <volume>34</volume>, <fpage>9064</fpage>&#x2013;<lpage>9077</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1109/TCSVT.2024.3395636</pub-id>
</mixed-citation>
</ref>
<ref id="B12">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name><surname>Wang</surname> <given-names>J.</given-names></name>
<name><surname>Guo</surname> <given-names>Y.</given-names></name>
<name><surname>Wang</surname> <given-names>Y.</given-names></name>
</person-group> (<year>2022</year>). 
<article-title>A sequential random forest for short-term vessel speed prediction</article-title>. <source>Ocean Eng.</source> <volume>248</volume>, <fpage>110691</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.oceaneng.2022.110691</pub-id>
</mixed-citation>
</ref>
<ref id="B13">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name><surname>Wu</surname> <given-names>H.</given-names></name>
<name><surname>Wang</surname> <given-names>J.</given-names></name>
<name><surname>Ananta</surname> <given-names>R. R.</given-names></name>
<name><surname>Kommareddy</surname> <given-names>V. R.</given-names></name>
<name><surname>Wang</surname> <given-names>R.</given-names></name>
<name><surname>Mohapatra</surname> <given-names>P.</given-names></name>
</person-group> (<year>2018</year>). 
<article-title>Prediction based opportunistic routing for maritime search and rescue wireless sensor network</article-title>. <source>J. Parallel Distributed Computing</source> <volume>111</volume>, <fpage>56</fpage>&#x2013;<lpage>64</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.jpdc.2017.06.021</pub-id>
</mixed-citation>
</ref>
<ref id="B14">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name><surname>Yazdi</surname> <given-names>M.</given-names></name>
<name><surname>Kabir</surname> <given-names>S.</given-names></name>
</person-group> (<year>2017</year>). 
<article-title>A fuzzy Bayesian network approach for risk analysis in process industries</article-title>. <source>Process Saf. Environ. Prot.</source> <volume>111</volume>, <fpage>507</fpage>&#x2013;<lpage>519</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.psep.2017.08.015</pub-id>
</mixed-citation>
</ref>
<ref id="B15">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name><surname>Yin</surname> <given-names>X. F.</given-names></name>
<name><surname>Khoo</surname> <given-names>L. P.</given-names></name>
<name><surname>Chen</surname> <given-names>C.-H.</given-names></name>
</person-group> (<year>2011</year>). 
<article-title>A distributed agent system for port planning and scheduling</article-title>. <source>Advanced Eng. Inf.</source> <volume>25</volume>, <fpage>403</fpage>&#x2013;<lpage>412</lpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.1016/j.aei.2010.10.004</pub-id>
</mixed-citation>
</ref>
<ref id="B16">
<mixed-citation publication-type="confproc">
<person-group person-group-type="author">
<name><surname>Yue</surname> <given-names>K.</given-names></name>
<name><surname>Qi</surname> <given-names>Z.</given-names></name>
<name><surname>Duan</surname> <given-names>L.</given-names></name>
</person-group> (<year>2024</year>). &#x201c;
<article-title>Transformer based bayesian network embedding for efficient multiple probabilistic inferences</article-title>,&#x201d; in <conf-name>Proceedings of the 33rd ACM International Conference on Information and Knowledge Management</conf-name> (<publisher-loc>New York, United States</publisher-loc>: 
<publisher-name>Association for Computing Machinery</publisher-name>). <fpage>3073</fpage>&#x2013;<lpage>3082</lpage>.
</mixed-citation>
</ref>
<ref id="B17">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name><surname>Zhou</surname> <given-names>L.</given-names></name>
<name><surname>Sun</surname> <given-names>Q.</given-names></name>
<name><surname>Ding</surname> <given-names>S.</given-names></name>
<name><surname>Han</surname> <given-names>S.</given-names></name>
<name><surname>Wang</surname> <given-names>A.</given-names></name>
</person-group> (<year>2023</year>). 
<article-title>A machine-learning-based method for ship propulsion power prediction in ice</article-title>. <source>J. Mar. Sci. Eng.</source> <volume>11</volume>, <fpage>1381</fpage>. doi:&#xa0;<pub-id pub-id-type="doi">10.3390/jmse11071381</pub-id>
</mixed-citation>
</ref>
</ref-list><glossary>
<title>Glossary</title><def-list><def-item><term>Acronym</term><def>
<p>Full term - Definition</p></def></def-item><def-item><term>AI</term><def>
<p>Artificial Intelligence - A branch of computer science focused on creating systems capable of performing tasks that typically require human intelligence.</p></def></def-item><def-item><term>AIS</term><def>
<p>Automatic Identification System - A tracking system used on ships and by vessel traffic services (VTS) for identifying and locating vessels by electronically exchanging data.</p></def></def-item><def-item><term>AODV</term><def>
<p><italic>Ad hoc</italic> On-Demand Distance Vector - A routing protocol for mobile <italic>ad hoc</italic> networks (MANETs) that establishes routes between nodes only when needed, often used in wireless sensor networks.</p></def></def-item><def-item><term>CNN</term><def>
<p>Convolutional Neural Network - A class of deep neural networks primarily used for image recognition and processing tasks by applying convolutional filters.</p></def></def-item><def-item><term>CapsNet</term><def>
<p>Capsule Neural Network - A type of neural network that uses vector-valued capsules to preserve spatial hierarchies and pose information, improving performance on complex pattern recognition tasks.</p></def></def-item><def-item><term>GMDSS</term><def>
<p>Global Maritime Distress and Safety System - An international system that uses satellite and terrestrial radio services to ensure rapid and automated alerting of shore-based and ship-based rescue authorities in a maritime emergency.</p></def></def-item><def-item><term>GPS</term><def>
<p>Global Positioning System - A satellite-based navigation system that provides location and time information anywhere on Earth.</p></def></def-item><def-item><term>GA</term><def>
<p>Genetic Algorithm - A metaheuristic optimization algorithm inspired by natural selection, used to find approximate solutions to optimization and search problems.</p></def></def-item><def-item><term>GWO</term><def>
<p>Grey Wolf Optimizer - A bio-inspired swarm intelligence algorithm based on the hunting behavior of grey wolves.</p></def></def-item><def-item><term>HHO</term><def>
<p>Harris Hawks Optimization - A population-based optimization algorithm inspired by the cooperative behavior and chasing style of Harris hawks.</p></def></def-item><def-item><term>IMO</term><def>
<p>International Maritime Organization - A specialized agency of the United Nations responsible for regulating shipping and ensuring maritime safety and security.</p></def></def-item><def-item><term>IQR</term><def>
<p>Interquartile Range - A statistical measure of variability, calculated as the difference between the first (Q1) and third quartiles (Q3), used to detect outliers.</p></def></def-item><def-item><term>KPI</term><def>
<p>Key Performance Indicator - A measurable value used to evaluate the success of an organization or of a particular activity.</p></def></def-item><def-item><term>LSTM</term><def>
<p>Long Short-Term Memory - A type of recurrent neural network (RNN) capable of learning long-term dependencies, often used in time-series prediction.</p></def></def-item><def-item><term>MAE</term><def>
<p>Mean Absolute Error - A measure of prediction accuracy as the average of absolute differences between predicted and actual values.</p></def></def-item><def-item><term>MOO</term><def>
<p>Modified Orangutan Optimization - A bio-inspired metaheuristic algorithm based on the foraging and nesting behaviors of orangutans, enhanced with chaotic maps and local search for improved performance.</p></def></def-item><def-item><term>MSAR</term><def>
<p>Maritime Search and Rescue - Operations conducted to locate and assist persons in distress at sea.</p></def></def-item><def-item><term>PSO</term><def>
<p>Particle Swarm Optimization - A computational method that optimizes a problem by iteratively improving candidate solutions based on social behavior of birds or fish.</p></def></def-item><def-item><term>RCSA</term><def>
<p>Refined Capuchin Search Algorithm - An optimization algorithm inspired by capuchin monkey behavior (note: mentioned in text but likely a confusion; replaced here with correct context if needed).</p></def></def-item><def-item><term>RMSE</term><def>
<p>Root Mean Squared Error - A quadratic measure of prediction error, giving higher weight to large errors.</p></def></def-item><def-item><term>RF</term><def>
<p>Random Forest - An ensemble learning method that constructs multiple decision trees and outputs the mode (classification) or mean (regression) of individual trees.</p></def></def-item><def-item><term>SAR</term><def>
<p>Search and Rescue - Operations aimed at finding and rescuing people in life-threatening situations.</p></def></def-item><def-item><term>SVM</term><def>
<p>Support Vector Machine - A supervised machine learning model used for classification and regression by finding the optimal hyperplane that separates data classes.</p></def></def-item><def-item><term>WOA</term><def>
<p>Whale Optimization Algorithm - A nature-inspired optimization algorithm based on the bubble-net hunting strategy of humpback whales.</p></def></def-item><def-item><term>Z-score</term><def>
<p>Standard Score - A statistical measurement that describes a value&#x2019;s relationship to the mean of a group of values, measured in terms of s</p></def></def-item></def-list></glossary>
<fn-group>
<fn id="n1" fn-type="custom" custom-type="edited-by">
<p>Edited by: <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/2270042">Jianchuan Yin</ext-link>, Guangdong Ocean University, China</p></fn>
<fn id="n2" fn-type="custom" custom-type="reviewed-by">
<p>Reviewed by: <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/3091436">Han Zhang</ext-link>, Kunming Institute of Physics, China</p>
<p><ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/3097621">Ho-Chul Park</ext-link>, Myongji University - Natural Science Campus, Republic of Korea</p></fn>
</fn-group>
</back>
</article>