Search Results (51)

In response to the low efficiency of collaborative processing of sewing machine cases at the part level in network collaborative manufacturing, this paper proposes a sewing machine cases manufacturing service composition optimization method based on an improved multi-objective artificial hummingbird algorithm. The structure and production process of sewing machine cases are analyzed; a framework for service composition optimization in the sewing machine cases manufacturing service platform is established; the required manufacturing resource service composition is determined; and a dual-objective service composition optimization mathematical model that considers Quality of Service (QoS) indicators and flexibility indicators is constructed. Opposition-based learning strategies, roulette wheel selection strategies, and improved differential evolution strategies are embedded in the multi-objective artificial hummingbird algorithm, and the improved artificial hummingbird algorithm (ORAHA_DE) is used to solve the sewing machine cases manufacturing service composition optimization model. The experimental results show the effectiveness and superiority of this composition optimization method in solving the sewing machine cases manufacturing composition optimization problem while avoiding entrapment in a local optimum during the solution process, thereby achieving the composition optimization of sewing machine cases collaborative manufacturing services. Full article

As network scale and demand rise, the Uncapacitated Facility Location Problem (UFLP), a classical NP-hard problem widely studied in operations research, becomes increasingly challenging for traditional methods confined to formulation, construction, and benchmarking. This work generalizes the UFLP to network setting in light of demand intensity and network topology. A new initialization technique called Network- and Demand-Weighted Roulette Wheel Initialization (NDWRWI) has been introduced and proved to be a competitive alternative to random (RI) and greedy initializations (GI). Experiments were carried out based on the TRB dataset and compared eight state-of-the-art methods. For instance, in the ultra-large-scale Gold Coast network, the NDWRWI-based Neighborhood Search (NS) achieved a competitive optimal total cost (9,372,502), closely comparable to the best-performing baseline (RI-based: 9,189,353), while delivering superior clustering quality (Silhouette: 0.3859 vs. 0.3833 and 0.3752 for RI- and GI-based NS, respectively) and reducing computational time by nearly an order of magnitude relative to the GI-based baseline. Similarly, NDWRWI-based Variable Neighborhood Search (VNS) improved upon RI-based baseline by reducing the overall cost by approximately 3.67%, increasing clustering quality and achieving a 27% faster runtime. It is found that NDWRWI prioritizes high-demand and centrally located nodes, fostering high-quality initial solutions and robust performance across large-scale and heterogeneous networks. Full article

(1) Background: Cultural heritage plays a vital role in shaping collective identity and supporting tourism, yet it faces increasing threats from natural and human-induced disasters. As a response, digital technologies—especially drone-based monitoring systems—are being explored for disaster prevention. This study examines whether a Genetic Algorithm can effectively optimize the placement of drone stations for the economic protection of cultural heritage. (2) Method: A simulation was conducted in a 2500 km² virtual space divided into 25 km² grid units, each assigned a random land price. Drone stations have an operational radius of 40 km. GA optimization uses a fitness function based on the ratio of cultural artifacts covered to installation cost. To prevent premature convergence, multi-point crossover and roulette wheel selection are employed. Key GA parameters were fine-tuned through repeated simulations. (3) Results: The optimal parameter set—population size of 300, mutation rate of 0.2, mutation strength of ±5 km, and crossover ratio of 0.3—balances exploration and convergence. The results show convergence toward low-cost, high-coverage locations without premature stagnation. Visualization clearly illustrates the optimization process. (4) Conclusions: GA proves effective for economically optimizing drone station placement. Though virtual, this method offers practical implications for real-world cultural heritage protection strategies. Full article

The Parrot Optimizer (PO) is a new optimization algorithm based on the behaviors of trained Pyrrhura Molinae parrots. In this paper, an improved PO (IPO) is proposed for solving global optimization problems and training the multilayer perceptron. The basic PO is enhanced by using three improvements, which are aerial search strategy, modified staying behavior, and improved communicating behavior. The aerial search strategy is derived from Arctic Puffin Optimization and is employed to enhance the exploration ability of PO. The staying behavior and communicating behavior of PO are modified using random movement and roulette fitness–distance balance selection methods to achieve a better balance between exploration and exploitation. To evaluate the optimization performance of the proposed IPO, twelve CEC2022 test functions and five standard classification datasets are selected for the experimental tests. The results between IPO and the other six well-known optimization algorithms show that IPO has superior performance for solving complex global optimization problems. The results between IPO and the other six well-known optimization algorithms show that IPO has superior performance for solving complex global optimization problems. In addition, IPO has been applied to optimize a multilayer perceptron model for classifying the oral English teaching quality evaluation dataset. An MLP model with a 10-21-3 structure is constructed for the classification of evaluation outcomes. The results show that IPO-MLP outperforms other algorithms with the highest classification accuracy of 88.33%, which proves the effectiveness of the developed method. Full article

