SOC distribution-based modeling for lithium-ion battery for electric vehicles using numerical optimization

In order to simulate electrical characteristics of a lithium-ion battery used in electric vehicles in a good manner,a three-layer battery model is established.The charge of the lithium-ion battery is assumed to distribute among the three layers and their interaction is used to depict hysteresis and relaxation effect observed in the lithium-ion battery.The model parameters are calibrated and optimized through a numerically nonlinear least squares algorithm in Simulink Parameter Estimation Toolbox for an experimental data set sampled in a hybrid pulse test of the battery.Evaluation results showed that the established model is able to provide an acceptable accuracy in estimating the State of Charge of the lithium-ion battery in an open-loop fashion for a sufficiently long time and to describe the battery voltage behavior more accurately than a commonly used battery model.The battery modeling accuracy can thereby satisfy the requirement for practical electric vehicle applications.

Adaptive backtracking search optimization algorithm with pattern search for numerical optimization

The backtracking search optimization algorithm（BSA） is one of the most recently proposed population-based evolutionary algorithms for global optimization. Due to its memory ability and simple structure, BSA has powerful capability to find global optimal solutions. However, the algorithm is still insufficient in balancing the exploration and the exploitation. Therefore, an improved adaptive backtracking search optimization algorithm combined with modified Hooke-Jeeves pattern search is proposed for numerical global optimization. It has two main parts： the BSA is used for the exploration phase and the modified pattern search method completes the exploitation phase. In particular, a simple but effective strategy of adapting one of BSA＇s important control parameters is introduced. The proposed algorithm is compared with standard BSA, three state-of-the-art evolutionary algorithms and three superior algorithms in IEEE Congress on Evolutionary Computation 2014（IEEE CEC2014） over six widely-used benchmarks and 22 real-parameter single objective numerical optimization benchmarks in IEEE CEC2014. The results of experiment and statistical analysis demonstrate the effectiveness and efficiency of the proposed algorithm.

Enhanced self-adaptive evolutionary algorithm for numerical optimization

There are many population-based stochastic search algorithms for solving optimization problems. However, the universality and robustness of these algorithms are still unsatisfactory. This paper proposes an enhanced self-adaptiveevolutionary algorithm （ESEA） to overcome the demerits above. In the ESEA, four evolutionary operators are designed to enhance the evolutionary structure. Besides, the ESEA employs four effective search strategies under the framework of the self-adaptive learning. Four groups of the experiments are done to find out the most suitable parameter values for the ESEA. In order to verify the performance of the proposed algorithm, 26 state-of-the-art test functions are solved by the ESEA and its competitors. The experimental results demonstrate that the universality and robustness of the ESEA out-perform its competitors.

Arc-search in numerical optimization

Determining the search direction and the search step are the two main steps of the nonlinear optimization algorithm,in which the derivatives of the objective and constraint functions are used to determine the search direction,the one-dimensional search and the trust domain methods are used to determine the step length along the search direction.One dimensional line search has been widely discussed in various textbooks and references.However,there is a lessknown techniquearc-search method,which is relatively new and may generate more efficient algorithms in some cases.In this paper,we will survey this technique,discuss its applications in different optimization problems,and explain its potential improvements over traditional line search method.

A Novel Hybrid Vortex Search and Artificial Bee Colony Algorithm for Numerical Optimization Problems

Though vortex search（VS） algorithm has good performance in solving global numerical optimization problems, it cannot fully search the whole space occasionally. Combining the vortex search algorithm and the artificial bee colony algorithm（ABC） which has good performance in exploration, we present a HVS（hybrid vortex search） algorithm to solve the numerical optimization problems. We first use the employed bees and onlooker bees of ABC algorithm to find a solution, and then adopt the VS algorithm to find the best solution. In the meantime, we cannot treat the best solution so far as the center of the algorithm all the time. The algorithm is tested by 50 benchmark functions. The numerical results show the HVS algorithm has superior performance over the ABC and the VS algorithms.

Technique for Multi-Pass Turning Optimization Based on Gaussian Quantum-Behaved Bat Algorithm

The multi-pass turning operation is one of the most commonly used machining methods in manufacturing field.The main objective of this operation is to minimize the unit production cost.This paper proposes a Gaussian quantum-behaved bat algorithm(GQBA)to solve the problem of multi-pass turning operation.The proposed algorithm mainly includes the following two improvements.The first improvement is to incorporate the current optimal positions of quantum bats and the global best position into the stochastic attractor to facilitate population diversification.The second improvement is to use a Gaussian distribution instead of the uniform distribution to update the positions of the quantum-behaved bats,thus performing a more accurate search and avoiding premature convergence.The performance of the presented GQBA is demonstrated through numerical benchmark functions and amulti-pass turning operation problem.Thirteen classical benchmark functions are utilized in the comparison experiments,and the experimental results for accuracy and convergence speed demonstrate that,in most cases,the GQBA can provide a better search capability than other algorithms.Furthermore,GQBA is applied to an optimization problem formulti-pass turning,which is designed tominimize the production cost while considering many practical machining constraints in the machining process.The experimental results indicate that the GQBA outperforms other comparison algorithms in terms of cost reduction,which proves the effectiveness of the GQBA.

