Prediction of Shear Bond Strength of Asphalt Concrete Pavement Using Machine Learning Models and Grid Search Optimization Technique

Determination of Shear Bond strength(SBS)at interlayer of double-layer asphalt concrete is crucial in flexible pavement structures.The study used three Machine Learning(ML)models,including K-Nearest Neighbors(KNN),Extra Trees(ET),and Light Gradient Boosting Machine(LGBM),to predict SBS based on easily determinable input parameters.Also,the Grid Search technique was employed for hyper-parameter tuning of the ML models,and cross-validation and learning curve analysis were used for training the models.The models were built on a database of 240 experimental results and three input variables:temperature,normal pressure,and tack coat rate.Model validation was performed using three statistical criteria:the coefficient of determination(R2),the Root Mean Square Error(RMSE),and the mean absolute error(MAE).Additionally,SHAP analysis was also used to validate the importance of the input variables in the prediction of the SBS.Results show that these models accurately predict SBS,with LGBM providing outstanding performance.SHAP(Shapley Additive explanation)analysis for LGBM indicates that temperature is the most influential factor on SBS.Consequently,the proposed ML models can quickly and accurately predict SBS between two layers of asphalt concrete,serving practical applications in flexible pavement structure design.

Optimization method of refracturing timing for old shale gas wells

Based on the elastic theory of porous media,embedded discrete fracture model and finite volume method,and considering the micro-seepage mechanism of shale gas,a fully coupled seepage-geomechanical model suitable for fractured shale gas reservoirs is established,the optimization method of refracturing timing is proposed,and the influencing factors of refracturing timing are analyzed based on the data from shale gas well in Fuling of Sichuan Basin.The results show that due to the depletion of formation pressure,the percentage of the maximum horizontal principal stress reversal area in the total area increases and then decreases with time.The closer the area is to the hydraulic fracture,the shorter the time for the peak of the stress reversal area percentage curve to appear,and the shorter the time for the final zero return(to the initial state).The optimum time of refracturing is affected by matrix permeability,initial stress difference and natural fracture approach angle.The larger the matrix permeability and initial stress difference is,the shorter the time for stress reversal area percentage curve to reach peak and return to the initial state,and the earlier the time to take refracturing measures.The larger the natural fracture approach angle is,the more difficult it is for stress reversal to occur near the fracture,and the earlier the optimum refracturing time is.The more likely the stress reversal occurs at the far end of the artificial fracture,the later the optimal time of refracturing is.Reservoirs with low matrix permeability have a rapid decrease in single well productivity.To ensure economic efficiency,measures such as shut-in or gas injection can be taken to restore the stress,and refracturing can be implemented in advance.

Optimal Multi-Timescale Scheduling of Integrated Energy Systems with Hybrid Energy Storage System Based on Lyapunov Optimization

The economic operation of integrated energy system(IES)faces new challenges such as multi-timescale characteristics of heterogeneous energy sources,and cooperative operation of hybrid energy storage system(HESS).To this end,this paper investigates the multi-timescale rolling opti-mization problem for IES integrated with HESS.Firstly,the architecture of IES with HESS is established,a comparative analysis is conducted to evaluate the advantages of the HESS over a single energy storage system(SESS)in stabilizing power fluctuations.Secondly,the dayahead and real-time scheduling cost functions of IES are established,the day-ahead scheduling mainly depends on operation costs of the components in IES,the real-time optimal scheduling adopts the Lya-punov optimization method to schedule the battery and hydrogen energy storage in each time slot,so as to minimize the real-time average scheduling operation cost,and the problem of day-ahead and real-time scheduling error,which caused by the uncertainty of the energy storage is solved by online optimization.Finally,the proposed model is verified to reduce the scheduling operation cost and the dispatching error by performing an arithmetic example analysis of the IES in Shanghai,which provides a reference for the safe and stable operation of the IES.

Accelerated Primal-Dual Projection Neurodynamic Approach With Time Scaling for Linear and Set Constrained Convex Optimization Problems