The remanufacturing of end-of-life products is an effective approach to alleviating resource shortages, environmental pollution, and global warming. As the initial step in the remanufacturing process, the quality and efficiency of disassembly have a decisive impact on the entire workflow. However, the complexity of product structures poses numerous challenges to practical disassembly operations. These challenges include not only conventional precedence constraints among disassembly tasks but also sequential dependencies, where interference between tasks due to their execution order can prolong operation times and complicate the formulation of disassembly plans. Additionally, the inherent uncertainties in the disassembly process further affect the practical applicability of disassembly plans. Therefore, developing reliable disassembly plans must fully consider both sequential dependencies and uncertainties. To this end, this paper employs a chance-constrained programming model to characterise uncertain information and constructs a multi-objective sequence-dependent disassembly line balancing (MO-SDDLB) problem model under uncertain environments. The model aims to minimise the hazard index, workstation time variance, and energy consumption, achieving a multi-dimensional optimisation of the disassembly process. To efficiently solve this problem, this paper designs an innovative multi-objective adaptive large neighbourhood search (MO-ALNS) algorithm. The algorithm integrates three destruction and repair operators, combined with simulated annealing, roulette wheel selection, and local search strategies, significantly enhancing solution efficiency and quality. Practical disassembly experiments on a lithium-ion battery validate the effectiveness of the proposed model and algorithm. Moreover, the proposed MO-ALNS demonstrated a superior performance compared to other state-of-the-art methods. On average, against the best competitor results, MO-ALNS improved the number of Pareto solutions (NPS) by approximately 21%, reduced the inverted generational distance (IGD) by about 21%, and increased the hypervolume (HV) by nearly 8%. Furthermore, MO-ALNS exhibited a superior stability, providing a practical and feasible solution for disassembly optimisation. Full article

Images serve as significant conduits of information and are extensively utilized in several facets of life. As chaotic encryption evolves, current chaotic key generators have grown increasingly prevalent and susceptible to compromise. We present an advanced chaos architecture that integrates numerous nonlinear functions and incorporates common chaotic maps as perturbation factors. The produced two-dimensional QWT chaotic map exhibits a more stable chaotic state and a broader chaotic range in comparison to existing maps. Simultaneously, we developed a novel roulette scrambling technique that shifts the conventional in-plane scrambling to cross-plane scrambling. Upon evaluation, the encrypted image demonstrates commendable performance regarding information entropy, correlation, and other parameters, while its encryption algorithm exhibits robust security. Full article

Flower collection constitutes a critical segment of the flower logistics chain, and its efficiency significantly influences the industry. However, the energy consumption and carbon emissions that occur in the flower collection process present a great challenge for realizing efficient flower collection. To this end, this study proposes a green vehicle routing planning model that incorporates multiple factors, such as fixed costs, refrigeration costs, transportation costs, and so on, to minimize the total costs under hard time window constraints. Moreover, a Genetic Neighborhood Comprehensive Spider Wasp Algorithm (GN_CSWA) is proposed to find the solution to this problem. The random generation and the nearest neighbor algorithms are employed to construct the initial solution, followed by roulette selection, elite selection, and a best individual retention strategy to refine the population for the next iteration. A crossover operator is applied to facilitate global exploration, while six neighborhood search operators are applied to further enhance the quality of the solution. Moreover, to prevent the algorithm from converging to a local optimum, two mutation operators are introduced to generate new solutions. The effectiveness of the proposed optimizer is validated through extensive experimental results. Full article