Hybrid Power Bank Deployment Model for Energy Supply Coverage Optimization in Industrial Wireless Sensor Network

Energy supply is one of the most critical challenges of wireless sensor networks(WSNs)and industrial wireless sensor networks(IWSNs).While research on coverage optimization problem(COP)centers on the network’s monitoring coverage,this research focuses on the power banks’energy supply coverage.The study of 2-D and 3-D spaces is typical in IWSN,with the realistic environment being more complex with obstacles(i.e.,machines).A 3-D surface is the field of interest(FOI)in this work with the established hybrid power bank deployment model for the energy supply COP optimization of IWSN.The hybrid power bank deployment model is highly adaptive and flexible for new or existing plants already using the IWSN system.The model improves the power supply to a more considerable extent with the least number of power bank deployments.The main innovation in this work is the utilization of a more practical surface model with obstacles and training while improving the convergence speed and quality of the heuristic algorithm.An overall probabilistic coverage rate analysis of every point on the FOI is provided,not limiting the scope to target points or areas.Bresenham’s algorithm is extended from 2-D to 3-D surface to enhance the probabilistic covering model for coverage measurement.A dynamic search strategy(DSS)is proposed to modify the artificial bee colony(ABC)and balance the exploration and exploitation ability for better convergence toward eliminating NP-hard deployment problems.Further,the cellular automata(CA)is utilized to enhance the convergence speed.The case study based on two typical FOI in the IWSN shows that the CA scheme effectively speeds up the optimization process.Comparative experiments are conducted on four benchmark functions to validate the effectiveness of the proposed method.The experimental results show that the proposed algorithm outperforms the ABC and gbest-guided ABC(GABC)algorithms.The results show that the proposed energy coverage optimization method based on the hybrid power bank deployment model generates more accurate results than the results obtained by similar algorithms(i.e.,ABC,GABC).The proposed model is,therefore,effective and efficient for optimization in the IWSN.

Deep Energies for Estimating Three-Dimensional Facial Pose and Expression

While much progress has been made in capturing high-quality facial performances using motion capture markers and shape-from-shading,high-end systems typically also rely on rotoscope curves hand-drawn on the image.These curves are subjective and difficult to draw consistently;moreover,ad-hoc procedural methods are required for generating matching rotoscope curves on synthetic renders embedded in the optimization used to determine three-dimensional(3D)facial pose and expression.We propose an alternative approach whereby these curves and other keypoints are detected automatically on both the image and the synthetic renders using trained neural networks,eliminating artist subjectivity,and the ad-hoc procedures meant to mimic it.More generally,we propose using machine learning networks to implicitly define deep energies which when minimized using classical optimization techniques lead to 3D facial pose and expression estimation.

A composite particle swarm algorithm for global optimization of multimodal functions

During the last decade, many variants of the original particle swarm optimization （PSO） algorithm have been proposed for global numerical optimization, hut they usually face many challenges such as low solution quality and slow convergence speed on multimodal function optimization. A composite particle swarm optimization （CPSO） for solving these difficulties is presented, in which a novel learning strategy plus an assisted search mechanism framework is used. Instead of simple learning strategy of the original PSO, the proposed CPSO combines one particle＇s historical best information and the global best information into one learning exemplar to guide the particle movement. The proposed learning strategy can reserve the original search information and lead to faster convergence speed. The proposed assisted search mechanism is designed to look for the global optimum. Search direction of particles can be greatly changed by this mechanism so that the algorithm has a large chance to escape from local optima. In order to make the assisted search mechanism more efficient and the algorithm more reliable, the executive probability of the assisted search mechanism is adjusted by the feedback of the improvement degree of optimal value after each iteration. According to the result of numerical experiments on multimodal benchmark functions such as Schwefel, Rastrigin, Ackley and Griewank both with and without coordinate rotation, the proposed CPSO offers faster convergence speed, higher quality solution and stronger robustness than other variants of PSO.

Improved Artificial Bee Colony Algorithm for Continuous Optimization Problems

