Search

The integrated industrial control systems require a reliable communication among each part of control systems. The limitation of network topology comprises the low latency of data transmission. The network algorithm topologies are sometimes failed to ensure the faulttolerant network design even if they offer it. Therefore, this works investigates a Node Insertion Algorithm (NIA) and Ant Colony Optimization (ACO) in order to solve the Travelling Salesman Problem (TSP) for network topologies in a communication network. The NP Non deterministic (polynomial time)-hardness based of TSP leads to the impossibility of polynomial time algorithm to solve an exponentially increasing amount of communication addresses. TSP itself is a well-known solution method known in the graph theory which is based on approximation algorithm. Therefore, this work also presents a comparison between the NIA and ACO for 200 nodes of network topologies. The results show that NIA is superior than ACO in terms of resulting ring's cost and computation duration. Three topologies are tested and it is observable that NIA requires only 14.88 seconds to finish the computation in which the resulting ring's length reaches 164019 units. Therefore, the achievement of the NIA can be applied for logical and physical nodes for a reliable connection in an industrial topology network. [ABSTRACT FROM AUTHOR]

Wang, and J.-T. Teng in their paper develop and compare the seller's profit per unit time under each of three payment methods - advance, cash, and credit. In their paper, S. Sarkar, S. Tiwari, and B. C. Giri present a continuous-review vendor-buyer supply chain (SC) model and uncovers the best policy that minimizes the system's total expected cost. The authors investigate the contracts that the manufacturer offers to the retailers and finds the optimal pricing and ordering decisions made by retailers and the best contract that includes maximum profit for the supply chain. The analysis of large-scale data generated by humans, online activity in different web and social platforms is a challenging problem faced by researchers, practitioners, and academicians. [Extracted from the article]

Ant-inspired metaheuristic algorithms known as ant colony optimization (ACO) offer an approach that has the ability to solve complex problems in both discrete and continuous domains. ACOs have gained significant attention in the field of water resources management, since many problems in this domain are non-linear, complex, challenging and also demand reliable solutions. The aim of this study is to critically review the applications of ACO algorithms specifically in the field of hydrology and hydrogeology, which include areas such as reservoir operations, water distribution systems, coastal aquifer management, long-term groundwater monitoring, hydraulic parameter estimation, and urban drainage and storm network design. Research articles, peer-reviewed journal papers and conference papers on ACO were critically analyzed to identify the arguments and research findings to delineate the scope for future research and to identify the drawbacks of ACO. Implementation of ACO variants is also discussed, as hybrid and modified ACO techniques prove to be more efficient over traditional ACO algorithms. These algorithms facilitate formulation of near-optimal solutions, and they also help improve cost efficiency. Although many studies are attempting to overcome the difficulties faced in the application of ACO, some parts of the mathematical analysis remain unsolved. It is also observed that despite its popularity, studies have not been successful in incorporating the uncertainty in ACOs and the problems of dimensionality, convergence and stability are yet to be resolved. Nevertheless, ACO is a potential area for further research as the studies on the applications of these techniques are few. [ABSTRACT FROM AUTHOR]

This document is a preface to a special issue of the journal "Mathematics" that focuses on mathematical modeling and optimization of service supply chains. The special issue includes 14 papers that cover a wide range of topics within this field. The papers provide valuable insights for researchers, students, and practitioners in supply chain management, operations research, industrial engineering, and business management. They address areas such as customer preferences, optimization of supply chain decisions, coordination mechanisms, and the effects of the external environment. The findings can assist in addressing current issues and challenges in service supply chains, ultimately enhancing performance and efficiency. [Extracted from the article]

The second paper, authored by M. Kara, A. Laouid, M. AlShaikh, M. Hammoudeh, A. Bounceur, R. Euler, A. Amamra, and B. Laouid proposed a multi-round Proof of Work (PoW) consensus algorithm for preserving energy consumption and resisting attacks [[9]]. Special Features on AMC The most commonly seen AMC algorithms include genetic algorithm (GA), genetic programming (GP), evolutionary strategy (ES), evolutionary programming (EP), memetic algorithm (MA), particle swarm optimization (PSO), ant colony optimization (ACO), artificial bee colony (ABC), differential evolution (DE), firefly algorithm (FA), simulated annealing (SA), tabu search (TS), scatter search (SS), variable neighborhood search (VNS), and GRASP, to name a few. The first paper, authored by J. Chou, T. Pham, and C. Ho, developed a metaheuristic-optimized machine-learning algorithm for multi-level classification in civil and construction engineering [[1]]. The adaptive shrinking grid search chaos wolf optimization algorithm was proposed to optimize the parameters of the neural network to enhance the image recognition accuracy. [Extracted from the article]

This document is a special issue of the journal Mathematics dedicated to recent advances in discrete optimization and scheduling. The issue includes 10 papers covering a range of topics such as batch loading and scheduling, optimization algorithms, scheduling surgeries, routing problems, and mathematical models for simplification. The papers present various approaches and algorithms for solving these problems, and they have been reviewed by experts in the field. The authors express their gratitude to the contributors, reviewers, and editorial staff, and hope that the readers will find stimulating ideas for further research in this area. [Extracted from the article]

The optimization of the cutting path of the sample can effectively reduce the cutting time, thereby improving the production efficiency of numerical control processing. This paper comprehensively considers the impact of the cutting order and the position of the knife entry point on the cutting path, converts the cutting path problem into a type of traveling salesman problem (TSP), and proposes an improved genetic-particle swarm optimization algorithm. The selection mechanism of the algorithm combines the elitist retention strategy and roulette wheel selection method to accelerate the search for the optimal solution; the mutation strategy designs a linear decreasing mutation rate, which enhances the global search ability; at the same time, introduces the ant colony optimization algorithm to process the fitness function, adjusts the population evolution difference, and speeds up the optimization process. Through this hybrid algorithm, the cutting order of the sample can be quickly optimized, and the nearest neighbor algorithm is used to determine the position of the knife entry point. Tests are conducted on clothing patterning charts and standard examples. Compared with several commonly used algorithms, experimental results verify the feasibility and effectiveness of this algorithm. [ABSTRACT FROM AUTHOR]