Recommendation systems (RSs) play a vital role in e-commerce and content platforms, yet balancing efficiency and recommendation quality remains challenging. Traditional deep models are computationally expensive, while heuristic methods like particle swarm optimization struggle with discrete optimization. To address these limitations, this paper proposes elite-evolution-based discrete particle swarm optimization (EEDPSO), a novel framework specifically designed to optimize high-dimensional combinatorial recommendation tasks. EEDPSO restructures the velocity and position update mechanisms to operate effectively in discrete spaces, integrating neighborhood search, elite evolution strategies, and roulette-wheel selection to balance exploration and exploitation. Experiments on the MovieLens and Amazon datasets show that EEDPSO outperforms five metaheuristic algorithms (GA, DE, SA, SCA, and PSO) in both recommendation quality and computational efficiency. For datasets below the million-level scale, EEDPSO also demonstrates superior performance compared to deep learning models like FairGo. The results establish EEDPSO as a robust optimization strategy for recommendation systems that effectively handles the cold-start problem. Full article

Synthetic Aperture Radar (SAR) constellations have become a key technology for disaster monitoring, terrain mapping, and ocean surveillance due to their all-weather and high-resolution imaging capabilities. However, the design of large-scale SAR constellations faces multi-objective optimization challenges, including short revisit cycles, wide coverage, high-performance imaging, and cost-effectiveness. Traditional optimization methods, such as genetic algorithms, suffer from issues like parameter dependency, slow convergence, and the complexity of multi-objective trade-offs. To address these challenges, this paper proposes a hybrid optimization framework that integrates chaotic sequence initialization and fuzzy rule-based decision mechanisms to solve high-dimensional constellation design problems. The framework generates the initial population using chaotic mapping, adaptively adjusts crossover strategies through fuzzy logic, and achieves multi-objective optimization via a weighted objective function. The simulation results demonstrate that the proposed method outperforms traditional algorithms in optimization performance, convergence speed, and robustness. Specifically, the average fitness value of the proposed method across 20 independent runs improved by 40.47% and 35.48% compared to roulette wheel selection and tournament selection, respectively. Furthermore, parameter sensitivity analysis and robustness experiments confirm the stability and superiority of the proposed method under varying parameter configurations. This study provides an efficient and reliable solution for the orbital design of large-scale SAR constellations, offering significant engineering application value. Full article

This paper introduces an improved version of the Federated Random High Local Performance (Fed-RHLP) algorithm, specifically aimed at addressing the difficulties posed by Non-IID (Non-Independent and Identically Distributed) data within the context of federated learning. The refined Fed-RHLP algorithm implements a more targeted client selection approach, emphasizing clients based on the size of their datasets, the diversity of labels, and the performance of their local models. It employs a biased roulette wheel mechanism for selecting clients, which improves the aggregation of the global model. This approach ensures that the global model is primarily influenced by high-performing clients while still permitting contributions from those with lower performance during the model training process. Experimental findings indicate that the improved Fed-RHLP algorithm significantly surpasses existing methodologies, including FederatedAveraging (FedAvg), Power of Choice (PoC), and FedChoice, by achieving superior global model accuracy, accelerated convergence rates, and decreased execution times, especially under conditions of high Non-IID data. Furthermore, the improved Fed-RHLP algorithm exhibits resilience even when the number of clients participating in local model updates and aggregation is diminished in each communication round. This characteristic positively influences the conservation of limited communication and computational resources. Full article

This paper presents, discusses, and tests a novel method for guiding roulette selection in evolutionary algorithms. The new method uses fuzzy logic and incorporates information from both current and historical generations to predict the best scheme for the selection process. Fuzzy logic controls the probability of selecting individuals to the parent pool, based on historical data from the evolution process and the relationship between an individual’s fitness and the average fitness of the population. The new algorithm outperforms existing solutions by ensuring a proper balance between exploring new regions of the search space and exploiting previously found ones. The proposed system enhances the performance, efficiency, and robustness of evolutionary algorithms while reducing the risk of stagnation in suboptimal solutions. Results of experiments demonstrate that the newly developed algorithm is more efficient and resistant to premature convergence than standard evolutionary algorithms. Tests on both function optimization problems and real-world connected facility localization problems confirm the robustness of the newly developed algorithm. The algorithm can be an effective tool in solving a wide range of optimization problems, for example, optimization of computer network infrastructure. Full article