The Nesterov accelerated dynamical approach serves as an essential tool for addressing convex optimization problems with accelerated convergence rates.Most previous studies in this field have primarily concentrated on unconstrained smooth con-vex optimization problems.In this paper,on the basis of primal-dual dynamical approach,Nesterov accelerated dynamical approach,projection operator and directional gradient,we present two accelerated primal-dual projection neurodynamic approaches with time scaling to address convex optimization problems with smooth and nonsmooth objective functions subject to linear and set constraints,which consist of a second-order ODE(ordinary differential equation)or differential conclusion system for the primal variables and a first-order ODE for the dual vari-ables.By satisfying specific conditions for time scaling,we demonstrate that the proposed approaches have a faster conver-gence rate.This only requires assuming convexity of the objective function.We validate the effectiveness of our proposed two accel-erated primal-dual projection neurodynamic approaches through numerical experiments.

Optimization Strategies of Na_(3)V_(2)(PO_(4))_(3) Cathode Materials for Sodium‑Ion Batteries

Na_(3)V_(2)(PO_(4))_(3)(NVP)has garnered great attentions as a prospective cathode material for sodium-ion batteries(SIBs)by virtue of its decent theoretical capacity,superior ion conductivity and high structural stability.However,the inherently poor electronic conductivity and sluggish sodium-ion diffusion kinetics of NVP material give rise to inferior rate performance and unsatisfactory energy density,which strictly confine its further application in SIBs.Thus,it is of significance to boost the sodium storage performance of NVP cathode material.Up to now,many methods have been developed to optimize the electrochemical performance of NVP cathode material.In this review,the latest advances in optimization strategies for improving the electrochemical performance of NVP cathode material are well summarized and discussed,including carbon coating or modification,foreign-ion doping or substitution and nanostructure and morphology design.The foreign-ion doping or substitution is highlighted,involving Na,V,and PO_(4)^(3−)sites,which include single-site doping,multiple-site doping,single-ion doping,multiple-ion doping and so on.Furthermore,the challenges and prospects of high-performance NVP cathode material are also put forward.It is believed that this review can provide a useful reference for designing and developing high-performance NVP cathode material toward the large-scale application in SIBs.

Electric Vehicle Charging Load Optimization Strategy Based on Dynamic Time-of-Use Tariff

Electric vehicle(EV)is an ideal solution to resolve the carbon emission issue and the fossil fuels scarcity problem in the future.However,a large number of EVs will be concentrated on charging during the valley hours leading to new load peaks under the guidance of static time-of-use tariff.Therefore,this paper proposes a dynamic time-of-use tariff mechanism,which redefines the peak and valley time periods according to the predicted loads using the fuzzy C-mean(FCM)clustering algorithm,and then dynamically adjusts the peak and valley tariffs according to the actual load of each time period.Based on the proposed tariff mechanism,an EV charging optimization model with the lowest cost to the users and the lowest variance of the grid-side load as the objective function is established.Then,a weight selection principle with an equal loss rate of the two objectives is proposed to transform the multi-objective optimization problem into a single-objective optimization problem.Finally,the EV charging load optimization model under three tariff strategies is set up and solved with the mathematical solver GROUBI.The results show that the EV charging load optimization strategy based on the dynamic time-of-use tariff can better balance the benefits between charging stations and users under different numbers and proportions of EVs connected to the grid,and can effectively reduce the grid load variance and improve the grid load curve.

Fixed-Time Cluster Optimization for Multi-Agent Systems Based on Piecewise Power-Law Design

Dear Editor,This letter focuses on the fixed-time(FXT)cluster optimization problem of first-order multi-agent systems(FOMASs)in an undirected network,in which the optimization objective is the sum of the objective functions of all clusters.A novel piecewise power-law control protocol with cooperative-competition relations is proposed.Furthermore,a sufficient condition is obtained to ensure that the FOMASs achieve the cluster consensus within an FXT.

Stochastic Ranking Improved Teaching-Learning and Adaptive Grasshopper Optimization Algorithm-Based Clustering Scheme for Augmenting Network Lifetime in WSNs