The split delivery vehicle routing problem (SDVRP) is a classic combinatorial optimization problem, which is usually solved using a heuristic algorithm. The ant colony optimization algorithm is an excellent heuristic algorithm that has been successfully applied to solve various practical problems, and it has achieved good results. However, in the existing ant colony optimization algorithms, there are issues with weak targeting of different customer selection strategies, difficulty in balancing convergence speed and global search ability, and a predisposition to become trapped in local optima. To solve these problems, this paper proposes an improved ant colony algorithm (IACA). First, in terms of customer point selection, the initial customer and noninitial customer selection strategies are proposed for different customers, and the adaptive selection threshold is designed. Second, in terms of pheromone processing, an initial pheromone distribution method based on a greedy strategy, a pheromone backtracking mechanism, and an adaptive pheromone volatile factor are proposed. Finally, based on the 2-opt local search method, vehicle path self-search and intervehicle path search are proposed to further improve the quality of the solution. This paper tests the performance of the IACA on datasets of different scales. The experimental results show that compared with the clustering algorithm, artificial bee colony algorithm, particle swarm optimization algorithm, traditional ant colony algorithm, and other algorithms, the IACA can achieve more competitive results. Specifically, compared to the path length calculated by other algorithms, the path length calculated by IACA decreased by an average of 1.58%, 4.28%, and 3.64% in small, medium, and large-scale tests, respectively. [ABSTRACT FROM AUTHOR]

Compared with the traditional OMP algorithm and the 3DSOMP algorithm, simulation results demonstrate the proposed DSD algorithm has higher channel estimation accuracy and lower pilot overhead. With the rapid development of internet-of-things (IoT) and communication technologies, the quality of our daily life has improved with the applications of smart communications and networking, such as intelligent transportation, mobile computing, and edge computing. TOPIC C - SMART TECHNOLOGY IN IOT Ai et al., in their paper 'Anti-collision algorithm based on slotted random regressive-style binary search tree in RFID technology', propose an anti-collision algorithm based on slotted random regressive-style binary search tree (SR-RBST). Guo et al., in their paper 'Payoff-maximisation-based adaptive hierarchical wireless charging algorithm for the mobile charger in IoT', propose a payoff-maximisation-based adaptive hierarchical wireless charging algorithm for the mobile charger. [Extracted from the article]

This paper presents a low-carbon vehicle routing optimization model to reduce energy consumption and carbon emissions in logistics and distribution. The model is solved using a hybrid algorithm of simulated annealing and ant colony optimization. It enhances the information pheromone concentration update process and directionality by introducing a carbon emission factor and a multifactor operator. Additionally, an adaptive elite individual reproduction strategy is employed to improve algorithm efficiency. In this case study focusing on cold chain logistics distribution, both the model and algorithm under consideration were evaluated. The findings affirm the effectiveness of the model in reducing carbon emissions and demonstrate the efficiency and robustness of the algorithm. Through this analysis, the paper sheds light on environmentally sustainable practices in logistics distribution. [ABSTRACT FROM AUTHOR]

H. Malon et al. in their paper entitled "Application of Low-Cost Sensors for the Development of a Methodology to Design Front-End Loaders for Tractors" developed a methodology to design tractor front-end loaders with a view of obtaining their accurate design during the bucket loading process. Sensors and applications in agricultural and environmental monitoring have become more essential to (1) farming practices, (2) crop growth estimation, (3) environmental changes, (4) global and regional observations on the earth's environment, and (5) monitoring/environmental analysis. M. Li et al. in their paper entitled "Response Mechanism of Cotton Growth to Water and Nutrients under Drip Irrigation with Plastic Mulch in Southern Xinjiang" studied the effects of water and nutrient control measures on cotton plant height, stem diameter, biomass, seed yield, and soil moisture under an irrigated plastic mulch production system. [Extracted from the article]

Robotic Mobile Fulfillment Systems (RMFSs) face challenges in handling large-scale orders and navigating complex environments, frequently encountering a series of intricate decision-making problems, such as order allocation, shelf selection, and robot scheduling. To address these challenges, this paper integrates Deep Reinforcement Learning (DRL) technology into an RMFS, to meet the needs of efficient order processing and system stability. This study focuses on three key stages of RMFSs: order allocation and sorting, shelf selection, and coordinated robot scheduling. For each stage, mathematical models are established and the corresponding solutions are proposed. Unlike traditional methods, DRL technology is introduced to solve these problems, utilizing a Genetic Algorithm and Ant Colony Optimization to handle decision making related to large-scale orders. Through simulation experiments, performance indicators—such as shelf access frequency and the total processing time of the RMFS—are evaluated. The experimental results demonstrate that, compared to traditional methods, our algorithms excel in handling large-scale orders, showcasing exceptional superiority, capable of completing approximately 110 tasks within an hour. Future research should focus on integrated decision-making modeling for each stage of RMFSs and designing efficient heuristic algorithms for large-scale problems, to further enhance system performance and efficiency. [ABSTRACT FROM AUTHOR]

Since the fuzzy techniques in supplier selection, industrial procurement and inventory management form the important parts of the application in supply chain management (SCM). Considering that, the fuzzy techniques involved in the eight papers are all based on the fuzzy theory proposed by Zadeh, and they all well integrate the original fuzzy theory into various decision-making method and further properly be applied into the most popular fields of supply chain management (SCM) and finance economics. Supplier selection, procurement containing supplier and order allocation and inventory management are important parts of SCM. [Extracted from the article]

Aiming at the shortcomings of single ant colony optimization such as many redundant nodes, slow convergence and low efficiency, based on the idea of "selection-crossover" of genetic algorithm, an improved fusion algorithm of ant colony optimization and genetic algorithm is proposed. In this paper, the fusion algorithm includes "optimal strategy" and "genetic region strategy". The optimal strategy is that high-quality parents are selected by roulette in the first M 1 paths of each generation; genetic region strategy is that according to the path information of the parents, the grid map is divided into genetic area and nongenetic area. Genetic area refers to the area where the offspring ants can pass, and nongenetic area refers to the area where the offspring ants can't pass; finally, the offspring ant searches the path in the genetic region to reduce the search range of the offspring ant and improve the convergence speed. Simulation results show that the fusion algorithm has faster searching speed and more stable convergence than the basic ant colony optimization and other improved ant colony optimization. [ABSTRACT FROM AUTHOR]