The artificial bee colony (ABC) algorithm is a swarm-based metaheuristic optimization technique, developed by inspiring foraging and dance behaviors of honey bee colonies. ABC consists of four phases named as initialization, employed bee, onlooker bee and scout bee. The employed bees try to improve their solution in employed bees phase. If an employed bee cannot improve self-solution in a certain time, it becomes a scout bee. This alteration is done in the scout bee phase. The onlooker bee phase is placed where information sharing is done. Although a candidate solution improved by onlookers is chosen among the employed bee population according to fitness values of the employed bees, neighbor of candidate solution is randomly selected. In this paper, we propose a selection mechanism for neighborhood of the candidate solutions in the onlooker bee phase. The proposed selection mechanism was based on information shared by the employed bees. Average fitness value obtained by the employed bees is calculated and those better than the aver- age fitness value are written to memory board. Therefore, the onlooker bees select a neighbor from the memory board. In this paper, the proposed ABC-based method called as iABC were applied to both five numerical benchmark functions and an estimation of energy demand problem. Obtained results for the problems show that iABC is better than the basic ABC in terms of solution quality.

Radial Basis Function Interpolation and Galerkin Projection for Direct Trajectory Optimization and Costate Estimation

This work presents a novel approach combining radial basis function(RBF)interpolation with Galerkin projection to efficiently solve general optimal control problems.The goal is to develop a highly flexible solution to optimal control problems,especially nonsmooth problems involving discontinuities,while accounting for trajectory accuracy and computational efficiency simultaneously.The proposed solution,called the RBF-Galerkin method,offers a highly flexible framework for direct transcription by using any interpolant functions from the broad class of global RBFs and any arbitrary discretization points that do not necessarily need to be on a mesh of points.The RBF-Galerkin costate mapping theorem is developed that describes an exact equivalency between the Karush-Kuhn-Tucker(KKT)conditions of the nonlinear programming problem resulted from the RBF-Galerkin method and the discretized form of the first-order necessary conditions of the optimal control problem,if a set of discrete conditions holds.The efficacy of the proposed method along with the accuracy of the RBF-Galerkin costate mapping theorem is confirmed against an analytical solution for a bang-bang optimal control problem.In addition,the proposed approach is compared against both local and global polynomial methods for a robot motion planning problem to verify its accuracy and computational efficiency.

Efficiency analysis of numerical integrations for finite element substructure in real-time hybrid simulation

Finite element（FE） is a powerful tool and has been applied by investigators to real-time hybrid simulations（RTHSs）. This study focuses on the computational efficiency, including the computational time and accuracy, of numerical integrations in solving FE numerical substructure in RTHSs. First, sparse matrix storage schemes are adopted to decrease the computational time of FE numerical substructure. In this way, the task execution time（TET） decreases such that the scale of the numerical substructure model increases. Subsequently, several commonly used explicit numerical integration algorithms, including the central difference method（CDM）, the Newmark explicit method, the Chang method and the Gui-λ method, are comprehensively compared to evaluate their computational time in solving FE numerical substructure. CDM is better than the other explicit integration algorithms when the damping matrix is diagonal, while the Gui-λ（λ = 4） method is advantageous when the damping matrix is non-diagonal. Finally, the effect of time delay on the computational accuracy of RTHSs is investigated by simulating structure-foundation systems. Simulation results show that the influences of time delay on the displacement response become obvious with the mass ratio increasing, and delay compensation methods may reduce the relative error of the displacement peak value to less than 5% even under the large time-step and large time delay.

Stability analysis of backflling in subsiding area and optimization of the stoping sequence

In underground mining by sublevel caving method, the deformation and damage of the surface induced by subsidence are the major challenging issues. The dynamic and soft backflling body increases the safety risks in the subsiding area. In this paper, taking Zhangfushan iron mine as an example, the ore body and the general layout are focused on the safety of backflling of mined-out area. Then, we use the ANSYS software to construct a three-dimensional(3D) model for the mining area in the Zhangfushan iron mine. According to the simulation results of the initial mining stages, the ore body is stoped step by step as suggested in the design. The stability of the backflling is back analyzed based on the monitored displacements, considering the stress distribution to optimize the stoping sequence. The simulations show that a reasonable stoping sequence can minimize the concentration of high compressive stress and ensure the safety of stoping of the ore body.

Uniformity evaluation and optimization of fluid flow characteristics in a seven-strand tundish

The effect of flow control devices（FCDs） on the uniformity of flow characteristics in a seven-strand symmetrical trapezoidal tundish was studied using both an experimental 1：2.5 hydraulic model and a numerical simulation of a 1：1 geometric model.The variation coefficient（CV） was defined to evaluate the flow uniformity of the seven-strand tundish.An optimized FCD configuration was proposed on the basis of the evaluation of experimental results.It is concluded that a turbulence inhibitor（TI） and U-type dam are essential to improve the uniformity of fluid flow in the seven-strand tundish.In addition,the configuration of inclination T-type dams with a height of 200 mm between the second and third strands and with a height of 300 mm between the third and fourth strands can minimize the proportion of dead zone.After optimizing the configuration of FCDs,the variation coefficient reduces below 20%of the mean value,and the average proportion of dead zone is just 14.6%;in addition,the temperature fluctuation between the strands could be controlled within 0.6 K.In summary,the uniformity of flow and temperature in the seven-strand tundish is greatly improved.