In Wireless Sensor Networks(WSNs),Clustering process is widely utilized for increasing the lifespan with sustained energy stability during data transmission.Several clustering protocols were devised for extending network lifetime,but most of them failed in handling the problem of fixed clustering,static rounds,and inadequate Cluster Head(CH)selection criteria which consumes more energy.In this paper,Stochastic Ranking Improved Teaching-Learning and Adaptive Grasshopper Optimization Algorithm(SRITL-AGOA)-based Clustering Scheme for energy stabilization and extending network lifespan.This SRITL-AGOA selected CH depending on the weightage of factors such as node mobility degree,neighbour's density distance to sink,single-hop or multihop communication and Residual Energy(RE)that directly influences the energy consumption of sensor nodes.In specific,Grasshopper Optimization Algorithm(GOA)is improved through tangent-based nonlinear strategy for enhancing the ability of global optimization.On the other hand,stochastic ranking and violation constraint handling strategies are embedded into Teaching-Learning-based Optimization Algorithm(TLOA)for improving its exploitation tendencies.Then,SR and VCH improved TLOA is embedded into the exploitation phase of AGOA for selecting better CH by maintaining better balance amid exploration and exploitation.Simulation results confirmed that the proposed SRITL-AGOA improved throughput by 21.86%,network stability by 18.94%,load balancing by 16.14%with minimized energy depletion by19.21%,compared to the competitive CH selection approaches.

A deep reinforcement learning approach to gasoline blending real-time optimization under uncertainty

The gasoline inline blending process has widely used real-time optimization techniques to achieve optimization objectives,such as minimizing the cost of production.However,the effectiveness of real-time optimization in gasoline blending relies on accurate blending models and is challenged by stochastic disturbances.Thus,we propose a real-time optimization algorithm based on the soft actor-critic(SAC)deep reinforcement learning strategy to optimize gasoline blending without relying on a single blending model and to be robust against disturbances.Our approach constructs the environment using nonlinear blending models and feedstocks with disturbances.The algorithm incorporates the Lagrange multiplier and path constraints in reward design to manage sparse product constraints.Carefully abstracted states facilitate algorithm convergence,and the normalized action vector in each optimization period allows the agent to generalize to some extent across different target production scenarios.Through these well-designed components,the algorithm based on the SAC outperforms real-time optimization methods based on either nonlinear or linear programming.It even demonstrates comparable performance with the time-horizon based real-time optimization method,which requires knowledge of uncertainty models,confirming its capability to handle uncertainty without accurate models.Our simulation illustrates a promising approach to free real-time optimization of the gasoline blending process from uncertainty models that are difficult to acquire in practice.

General Lyapunov Stability and Its Application to Time-Varying Convex Optimization

In this article, a general Lyapunov stability theory of nonlinear systems is put forward and it contains asymptotic/finite-time/fast finite-time/fixed-time stability. Especially, a more accurate estimate of the settling-time function is exhibited for fixedtime stability, and it is still extraneous to the initial conditions.This can be applied to obtain less conservative convergence time of the practical systems without the information of the initial conditions. As an application, the given fixed-time stability theorem is used to resolve time-varying(TV) convex optimization problem.By the Newton's method, two classes of new dynamical systems are constructed to guarantee that the solution of the dynamic system can track to the optimal trajectory of the unconstrained and equality constrained TV convex optimization problems in fixed time, respectively. Without the exact knowledge of the time derivative of the cost function gradient, a fixed-time dynamical non-smooth system is established to overcome the issue of robust TV convex optimization. Two examples are provided to illustrate the effectiveness of the proposed TV convex optimization algorithms. Subsequently, the fixed-time stability theory is extended to the theories of predefined-time/practical predefined-time stability whose bound of convergence time can be arbitrarily given in advance, without tuning the system parameters. Under which, TV convex optimization problem is solved. The previous two examples are used to demonstrate the validity of the predefined-time TV convex optimization algorithms.

Fixed-Time Gradient Flows for Solving Constrained Optimization: A Unified Approach