The basic genetic algorithm usually has the following problems when solving robot path planning problems. First, the chromosome (path) of the first generation is randomly generated, so its fitness is often too high, resulting in too slow convergence speed and even unable to obtain the global optimal solution. Second, in the crossover operator, the selection of crossover points is often random, which cannot ensure that the fitness of cross generated offspring is better than that of their parents. Finally, in the mutation stage, because the traditional mutation strategy is to replace the selected mutation node in the individual chromosome with a random node, the offspring path generated by the mutation operator is likely to be discontinuous, so it cannot reflect the effectiveness of the mutation operator. Based on the mentioned contents, some improved strategies are proposed for the discussed three shortcomings of the basic genetic algorithm. First, a new generation mechanism of the first generation is constructed by simulating the path finding rules of ants in ant colony optimization, which greatly improves the quality of the first generation. Second, during crossover operator, the chromosomes of the two parents are disconnected at the same node, and the optimal chromosome fragments in each segment are combined based on greed, so as to gather all the excellent gene fragments of the parents in an individual as much as possible, improve the quality of the offspring after crossover operator, and speed up the convergence speed. Finally, a new mutation strategy is proposed to eliminate redundant sections and the number of corners, so that the individuals always can be mutated in a good direction. A large number of simulation results show that the improved genetic algorithm is effective in solving the robot path planning problem, and the overall performance is better than the basic genetic algorithm and some other improved genetic algorithms. Finally, by modeling and simulating the real enterprise factory environment based on the ROS platform, the experimental results also verify the effectiveness and feasibility of the improved genetic algorithm. [ABSTRACT FROM AUTHOR]

Traditional logistics delivery route optimization algorithm has some problems such as long time to find the optimal route. Based on this, this paper discusses swarm intelligence optimization algorithm and logistics delivery route optimization. To solve the logistics vehicle routing problem, considering that the basic ACO (ant colony optimization) has the disadvantages of slow convergence speed and easy to fall into local optimum, this paper proposes a new hybrid population optimization algorithm and applies it to VRPTW (vehicle routing problem with time windows). In addition, the concept of crowding degree in AFSA (artificial fish swarm algorithm) is introduced into ACO. In the early stage of the optimization process, a strong crowding degree limit is set to ensure that most ants are not affected by pheromone concentration to conduct random optimization. The simulation results show that the AC (accuracy rate) of this algorithm is 95.08%, which is higher than the traditional PSO (particle swarm optimization) algorithm and general heuristic algorithm. The hybrid algorithm can effectively improve the optimization efficiency of VRPTW, lay a foundation for solving large-scale VRPTW, and provide new research ideas and methods. At the same time, the results fully show that the algorithm in this paper has certain advantages in performance, and it can be applied to logistics delivery route optimization. [ABSTRACT FROM AUTHOR]

This document discusses the importance of optimization in various fields such as statistics, biology, finance, economics, and control. It highlights the advancements made in optimization theory and methods, including first-order methods and augmented Lagrangian methods. The document also introduces a special issue on "Symmetry in Optimization Theory, Algorithms and Applications," which features five papers on topics such as ensemble learning, ant colony system algorithms, subspace algorithms, consensus problems in multi-agent systems, and dynamic conditional correlation models. The authors express their gratitude to the contributors and reviewers of the special issue. [Extracted from the article]

In this paper, a method of 3D concrete printing is used to find the optimal path of the nozzle running path. We propose a path optimization algorithm based on graph theory to solve two key problems in 3D concrete printing. The partitioning algorithm based on graph theory was adopted to improve the forming quality of concrete components, and ant colony algorithm was used to reduce printing time. The method was evaluated with 3D concrete printing experiments after introducing the process of implementing the partition algorithm and ant colony algorithm. The experiment results show a significant reduction in the idle strokes and the nozzle head-up times of the running path planned by the method in this paper. This has a direct impact on shortening the printing time and improving the forming quality. Compared with the other three conventional algorithms, the idle strokes of the nozzle planned by the method in this paper are reduced by 18.94%, 37.88%, and 66.67%, and the nozzle head-up times are reduced by 1.59%, 2.15%, and 8.69%. It provides a practical reference for the path optimization of 3D concrete printing. [ABSTRACT FROM AUTHOR]

In light of the growing urgency surrounding energy and environmental concerns, this paper presents a two-layer iterative energy dispatch strategy tailored for a multi-energy-flow virtual power plant (VPP) operating within the distribution power grid. The proposed strategy unfolds in two key phases. First, it establishes an energy dispatch framework designed specifically for the multi-energy-flow VPP within the distribution power grid. Subsequently, it introduces an improved ant colony algorithm aimed at optimizing the output power of each VPP. In addition, the paper presents an optimization method for substation energy dispatch. This method uses a delay-aware consensus algorithm with the substation dispatch cost increment rate as the consensus variable, taking into account the communication delay between VPPs. Integrating a proportional-derivative (PD) control mechanism enhances the convergence speed of the delay-aware consensus algorithm and enables real-time energy dispatch of the multi-energy-flow VPP. The paper presents its conclusions by validating the efficacy of the proposed approach through simulation, thereby addressing the challenges and adapting to the shifting energy and environmental landscape. [ABSTRACT FROM AUTHOR]

To improve the workshop production efficiency of textile enterprises and balance the total operating time of all machines in each operation, this paper proposes a modified algorithm based on the combination of the ant colony optimization (ACO) algorithm and production products, which we call the product ant colony optimization (PACO) algorithm. The local pheromone update rule in the ACO algorithm is modified through the close relationship between textile machinery and production products in the textile workshop; the pheromone is then introduced into production products based on the constraints of the textile machine. A heuristic function is designed to improve the utilization rate of textile machines to increase the heuristic value of machines that are less frequently used in the algorithm iteration process. In addition, this paper combines the convergence speed and the global search ability of the algorithm with a designed variable pheromone evaporate parameter. The comparison among the initially designed PACO algorithm, the separately modified PACO algorithm, and the integratively modified PACO algorithm demonstrates that the proposed enhancement effectively addresses scheduling issues in textile flexible workshops and various workshops with similar constraint conditions. [ABSTRACT FROM AUTHOR]

