Search Results (596)

This study proposes a biomimetic optimization approach for maritime Search and Rescue (SAR) planning using a Genetic Algorithm (GA). The goal is to maximize the number of detected drifting targets by optimally deploying both official and civilian Search and Rescue Units (SRUs). The proposed method incorporates a POD-adjusted fitness function with collision-avoidance constraints and is enhanced by a greedy initialization strategy. To validate its effectiveness, we compare the GA against a baseline method (EAGD) that combines a (1 + 1)-Evolutionary Algorithm with greedy deployment, across 24 experiments involving 2 realistic maritime scenarios and 12 coverage conditions. Results show that GA consistently achieves higher average fitness and stability, particularly under stress-test settings involving only civilian vessels. The findings underscore the potential of biomimetic algorithms for real-time, flexible, and scalable SAR planning, while highlighting the value of civilian participation in emergency maritime operations. Full article

Robots play a crucial role in experimental smart cities and are ubiquitous in daily life, especially in complex environments where multiple robots are often needed to solve problems collaboratively. Researchers have found that the swarm intelligence optimization algorithm has a better performance in planning robot paths, but the traditional swarm intelligence algorithm cannot be targeted to solve the robot path planning problem in difficult problem. Therefore, this paper aims to introduce a fuzzy controller, mutation factor, exponential noise, and other strategies on the basis of particle swarm optimization to solve this problem. By judging the moving speed of different particles at different periods of the algorithm, the individual learning factor and social learning factor of the particles are obtained by fuzzy controller, and using the leader particle and random particle, designing a new dynamic balance of mutation factor, with the iterative process of the adaptation value of continuous non-updating counter and continuous updating counter to control the proportion of the elite individuals and random individuals. Finally, using exponential noise to update the matrix of the population every 50 iterations is a way to balance the local search ability and global exploration ability of the algorithm. In order to test the proposed algorithm, the main method of this paper is simulated on simple scenarios, complex scenarios, and random maps consisting of different numbers of static obstacles and dynamic obstacles, and the algorithm proposed in this paper is compared with eight other algorithms. The average path deviation error of the planned paths is smaller; the average distance of untraveled target is shorter; the number of steps of the robot movements is smaller, and the path is shorter, which is superior to the other eight algorithms. This superiority in solving multi-robot cooperative path planning has good practicality in many fields such as logistics and distribution, industrial automation operation, and so on. Full article

The strategic development of the low-altitude economy requires efficient urban logistics solutions. The existing Unmanned Aerial Vehicle (UAV) truck delivery system faces severe challenges in dealing with dynamic weather constraints and multi-agent coordination. This article proposes a neural network-based optimisation framework that integrates constrained K-means clustering and a three-stage neural architecture. In this work, a mathematical model for heterogeneous vehicle constraints considering time windows and UAV energy consumption is developed, and it is validated through reference to the Solomon benchmark’s arithmetic examples. Experimental results show that the Truck–Drone Cooperative Traveling Salesman Problem (TDCTSP) model reduces the cost by 21.3% and the delivery time variance by 18.7% compared to the truck-only solution (Truck Traveling Salesman Problem (TTSP)). Improved neural network (INN) algorithms are also superior to the traditional genetic algorithm (GA) and Adaptive Large Neighborhood Search (ALNS) methods in terms of the quality of computed solutions. This research provides an adaptive solution for intelligent low-altitude logistics, which provides a theoretical basis and practical tools for the development of urban air traffic under environmental uncertainty. Full article