The accelerated method in solving optimization problems has always been an absorbing topic.Based on the fixedtime(FxT)stability of nonlinear dynamical systems,we provide a unified approach for designing FxT gradient flows(FxTGFs).First,a general class of nonlinear functions in designing FxTGFs is provided.A unified method for designing first-order FxTGFs is shown under Polyak-Łjasiewicz inequality assumption,a weaker condition than strong convexity.When there exist both bounded and vanishing disturbances in the gradient flow,a specific class of nonsmooth robust FxTGFs with disturbance rejection is presented.Under the strict convexity assumption,Newton-based FxTGFs is given and further extended to solve time-varying optimization.Besides,the proposed FxTGFs are further used for solving equation-constrained optimization.Moreover,an FxT proximal gradient flow with a wide range of parameters is provided for solving nonsmooth composite optimization.To show the effectiveness of various FxTGFs,the static regret analyses for several typical FxTGFs are also provided in detail.Finally,the proposed FxTGFs are applied to solve two network problems,i.e.,the network consensus problem and solving a system linear equations,respectively,from the perspective of optimization.Particularly,by choosing component-wisely sign-preserving functions,these problems can be solved in a distributed way,which extends the existing results.The accelerated convergence and robustness of the proposed FxTGFs are validated in several numerical examples stemming from practical applications.

Vehicle routing optimization algorithm based on time windows and dynamic demand

To provide the supplier with the minimizum vehicle travel distance in the distribution process of goods in three situations of new customer demand,customer cancellation service,and change of customer delivery address,based on the ideas of pre-optimization and real-time optimization,a two-stage planning model of dynamic demand based vehicle routing problem with time windows was established.At the pre-optimization stage,an improved genetic algorithm was used to obtain the pre-optimized distribution route,a large-scale neighborhood search method was integrated into the mutation operation to improve the local optimization performance of the genetic algorithm,and a variety of operators were introduced to expand the search space of neighborhood solutions;At the real-time optimization stage,a periodic optimization strategy was adopted to transform a complex dynamic problem into several static problems,and four neighborhood search operators were used to quickly adjust the route.Two different scale examples were designed for experiments.It is proved that the algorithm can plan the better route,and adjust the distribution route in time under the real-time constraints.Therefore,the proposed algorithm can provide theoretical guidance for suppliers to solve the dynamic demand based vehicle routing problem.

Privacy Preserving Distributed Bandit Residual Feedback Online Optimization Over Time-Varying Unbalanced Graphs

This paper considers the distributed online optimization(DOO) problem over time-varying unbalanced networks, where gradient information is explicitly unknown. To address this issue, a privacy-preserving distributed online one-point residual feedback(OPRF) optimization algorithm is proposed. This algorithm updates decision variables by leveraging one-point residual feedback to estimate the true gradient information. It can achieve the same performance as the two-point feedback scheme while only requiring a single function value query per iteration. Additionally, it effectively eliminates the effect of time-varying unbalanced graphs by dynamically constructing row stochastic matrices. Furthermore, compared to other distributed optimization algorithms that only consider explicitly unknown cost functions, this paper also addresses the issue of privacy information leakage of nodes. Theoretical analysis demonstrate that the method attains sublinear regret while protecting the privacy information of agents. Finally, numerical experiments on distributed collaborative localization problem and federated learning confirm the effectiveness of the algorithm.

Identification of time-varying system and energy-based optimization of adaptive control in seismically excited structure

The combination of structural health monitoring and vibration control is of great importance to provide components of smart structures.While synthetic algorithms have been proposed,adaptive control that is compatible with changing conditions still needs to be used,and time-varying systems are required to be simultaneously estimated with the application of adaptive control.In this research,the identification of structural time-varying dynamic characteristics and optimized simple adaptive control are integrated.First,reduced variations of physical parameters are estimated online using the multiple forgetting factor recursive least squares(MFRLS)method.Then,the energy from the structural vibration is simultaneously specified to optimize the control force with the identified parameters to be operational.Optimization is also performed based on the probability density function of the energy under the seismic excitation at any time.Finally,the optimal control force is obtained by the simple adaptive control(SAC)algorithm and energy coefficient.A numerical example and benchmark structure are employed to investigate the efficiency of the proposed approach.The simulation results revealed the effectiveness of the integrated online identification and optimal adaptive control in systems.

A time-space network-based model for transportation service optimization of China Railway Express

This paper describes the development and optimization plans for the China Railway Express(CR Express).As a new type of international land transport organization,CR Express has emerged with the continuous expansion of China toward European investment and trade,and in particular,has expanded with the continuous progress of the One Belt and One Road(OBOR)initiative.In addition to improving the service quality of CR Express,the operating costs must be reduced for developing“smart railways”that serve“smart cities”.We propose a dualobjective-based function mathematical optimization model;the satisfaction of the cargo owner is considered,and the timeliness,transportation capacity,and goods category constraints of CR Express transportation are designed.Moreover,we present the normalized equivalent method of the two-objective function of the model.Finally,a case study is conducted against the background of certain trains in the western corridor of CR Express to validate the effectiveness of the model and research methods proposed in this study.