In order to reduce the cogging torque of a symmetrical V-type line-start permanent magnet synchronous (LSPMS) motor, this paper proposes a multi-objective optimization method based on the combination of design parameter stratification and response surface methodology (RSM). The optimal solution to the RSM model is acquired using the max–min ant algorithm. The permanent magnet width, pole opening angle, stator slot width, rotor axial length, and rotor tooth width are selected as optimization variables. The cogging torque and average torque are the optimization objectives. Finite element method (FEM) results show that the cogging torque is reduced by 71.5%, the torque ripple is reduced by 65.6%, and the average torque is improved by 12%. Finally, the effectiveness of the algorithm is verified with simulation results. [ABSTRACT FROM AUTHOR]

Scheduling is an important technique being used widely in numerous applications especially in industry. Flexible Job Shop Scheduling Problem (FJSP) is an extension of job scheduling which has several practical applications, (FJSP) is NPhard combinatorial optimization problem. Owing to its importance and intricacy a lot of attention has been paid to this topic. Many swarm intelligent algorithms have drawn inspiration from nature; one particularly notable example is Ant Colony Optimization (ACO), which has shown to be incredibly successful and productive when applied to highcomplexity (NP-hard) combinatorial optimization tasks. The paper presents a literature survey on ACO variants types and applications in Scheduling. [ABSTRACT FROM AUTHOR]

Navigating miners during an evacuation using smart evacuation technology can significantly decrease the evacuation time of an underground mine in case of emergency hazards. This paper presents a mathematical programming model to calculate the most efficient escape path for miners as a critical component of smart evacuation technology. In this model, the total evacuation distance of the crew is minimized and scenarios with blocked pathways and stamina categories for the miners are simulated. The findings revealed that all the tested scenarios were technically feasible. Using the feature that filters out blocked pathways has no downsides as safer routes are calculated and there is no penalty in the computation time. This paper also discusses the social and technical issues that must be resolved before the algorithm can be implemented as an actual escape solution. [ABSTRACT FROM AUTHOR]

Recently, there has been a surge in interest surrounding the field of distributed edge computing resource scheduling. Notably, applications like intelligent traffic systems and Internet of Things (IoT) intelligent monitoring necessitate the effective scheduling and migration of distributed resources. In addressing this challenge, distributed resource scheduling must weigh the costs associated with resource scheduling, aiming to identify an optimal strategy amid various feasible solutions. Different application scenarios introduce diverse optimization objectives, including considerations such as cost, transmission delay, and energy consumption. While current research predominantly focuses on the optimization problem of local resource scheduling, there is a recognized need for increased attention to global resource scheduling. This paper contributes to the field by defining a global resource scheduling problem for distributed edge computing, demonstrating its NP-Hard nature through proof. To tackle this complex problem, the paper proposes a heuristic solution strategy based on the ant colony algorithm (ACO), with optimization of ACO parameters achieved through the use of particle swarm optimization (PSO). To assess the effectiveness of the proposed algorithm, an experimental comparative analysis is conducted. The results showcase the algorithm's notable accuracy and efficient iteration cost performance, highlighting its potential applicability and benefits in the realm of distributed edge computing resource scheduling. [ABSTRACT FROM AUTHOR]

In order to obtain an optimal trajectory for indoor AGV, this paper combined an improved ACO and fuzzy DWA (IACO-DWA) algorithm, which can provide an optimal path with collision-free under higher optimization efficiency. The highlights of this paper are detailed as follows: Firstly, an improved adaptive pseudo-random transition strategy is adopted in the state transition probability with an angle factor. A reward and punishment mechanism is introduced in the pheromone updating strategy, then a path optimization strategy called IACO is proposed for the more optimized path. Secondly, IDWA adopted three fuzzy controllers of direction, security and adjustment coefficients through evaluating directional and safety principles, then improving the angular velocity by processing the linear velocity with linear normalization. By adapting to the changes of the environment, the IDWA parameters can be dynamically adjusted to ensure the optimal running speed and reasonable path of AGV. Thirdly, aiming to deal with the path-planning problem in complex environments, we combined IACO with IDWA, the hybrid algorithm involves dividing the globally optimal path obtained from IACO planning into multiple virtual sub-target points. IDWA completes the path planning by switching between these local target points, thereby improving the efficiency of the path planning. Finally, simulations is verified by Matlab and experiment results on the QBot2e platform are given to verify IACO-DWA algorithm's effectiveness and high performance. [ABSTRACT FROM AUTHOR]

The conventional trust model employed in satellite network security routing algorithms exhibits limited accuracy in detecting malicious nodes and lacks adaptability when confronted with unknown attacks. To address this challenge, this paper introduces a secure satellite network routing technology founded on deep learning and trust management. The approach embraces the concept of distributed trust management, resulting in all satellite nodes in this paper being equipped with trust management and anomaly detection modules for assessing the security of neighboring nodes. In a more detailed breakdown, this technology commences by preprocessing the communication behavior of satellite network nodes using D–S evidence theory, effectively mitigating interference factors encountered during the training of VAE modules. Following this preprocessing step, the trust vector, which has undergone prior processing, is input into the VAE module. Once the VAE module's training is completed, the satellite network can assess safety factors by employing the safety module during the collection of trust evidence. Ultimately, these security factors can be integrated with the pheromone component within the ant colony algorithm to guide the ants in discovering pathways. Simulation results substantiate that the proposed satellite network secure routing algorithm effectively counters the impact of malicious nodes on data transmission within the network. When compared to the traditional trust management model of satellite network secure routing algorithms, the algorithm demonstrates enhancements in average end-to-end delay, packet loss rate, and throughput. [ABSTRACT FROM AUTHOR]

To solve the transmission correlation issue arising from traditional named data networking (NDN) caching during segmenting contents, where users must obtain data blocks related to the requested file blocks to recover the source data, in this paper, we propose an NDN-based coded caching strategy for low Earth orbit (LEO) satellite networks, using coding operations to remove the transmission correlation of data. To achieve efficient content distribution, the satellite node's coded package is strategically placed with the objectives of minimizing the backhaul link load and content acquisition latency. The optimization problem is solved by using a multi-colony ant colony algorithm, enabling fast content retrieval. We designed a cluster cooperative distribution mechanism to simplify the satellite network's management and reduce the load of satellite links for content distribution when covered by multiple satellite nodes. Finally, we compare the multi-objective coded caching (CCMO) introduced in this paper with the most popular (MP) strategy and the random-based coded caching (CCR) strategy; the average cache hit ratio, backhaul link load, and content acquisition delay are compared and analyzed. The results show that CCMO performs better. [ABSTRACT FROM AUTHOR]

