With the increasing complexity of logistics operations,traditional static vehicle routing models are no longer sufficient.In practice,customer demands often arise dynamically,and multi-depot systems are commonly used ...With the increasing complexity of logistics operations,traditional static vehicle routing models are no longer sufficient.In practice,customer demands often arise dynamically,and multi-depot systems are commonly used to improve efficiency.This paper first introduces a vehicle routing problem with the goal of minimizing operating costs in a multi-depot environment with dynamic demand.New customers appear in the delivery process at any time and are periodically optimized according to time slices.Then,we propose a scheduling system TS-DPU based on an improved ant colony algorithm TS-ACO to solve this problem.The classical ant colony algorithm uses spatial distance to select nodes,while TS-ACO considers the impact of both temporal and spatial distance on node selection.Meanwhile,we adopt Cordeau’s Multi-Depot Vehicle Routing Problem with Time Windows(MDVRPTW)dataset to evaluate the performance of our system.According to the experimental results,TS-ACO,which considers spatial and temporal distance,is more effective than the classical ACO,which only considers spatial distance.展开更多
Traditional mining in open pit mines often uses explosives,leading to environmental hazards,with flyrock being a critical issue.In detail,excess flying rock beyond the designated explosion area was identified as the p...Traditional mining in open pit mines often uses explosives,leading to environmental hazards,with flyrock being a critical issue.In detail,excess flying rock beyond the designated explosion area was identified as the primary cause of fatal and non-fatal blasting hazards in open pit mining.Therefore,the accurate and reliable prediction of flyrock becomes crucial for effectively managing and mitigating associated problems.This study used the Light Gradient Boosting Machine(LightGBM)model to predict flyrock in a lead-zinc mine,with promising results.To improve its accuracy,multi-verse optimizer(MVO)and ant lion optimizer(ALO)metaheuristic algorithms were introduced.Results showed MVO-LightGBM outperformed conventional LightGBM.Additionally,decision tree(DT),support vector machine(SVM),and classification and regression tree(CART)models were trained and compared with MVO-LightGBM.The MVO-LightGBM model excelled over DT,SVM,and CART.This study highlights MVO-LightGBM's effectiveness and potential for broader applications.Furthermore,a multiple parametric sensitivity analysis(MPSA)algorithm was employed to specify the sensitivity of parameters.MPSA results indicated that the highest and lowest sensitivities are relevant to blasted rock per hole and spacing with theγ=1752.12 andγ=49.52,respectively.展开更多
In the wireless energy transmission service composition optimization problem,a key challenge is accurately capturing users’preferences for service criteria under complex influencing factors,and optimally selecting a ...In the wireless energy transmission service composition optimization problem,a key challenge is accurately capturing users’preferences for service criteria under complex influencing factors,and optimally selecting a composition solution under their budget constraints.Existing studies typically evaluate satisfaction solely based on energy transmission capacity,while overlooking critical factors such as price and trustworthiness of the provider,leading to a mismatch between optimization outcomes and user needs.To address this gap,we construct a user satisfaction evaluation model for multi-user and multi-provider scenarios,systematically incorporating service price,transmission capacity,and trustworthiness into the satisfaction assessment framework.Furthermore,we propose a Budget-Aware Preference Adjustment Model that predicts users’baseline preference weights from historical data and dynamically adjusts them according to budget levels,thereby reflecting user preferences more realistically under varying budget constraints.In addition,to tackle the composition optimization problem,we develop a ReflectiveEvolutionary Large Language Model—Guided Ant Colony Optimization algorithm,which leverages the reflective evolution capability of large language models to iteratively generate and refine heuristic information that guides the search process.Experimental results demonstrate that the proposed framework effectively integrates personalized preferences with budget sensitivity,accurately predicts users’preferences,and significantly enhances their satisfaction under complex constraints.展开更多
The proposed hybrid optimization algorithm integrates particle swarm optimizatio(PSO)with Ant Colony Optimization(ACO)to improve a number of pitfalls within PSO methods traditionally considered and/or applied to indus...The proposed hybrid optimization algorithm integrates particle swarm optimizatio(PSO)with Ant Colony Optimization(ACO)to improve a number of pitfalls within PSO methods traditionally considered and/or applied to industrial robots.Particle Swarm Optimization may frequently suffer from local optima and inaccuracies in identifying the geometric parameters,which are necessary for applications requiring high-accuracy performances.The proposed approach integrates pheromone-based learning of ACO with the D-H method of developing an error model;hence,the global search effectiveness together with the convergence accuracy is further improved.Comparison studies of the hybrid PSO-ACO algorithm show higher precision and effectiveness in the optimization of geometric error parameters compared to the traditional methods.This is a remarkable reduction of localization errors,thus yielding accuracy and reliability in industrial robotic systems,as the results show.This approach improves performance in those applications that demand high geometric calibration by reducing the geometric error.The paper provides an overview of input for developing robotics and automation,giving importance to precision in industrial engineering.The proposed hybrid methodology is a good way to enhance the working accuracy and effectiveness of industrial robots and shall enable their wide application to complex tasks that require a high degree of accuracy.展开更多
In this paper,a fusion model based on a long short-term memory(LSTM)neural network and enhanced search ant colony optimization(ENSACO)is proposed to predict the power degradation trend of proton exchange membrane fuel...In this paper,a fusion model based on a long short-term memory(LSTM)neural network and enhanced search ant colony optimization(ENSACO)is proposed to predict the power degradation trend of proton exchange membrane fuel cells(PEMFC).Firstly,the Shapley additive explanations(SHAP)value method is used to select external characteristic parameters with high contributions as inputs for the data-driven approach.Next,a novel swarm optimization algorithm,the enhanced search ant colony optimization,is proposed.This algorithm improves the ant colony optimization(ACO)algorithm based on a reinforcement factor to avoid premature convergence and accelerate the convergence speed.Comparative experiments are set up to compare the performance differences between particle swarm optimization(PSO),ACO,and ENSACO.Finally,a data-driven method based on ENSACO-LSTM is proposed to predict the power degradation trend of PEMFCs.And actual aging data is used to validate the method.The results show that,within a limited number of iterations,the optimization capability of ENSACO is significantly stronger than that of PSO and ACO.Additionally,the prediction accuracy of the ENSACO-LSTM method is greatly improved,with an average increase of approximately 50.58%compared to LSTM,PSO-LSTM,and ACO-LSTM.展开更多
Insects live in most places in the world,and there are billions of them.There are about 1.4 billion insects for every person on our planet!They are very important for nature.Bees and butterflies help plants grow by mo...Insects live in most places in the world,and there are billions of them.There are about 1.4 billion insects for every person on our planet!They are very important for nature.Bees and butterflies help plants grow by moving Dollen from one flower to another.Ants clean up by eating dead plants and animals.And butterflies are beautiful.They make us happy when we see them.Even though insects are small,they help keep the world healthy and full of life.展开更多
Ants rank among the most ecologically dominant and evolutionarily remarkable insects on the planet,capturing the imagination of both curious children and thoughtful scholars alike.Aristotle,impressed by their division...Ants rank among the most ecologically dominant and evolutionarily remarkable insects on the planet,capturing the imagination of both curious children and thoughtful scholars alike.Aristotle,impressed by their division of labor and cooperative behavior,described them as“political animals”.In Aesop’s Fables,they are celebrated for their foresight and diligence in preparing for hardship.Traditional Chinese narratives similarly portray ants as modest creatures that,through collective effort,achieve extraordinary power and influence.展开更多
The ability of queens and males of most ant species to disperse by flight has fundamentally contributed to the group’s evolutionary and ecological success and is a determining factor to take into account for biogeogr...The ability of queens and males of most ant species to disperse by flight has fundamentally contributed to the group’s evolutionary and ecological success and is a determining factor to take into account for biogeographic studies(Wagner and Liebherr 1992;Peeters and Ito 2001;Helms 2018).展开更多
The Internet of Things(IoT)has emerged as an important future technology.IoT-Fog is a new computing paradigm that processes IoT data on servers close to the source of the data.In IoT-Fog computing,resource allocation ...The Internet of Things(IoT)has emerged as an important future technology.IoT-Fog is a new computing paradigm that processes IoT data on servers close to the source of the data.In IoT-Fog computing,resource allocation and independent task scheduling aim to deliver short response time services demanded by the IoT devices and performed by fog servers.The heterogeneity of the IoT-Fog resources and the huge amount of data that needs to be processed by the IoT-Fog tasks make scheduling fog computing tasks a challenging problem.This study proposes an Adaptive Firefly Algorithm(AFA)for dependent task scheduling in IoT-Fog computing.The proposed AFA is a modified version of the standard Firefly Algorithm(FA),considering the execution times of the submitted tasks,the impact of synchronization requirements,and the communication time between dependent tasks.As IoT-Fog computing depends mainly on distributed fog node servers that receive tasks in a dynamic manner,tackling the communications and synchronization issues between dependent tasks is becoming a challenging problem.The proposed AFA aims to address the dynamic nature of IoT-Fog computing environments.The proposed AFA mechanism considers a dynamic light absorption coefficient to control the decrease in attractiveness over iterations.The proposed AFA mechanism performance was benchmarked against the standard Firefly Algorithm(FA),Puma Optimizer(PO),Genetic Algorithm(GA),and Ant Colony Optimization(ACO)through simulations under light,typical,and heavy workload scenarios.In heavy workloads,the proposed AFA mechanism obtained the shortest average execution time,968.98 ms compared to 970.96,1352.87,1247.28,and 1773.62 of FA,PO,GA,and ACO,respectively.The simulation results demonstrate the proposed AFA’s ability to rapidly converge to optimal solutions,emphasizing its adaptability and efficiency in typical and heavy workloads.展开更多
基金supported by the Startup Foundation for Introducing Talent of Nanjing University of Information Science and Technology.
文摘With the increasing complexity of logistics operations,traditional static vehicle routing models are no longer sufficient.In practice,customer demands often arise dynamically,and multi-depot systems are commonly used to improve efficiency.This paper first introduces a vehicle routing problem with the goal of minimizing operating costs in a multi-depot environment with dynamic demand.New customers appear in the delivery process at any time and are periodically optimized according to time slices.Then,we propose a scheduling system TS-DPU based on an improved ant colony algorithm TS-ACO to solve this problem.The classical ant colony algorithm uses spatial distance to select nodes,while TS-ACO considers the impact of both temporal and spatial distance on node selection.Meanwhile,we adopt Cordeau’s Multi-Depot Vehicle Routing Problem with Time Windows(MDVRPTW)dataset to evaluate the performance of our system.According to the experimental results,TS-ACO,which considers spatial and temporal distance,is more effective than the classical ACO,which only considers spatial distance.
基金funded by the Key Laboratory of Geological Safety of Coastal Urban Underground Space,Ministry of Natural Resources of China(Grant No.BHKF2022Y02)Natural Science Foundation of Guangdong Province,China(Grant No.2024A1515011162)Natural Science Foundation of Shandong Province,China(Grant No.ZR2024QE021).
文摘Traditional mining in open pit mines often uses explosives,leading to environmental hazards,with flyrock being a critical issue.In detail,excess flying rock beyond the designated explosion area was identified as the primary cause of fatal and non-fatal blasting hazards in open pit mining.Therefore,the accurate and reliable prediction of flyrock becomes crucial for effectively managing and mitigating associated problems.This study used the Light Gradient Boosting Machine(LightGBM)model to predict flyrock in a lead-zinc mine,with promising results.To improve its accuracy,multi-verse optimizer(MVO)and ant lion optimizer(ALO)metaheuristic algorithms were introduced.Results showed MVO-LightGBM outperformed conventional LightGBM.Additionally,decision tree(DT),support vector machine(SVM),and classification and regression tree(CART)models were trained and compared with MVO-LightGBM.The MVO-LightGBM model excelled over DT,SVM,and CART.This study highlights MVO-LightGBM's effectiveness and potential for broader applications.Furthermore,a multiple parametric sensitivity analysis(MPSA)algorithm was employed to specify the sensitivity of parameters.MPSA results indicated that the highest and lowest sensitivities are relevant to blasted rock per hole and spacing with theγ=1752.12 andγ=49.52,respectively.
基金supported by the National Natural Science Foundation of China under Grant 62472264the Natural Science Distinguished Youth Foundation of Shandong Province under Grant ZR2025QA13。
文摘In the wireless energy transmission service composition optimization problem,a key challenge is accurately capturing users’preferences for service criteria under complex influencing factors,and optimally selecting a composition solution under their budget constraints.Existing studies typically evaluate satisfaction solely based on energy transmission capacity,while overlooking critical factors such as price and trustworthiness of the provider,leading to a mismatch between optimization outcomes and user needs.To address this gap,we construct a user satisfaction evaluation model for multi-user and multi-provider scenarios,systematically incorporating service price,transmission capacity,and trustworthiness into the satisfaction assessment framework.Furthermore,we propose a Budget-Aware Preference Adjustment Model that predicts users’baseline preference weights from historical data and dynamically adjusts them according to budget levels,thereby reflecting user preferences more realistically under varying budget constraints.In addition,to tackle the composition optimization problem,we develop a ReflectiveEvolutionary Large Language Model—Guided Ant Colony Optimization algorithm,which leverages the reflective evolution capability of large language models to iteratively generate and refine heuristic information that guides the search process.Experimental results demonstrate that the proposed framework effectively integrates personalized preferences with budget sensitivity,accurately predicts users’preferences,and significantly enhances their satisfaction under complex constraints.
文摘The proposed hybrid optimization algorithm integrates particle swarm optimizatio(PSO)with Ant Colony Optimization(ACO)to improve a number of pitfalls within PSO methods traditionally considered and/or applied to industrial robots.Particle Swarm Optimization may frequently suffer from local optima and inaccuracies in identifying the geometric parameters,which are necessary for applications requiring high-accuracy performances.The proposed approach integrates pheromone-based learning of ACO with the D-H method of developing an error model;hence,the global search effectiveness together with the convergence accuracy is further improved.Comparison studies of the hybrid PSO-ACO algorithm show higher precision and effectiveness in the optimization of geometric error parameters compared to the traditional methods.This is a remarkable reduction of localization errors,thus yielding accuracy and reliability in industrial robotic systems,as the results show.This approach improves performance in those applications that demand high geometric calibration by reducing the geometric error.The paper provides an overview of input for developing robotics and automation,giving importance to precision in industrial engineering.The proposed hybrid methodology is a good way to enhance the working accuracy and effectiveness of industrial robots and shall enable their wide application to complex tasks that require a high degree of accuracy.
基金Supported by the Major Science and Technology Project of Jilin Province(20220301010GX)the International Scientific and Technological Cooperation(20240402071GH).
文摘In this paper,a fusion model based on a long short-term memory(LSTM)neural network and enhanced search ant colony optimization(ENSACO)is proposed to predict the power degradation trend of proton exchange membrane fuel cells(PEMFC).Firstly,the Shapley additive explanations(SHAP)value method is used to select external characteristic parameters with high contributions as inputs for the data-driven approach.Next,a novel swarm optimization algorithm,the enhanced search ant colony optimization,is proposed.This algorithm improves the ant colony optimization(ACO)algorithm based on a reinforcement factor to avoid premature convergence and accelerate the convergence speed.Comparative experiments are set up to compare the performance differences between particle swarm optimization(PSO),ACO,and ENSACO.Finally,a data-driven method based on ENSACO-LSTM is proposed to predict the power degradation trend of PEMFCs.And actual aging data is used to validate the method.The results show that,within a limited number of iterations,the optimization capability of ENSACO is significantly stronger than that of PSO and ACO.Additionally,the prediction accuracy of the ENSACO-LSTM method is greatly improved,with an average increase of approximately 50.58%compared to LSTM,PSO-LSTM,and ACO-LSTM.
文摘Insects live in most places in the world,and there are billions of them.There are about 1.4 billion insects for every person on our planet!They are very important for nature.Bees and butterflies help plants grow by moving Dollen from one flower to another.Ants clean up by eating dead plants and animals.And butterflies are beautiful.They make us happy when we see them.Even though insects are small,they help keep the world healthy and full of life.
基金supported by the National Natural Science Foundation of China(32388102 to G.Z.,32370668 to W.L.)Yunnan Provincial Science and Technology Department,Yunnan Fundamental Research Projects(202201AT070129 and 202401BC070017 to W.L.)。
文摘Ants rank among the most ecologically dominant and evolutionarily remarkable insects on the planet,capturing the imagination of both curious children and thoughtful scholars alike.Aristotle,impressed by their division of labor and cooperative behavior,described them as“political animals”.In Aesop’s Fables,they are celebrated for their foresight and diligence in preparing for hardship.Traditional Chinese narratives similarly portray ants as modest creatures that,through collective effort,achieve extraordinary power and influence.
基金funded by the“Departments of Excellence”program of the Italian Ministry for University and Research(MIUR,2018-2022 and MUR,2023-2027).
文摘The ability of queens and males of most ant species to disperse by flight has fundamentally contributed to the group’s evolutionary and ecological success and is a determining factor to take into account for biogeographic studies(Wagner and Liebherr 1992;Peeters and Ito 2001;Helms 2018).
基金the Deanship of Graduate Studies and Scientific Research at Najran University for funding this work under the Easy Funding Program grant code(NU/EFP/SERC/13/166).
文摘The Internet of Things(IoT)has emerged as an important future technology.IoT-Fog is a new computing paradigm that processes IoT data on servers close to the source of the data.In IoT-Fog computing,resource allocation and independent task scheduling aim to deliver short response time services demanded by the IoT devices and performed by fog servers.The heterogeneity of the IoT-Fog resources and the huge amount of data that needs to be processed by the IoT-Fog tasks make scheduling fog computing tasks a challenging problem.This study proposes an Adaptive Firefly Algorithm(AFA)for dependent task scheduling in IoT-Fog computing.The proposed AFA is a modified version of the standard Firefly Algorithm(FA),considering the execution times of the submitted tasks,the impact of synchronization requirements,and the communication time between dependent tasks.As IoT-Fog computing depends mainly on distributed fog node servers that receive tasks in a dynamic manner,tackling the communications and synchronization issues between dependent tasks is becoming a challenging problem.The proposed AFA aims to address the dynamic nature of IoT-Fog computing environments.The proposed AFA mechanism considers a dynamic light absorption coefficient to control the decrease in attractiveness over iterations.The proposed AFA mechanism performance was benchmarked against the standard Firefly Algorithm(FA),Puma Optimizer(PO),Genetic Algorithm(GA),and Ant Colony Optimization(ACO)through simulations under light,typical,and heavy workload scenarios.In heavy workloads,the proposed AFA mechanism obtained the shortest average execution time,968.98 ms compared to 970.96,1352.87,1247.28,and 1773.62 of FA,PO,GA,and ACO,respectively.The simulation results demonstrate the proposed AFA’s ability to rapidly converge to optimal solutions,emphasizing its adaptability and efficiency in typical and heavy workloads.