Improved ant colony optimization for multi-depot heterogeneous vehicle routing problem with soft time windows

Considering that the vehicle routing problem （VRP） with many extended features is widely used in actual life, such as multi-depot, heterogeneous types of vehicles, customer service priority and time windows etc., a mathematical model for multi-depot heterogeneous vehicle routing problem with soft time windows （MDHVRPSTW） is established. An improved ant colony optimization （IACO） is proposed for solving this model. First, MDHVRPSTW is transferred into different groups according to the nearest principle, and then the initial route is constructed by the scanning algorithm （SA）. Secondly, genetic operators are introduced, and crossover probability and mutation probability are adaptively adjusted in order to improve the global search ability of the algorithm. Moreover, the smooth mechanism is used to improve the performance of the ant colony optimization （ACO）. Finally, the 3-opt strategy is used to improve the local search ability. The proposed IACO was tested on three new instances that were generated randomly. The experimental results show that IACO is superior to the other three existing algorithms in terms of convergence speed and solution quality. Thus, the proposed method is effective and feasible, and the proposed model is meaningful.

Application of Hilbert-Huang transform based delay time identification in optimization of short millisecond blasting

The accurate identification of delay time in millisecond blasting plays an important role in the optimization of blasting design and reduction of vibration effect. Through a case study of a surge shaft blasting project, the capability of the EMD （empirical mode decomposition） method in identifying the delay time of short millisecond blasting with precise initiation was compared with the instantaneous energy method based on Hilbert-Huang transform （HHT）. The recognition rate of the EMD method was more than 80%, while the instantaneous energy method was less than 25%. By analyzing the instantaneous energy of single-hole blasting signal, it was found that the instantaneous energy method was adaptable to millisecond blasting with delay time longer than half of the energy peak period. The EMD method was used to identify delay time of millisecond blasting in Zijinshan open-pit mine. According to the identification results, the blasting parameters were optimized for controlling the blast-induced vibration and reducing the large block ratio. The field data showed that the velocity peak of ground vibration was reduced by more than 30%under almost the same maximum charge per delay by the optimization of delay time and detonating detonators. Combining with slag-remaining blasting and burden optimization of the first row, the large block ratio was reduced to less than 3%. The research results proved that the identification method based on HHT was feasible to optimize the blasting design. The identification method is also of certain reference value for design optimization of other similar blasting projects.

Path-Based Timing Optimization by Buffer Insertion with Accurate Delay Model

An algorithm of path based timing optimization by buffer insertion is presented.The algorithm adopts a high order model to estimate interconnect delay and a nonlinear delay model based on look up table for gate delay estimation.And heuristic method of buffer insertion is presented to reduce delay.The algorithm is tested by industral circuit case.Experimental results show that the algorithm can optimize the timing of circuit efficiently and the timing constraint is satisfied.

Timing Optimization by Inserting Minimum Buffers with Accurate Delay Models

An algorithm of minimizing the number of buffers under certain delay constraint with accurate delay models is presented.Given a two-terminal net,the algorithm can minimize the total number of buffers inserted to meet the delay constraint.A high order delay model is applied to estimate interconnect delay and a nonlinear delay model based on look-up table is for buffer delay estimation.The experimental results show that the algorithm can efficiently achieve the trade-offs between number of buffers and delay,and avoid needless power and area cost.The running time is satisfactory.

Incremental Placement Algorithm for Timing and Routability Optimization

A new approach of incremental placement approach is described.The obtained timing information drives an efficient net-based placement technique,which dynamically adapts the net weights during successive placement steps.Several methods to combine timing optimization and congestion reducing together are proposed.Cells on critical paths are replaced according to timing and congestion constraints.Experimental results show that our approach can efficiently reduce cycle time and enhance route ability.The max path delay is reduced by 10% on an average afterincremental placement on wirelength-optimized circuits.And it achieves the same quality with a high speed up compared to timing driven detailed placement algorithm.