The CloudAnalyst simulation tool offers various load balancing techniques that can be utilized for efficiently distributing tasks. This research paper explores various load balancing techniques by utilizing the CloudAnalyst simulation tool. The research paper intends to evaluate and contrast the effectiveness of conventional load balancing techniques. While gathering information, the technique entails the simulation of diverse cases with varying parameters, including server capacity, workload, and network latency. The results are compared and contrasted to demonstrate that each technique for load balancing has strengths and weaknesses, and that the most suitable technique should be chosen based on the specific scenario. The Round Robin algorithm is easy to implement but may not be suitable for all scenarios. The Least Connection algorithm is suitable for scenarios where server capacity is not uniform. The IP Hash algorithm is useful for stateful applications, while the Weighted Round Robin algorithm is suitable for scenarios where servers have different capacities. The Least time algorithm is useful for scenarios where processing time is critical. The proposed framework for this research paper is based on nature-inspired load balancing using the CloudAnalyst simulation tool. The framework aims to develop a load balancing algorithm that can adapt to changing workload patterns in real-time. [ABSTRACT FROM AUTHOR]

For the optimal design of the sustainable supply chain network, considering the comprehensiveness of the problem factors, considering the three aspects of economy, environment and society, the goal is to minimize the establishment cost, minimize the emission of environ-mental pollution and maximize the number of labor. A mixed integer programming model is established to maximize the efficiency of the supply chain network. The innovation of this paper, first, is to consider the impact of economic, environmental and social benefits in a continuous supply chain, where the environmental benefits not only consider carbon emissions but also include the emissions of plant wastewater, waste and solid waste as influencing factors. Second, a multi-objective fuzzy affiliation function is constructed to measure the quality of the model solution in terms of the overall satisfaction value. Finally, the chaotic particle ant colony algorithm is proposed, and the problem of premature convergence in the operation of the particle swarm algorithm is solved. Experimental results show that the PSCACO algorithm proposed in this paper is compared with MOPSO, CACO and NSGA-II algorithms, and the convergence effect of the algorithm is concluded to be more effective to verify the effectiveness and feasibility of chaotic particle ant colony algorithm for solving multi-objective functions, which proposes a new feasible solution for the supply chain management. [ABSTRACT FROM AUTHOR]

Mobile edge computing has been an important computing paradigm for providing delay-sensitive and computation-intensive services to mobile users. In this paper, we study the problem of the joint optimization of task assignment and energy management in a mobile-server-assisted edge computing network, where mobile servers can provide assisted task offloading services on behalf of the fixed servers at the network edge. The design objective is to minimize the system delay. As far as we know, our paper presents the first work that improves the quality of service of the whole system from a long-term aspect by prolonging the operational time of assisted mobile servers. We formulate the system delay minimization problem as a mixed-integer programming (MIP) problem. Due to the NP-hardness of this problem, we propose a dynamic energy criticality avoidance-based delay minimization ant colony algorithm (EACO), which strives for a balance between delay minimization for offloaded tasks and operational time maximization for mobile servers. We present a detailed algorithm design and deduce its computational complexity. We conduct extensive simulations, and the results demonstrate the high performance of the proposed algorithm compared to the benchmark algorithms. [ABSTRACT FROM AUTHOR]

This research addresses the pressing challenge of intrusion detection and prevention in Wireless Sensor Networks (WSNs), offering an innovative and comprehensive approach. The research leverages Support Vector Regression (SVR) models to predict the number of barriers necessary for effective intrusion detection and prevention while optimising their strategic placement. The paper employs the Ant Colony Optimization (ACO) algorithm to enhance the precision of barrier placement and resource allocation. The integrated approach combines SVR predictive modelling with ACO-based optimisation, contributing to advancing adaptive security solutions for WSNs. Feature ranking highlights the critical influence of barrier count attributes, and regularisation techniques are applied to enhance model robustness. Importantly, the results reveal substantial percentage improvements in model accuracy metrics: a 4835.71% reduction in Mean Squared Error (MSE) for ACO-SVR1, an 862.08% improvement in Mean Absolute Error (MAE) for ACO-SVR1, and an 86.29% enhancement in R-squared (R2) for ACO-SVR1. ACO-SVR2 has a 2202.85% reduction in MSE, a 733.98% improvement in MAE, and a 54.03% enhancement in R-squared. These considerable improvements verify the method's effectiveness in enhancing WSNs, ensuring reliability and resilience in critical infrastructure. The paper concludes with a performance comparison and emphasises the remarkable efficacy of regularisation. It also underscores the practicality of precise barrier count estimation and optimised barrier placement, enhancing the security and resilience of WSNs against potential threats. [ABSTRACT FROM AUTHOR]

Regarding the issue of information freshness in systems that aid in data collection using unmanned aerial vehicles (UAVs), a data collection algorithm that is based on freshness and UAV assistance is proposed. Under the limitations of wireless sensor node communication distance and UAV parameters, the optimization problem of minimizing the average spatial correlation age of information (SCAoI) of all nodes in the area is set up. This problem is solved by optimizing the number of clusters, UAV flight trajectories, and the order of data collection from cluster member nodes. The maximum communication distance of the nodes is used as the cluster formation radius, and the maximum-minimum distance clustering algorithm is used to cluster the nodes in the region to obtain the minimum number of clusters. After it has been proven that the trajectory optimization problem in this study is NP-hard, the ant colony algorithm is applied to obtain the minimum flight time and the corresponding trajectory. By using the greedy algorithm to determine the member nodes in the sequence of data collection for a cluster, the instantaneous SCAoI of the UAV arriving at the cluster head is solved. Simulation results show that the proposed algorithm in this paper can effectively improve the freshness of data and reduce the average SCAoI of the system compared with the algorithm in the comparative literature, reducing the average SCAoI by about 61%. [ABSTRACT FROM AUTHOR]