Predictive maintenance (PdM) is a cornerstone of smart manufacturing, enabling the early detection of equipment degradation and reducing unplanned downtimes. This study proposes an advanced machine learning framework that integrates the Extreme Learning Machine (ELM) with a novel hybrid metaheuristic optimization algorithm, the Polar Lights Salp Cooperative Optimizer (PLSCO), to enhance predictive modeling in manufacturing processes. PLSCO combines the strengths of the Polar Light Optimizer (PLO), Competitive Swarm Optimization (CSO), and Salp Swarm Algorithm (SSA), utilizing a cooperative strategy that adaptively balances exploration and exploitation. In this mechanism, particles engage in a competitive division process, where winners intensify search via PLO and losers diversify using SSA, effectively avoiding local optima and premature convergence. The performance of PLSCO was validated on CEC2015 and CEC2020 benchmark functions, demonstrating superior convergence behavior and global search capabilities. When applied to a real-world predictive maintenance dataset, the ELM-PLSCO model achieved a high prediction accuracy of 95.4%, outperforming baseline and other optimization-assisted models. Feature importance analysis revealed that torque and tool wear are dominant indicators of machine failure, offering interpretable insights for condition monitoring. The proposed approach presents a robust, interpretable, and computationally efficient solution for predictive maintenance in intelligent manufacturing environments. Full article

To address the logistical challenges of traffic congestion and environmental concerns associated with carbon emissions in last-mile delivery, this paper explores the potential of vehicle–drone cooperative delivery. The existing studies are predominantly confined to single-drone scenarios, failing to simultaneously consider the constraints of drone payload capacity and endurance. This limitation leads to task allocation imbalance in large-scale customer deliveries and low distribution efficiency. Firstly, a mathematical model for vehicle–multi-drone collaborative delivery with payload and endurance constraint (VMDCD-PEC) is proposed. Secondly, an improved genetic algorithm (IGA) is developed, as follows: 1. designing a hybrid selection strategy to achieve symmetrical equilibrium between exploration and exploitation by adjusting the weights of dynamic fitness–distance balance, greedy selection, and random selection; and 2. introducing the local search operator composed of gene sequence reversal, single-gene slide-down, and random half-swap to improve the neighborhood quality solution mining efficiency. Finally, the experimental results show that compared with a traditional genetic algorithm (GA) and adaptive large neighborhood search (ALNS), the IGA requires less time to find solutions in various test cases and reduces the average cost of the optimal solution by up to 30%. In addition, an analysis of drone payload sensitivity showed that drone payload capacity is negatively correlated with delivery time, and that larger customer sizes corresponded to higher sensitivity. Full article

This paper addresses the core issues of slow coverage rate growth and high repeated detection rates in multi-UAV cooperative search operations within unknown areas. A distributed cooperative search algorithm based on the maximum entropy mechanism is proposed to resolve these challenges. It innovatively integrates the entropy gradient decision framework with DMPC-OODA (Distributed Model Predictive Control-Observe, Orient, Decide, Act) rolling optimization: environmental uncertainty is quantified through an exponential decay entropy model to drive UAVs to migrate toward high-entropy regions; element-wise product operations are employed to efficiently update environmental maps; and a dynamic weight function is designed to adaptively adjust the weights of coverage gain and entropy gain, thereby balancing “rapid coverage” and “accurate exploration”. Through multiple independent repeated experiments, the algorithm demonstrates significant improvements in coverage efficiency—by 6.95%, 12.22%, and 59.49%, respectively—compared with the Search Intent Interaction (SII) mode, non-entropy mode, and random mode, which effectively enhances resource utilization. Full article