Disaster backup, which occurs over long distances and involves large data volumes, often leads to huge energy consumption and the long-term occupation of network resources. However, existing work in this area lacks adequate optimization of the trade-off between energy consumption and latency. We consider the one-to-many characteristic in disaster backup and propose a novel algorithm based on multicast and reinforcement learning to optimize the data transmission process. We aim to jointly reduce network energy consumption and latency while meeting the requirements of network performance and Quality of Service. We leverage hybrid-step Q-Learning, which can more accurately estimate the long-term reward of each path. We enhance the utilization of shared nodes and links by introducing the node sharing degree in the reward value. We perform path selection through three different levels to improve algorithm efficiency and robustness. To simplify weight selection among multiple objectives, we leverage the Chebyshev scalarization function based on roulette to evaluate the action reward. We implement comprehensive performance evaluation with different network settings and demand sets and provide an implementation prototype to verify algorithm applicability in a real-world network structure. The simulation results show that compared with existing representative algorithms, our algorithm can effectively reduce network energy consumption and latency during the data transmission of disaster backup while obtaining good convergence and robustness. Full article

The RIME algorithm is a novel physical-based meta-heuristic algorithm with a strong ability to solve global optimization problems and address challenges in engineering applications. It implements exploration and exploitation behaviors by constructing a rime-ice growth process. However, RIME comes with a couple of disadvantages: a limited exploratory capability, slow convergence, and inherent asymmetry between exploration and exploitation. An improved version with more efficiency and adaptability to solve these issues now comes in the form of Hybrid Estimation Rime-ice Optimization, in short, HERIME. A probabilistic model-based sampling approach of the estimated distribution algorithm is utilized to enhance the quality of the RIME population and boost its global exploration capability. A roulette-based fitness distance balanced selection strategy is used to strengthen the hard-rime phase of RIME to effectively enhance the balance between the exploitation and exploration phases of the optimization process. We validate HERIME using 41 functions from the IEEE CEC2017 and IEEE CEC2022 test suites and compare its optimization accuracy, convergence, and stability with four classical and recent metaheuristic algorithms as well as five advanced algorithms to reveal the fact that the proposed algorithm outperforms all of them. Statistical research using the Friedman test and Wilcoxon rank sum test also confirms its excellent performance. Moreover, ablation experiments validate the effectiveness of each strategy individually. Thus, the experimental results show that HERIME has better search efficiency and optimization accuracy and is effective in dealing with global optimization problems. Full article

To achieve a rational allocation of real-time operational equipment, such as excavators and dump trucks, in open-pit mines, and thereby enhance truck–shovel coordination, this paper addresses the challenges posed by unreasonable on-site scheduling, which includes excessive truck waiting times and prolonged excavator boom-and-dipper operations. Ultimately, the paper aims to attain optimal truck–shovel coordination efficiency. To this end, we construct a scheduling optimization model, with the production capacities of trucks and shovels serving as constraints. The objective functions of this model focus on minimizing transportation costs, reducing truck waiting times, and shortening excavator boom-and-dipper operation durations. To solve this model, we have developed an improved genetic algorithm that integrates roulette wheel selection and elite preservation strategies. The experimental results of our algorithm demonstrate that it can provide a more refined operational equipment scheduling scheme, effectively decreasing truck transportation costs and enhancing equipment utilization efficiency in open-pit mines. Full article

Beluga whale optimization (BWO) is a swarm-based metaheuristic algorithm inspired by the group behavior of beluga whales. BWO suffers from drawbacks such as an insufficient exploration capability and the tendency to fall into local optima. To address these shortcomings, this paper proposes augmented multi-strategy beluga optimization (AMBWO). The adaptive population learning strategy is proposed to improve the global exploration capability of BWO. The introduction of the roulette equilibrium selection strategy allows BWO to have more reference points to choose among during the exploitation phase, which enhances the flexibility of the algorithm. In addition, the adaptive avoidance strategy improves the algorithm’s ability to escape from local optima and enriches the population quality. In order to validate the performance of the proposed AMBWO, extensive evaluation comparisons with other state-of-the-art improved algorithms were conducted on the CEC2017 and CEC2022 test sets. Statistical tests, convergence analysis, and stability analysis show that the AMBWO exhibits a superior overall performance. Finally, the applicability and superiority of the AMBWO was further verified by several engineering optimization problems. Full article