Wireless sensor networks (WSNs) play a vital role in various fields, but ensuring optimal coverage poses a significant challenge due to the limited energy resources that constrain sensor nodes. To address this issue, this paper presents a novel approach that combines the binary ant colony algorithm (BACA), a variant of ant colony optimization (ACO), with other search optimization algorithms, such as hill climbing (HC) and simulated annealing (SA). The BACA is employed to generate an initial solution by emulating the foraging behavior of ants and the pheromone trails they leave behind in their search for food. However, we acknowledge that the BACA alone may not guarantee the most optimal solution. Subsequently, HC and SA are optimization search algorithms that refine the initial solution obtained by the BACA to find a more enhanced solution. Through extensive simulations and experiments, we demonstrate that our proposed approach results in enhanced coverage and energy-efficient coverage in a two-dimensional (2D) field. Interestingly, our findings reveal that HC consistently outperforms SA, particularly in less complex search spaces, leveraging its robust exploitation approach. Our research contributes valuable insights into optimizing WSN coverage, highlighting the superiority of HC in this context. Finally, we outline promising future research directions that can advance the optimization of WSN coverage. [ABSTRACT FROM AUTHOR]

The growing demand for Electric Vehicles (EVs) depends on the high integration of this technology in many areas. Therefore, an important area of research raises interest in finding the optimal path-planning solution for electric vehicles. This paper discusses several reviews and analyzes some of the constraints of the techniques used to improve these systems. The paper discusses common models used in Unmanned Aerial Vehicles (UAVs) and Unmanned Ground Vehicles (UGV). This paper investigates the planning approaches that lead to finding the optimal route for the tour from the source to the destination. The review outlines the different models and systems of Unmanned Ariel Vehicles (UAV) and Unmanned Ground Vehicles (UGV). This paper can be considered as comprehensive survey research for EV routing techniques to assist researchers choose the appropriate approach for developing a system based on optimization techniques, machine learning, or Hybrid Approaches (HAs) techniques. Optimization techniques are mostly used to find the optimal path and achieve multi-objective goals. Some findings were approved as the best models inspired by natural biological as genetic algorithms, Particle Swarm Optimization, and Ant Colony Optimization. In addition to machine learning techniques as Reinforcement Learning. The hybrid approach techniques that combine optimization and machine learning techniques can increase robustness in solving routing problems. [ABSTRACT FROM AUTHOR]

As an important historical and cultural heritage, rural red tourism sites have high historical, cultural, and social values. Moreover, rural red tourism sites are suitable for development and protection as tourism resources due to their unique landscape, architecture, culture, and art. In this paper, we propose a path generation model based on an ant colony algorithm to recommend the best path for tourists to visit rural red tourism sites. First, this paper investigates the modeling methods of path planning and multiobjective planning and their related solution algorithms to prepare for the establishment and solution of the tour path generation model for rural red tourism sites. By analyzing the problem description, this paper proposes the two model objectives of the shortest tour path and the highest total rating of the tourist attraction, and the model limitation of the total tour usage time, to model the model with a multiobjective planning approach. Then, by modifying the calculation of visibility and pheromone increments of the ant colony algorithm, the modified ant colony algorithm can take into account the two objectives of shortest path and highest total rating when constructing the path. Finally, this paper proposes to update the optimal path by using the number of ratings per unit path length as the update criterion of the optimal path. [ABSTRACT FROM AUTHOR]

In designing control systems, it is known that fractional-order proportional integral derivative (FOPID) controllers often provide greater flexibility than conventional proportional integral derivative (PID) controllers. This higher level of flexibility has proven to be extremely valuable for various applications such as vibration suppression in structural engineering. In this paper, we study the optimization of FOPID controllers using twelve well-established algorithms to minimize structural responses under seismic excitations. The algorithms include crystal structure algorithm (CryStAl), stochastic paint optimizer, particle swarm optimization, krill herd, harmony search, ant colony optimization, genetic algorithm, grey wolf optimizer, Harris hawks optimization, sparrow search algorithm, hippopotamus optimization algorithm, and duck swarm algorithm. In addition to highlighting the benefits of fractional calculus in structural control, this study provides a detailed analysis of FOPID controllers as well as a brief description of the algorithms used to optimize them. To evaluate the efficiency of the proposed techniques, two building models with different numbers of stories are examined. FOPID controllers are designed based on oustaloup's approximation and the El Centro earthquake data. Using five well-known metrics, the performances of the developed methods are evaluated against five earthquake scenarios, including the recent earthquake in Turkey. A non-parametric (Friedman) test is also employed to compare the algorithms based on their corresponding vibration reduction. The findings of this analysis show that CryStAl consistently performs better than the other algorithms for both building models, thus resulting in superior vibration suppression. [ABSTRACT FROM AUTHOR]

With a high proportion of distributed source-grid-load-storage resources penetrating into the distribution network, multi-flow aggregated energy dispatch is essential to enhance renewable energy consumption capacity and maintain grid stability. However, intelligent energy dispatch has stringent requirements for low latency and security, which necessitates the development of secure and rapid response methods. In this paper, we combine the edge-end collaboration with container microservices architecture and propose a container and microservice empowered edge-end collaborative secure and rapid response framework for multi-flow aggregated energy dispatch service in a distribution grid. Then, a container selection optimization problem is formulated to minimize the total microservices execution delay. To cope with the dynamic environment such as electromagnetic interference, noise, and workload variation, we propose a microservice container selection algorithm based on an enhanced ant colony with empirical SINR and delay performance awareness. The proposed algorithm benefits from the local and global integrated pheromone updating methods and the empirical performance-based dynamic pheromone and heuristic information updating mechanism. Simulation results demonstrate that the proposed algorithm outperforms the existing methods in average service execution delay and convergence speed. [ABSTRACT FROM AUTHOR]

The hot rolled strip is a basic industrial product whose surface quality is of utmost importance. The condition of hot rolling work rolls that have been worn for a long time is the key factor. However, the traditional scheduling method controls risks to the surface quality by setting fixed rolling length limits and penalty scores, ignoring the wear condition differences caused by various products. This paper addresses this limitation by reconstructing a hot rolling-scheduling model, after developing a model for pre-assessment of the risk to surface quality based on the Weibull failure function, the deformation resistance formula, and real production data from a rolling plant. Additionally, Ant Colony Optimization (referred to as ACO) is employed to implement the scheduling model. The simulation results of the experiments demonstrate that, compared to the original scheduling method, the proposed one significantly reduces the cumulative risk of surface defects on products. This highlights the efficacy of the proposed method in improving scheduling decisions and surface quality of hot rolled strips. [ABSTRACT FROM AUTHOR]