Efficient surface water allocation in reservoir-equipped basins is essential for balancing competing demands within the Water–Energy–Food (WEF) nexus. This study investigated the applicability of Particle Swarm Optimization (PSO) for optimizing water distribution in the Machángara River Basin, Ecuador; a complex, constraint-rich hydrological system. Implemented via the Pymoo package in Python, the PSO model was evaluated across calibration, validation, and execution phases, and benchmarked against exact methods, including Linear Programming (LP) and Mixed Integer Linear Programming (MILP). The results revealed that standard PSO struggled to satisfy equality constraints and yielded suboptimal solutions, with elevated penalty costs. Despite incorporating MILP-inspired encoding and repair functions, the algorithm failed to identify feasible solutions that met operational requirements. The execution phase, which includes reservoir construction decisions, resulted in a total penalty exceeding EUR 164.95 billion, with no improvement observed from adding reservoirs. Comparative analysis confirmed that LP and MILP outperformed PSO in constraint compliance and penalty minimization. Nonetheless, the study contributes a reproducible implementation framework and a comprehensive benchmarking strategy, including synthetic test functions, performance metrics, and diagnostic visualizations. These tools can facilitate systematic evaluation of PSO’s behavior in high-dimensional, nonlinear environments and provide a foundation for future hybrid or adaptive heuristic models. The findings underscore the limitations of standard PSO in hydrological optimization but also highlight its potential when enhanced through hybridization. Future research should explore PSO variants that integrate exact solvers, adaptive control mechanisms, or cooperative search strategies to improve feasibility and convergence. This work advances the methodological understanding of metaheuristics in environmental resource management and supports the development of robust optimization tools under the WEF-nexus paradigm. Full article

The Parrot Optimization Algorithm (PO) represents a contemporary nature-inspired metaheuristic technique formulated through observations of Pyrrhura Molinae parrot behavioral patterns. PO exhibits effective optimization capabilities by achieving equilibrium between exploration and exploitation phases through mimicking foraging behaviors and social interactions. Nevertheless, during iterative progression, the algorithm encounters significant obstacles in preserving population diversity and experiences declining search effectiveness, resulting in early convergence and diminished capacity to identify optimal solutions within intricate optimization landscapes. To overcome these constraints, this work presents the Adaptive Differentiated Parrot Optimization Algorithm (ADPO), which constitutes a substantial enhancement over baseline PO through the implementation of three innovative mechanisms: Mean Differential Variation (MDV), Dimension Learning-Based Hunting (DLH), and Enhanced Adaptive Mutualism (EAM). The MDV mechanism strengthens the exploration capabilities by implementing dual-phase mutation strategies that facilitate extensive search during initial iterations while promoting intensive exploitation near promising solutions during later phases. Additionally, the DLH mechanism prevents premature convergence by enabling dimension-wise adaptive learning from spatial neighbors, expanding search diversity while maintaining coordinated optimization behavior. Finally, the EAM mechanism replaces rigid cooperation with fitness-guided interactions using flexible reference solutions, ensuring optimal balance between intensification and diversification throughout the optimization process. Collectively, these mechanisms significantly improve the algorithm’s exploration, exploitation, and convergence capabilities. Furthermore, ADPO’s effectiveness was comprehensively assessed using benchmark functions from the CEC2017 and CEC2022 suites, comparing performance against 12 advanced algorithms. The results demonstrate ADPO’s exceptional convergence speed, search efficiency, and solution precision. Additionally, ADPO was applied to wind power forecasting through integration with Long Short-Term Memory (LSTM) networks, achieving remarkable improvements over conventional approaches in real-world renewable energy prediction scenarios. Specifically, ADPO outperformed competing algorithms across multiple evaluation metrics, achieving average R² values of 0.9726 in testing phases with exceptional prediction stability. Moreover, ADPO obtained superior Friedman rankings across all comparative evaluations, with values ranging from 1.42 to 2.78, demonstrating clear superiority over classical, contemporary, and recent algorithms. These outcomes validate the proposed enhancements and establish ADPO’s robustness and effectiveness in addressing complex optimization challenges. Full article

In swarm robotics, collective transport refers to the cooperative movement of a large object by multiple small robots, each with limited individual capabilities such as sensing, mobility, and communication. When working together, however, these simple agents can achieve complex tasks. This study explores a collective transport method based on the caging approach, which involves surrounding the object in a way that restricts its movement while still allowing limited motion, effectively preventing escape from the robot formation. The proposed approach is structured into four main phases: locating the object, recruiting additional robots, forming an initial cage around the object, and finally, performing the transportation. The method is tested using simulations in the CoppeliaSim environment, employing a team of Khepera-III robots. Performance metrics include execution time for the search and recruitment phases, and both execution time and trajectory accuracy, via a normalized error, for the transport phase. To further validate the method, a comparison is made between the caging-based strategy and a traditional pushing strategy. Full article

