In this paper,an adaptive cubic regularisation algorithm based on affine scaling methods(ARCBASM)is proposed for solving nonlinear equality constrained programming with nonnegative constraints on variables.From the op...In this paper,an adaptive cubic regularisation algorithm based on affine scaling methods(ARCBASM)is proposed for solving nonlinear equality constrained programming with nonnegative constraints on variables.From the optimality conditions of the problem,we introduce appropriate affine matrix and construct an affine scaling ARC subproblem with linearized constraints.Composite step methods and reduced Hessian methods are applied to tackle the linearized constraints.As a result,a standard unconstrained ARC subproblem is deduced and its solution can supply sufficient decrease.The fraction to the boundary rule maintains the strict feasibility(for nonnegative constraints on variables)of every iteration point.Reflection techniques are employed to prevent the iterations from approaching zero too early.Under mild assumptions,global convergence of the algorithm is analysed.Preliminary numerical results are reported.展开更多
The outstanding growth in the applications of large language models(LLMs)demonstrates the significance of adaptive and efficient prompt engineering tactics.The existing methods may not be variable,vigorous and streaml...The outstanding growth in the applications of large language models(LLMs)demonstrates the significance of adaptive and efficient prompt engineering tactics.The existing methods may not be variable,vigorous and streamlined in different domains.The offered study introduces an immediate optimization outline,named PROMPTx-PE,that is going to yield a greater level of precision and strength when it comes to the assignments that are premised on LLM.The proposed systemfeatures a timely selection schemewhich is informed by reinforcement learning,a contextual layer and a dynamic weighting module which is regulated by Lyapunov-based stability guidelines.The PROMPTx-PE dynamically varies the exploration and exploitation of the prompt space,depending on real-time feedback and multi-objective reward development.Extensive testing on both benchmark(GLUE,SuperGLUE)and domain-specific data(Healthcare-QA and Industrial-NER)demonstrates a large best performance to be 89.4%and a strong robustness disconnect with under 3%computation expense.The results confirm the effectiveness,consistency,and scalability of PROMPTx-PE as a platform of adaptive prompt engineering based on recent uses of LLMs.展开更多
Designing appropriate loss functions is critical to the success of supervised learning models.However,most conventional losses are fixed and manually designed,making them suboptimal for diverse and dynamic learning sc...Designing appropriate loss functions is critical to the success of supervised learning models.However,most conventional losses are fixed and manually designed,making them suboptimal for diverse and dynamic learning scenarios.In this work,we propose an Adaptive Meta-Loss Network(Adaptive-MLN)that learns to generate taskagnostic loss functions tailored to evolving classification problems.Unlike traditional methods that rely on static objectives,Adaptive-MLN treats the loss function itself as a trainable component,parameterized by a shallow neural network.To enable flexible,gradient-free optimization,we introduce a hybrid evolutionary approach that combines GeneticAlgorithms(GA)for global exploration and Evolution Strategies(ES)for local refinement.This co-evolutionary process dynamically adjusts the loss landscape,improvingmodel generalization without relying on analytic gradients or handcrafted heuristics.Experimental evaluations on synthetic tasks and the CIFAR-10 andMNIST datasets demonstrate that our approach consistently outperforms standard losses such as Cross-Entropy and Mean Squared Error in terms of accuracy,convergence,and adaptability.展开更多
The healthcare field is fraught with challenges associated with severe class imbalance,wherein such critical conditions like sepsis,cardiac arrest,and drug adverse reactions are rare but have dire clinical consequence...The healthcare field is fraught with challenges associated with severe class imbalance,wherein such critical conditions like sepsis,cardiac arrest,and drug adverse reactions are rare but have dire clinical consequences.This paper presents a new framework,Deep Reinforcement Adaptive Gradient Optimization Network to Mining Rare Events(DRAGON-MINE),to demonstrate how deep reinforcement learning can be used synergistically with adaptive gradient optimization and address the inherent weaknesses of current methods in the prediction of rare health events.The suggested architecture uses a dual-pathway consisting of a reinforcement learning agent to dynamically reweigh samples and an adaptive gradient optimizer to follow novel learning rates.With extensive experiments on the MIMIC-IV and eICU-CRD datasets,DRAGON-MINE consistently outperforms recent state-of-the-art methods for sepsis,cardiac arrest,and adverse drug reaction prediction,achieving AUROC values of 92.3%and 91.6%for sepsis prediction on MIMIC-IV and eICU-CRD,respectively,while consistently outperforming Transformer-,CNN-RNN-,and Fed-Ensemble-based methods across all evaluated tasks and datasets,with particularly strong gains observed in precision-recall performance under severe class imbalance.With its high sensitivity(88.4%)and specificity(90.2%),DRAGON-MINE enables reliable early warning of rare clinical events in critical care settings while minimizing false alarms,supporting safer clinical decision support systems,and demonstrating strong potential for scalable deployment across multi-institutional intensive care environments through federated learning.展开更多
To address the limitations of the sand cat swarm optimization(SCSO) algorithm which are slow convergence and low accuracy in complex problems,this study proposes an improved SCSO(ISCSO) algorithm that integrates multi...To address the limitations of the sand cat swarm optimization(SCSO) algorithm which are slow convergence and low accuracy in complex problems,this study proposes an improved SCSO(ISCSO) algorithm that integrates multiple enhancement strategies.Firstly,Kent chaotic mapping initializes the population for uniform distribution.Secondly,somersault foraging strategy is introduced during the search and attack phases,allowing the algorithm to escape local optima by intercepting evasive prey.Simultaneously,an adaptive Lévy flight strategy is incorporated into the attack phase to bolster global exploration.Finally,the vertical and horizontal crossover strategy is implemented to enhance population diversity.The performance of the proposed algorithm is evaluated using 16 benchmark test functions.The experimental results demonstrate that ISCSO significantly outperforms the original SCSO and shows notable advantages over other metaheuristic algorithms.Furthermore,application to a pressure vessel design problem verifies ISCSO's effectiveness in solving practical engineering optimization challenges.展开更多
Realizing optimal control performance for continuum robots(CRs) poses huge challenges on traditional modelbased optimal control approaches due to their high degrees of freedom,complex nonlinear dynamics and soft conti...Realizing optimal control performance for continuum robots(CRs) poses huge challenges on traditional modelbased optimal control approaches due to their high degrees of freedom,complex nonlinear dynamics and soft continuum morphologies which are difficult to explicitly model.This paper proposes a model-free adaptive optimal control algorithm(ADAPT)for CRs.In our strategy,we consider CRs as a class of nonlinear continuous-time dynamical systems in the state space,wherein the position of the end-effector is considered as the state and the input torque is mapped as the control input.Then,the optimized Hamilton-Jacobi-Bellman(HJB) equation is derived by optimal control principles,and subsequently solved by the proposed ADAPT algorithm without requiring knowledge of the original system dynamics.Under some mild assumptions,the global stability and convergence of the closed-loop control approach are guaranteed.Several simulation experiments are conducted on a magnetic CR(MCR) to demonstrate the practicality and effectiveness of the ADAPT algorithm.展开更多
Parameterized level-set method(PLSM)has been proposed and developed for many years,and is renowned for its efficacy in ad-dressing topology optimization challenges associated with intricate boundaries and nucleation o...Parameterized level-set method(PLSM)has been proposed and developed for many years,and is renowned for its efficacy in ad-dressing topology optimization challenges associated with intricate boundaries and nucleation of new holes.However,most pertinent investigations in the field rely predominantly on fixed background mesh,which is never remeshed.Consequently,the mesh element partitioned by material interface during the optimization process necessitates approximation by using artificial interpolation models to obtain its element stiffness or other properties.This paper introduces a novel approach to topology op-timization by integrating the PLSM with body-fitted adaptive mesh and Helmholtz-type filter.Primarily,combining the PLSM with body-fitted adaptive mesh enables the regeneration of mesh based on the zero level-set interface.This not only precludes the direct traversal of the material interface through the mesh element during the topology optimization process,but also improves the accuracy of calculation.Additionally,the incorporation of a Helmholtz-type partial differential equation filter,relying solely on mesh information essential for finite element discretization,serves to regulate the topological complexity and the minimum feature size of the optimized structure.Leveraging these advantages,the topology optimization program demonstrates its versa-tility by successfully addressing various design problems,encompassing the minimum mean compliance problem and minimum energy dissipation problem.Ultimately,the result of numerical example indicates that the optimized structure exhibits a dis-tinct and smooth boundary,affirming the effective control over both topological complexity and the minimum feature size of the optimized structure.展开更多
As optimization problems continue to grow in complexity,the need for effective metaheuristic algorithms becomes increasingly evident.However,the challenge lies in identifying the right parameters and strategies for th...As optimization problems continue to grow in complexity,the need for effective metaheuristic algorithms becomes increasingly evident.However,the challenge lies in identifying the right parameters and strategies for these algorithms.In this paper,we introduce the adaptive multi-strategy Rabbit Algorithm(RA).RA is inspired by the social interactions of rabbits,incorporating elements such as exploration,exploitation,and adaptation to address optimization challenges.It employs three distinct subgroups,comprising male,female,and child rabbits,to execute a multi-strategy search.Key parameters,including distance factor,balance factor,and learning factor,strike a balance between precision and computational efficiency.We offer practical recommendations for fine-tuning five essential RA parameters,making them versatile and independent.RA is capable of autonomously selecting adaptive parameter settings and mutation strategies,enabling it to successfully tackle a range of 17 CEC05 benchmark functions with dimensions scaling up to 5000.The results underscore RA’s superior performance in large-scale optimization tasks,surpassing other state-of-the-art metaheuristics in convergence speed,computational precision,and scalability.Finally,RA has demonstrated its proficiency in solving complicated optimization problems in real-world engineering by completing 10 problems in CEC2020.展开更多
Cloud computing has become an essential technology for the management and processing of large datasets,offering scalability,high availability,and fault tolerance.However,optimizing data replication across multiple dat...Cloud computing has become an essential technology for the management and processing of large datasets,offering scalability,high availability,and fault tolerance.However,optimizing data replication across multiple data centers poses a significant challenge,especially when balancing opposing goals such as latency,storage costs,energy consumption,and network efficiency.This study introduces a novel Dynamic Optimization Algorithm called Dynamic Multi-Objective Gannet Optimization(DMGO),designed to enhance data replication efficiency in cloud environments.Unlike traditional static replication systems,DMGO adapts dynamically to variations in network conditions,system demand,and resource availability.The approach utilizes multi-objective optimization approaches to efficiently balance data access latency,storage efficiency,and operational costs.DMGO consistently evaluates data center performance and adjusts replication algorithms in real time to guarantee optimal system efficiency.Experimental evaluations conducted in a simulated cloud environment demonstrate that DMGO significantly outperforms conventional static algorithms,achieving faster data access,lower storage overhead,reduced energy consumption,and improved scalability.The proposed methodology offers a robust and adaptable solution for modern cloud systems,ensuring efficient resource consumption while maintaining high performance.展开更多
Current topology optimization methods for nonlinear continuum structures often suffer from low computational efficiency and limited applicability to complex nonlinear problems.To address these issues,this paper propos...Current topology optimization methods for nonlinear continuum structures often suffer from low computational efficiency and limited applicability to complex nonlinear problems.To address these issues,this paper proposes an improved bi-directional evolutionary structural optimization(BESO)method tailored for maximizing stiffness in nonlinear structures.The optimization program is developed in Python and can be combined with Abaqus software to facilitate finite element analysis(FEA).To accelerate the speed of optimization,a novel adaptive evolutionary ratio(ER)strategy based on the BESO method is introduced,with four distinct adaptive ER functions proposed.The Newton-Raphson method is utilized for iteratively solving nonlinear equilibrium equations,and the sensitivity information for updating design variables is derived using the adjoint method.Additionally,this study extends topology optimization to account for both material nonlinearity and geometric nonlinearity,analyzing the effects of various nonlinearities.A series of comparative studies are conducted using benchmark cases to validate the effectiveness of the proposed method.The results show that the BESO method with adaptive ER significantly improves the optimization efficiency.Compared to the BESO method with a fixed ER,the convergence speed of the four adaptive ER BESO methods is increased by 37.3%,26.7%,12%and 18.7%,respectively.Given that Abaqus is a powerful FEA platform,this method has the potential to be extended to large-scale engineering structures and to address more complex optimization problems.This research proposes an improved BESO method with novel adaptive ER,which significantly accelerates the optimization process and enables its application to topology optimization of nonlinear structures.展开更多
The increasing penetration of second-life battery energy storage systems(SLBESS)in power grids presents substantial challenges to system operation and control due to the heterogeneous characteristics and uncertain deg...The increasing penetration of second-life battery energy storage systems(SLBESS)in power grids presents substantial challenges to system operation and control due to the heterogeneous characteristics and uncertain degradation patterns of repurposed batteries.This paper presents a novel model-free adaptive voltage controlembedded dung beetle-inspired heuristic optimization algorithmfor optimal SLBESS capacity configuration and power dispatch.To simultaneously address the computational complexity and ensure system stability,this paper develops a comprehensive bilevel optimization framework.At the upper level,a dung beetle optimization algorithmdetermines the optimal SLBESS capacity configuration byminimizing total lifecycle costswhile incorporating the charging/discharging power trajectories derived from the model-free adaptive voltage control strategy.At the lower level,a health-priority power dispatch optimization model intelligently allocates power demands among heterogeneous battery groups based on their real-time operational states,state-of-health variations,and degradation constraints.The proposed model-free approach circumvents the need for complex battery charging/discharging power controlmodels and extensive historical data requirements whilemaintaining system stability through adaptive controlmechanisms.A novel cycle life degradation model is developed to quantify the relationship between remaining useful life,depth of discharge,and operational patterns.The integrated framework enables simultaneous strategic planning and operational control,ensuring both economic efficiency and extended battery lifespan.The effectiveness of the proposed method is validated through comprehensive case studies on hybrid energy storage systems,demonstrating superior computational efficiency,robust performance across different network configurations,and significant improvements in battery utilization compared to conventional approaches.展开更多
Accurate forecasting of wind power is crucial for ensuring the reliable operation of the electrical grid.Due to the impact of various factors,wind power forecasting presents a significant challenge.This paper presents...Accurate forecasting of wind power is crucial for ensuring the reliable operation of the electrical grid.Due to the impact of various factors,wind power forecasting presents a significant challenge.This paper presents the model that integrates Osprey and adaptive T-distribution dung beetle algorithm for optimizing a convolutional neural network.The CNN-BiLSTM-Attention model combines bidirectional long short-term memory neural networks with an attention mechanism,thereby improving the accuracy of wind power generation predictions.The original data is subjected to Variational Mode Decomposition(VMD)for analysis,taking into account the fluctuations in wind power across different periods.The BiLSTM network with short-term memory processes time-series wind power data,yielding an optimal predictive performance.The integration of the osprey algorithm and adaptive T-distribution within the Dung Beetle Optimization Algorithm was utilized to optimize the hyperparameters of the CNN-BiLSTM-Attention model,thereby enhancing its predictive performance.To assess the efficacy of the CNN-BiLSTM-Attention algorithm,enhanced by Ospreys and adaptive T-distributed dung beetle algorithm,we conducted experiments using the CEC2021 benchmark function.The integrated Osprey and adaptive T-distribution Dung Beetle algorithm has excellent global optimization performance when dealing with complex optimization problems.The fusion of Osprey and the adaptive T-distribution Dung beetle algorithm optimized the CNN-BiLSTM-Attention algorithm as well as other optimization algorithms for ablation experiments.The results show that the improved algorithm performs well in predicting wind power.The experimental findings suggest that the model’s predictive efficiency has enhanced by a minimum of 17.74%.展开更多
Aim To introduce a new method of adaptive shape optimization (ASOP) based on three-dimensional structure boundary strength and optimize an engine bearing cap with the method. Methods Using the normal substance's p...Aim To introduce a new method of adaptive shape optimization (ASOP) based on three-dimensional structure boundary strength and optimize an engine bearing cap with the method. Methods Using the normal substance's property of thermal expansion and cooling shrinkage,the load which is proportional to the difference between the nodes' stress and their respective objective stress were applied to the corresponding variable nodes on the boundary.The thermal load made the nodes whose stress is greater than their objective stress expand along the boundary's normal direction and the nodes whose stress is less than objec- tive stress shrink in the opposite direction , This process would repeat until the stress on the boundary nodes was converge to the objective stress. Results The satisfied results have been obtained when optimizing an engine bearing cap.The mass of the bearing cap is reduced to 55 percent of the total. Conclusion ASOP is an efficient,practical and reliable method which is suitable for optimizing the shape of the continuous structures.展开更多
Model checking is crucial in statistical analyses and has garnered significant attention in the academic literature.However,certain challenges persist in scenarios that involve large-scale datasets and limited resourc...Model checking is crucial in statistical analyses and has garnered significant attention in the academic literature.However,certain challenges persist in scenarios that involve large-scale datasets and limited resource allocations.This research introduces a novel subsampling methodology for testing regression models with continuous and categorical predictors,referred to as the Subsampling Adaptive Projection-Test(SAPT).This innovative approach demonstrates substantial improvements in test power for both local and global alternatives,outperforming conventional uniform subsampling mechanisms.The authors rigorously establish the asymptotic properties of SAPT and delineate its maximum achievable power under asymptotic conditions.Comprehensive simulations and real-world dataset applications provide robust validation of the proposed theoretical propositions.展开更多
This article presents an adaptive intelligent control strategy applied to a lumped-parameter evaporator model,i.e.,a simplified dynamic representation treating the evaporator as a single thermal node with uniform temp...This article presents an adaptive intelligent control strategy applied to a lumped-parameter evaporator model,i.e.,a simplified dynamic representation treating the evaporator as a single thermal node with uniform temperature distribution,suitable for control design due to its balance between physical fidelity and computational simplicity.The controller uses a wavelet-based neural proportional,integral,derivative(PID)controller with IIR filtering(infinite impulse response).The dynamic model captures the essential heat and mass transfer phenomena through a nonlinear energy balance,where the cooling capacity“Qevap”is expressed as a non-linear function of the compressor frequency and the temperature difference,specifically,Q_(evap)=k_(1)u(T_(in)−T_(e))with u as compressor frequency,Te evaporator temperature,and Tin inlet fluid temperature.The operating conditions of the system,in general terms,focus on the following variables,the overall thermal capacity is 1000 J/K,typical for small-capacity heat exchangers,The mass flow is 0.05 kg/s,typical for secondary liquid cooling circuits,the overall loss coefficient of 50 W/K that corresponds to small evaporators with partial insulation,the temperatures(inlet)of 10℃and the temperature of environment of 25℃,thermal load of 200 W that corresponds to a small-scaled air conditioning applications.To handle system nonlinearities and improve control performance,aMorlet wavelet-based neural network(Wavenet)is used to dynamically adjust the PID gains online.An IIR filter is incorporated to smooth the adaptive gains,improving stability and reducing oscillations.In contrast to prior wavelet-or neural-adaptive PID controllers in HVAC applications,which typically adjust gains without explicit filtering or not tailored to evaporator dynamics,this work introduces the first PID–Wavenet scheme augmented with an IIR-based stabilization layer,specifically designed to address the combined challenges of nonlinear evaporator behavior,gain oscillation,and real-time implementability.The proposed controller(PID-Wavenet+IIR)is implemented and validated inMATLAB/Simulink,demonstrating superior performance compared to a conventional PID tuned using Simulink’s auto-tuning function.Key results include a reduction in settling time from 13.3 to 8.2 s,a reduction in overshoot from 3.5%to 0.8%,a reduction in steady-state error from 0.12℃ to 0.02℃and a 13%reduction in energy overall consumption.The controller also exhibits greater robustness and adaptability under varying thermal loads.This explicit integration of wavelet-driven adaptation with IIR-filtered gain shaping constitutes the main methodological contribution and novelty of the work.These findings validate the effectiveness of the wavelet-based adaptive approach for advanced thermal management in refrigeration and HVAC systems,with potential applications in controlling variable-speed compressors,liquid chillers,and compact cooling units.展开更多
This paper develops an advanced framework for the operational optimization of integrated multi-energy systems that encompass electricity,gas,and heating networks.Introducing a cutting-edge stochastic gradient-enhanced...This paper develops an advanced framework for the operational optimization of integrated multi-energy systems that encompass electricity,gas,and heating networks.Introducing a cutting-edge stochastic gradient-enhanced distributionally robust optimization approach,this study integrates deep learning models,especially generative adversarial networks,to adeptly handle the inherent variability and uncertainties of renewable energy and fluctuating consumer demands.The effectiveness of this framework is rigorously tested through detailed simulations mirroring real-world urban energy consumption,renewable energy production,and market price fluctuations over an annual period.The results reveal substantial improvements in the resilience and efficiency of the grid,achieving a reduction in power distribution losses by 15%and enhancing voltage stability by 20%,markedly outperforming conventional systems.Additionally,the framework facilitates up to 25%in cost reductions during peak demand periods,significantly lowering operational costs.The adoption of stochastic gradients further refines the framework’s ability to continually adjust to real-time changes in environmental and market conditions,ensuring stable grid operations and fostering active consumer engagement in demand-side management.This strategy not only aligns with contem-porary sustainable energy practices but also provides scalable and robust solutions to pressing challenges in modern power network management.展开更多
The multi-objective optimization problems,especially in constrained environments such as power distribution planning,demand robust strategies for discovering effective solutions.This work presents the improved variant...The multi-objective optimization problems,especially in constrained environments such as power distribution planning,demand robust strategies for discovering effective solutions.This work presents the improved variant of the Multi-population Cooperative Constrained Multi-Objective Optimization(MCCMO)Algorithm,termed Adaptive Diversity Preservation(ADP).This enhancement is primarily focused on the improvement of constraint handling strategies,local search integration,hybrid selection approaches,and adaptive parameter control.Theimproved variant was experimented on with the RWMOP50 power distribution systemplanning benchmark.As per the findings,the improved variant outperformed the original MCCMO across the eleven performance metrics,particularly in terms of convergence speed,constraint handling efficiency,and solution diversity.The results also establish that MCCMOADP consistently delivers substantial performance gains over the baseline MCCMO,demonstrating its effectiveness across performancemetrics.The new variant also excels atmaintaining the balanced trade-off between exploration and exploitation throughout the search process,making it especially suitable for complex optimization problems in multiconstrained power systems.These enhancements make MCCMO-ADP a valuable and promising candidate for handling problems such as renewable energy scheduling,logistics planning,and power system optimization.Future work will benchmark the MCCMO-ADP against widely recognized algorithms such as NSGA-Ⅱ,NSGA-Ⅲ,and MOEA/D and will also extend its validation to large-scale real-world optimization domains to further consolidate its generalizability.展开更多
An optimized volt-ampere reactive(VAR)control framework is proposed for transmission-level power systems to simultaneously mitigate voltage deviations and active-power losses through coordinated control of large-scale...An optimized volt-ampere reactive(VAR)control framework is proposed for transmission-level power systems to simultaneously mitigate voltage deviations and active-power losses through coordinated control of large-scale wind/solar farms with shunt static var generators(SVGs).The model explicitly represents reactive-power regulation characteristics of doubly-fed wind turbines and PV inverters under real-time meteorological conditions,and quantifies SVG high-speed compensation capability,enabling seamless transition from localized VAR management to a globally coordinated strategy.An enhanced adaptive gain-sharing knowledge optimizer(AGSK-SD)integrates simulated annealing and diversity maintenance to autonomously tune voltage-control actions,renewable source reactive-power set-points,and SVG output.The algorithm adaptively modulates knowledge factors and ratios across search phases,performs SA-based fine-grained local exploitation,and periodically re-injects population diversity to prevent premature convergence.Comprehensive tests on IEEE 9-bus and 39-bus systems demonstrate AGSK-SD’s superiority over NSGA-II and MOPSO in hypervolume(HV),inverse generative distance(IGD),and spread metrics while maintaining acceptable computational burden.The method reduces network losses from 2.7191 to 2.15 MW(20.79%reduction)and from 15.1891 to 11.22 MW(26.16%reduction)in the 9-bus and 39-bus systems respectively.Simultaneously,the cumulative voltage-deviation index decreases from 0.0277 to 3.42×10^(−4) p.u.(98.77%reduction)in the 9-bus system,and from 0.0556 to 0.0107 p.u.(80.76%reduction)in the 39-bus system.These improvements demonstrate significant suppression of line losses and voltage fluctuations.Comparative analysis with traditional heuristic optimization algorithms confirms the superior performance of the proposed approach.展开更多
Based on results of chaos characteristics comparing one-dimensional iterative chaotic self-map x = sin（2/x） with infinite collapses within the finite region[-1, 1] to some representative iterative chaotic maps with ...Based on results of chaos characteristics comparing one-dimensional iterative chaotic self-map x = sin（2/x） with infinite collapses within the finite region[-1, 1] to some representative iterative chaotic maps with finite collapses （e.g., Logistic map, Tent map, and Chebyshev map）, a new adaptive mutative scale chaos optimization algorithm （AMSCOA） is proposed by using the chaos model x = sin（2/x）. In the optimization algorithm, in order to ensure its advantage of speed convergence and high precision in the seeking optimization process, some measures are taken： 1） the searching space of optimized variables is reduced continuously due to adaptive mutative scale method and the searching precision is enhanced accordingly; 2） the most circle time is regarded as its control guideline. The calculation examples about three testing functions reveal that the adaptive mutative scale chaos optimization algorithm has both high searching speed and precision.展开更多
Adaptive optimization is one of the means that agile organization of command and control resource （AOC2R） adapts for the dynamic battlefield environment. A math model of the adaptive optimization of AOC2R is put for...Adaptive optimization is one of the means that agile organization of command and control resource （AOC2R） adapts for the dynamic battlefield environment. A math model of the adaptive optimization of AOC2R is put forward by analyzing the interrelating concept and research. The model takes the adaptive process as a multi-stage decision making problem. The 2-phases method is presented to calculate the model, which obtains the related parameters by running the colored Petri net （CPN） model of AOC2R and then searches for the result by ant colony optimization （ACO） algorithm integrated with genetic optimization techniques. The simulation results demonstrate that the proposed algorithm greatly improves the performance of AOC2R.展开更多
基金Supported by the National Natural Science Foundation of China(12071133)Natural Science Foundation of Henan Province(252300421993)Key Scientific Research Project of Higher Education Institutions in Henan Province(25B110005)。
文摘In this paper,an adaptive cubic regularisation algorithm based on affine scaling methods(ARCBASM)is proposed for solving nonlinear equality constrained programming with nonnegative constraints on variables.From the optimality conditions of the problem,we introduce appropriate affine matrix and construct an affine scaling ARC subproblem with linearized constraints.Composite step methods and reduced Hessian methods are applied to tackle the linearized constraints.As a result,a standard unconstrained ARC subproblem is deduced and its solution can supply sufficient decrease.The fraction to the boundary rule maintains the strict feasibility(for nonnegative constraints on variables)of every iteration point.Reflection techniques are employed to prevent the iterations from approaching zero too early.Under mild assumptions,global convergence of the algorithm is analysed.Preliminary numerical results are reported.
基金supported by the National Science and Technology Council(NSTC),Taiwan,under grant number 114-2221-E-182-041-MY3by Chang Gung University and Chang Gung Memorial Hospital under project number NERPD4Q0021.
文摘The outstanding growth in the applications of large language models(LLMs)demonstrates the significance of adaptive and efficient prompt engineering tactics.The existing methods may not be variable,vigorous and streamlined in different domains.The offered study introduces an immediate optimization outline,named PROMPTx-PE,that is going to yield a greater level of precision and strength when it comes to the assignments that are premised on LLM.The proposed systemfeatures a timely selection schemewhich is informed by reinforcement learning,a contextual layer and a dynamic weighting module which is regulated by Lyapunov-based stability guidelines.The PROMPTx-PE dynamically varies the exploration and exploitation of the prompt space,depending on real-time feedback and multi-objective reward development.Extensive testing on both benchmark(GLUE,SuperGLUE)and domain-specific data(Healthcare-QA and Industrial-NER)demonstrates a large best performance to be 89.4%and a strong robustness disconnect with under 3%computation expense.The results confirm the effectiveness,consistency,and scalability of PROMPTx-PE as a platform of adaptive prompt engineering based on recent uses of LLMs.
基金supported by the National Natural Science Foundation of China(NSFC)under Grant number:82171965.
文摘Designing appropriate loss functions is critical to the success of supervised learning models.However,most conventional losses are fixed and manually designed,making them suboptimal for diverse and dynamic learning scenarios.In this work,we propose an Adaptive Meta-Loss Network(Adaptive-MLN)that learns to generate taskagnostic loss functions tailored to evolving classification problems.Unlike traditional methods that rely on static objectives,Adaptive-MLN treats the loss function itself as a trainable component,parameterized by a shallow neural network.To enable flexible,gradient-free optimization,we introduce a hybrid evolutionary approach that combines GeneticAlgorithms(GA)for global exploration and Evolution Strategies(ES)for local refinement.This co-evolutionary process dynamically adjusts the loss landscape,improvingmodel generalization without relying on analytic gradients or handcrafted heuristics.Experimental evaluations on synthetic tasks and the CIFAR-10 andMNIST datasets demonstrate that our approach consistently outperforms standard losses such as Cross-Entropy and Mean Squared Error in terms of accuracy,convergence,and adaptability.
文摘The healthcare field is fraught with challenges associated with severe class imbalance,wherein such critical conditions like sepsis,cardiac arrest,and drug adverse reactions are rare but have dire clinical consequences.This paper presents a new framework,Deep Reinforcement Adaptive Gradient Optimization Network to Mining Rare Events(DRAGON-MINE),to demonstrate how deep reinforcement learning can be used synergistically with adaptive gradient optimization and address the inherent weaknesses of current methods in the prediction of rare health events.The suggested architecture uses a dual-pathway consisting of a reinforcement learning agent to dynamically reweigh samples and an adaptive gradient optimizer to follow novel learning rates.With extensive experiments on the MIMIC-IV and eICU-CRD datasets,DRAGON-MINE consistently outperforms recent state-of-the-art methods for sepsis,cardiac arrest,and adverse drug reaction prediction,achieving AUROC values of 92.3%and 91.6%for sepsis prediction on MIMIC-IV and eICU-CRD,respectively,while consistently outperforming Transformer-,CNN-RNN-,and Fed-Ensemble-based methods across all evaluated tasks and datasets,with particularly strong gains observed in precision-recall performance under severe class imbalance.With its high sensitivity(88.4%)and specificity(90.2%),DRAGON-MINE enables reliable early warning of rare clinical events in critical care settings while minimizing false alarms,supporting safer clinical decision support systems,and demonstrating strong potential for scalable deployment across multi-institutional intensive care environments through federated learning.
基金Supported by the National Key R&D Program of China (No.2022ZD0119000)the Natural Science Foundation of Shaanxi Province (No.2025JC-YBMS-736,2025JC-YBMS-343)Shaanxi Province Key Research and Development Project (2025CY-YBXM-061)。
文摘To address the limitations of the sand cat swarm optimization(SCSO) algorithm which are slow convergence and low accuracy in complex problems,this study proposes an improved SCSO(ISCSO) algorithm that integrates multiple enhancement strategies.Firstly,Kent chaotic mapping initializes the population for uniform distribution.Secondly,somersault foraging strategy is introduced during the search and attack phases,allowing the algorithm to escape local optima by intercepting evasive prey.Simultaneously,an adaptive Lévy flight strategy is incorporated into the attack phase to bolster global exploration.Finally,the vertical and horizontal crossover strategy is implemented to enhance population diversity.The performance of the proposed algorithm is evaluated using 16 benchmark test functions.The experimental results demonstrate that ISCSO significantly outperforms the original SCSO and shows notable advantages over other metaheuristic algorithms.Furthermore,application to a pressure vessel design problem verifies ISCSO's effectiveness in solving practical engineering optimization challenges.
基金supported in part by the Innovation and Technology Commission of Hong Kong,China(ITS/136/20,ITS/234/21,MHP/096/22,ITS/235/22)Multi-Scale Medical Robotics Center,InnoHK,China(8312051)+1 种基金Research Grants Council(RGC) of Hong Kong,China(CUHK 14217822,CUHK14207823,AoE/E-407/24-N)The Chinese University of Hong Kong(CUHK) Direct Grant。
文摘Realizing optimal control performance for continuum robots(CRs) poses huge challenges on traditional modelbased optimal control approaches due to their high degrees of freedom,complex nonlinear dynamics and soft continuum morphologies which are difficult to explicitly model.This paper proposes a model-free adaptive optimal control algorithm(ADAPT)for CRs.In our strategy,we consider CRs as a class of nonlinear continuous-time dynamical systems in the state space,wherein the position of the end-effector is considered as the state and the input torque is mapped as the control input.Then,the optimized Hamilton-Jacobi-Bellman(HJB) equation is derived by optimal control principles,and subsequently solved by the proposed ADAPT algorithm without requiring knowledge of the original system dynamics.Under some mild assumptions,the global stability and convergence of the closed-loop control approach are guaranteed.Several simulation experiments are conducted on a magnetic CR(MCR) to demonstrate the practicality and effectiveness of the ADAPT algorithm.
基金supported by the National Natural Science Foundation of China(Grant Nos.12372200 and 12072242).
文摘Parameterized level-set method(PLSM)has been proposed and developed for many years,and is renowned for its efficacy in ad-dressing topology optimization challenges associated with intricate boundaries and nucleation of new holes.However,most pertinent investigations in the field rely predominantly on fixed background mesh,which is never remeshed.Consequently,the mesh element partitioned by material interface during the optimization process necessitates approximation by using artificial interpolation models to obtain its element stiffness or other properties.This paper introduces a novel approach to topology op-timization by integrating the PLSM with body-fitted adaptive mesh and Helmholtz-type filter.Primarily,combining the PLSM with body-fitted adaptive mesh enables the regeneration of mesh based on the zero level-set interface.This not only precludes the direct traversal of the material interface through the mesh element during the topology optimization process,but also improves the accuracy of calculation.Additionally,the incorporation of a Helmholtz-type partial differential equation filter,relying solely on mesh information essential for finite element discretization,serves to regulate the topological complexity and the minimum feature size of the optimized structure.Leveraging these advantages,the topology optimization program demonstrates its versa-tility by successfully addressing various design problems,encompassing the minimum mean compliance problem and minimum energy dissipation problem.Ultimately,the result of numerical example indicates that the optimized structure exhibits a dis-tinct and smooth boundary,affirming the effective control over both topological complexity and the minimum feature size of the optimized structure.
文摘As optimization problems continue to grow in complexity,the need for effective metaheuristic algorithms becomes increasingly evident.However,the challenge lies in identifying the right parameters and strategies for these algorithms.In this paper,we introduce the adaptive multi-strategy Rabbit Algorithm(RA).RA is inspired by the social interactions of rabbits,incorporating elements such as exploration,exploitation,and adaptation to address optimization challenges.It employs three distinct subgroups,comprising male,female,and child rabbits,to execute a multi-strategy search.Key parameters,including distance factor,balance factor,and learning factor,strike a balance between precision and computational efficiency.We offer practical recommendations for fine-tuning five essential RA parameters,making them versatile and independent.RA is capable of autonomously selecting adaptive parameter settings and mutation strategies,enabling it to successfully tackle a range of 17 CEC05 benchmark functions with dimensions scaling up to 5000.The results underscore RA’s superior performance in large-scale optimization tasks,surpassing other state-of-the-art metaheuristics in convergence speed,computational precision,and scalability.Finally,RA has demonstrated its proficiency in solving complicated optimization problems in real-world engineering by completing 10 problems in CEC2020.
文摘Cloud computing has become an essential technology for the management and processing of large datasets,offering scalability,high availability,and fault tolerance.However,optimizing data replication across multiple data centers poses a significant challenge,especially when balancing opposing goals such as latency,storage costs,energy consumption,and network efficiency.This study introduces a novel Dynamic Optimization Algorithm called Dynamic Multi-Objective Gannet Optimization(DMGO),designed to enhance data replication efficiency in cloud environments.Unlike traditional static replication systems,DMGO adapts dynamically to variations in network conditions,system demand,and resource availability.The approach utilizes multi-objective optimization approaches to efficiently balance data access latency,storage efficiency,and operational costs.DMGO consistently evaluates data center performance and adjusts replication algorithms in real time to guarantee optimal system efficiency.Experimental evaluations conducted in a simulated cloud environment demonstrate that DMGO significantly outperforms conventional static algorithms,achieving faster data access,lower storage overhead,reduced energy consumption,and improved scalability.The proposed methodology offers a robust and adaptable solution for modern cloud systems,ensuring efficient resource consumption while maintaining high performance.
基金Supported by National Natural Science Foundation of China(Grant No.52105271).
文摘Current topology optimization methods for nonlinear continuum structures often suffer from low computational efficiency and limited applicability to complex nonlinear problems.To address these issues,this paper proposes an improved bi-directional evolutionary structural optimization(BESO)method tailored for maximizing stiffness in nonlinear structures.The optimization program is developed in Python and can be combined with Abaqus software to facilitate finite element analysis(FEA).To accelerate the speed of optimization,a novel adaptive evolutionary ratio(ER)strategy based on the BESO method is introduced,with four distinct adaptive ER functions proposed.The Newton-Raphson method is utilized for iteratively solving nonlinear equilibrium equations,and the sensitivity information for updating design variables is derived using the adjoint method.Additionally,this study extends topology optimization to account for both material nonlinearity and geometric nonlinearity,analyzing the effects of various nonlinearities.A series of comparative studies are conducted using benchmark cases to validate the effectiveness of the proposed method.The results show that the BESO method with adaptive ER significantly improves the optimization efficiency.Compared to the BESO method with a fixed ER,the convergence speed of the four adaptive ER BESO methods is increased by 37.3%,26.7%,12%and 18.7%,respectively.Given that Abaqus is a powerful FEA platform,this method has the potential to be extended to large-scale engineering structures and to address more complex optimization problems.This research proposes an improved BESO method with novel adaptive ER,which significantly accelerates the optimization process and enables its application to topology optimization of nonlinear structures.
基金Financial support was provided by the State Grid Sichuan Electric Power Company Science and Technology Project“Key Research on Development Path Planning and Key Operation Technologies of New Rural Electrification Construction”under Grant No.52199623000G.
文摘The increasing penetration of second-life battery energy storage systems(SLBESS)in power grids presents substantial challenges to system operation and control due to the heterogeneous characteristics and uncertain degradation patterns of repurposed batteries.This paper presents a novel model-free adaptive voltage controlembedded dung beetle-inspired heuristic optimization algorithmfor optimal SLBESS capacity configuration and power dispatch.To simultaneously address the computational complexity and ensure system stability,this paper develops a comprehensive bilevel optimization framework.At the upper level,a dung beetle optimization algorithmdetermines the optimal SLBESS capacity configuration byminimizing total lifecycle costswhile incorporating the charging/discharging power trajectories derived from the model-free adaptive voltage control strategy.At the lower level,a health-priority power dispatch optimization model intelligently allocates power demands among heterogeneous battery groups based on their real-time operational states,state-of-health variations,and degradation constraints.The proposed model-free approach circumvents the need for complex battery charging/discharging power controlmodels and extensive historical data requirements whilemaintaining system stability through adaptive controlmechanisms.A novel cycle life degradation model is developed to quantify the relationship between remaining useful life,depth of discharge,and operational patterns.The integrated framework enables simultaneous strategic planning and operational control,ensuring both economic efficiency and extended battery lifespan.The effectiveness of the proposed method is validated through comprehensive case studies on hybrid energy storage systems,demonstrating superior computational efficiency,robust performance across different network configurations,and significant improvements in battery utilization compared to conventional approaches.
基金supported by the National Natural Science Foundation of China[Grant No.12371378]the Fujian Natural Science Foundation[Grant No.2022J01378,Grant No.2023J011127].
文摘Accurate forecasting of wind power is crucial for ensuring the reliable operation of the electrical grid.Due to the impact of various factors,wind power forecasting presents a significant challenge.This paper presents the model that integrates Osprey and adaptive T-distribution dung beetle algorithm for optimizing a convolutional neural network.The CNN-BiLSTM-Attention model combines bidirectional long short-term memory neural networks with an attention mechanism,thereby improving the accuracy of wind power generation predictions.The original data is subjected to Variational Mode Decomposition(VMD)for analysis,taking into account the fluctuations in wind power across different periods.The BiLSTM network with short-term memory processes time-series wind power data,yielding an optimal predictive performance.The integration of the osprey algorithm and adaptive T-distribution within the Dung Beetle Optimization Algorithm was utilized to optimize the hyperparameters of the CNN-BiLSTM-Attention model,thereby enhancing its predictive performance.To assess the efficacy of the CNN-BiLSTM-Attention algorithm,enhanced by Ospreys and adaptive T-distributed dung beetle algorithm,we conducted experiments using the CEC2021 benchmark function.The integrated Osprey and adaptive T-distribution Dung Beetle algorithm has excellent global optimization performance when dealing with complex optimization problems.The fusion of Osprey and the adaptive T-distribution Dung beetle algorithm optimized the CNN-BiLSTM-Attention algorithm as well as other optimization algorithms for ablation experiments.The results show that the improved algorithm performs well in predicting wind power.The experimental findings suggest that the model’s predictive efficiency has enhanced by a minimum of 17.74%.
文摘Aim To introduce a new method of adaptive shape optimization (ASOP) based on three-dimensional structure boundary strength and optimize an engine bearing cap with the method. Methods Using the normal substance's property of thermal expansion and cooling shrinkage,the load which is proportional to the difference between the nodes' stress and their respective objective stress were applied to the corresponding variable nodes on the boundary.The thermal load made the nodes whose stress is greater than their objective stress expand along the boundary's normal direction and the nodes whose stress is less than objec- tive stress shrink in the opposite direction , This process would repeat until the stress on the boundary nodes was converge to the objective stress. Results The satisfied results have been obtained when optimizing an engine bearing cap.The mass of the bearing cap is reduced to 55 percent of the total. Conclusion ASOP is an efficient,practical and reliable method which is suitable for optimizing the shape of the continuous structures.
基金supported by the National Social Science Foundation of China under Grant No.21 BT1048the National Scientific Foundation of China under Grant Nos.12371276 and 12131006。
文摘Model checking is crucial in statistical analyses and has garnered significant attention in the academic literature.However,certain challenges persist in scenarios that involve large-scale datasets and limited resource allocations.This research introduces a novel subsampling methodology for testing regression models with continuous and categorical predictors,referred to as the Subsampling Adaptive Projection-Test(SAPT).This innovative approach demonstrates substantial improvements in test power for both local and global alternatives,outperforming conventional uniform subsampling mechanisms.The authors rigorously establish the asymptotic properties of SAPT and delineate its maximum achievable power under asymptotic conditions.Comprehensive simulations and real-world dataset applications provide robust validation of the proposed theoretical propositions.
文摘This article presents an adaptive intelligent control strategy applied to a lumped-parameter evaporator model,i.e.,a simplified dynamic representation treating the evaporator as a single thermal node with uniform temperature distribution,suitable for control design due to its balance between physical fidelity and computational simplicity.The controller uses a wavelet-based neural proportional,integral,derivative(PID)controller with IIR filtering(infinite impulse response).The dynamic model captures the essential heat and mass transfer phenomena through a nonlinear energy balance,where the cooling capacity“Qevap”is expressed as a non-linear function of the compressor frequency and the temperature difference,specifically,Q_(evap)=k_(1)u(T_(in)−T_(e))with u as compressor frequency,Te evaporator temperature,and Tin inlet fluid temperature.The operating conditions of the system,in general terms,focus on the following variables,the overall thermal capacity is 1000 J/K,typical for small-capacity heat exchangers,The mass flow is 0.05 kg/s,typical for secondary liquid cooling circuits,the overall loss coefficient of 50 W/K that corresponds to small evaporators with partial insulation,the temperatures(inlet)of 10℃and the temperature of environment of 25℃,thermal load of 200 W that corresponds to a small-scaled air conditioning applications.To handle system nonlinearities and improve control performance,aMorlet wavelet-based neural network(Wavenet)is used to dynamically adjust the PID gains online.An IIR filter is incorporated to smooth the adaptive gains,improving stability and reducing oscillations.In contrast to prior wavelet-or neural-adaptive PID controllers in HVAC applications,which typically adjust gains without explicit filtering or not tailored to evaporator dynamics,this work introduces the first PID–Wavenet scheme augmented with an IIR-based stabilization layer,specifically designed to address the combined challenges of nonlinear evaporator behavior,gain oscillation,and real-time implementability.The proposed controller(PID-Wavenet+IIR)is implemented and validated inMATLAB/Simulink,demonstrating superior performance compared to a conventional PID tuned using Simulink’s auto-tuning function.Key results include a reduction in settling time from 13.3 to 8.2 s,a reduction in overshoot from 3.5%to 0.8%,a reduction in steady-state error from 0.12℃ to 0.02℃and a 13%reduction in energy overall consumption.The controller also exhibits greater robustness and adaptability under varying thermal loads.This explicit integration of wavelet-driven adaptation with IIR-filtered gain shaping constitutes the main methodological contribution and novelty of the work.These findings validate the effectiveness of the wavelet-based adaptive approach for advanced thermal management in refrigeration and HVAC systems,with potential applications in controlling variable-speed compressors,liquid chillers,and compact cooling units.
基金supported by the National Key R&D Program of China(No.2021ZD0112700).
文摘This paper develops an advanced framework for the operational optimization of integrated multi-energy systems that encompass electricity,gas,and heating networks.Introducing a cutting-edge stochastic gradient-enhanced distributionally robust optimization approach,this study integrates deep learning models,especially generative adversarial networks,to adeptly handle the inherent variability and uncertainties of renewable energy and fluctuating consumer demands.The effectiveness of this framework is rigorously tested through detailed simulations mirroring real-world urban energy consumption,renewable energy production,and market price fluctuations over an annual period.The results reveal substantial improvements in the resilience and efficiency of the grid,achieving a reduction in power distribution losses by 15%and enhancing voltage stability by 20%,markedly outperforming conventional systems.Additionally,the framework facilitates up to 25%in cost reductions during peak demand periods,significantly lowering operational costs.The adoption of stochastic gradients further refines the framework’s ability to continually adjust to real-time changes in environmental and market conditions,ensuring stable grid operations and fostering active consumer engagement in demand-side management.This strategy not only aligns with contem-porary sustainable energy practices but also provides scalable and robust solutions to pressing challenges in modern power network management.
文摘The multi-objective optimization problems,especially in constrained environments such as power distribution planning,demand robust strategies for discovering effective solutions.This work presents the improved variant of the Multi-population Cooperative Constrained Multi-Objective Optimization(MCCMO)Algorithm,termed Adaptive Diversity Preservation(ADP).This enhancement is primarily focused on the improvement of constraint handling strategies,local search integration,hybrid selection approaches,and adaptive parameter control.Theimproved variant was experimented on with the RWMOP50 power distribution systemplanning benchmark.As per the findings,the improved variant outperformed the original MCCMO across the eleven performance metrics,particularly in terms of convergence speed,constraint handling efficiency,and solution diversity.The results also establish that MCCMOADP consistently delivers substantial performance gains over the baseline MCCMO,demonstrating its effectiveness across performancemetrics.The new variant also excels atmaintaining the balanced trade-off between exploration and exploitation throughout the search process,making it especially suitable for complex optimization problems in multiconstrained power systems.These enhancements make MCCMO-ADP a valuable and promising candidate for handling problems such as renewable energy scheduling,logistics planning,and power system optimization.Future work will benchmark the MCCMO-ADP against widely recognized algorithms such as NSGA-Ⅱ,NSGA-Ⅲ,and MOEA/D and will also extend its validation to large-scale real-world optimization domains to further consolidate its generalizability.
基金supported by Yunnan Power Grid Co.,Ltd.Science and Technology Project:Research and application of key technologies for graphical-based power grid accident reconstruction and simulation(YNKJXM20240333).
文摘An optimized volt-ampere reactive(VAR)control framework is proposed for transmission-level power systems to simultaneously mitigate voltage deviations and active-power losses through coordinated control of large-scale wind/solar farms with shunt static var generators(SVGs).The model explicitly represents reactive-power regulation characteristics of doubly-fed wind turbines and PV inverters under real-time meteorological conditions,and quantifies SVG high-speed compensation capability,enabling seamless transition from localized VAR management to a globally coordinated strategy.An enhanced adaptive gain-sharing knowledge optimizer(AGSK-SD)integrates simulated annealing and diversity maintenance to autonomously tune voltage-control actions,renewable source reactive-power set-points,and SVG output.The algorithm adaptively modulates knowledge factors and ratios across search phases,performs SA-based fine-grained local exploitation,and periodically re-injects population diversity to prevent premature convergence.Comprehensive tests on IEEE 9-bus and 39-bus systems demonstrate AGSK-SD’s superiority over NSGA-II and MOPSO in hypervolume(HV),inverse generative distance(IGD),and spread metrics while maintaining acceptable computational burden.The method reduces network losses from 2.7191 to 2.15 MW(20.79%reduction)and from 15.1891 to 11.22 MW(26.16%reduction)in the 9-bus and 39-bus systems respectively.Simultaneously,the cumulative voltage-deviation index decreases from 0.0277 to 3.42×10^(−4) p.u.(98.77%reduction)in the 9-bus system,and from 0.0556 to 0.0107 p.u.(80.76%reduction)in the 39-bus system.These improvements demonstrate significant suppression of line losses and voltage fluctuations.Comparative analysis with traditional heuristic optimization algorithms confirms the superior performance of the proposed approach.
基金Hunan Provincial Natural Science Foundation of China (No. 06JJ50103)the National Natural Science Foundationof China (No. 60375001)
文摘Based on results of chaos characteristics comparing one-dimensional iterative chaotic self-map x = sin（2/x） with infinite collapses within the finite region[-1, 1] to some representative iterative chaotic maps with finite collapses （e.g., Logistic map, Tent map, and Chebyshev map）, a new adaptive mutative scale chaos optimization algorithm （AMSCOA） is proposed by using the chaos model x = sin（2/x）. In the optimization algorithm, in order to ensure its advantage of speed convergence and high precision in the seeking optimization process, some measures are taken： 1） the searching space of optimized variables is reduced continuously due to adaptive mutative scale method and the searching precision is enhanced accordingly; 2） the most circle time is regarded as its control guideline. The calculation examples about three testing functions reveal that the adaptive mutative scale chaos optimization algorithm has both high searching speed and precision.
文摘Adaptive optimization is one of the means that agile organization of command and control resource （AOC2R） adapts for the dynamic battlefield environment. A math model of the adaptive optimization of AOC2R is put forward by analyzing the interrelating concept and research. The model takes the adaptive process as a multi-stage decision making problem. The 2-phases method is presented to calculate the model, which obtains the related parameters by running the colored Petri net （CPN） model of AOC2R and then searches for the result by ant colony optimization （ACO） algorithm integrated with genetic optimization techniques. The simulation results demonstrate that the proposed algorithm greatly improves the performance of AOC2R.