The path planning problem is an important issue in maritime search and rescue. This paper models the path planning problem as a dynamic vehicle routing problem. It first designs a dynamic generator that transforms the existing benchmark sets for the static vehicle routing problem into dynamic scenarios. Subsequently, it proposes an effective Dynamic Ant Colony Optimization (DACO) algorithm, whose novelty lies in that it dynamically adjusts the pheromone matrix to efficiently handle customers' changes. Moreover, DACO incorporates simulated annealing to increase population diversity and employs a local search operator that is dedicated to route modification for continuous performance maximization of the route. The experimental results demonstrated that the proposed DACO outperformed existing approaches in generating better routes across various benchmark sets. Specifically, DACO achieved significant improvements in the route cost, serviced customer quantity, and adherence to time window requirements. These results highlight the superiority of DACO in the dynamic vehicle routing problem, providing an effective solution for similar problems. [ABSTRACT FROM AUTHOR]

Urban air mobility is an effective solution to address the current issue of ground traffic congestion in future cities. However, as the user scale continues to expand, the current civil aviation flight scheduling and control methods are becoming inadequate to meet the high-volume flight guarantee demands of future urban air transportation. In order to effectively handle and resolve potential issues in this field in the future, this paper proposes a method for planning urban air mobility route networks. The planning process is divided into two stages: construction and optimization. Methods for constructing urban air mobility route networks based on flight routes and global optimization methods based on node movement are proposed in each stage. In the construction stage, a complete construction process is designed to generate routes based on existing flight routes, in line with the trend of urban air transportation development. In the optimization stage, inspired by the ant colony algorithm, node transfer rules and information transfer rules are incorporated to design a global optimization process and algorithm for route networks. Experimental results demonstrate the effectiveness and advancement of the proposed planning method. [ABSTRACT FROM AUTHOR]

To address the epidemic, such as COVID-19, the government may implement the home quarantine policy for the infected residents. The logistics company is required to control the risk of epidemic spreading while delivering goods to residents. In this case, the logistics company often uses vehicles and unmanned aerial vehicles (UAVs) for delivery. This paper studies the distribution issue of cold chain logistics by integrating UAV logistics with epidemic risk management innovatively. At first, a "vehicle-UAV" joint distribution mode including vehicles, small UAVs and large UAVs, is proposed. The green cost for vehicles and UAVs is calculated, respectively. The formula for infection risk due to large numbers of residents gathering at distribution centers to pick up goods is then derived. Furthermore, based on the control of infection risk, an optimization model is developed to minimize the total logistics cost. A modified ant colony algorithm is designed to solve the model. The numerical results show that the maximum acceptable risk and the crowd management level of distribution centers both have significant effects on the distribution network, logistics cost and number of new infections. Our study provides a new management method and technical idea for ensuring the needs of residents during the epidemic. [ABSTRACT FROM AUTHOR]

Diverse demands have promoted the rapid development of the cold chain logistics industry. In the paper, a novel approach for calculating the comprehensive carbon emission cost was proposed and the front warehouse mode was analyzed under the background of energy conservation and emission reduction. To solve the two-echelon low-carbon location-routing problem (2E-LCLRP), a mathematical model considering operating cost, total transportation cost, fixed cost, refrigeration cost, cargo damage cost, and comprehensive carbon emission cost was proposed to determine the minimum total cost. A hybrid ant colony optimization (HACO) algorithm based on an elbow rule and an improved ant colony optimization (IACO) algorithm was proposed to solve the 2E-LCLRP. According to the elbow rule, the optimal number of front warehouses was determined and an IACO algorithm was then designed to optimize vehicle routes. An adaptive hybrid selection strategy and an optimized pheromone update mechanism were integrated into the HACO algorithm to accelerate convergence and obtain global optimal solutions. The proposed model and algorithm were verified through the case study of the 2E-LCLRP in Nanjing, China. The HACO algorithm outperformed the original ant colony optimization (ACO) algorithm in terms of convergence rate and solution quality. This study provides significant insights for enhancing heuristic algorithms as well as valuable research methods. Furthermore, the results can help cold chain logistics companies in balancing economic costs and environmental benefits and address cold chain distribution of agricultural products. [ABSTRACT FROM AUTHOR]

The rapid advancement of deepfake technology presents significant challenges in detecting highly convincing fake videos, posing risks such as misinformation, identity theft, and privacy violations. In response, this paper proposes an innovative approach to deepfake video detection by integrating features derived from ant colony optimization–particle swarm optimization (ACO-PSO) and deep learning techniques. The proposed methodology leverages ACO-PSO features and deep learning models to enhance detection accuracy and robustness. Features from ACO-PSO are extracted from the spatial and temporal characteristics of video frames, capturing subtle patterns indicative of deepfake manipulation. These features are then used to train a deep learning classifier to automatically distinguish between authentic and deepfake videos. Extensive experiments using comparative datasets demonstrate the superiority of the proposed method in terms of detection accuracy, robustness to manipulation techniques, and generalization to unseen data. The computational efficiency of the approach is also analyzed, highlighting its practical feasibility for real-time applications. The findings revealed that the proposed method achieved an accuracy of 98.91% and an F1 score of 99.12%, indicating remarkable success in deepfake detection. The integration of ACO-PSO features and deep learning enables comprehensive analysis, bolstering precision and resilience in detecting deepfake content. This approach addresses the challenges involved in facial forgery detection and contributes to safeguarding digital media integrity amid misinformation and manipulation. [ABSTRACT FROM AUTHOR]

This paper proposes a flexible travel recommender model (FTRM) that emphasizes the symmetry between user preferences and travel constraints, addressing key challenges in the field such as the integration of diverse constraint types and the customization of travel itineraries. The key contribution of the proposed model lies in its integration with the item constraints data model (ICDM), which effectively manages a plethora of constraint types. Additionally, this study develops a novel algorithm inspired by ant colony optimization (ACO) principles, demonstrating performance metrics that are comparable to state-of-the-art algorithms in this field. A comprehensive set of systematic experimental analyses is conducted, employing various models across diverse situational contexts, with the primary goal of illustrating the capabilities of the proposed symmetrical FTRM using real-world data from the Durham dataset. The obtained results highlight the model's ability to accommodate diverse constraint types, facilitating the customization of travel itineraries to suit individual user preferences and achieve a balanced and symmetrical travel experience. Specifically, our model outperforms existing models in terms of flexibility and customization, showing significant improvements in user satisfaction and itinerary efficiency. [ABSTRACT FROM AUTHOR]