Core problems in agile software project scheduling, such as resource-constrained balancing and iteration cycle optimization, embody the pursuit of symmetry. Simultaneously, optimization algorithms find extensive applications in symmetry problems, for example, in graphs and pattern recognition. Considering the cooperation among multiple teams and environmental changes in complex agile software development, a dynamic periodic scheduling model for multi-team agile software project is constructed, which includes three tightly coupled sub-problems, namely user story selection, user story-development team allocation, and task-employee allocation. To solve the model, a group learning particle swarm optimization algorithm is proposed, which includes three novel strategies. First, the population is divided into four groups based on dual indicators of objective values and potential values. Second, different learning objects are selected according to the characteristic of each group so that the search diversity can be improved. Third, to react to the environmental changes and enhance the mining ability, heuristic population initialization and local search strategies are designed by utilizing the problem-specific information. Systematic experimental results on 13 instances indicate that compared with the state-of-the-art algorithms, the proposed algorithm is able to provide a schedule with better precision for the project manager in each sprint of the agile development. Full article

To address challenges in automated charging operations of bulk explosive trucks in open-pit mines—specifically difficulties in borehole identification, positioning inaccuracies, and low operational efficiency—this study proposes an intelligent collaborative charging system integrating three modular components: (1) an explosive transport vehicle (with onboard terminal, explosive compartment, and mobility system enabling optimal routing and quantitative dispensing), (2) a charging robot (equipped with borehole detection, loading mechanisms, and mobility system for optimized search path planning and precision positioning), and (3) interconnection systems (coupling devices and interfaces facilitating auxiliary explosive transfer). This approach resolves three critical limitations of conventional systems: (i) mechanical arm-based borehole detection difficulties, (ii) blast hole positioning inaccuracies, and (iii) complex transport routing. The experimental results demonstrate that the intelligent cooperative charging method for open-pit mines achieves an 18% improvement in operational efficiency through intelligent collaboration among its modular components, while simultaneously realizing automated and intelligent charging operations. This advancement has significant implications for promoting intelligent development in open-pit mining operations. Full article

To address the shortcomings of poor convergence and the ease of falling into local optima when using the traditional gold rush optimization (GRO) algorithm to solve the complex scheduling problem of a combined cooling, heating, and power (CCHP) microgrid system, an optimal scheduling model for a microgrid based on the improved gold rush optimization (IGRO) algorithm is proposed. First, the Halton sequence is introduced to initialize the population, ensuring a uniform and diverse distribution of prospectors, which enhances the algorithm’s global exploration capability. Then, a dynamically adaptive weighting factor is applied during the gold mining phase, enabling the algorithm to adjust its strategy across different search stages by balancing global exploration and local exploitation, thereby improving the convergence efficiency of the algorithm. In addition, a weighted global optimal solution update strategy is employed during the cooperation phase, enhancing the algorithm’s global search capability while reducing the risk of falling into local optima by adjusting the balance of influence between the global best solution and local agents. Finally, a t-distribution mutation strategy is introduced to improve the algorithm’s local search capability and convergence speed. The IGRO algorithm is then applied to solve the microgrid scheduling problem, with the objective function incorporating power purchase and sale cost, fuel cost, maintenance cost, and environmental cost. The example results show that, compared with the GRO algorithm, the IGRO algorithm reduces the average total operating cost of the microgrid by 3.29%, and it achieves varying degrees of cost reduction compared to four other algorithms, thereby enhancing the system’s economic benefits. Full article