Design optimization of transonic compressor stage using CFD and response surface model

In order to shorten the design period, the paper describes a new optimization strategy for computationally expensive design optimization of turbomachinery, combined with design of experiment (DOE), response surface models (RSM), genetic algorithm (GA) and a 3-D Navier-Stokes solver(Numeca Fine). Data points for response evaluations were selected by improved distributed hypercube sampling (IHS) and the 3-D Navier-Stokes analysis was carried out at these sample points. The quadratic response surface model was used to approximate the relationships between the design variables and flow parameters. To maximize the adiabatic efficiency, the genetic algorithm was applied to the response surface model to perform global optimization to achieve the optimum design of NASA Stage 35. An optimum leading edge line was found, which produced a new 3-D rotor blade combined with sweep and lean, and a new stator one with skew. It is concluded that the proposed strategy can provide a reliable method for design optimization of turbomachinery blades at reasonable computing cost.

An Improved Northern Goshawk Optimization Algorithm for Feature Selection

Feature Selection(FS)is an important data management technique that aims to minimize redundant information in a dataset.This work proposes DENGO,an improved version of the Northern Goshawk Optimization(NGO),to address the FS problem.The NGO is an efficient swarm-based algorithm that takes its inspiration from the predatory actions of the northern goshawk.In order to overcome the disadvantages that NGO is prone to local optimum trap,slow convergence speed and low convergence accuracy,two strategies are introduced in the original NGO to boost the effectiveness of NGO.Firstly,a learning strategy is proposed where search members learn by learning from the information gaps of other members of the population to enhance the algorithm's global search ability while improving the population diversity.Secondly,a hybrid differential strategy is proposed to improve the capability of the algorithm to escape from the trap of the local optimum by perturbing the individuals to improve convergence accuracy and speed.To prove the effectiveness of the suggested DENGO,it is measured against eleven advanced algorithms on the CEC2015 and CEC2017 benchmark functions,and the obtained results demonstrate that the DENGO has a stronger global exploration capability with higher convergence performance and stability.Subsequently,the proposed DENGO is used for FS,and the 29 benchmark datasets from the UCL database prove that the DENGO-based FS method equipped with higher classification accuracy and stability compared with eight other popular FS methods,and therefore,DENGO is considered to be one of the most prospective FS techniques.DENGO's code can be obtained at https://www.mathworks.com/matlabcentral/fileexchange/158811-project1.

Weighted Sparse Image Classification Based on Low Rank Representation

The conventional sparse representation-based image classification usually codes the samples independently,which will ignore the correlation information existed in the data.Hence,if we can explore the correlation information hidden in the data,the classification result will be improved significantly.To this end,in this paper,a novel weighted supervised spare coding method is proposed to address the image classification problem.The proposed method firstly explores the structural information sufficiently hidden in the data based on the low rank representation.And then,it introduced the extracted structural information to a novel weighted sparse representation model to code the samples in a supervised way.Experimental results show that the proposed method is superiority to many conventional image classification methods.

Differential evolution with controlled search direction

A novel and simple technique to control the search direction of the differential mutation was proposed.In order to verify the performance of this method,ten widely used benchmark functions were chosen and the results were compared with the original differential evolution(DE)algorithm.Experimental results indicate that the search direction controlled DE algorithm obtains better results than the original DE algorithm in term of the solution quality and convergence rate.

Infinity Norm Measurement of Sensitivity for Closed-Loop Systems Using Chirp as Excitation

A simple identification method based on a closed-loop experiment is proposed to measure the infinity norm of sensitivity function.A chirp signal,modified to have desired band-limited characteristic and finite duration,is used as the excitation in the experiment,and the sensitivity function is calculated using Fourier transform of input and error signals before the infinity norm is evaluated through maximization of the magnitude of sensitivity function.With an additional feature of providing values of gain margin and phase margin at a little extra effort,this method can be used in the identification step of a controller auto-tuning procedure,as having been supported by simulation results showing its capability of providing fast and accurate estimates for a large variety of processes.

Study of full waveform inversion based on L-BFGS algorithm

Full waveform inversion size of full waveform inversion will and the limitation of full waveform is mainly used to obtain high resolution velocity models of subsurface. The lead to a gigantic computation cost. Under the available computer resource inversion, the authors propose L-BFGS algorithm as the optimization method to solve this problem. In order to demonstrate the flexibility of the method, three different numerical experi- ments have been done to analyze the properties of full waveform inversion based on L-BFGS.