In order to monitor the sports load data of athletes in sports training, this paper studies the methods and systems of sports load monitoring and fatigue warning based on neural network technology. In this paper, the neural network parallel optimization algorithm based on big data is used to accurately estimate the motion load and intensity according to the determined motion mode and acceleration data, so as to realize the real-time monitoring of the exercise training. The results show that the value of η is usually small to ensure that the weight correction can truly follow the direction of the gradient descent. In this paper, 176 samples were extracted from the monitoring data collected by the "National Tennis Team Information Platform," 160 of which were selected as training samples and the other 16 as test samples. Ant colony size M = 20. The minimum value Wmin of the weight interval is −2, and the maximum value Wmax is 2. The maximum number of iterations is set to 200. σ = 1; that is, only one optimal solution is retained. The domain is divided into 60 parts evenly; that is, r = 60. Generally, η can be taken as any number [28] between [10-3, 10], but the value is usually small to ensure that the weight correction can truly follow the direction of the gradient descent. In this paper, the value is 0.003. In the early warning stage of exercise fatigue, reasonable measurement units of exercise fatigue time were divided according to the characteristics of different exercise items. It is proved that the Bayesian classification algorithm can effectively avoid the sports injury caused by overtraining by warning the fatigue and preventing the sports injury caused by overtraining. [ABSTRACT FROM AUTHOR]

Vehicle Ad hoc Networks (VANETs) have high mobility and a randomized connection structure, resulting in extremely dynamic behavior. Several challenges, such as frequent connection failures, sustainability, multi-hop data transfer, and data loss, affect the effectiveness of Transmission Control Protocols (TCP) on such wireless ad hoc networks. To avoid the problem, in this paper, mobility-aware zone-based routing in VANET is proposed. To achieve this concept, in this paper hybrid optimization algorithm is presented. The hybrid algorithm is a combination of Ant colony optimization (ACO) and artificial bee colony optimization (ABC). The proposed hybrid algorithm is designed for the routing process which is transmitting the information from one place to another. The optimal routing process is used to avoid traffic and link failure. The fitness function is designed based on Link stability and Residual energy. The validation of the proposed algorithm takes solution encoding, fitness calculation, and updating functions. To perform simulation experiments, NS2 simulator software is used. The performance of the proposed approach is analyzed based on different metrics namely, delivery ratio, delay time, throughput, and overhead. The effectiveness of the proposed method compared with different algorithms. Compared to other existing VANET algorithms, the hybrid algorithm has proven to be very efficient in terms of packet delivery ratio and delay. [ABSTRACT FROM AUTHOR]

Under the "Double Carbon" background, the development of green agricultural machinery is very fast. An important factor that determines the performance of electric farm machinery is the endurance capacity, which is directly related to the running path of farm machinery. The optimized driving path can reduce the operating loss and extend the mileage of agricultural machinery, then multi-node path planning helps to improve the working efficiency of electric tractors. Ant Colony Optimization (ACO) is often used to solve multi-node path planning problems. However, ACO has some problems, such as poor global search ability, few initial pheromones, poor convergence, and weak optimization ability, which is not conducive to obtaining the optimal path. This paper proposes a multi-node path planning algorithm based on Improved Whale Optimized ACO, named IWOA-ACO. The algorithm first introduces reverse learning strategy, nonlinear convergence factor, and adaptive inertia weight factor to improve the global and local convergence ability. Then, an appropriate evaluation function is designed to evaluate the solving process and obtain the best fitting parameters of ACO. Finally, the optimal objective function, fast convergence, and stable operation requirements are achieved through the best fitting parameters to obtain the global path optimization. The simulation results show that in flat environment, the length and energy consumption of IWOA-ACO planned path are the same as those of PSO-ACO, and are 0.61% less than those of WOA-ACO. In addition, in bump environment, the length and energy consumption of IWOA-ACO planned path are 1.91% and 4.32% less than those of PSO-ACO, and are 1.95% and 1.25% less than those of WOA-ACO. Therefore, it is helpful to improve the operating efficiency along with the endurance of electric tractors, which has practical application value. [ABSTRACT FROM AUTHOR]

As a novel network architecture, network function virtualization (NFV) greatly improves the flexibility and scalability of service provision. Deploying the service function chain (SFC) in an NFV environment needs to coordinate the instantiation of the virtual network function descriptor, network function embedding, and traffic steering, which also improves the complexity of the problem. Although heuristic algorithms are widely used to optimize this problem, due to the lack of complete SFC deployment solution space and digital coding scheme, the time complexity of the algorithm is difficult to meet the requirements. Therefore, this paper studies the digital coding scheme of the heuristic SFC deployment to improve time efficiency without reducing performance. Firstly, we model the SFC deployment as a 0–1 integer linear programming, considering the above factors, and then design a continuous digital solution space construction scheme based on N-Base coding (NBACO-SS) to optimize the above problems. NBACO-SS uses integer size and carry to map the complex SFC deployment to simple digital coding, evaluates the continuity of solution space through the Manhattan distance, and optimizes the continuity through the ant colony algorithm. Based on NBACO-SS, we reconstruct two heuristic algorithms to solve the SFC deployment problem. Experimental results demonstrate that NBACO-SS can improve the time efficiency by 20% without reducing the total network service traffic. [ABSTRACT FROM AUTHOR]

The thermal effect and heat dissipation have a significant impact on three-dimensional stacked chips, and the positional layout of the chip's three-dimensional layout directly affects the internal temperature field. One effective way is to plan the overall layout of three-dimensional integrated circuits by considering the thermal effect and layout utilization. In this paper, an ant colony algorithm is used to search for the most planned paths and achieve the overall layout optimization by considering the effects of power, temperature, and location on the thermal layout and using feedback optimization of pheromone concentration. The simulation results show that the optimization of the thermal layout of 3D integrated circuits can be well realized by adjusting the algorithm parameters. The maximum temperature, temperature gradient, and layout scheme verify reliability and practicability. It improves the utilization rate of chips, optimizes the layout, realizes energy conservation, and reduces resource waste. [ABSTRACT FROM AUTHOR]