Precise odor source localization in turbulent and sparse environments plays a vital role in enabling robotic systems for hazardous chemical monitoring and effective disaster response. To address this, we propose Cooperative Gravitational-Rényi Infotaxis (CGRInfotaxis), a distributed decision-optimization framework that combines multi-agent collaboration with hybrid cognitive strategy to improve search efficiency and robustness. The method integrates a gravitational potential field for rapid source convergence and Rényi divergence-based probabilistic exploration to handle sparse detections, dynamically balanced via a regulation factor. Particle filtering optimizes posterior probability estimation to autonomously refine search areas while preserving computational efficiency, alongside a distributed interactive-optimization mechanism for real-time decision updates through agent cooperation. The algorithm’s performance is evaluated in scenarios with fixed and randomized odor source locations, as well as with varying numbers of agents. Results demonstrate that CGRInfotaxis achieves a near-100% success rate with high consistency across diverse conditions, outperforming existing methods in stability and adaptability. Increasing the number of agents further enhances search efficiency without compromising reliability. These findings suggest that CGRInfotaxis significantly advances multi-agent odor source localization in turbulent, sparse environments, offering practical utility for real-world applications. Full article

Due to the limited endurance of UAVs, especially in scenarios involving large areas and dense target nodes, it is challenging for multiple UAVs to complete diverse tasks while ensuring timely execution. Toward this, we propose a cross-platform system consisting of an aircraft carrier (AC) and multiple UAVs, which makes unified task planning for included heterogeneous platforms to maximize the efficiency of the entire combat system. The carrier-based UAV swarm mission planning problem is formulated to minimize completion time and resource utilization, taking into account large-scale targets, multi-type tasks, and multi-obstacle environments. Since the problem is complex, we design a decoupled framework to simplify the solution by decomposing it into two levels: upper-level AC path planning and bottom-level multi-UAV cooperative mission planning. At the upper level, a drop point determination method and a discrete genetic algorithm incorporating improved A* (DGAIIA) are proposed to plan the AC’s path in the presence of no-fly zones and radar threats. At the bottom level, an improved differential evolution algorithm with a market mechanism (IDEMM) is proposed to minimize task completion time and maximize UAV utilization. Specifically, a dual-switching search strategy and a neighborhood-first buying-and-selling mechanism are developed to improve the search efficiency of the IDEMM. Simulation results validate the effectiveness of both the DGAIIA and IDEMM. An animation of the simulation results is available at simulation section. Full article

Unmanned aerial vehicles (UAVs), commonly known as drones, offer unprecedented flexibility for complex missions such as area surveillance, search and rescue, and cooperative inspection. This paper presents a unified evaluation framework for the comparison of centralized and distributed task allocation algorithms specifically tailored to multi-UAV operations. We first contextualize the classical assignment problem (AP) under UAV mission constraints, including the flight time, propulsion energy capacity, and communication range, and evaluate optimal one-to-one solvers including the Hungarian algorithm, the Bertsekas $ϵ$-auction algorithm, and a minimum cost maximum flow formulation. To reflect the dynamic, uncertain environments that UAV fleets encounter, we extend our analysis to distributed multi-UAV task allocation (MUTA) methods. In particular, we examine the consensus-based bundle algorithm (CBBA) and a distributed auction 2-opt refinement strategy, both of which iteratively negotiate task bundles across UAVs to accommodate real-time task arrivals and intermittent connectivity. Finally, we outline how reinforcement learning (RL) can be incorporated to learn adaptive policies that balance energy efficiency and mission success under varying wind conditions and obstacle fields. Through simulations incorporating UAV-specific cost models and communication topologies, we assess each algorithm’s mission completion time, total energy expenditure, communication overhead, and resilience to UAV failures. Our results highlight the trade-off between strict optimality, which is suitable for small fleets in static scenarios, and scalable, robust coordination, necessary for large, dynamic multi-UAV deployments. Full article