Quantum fireworks algorithm for optimal cooperation mechanism of energy harvesting cognitive radio

For acquiring high energy efficiency and the maximal throughput, a new time slot structure is designed for energy harvesting(EH) cognitive radio(CR). Considering the CR system with EH and cooperative relay, a best cooperative mechanism(BCM)is proposed for CR with EH. To get the optimal estimation performance, a quantum fireworks algorithm(QFA) is designed to resolve the difficulties of maximal throughput and EH, and the proposed cooperative mechanism is called as QFA-BCM. The proposed QFA combines the advantages of quantum computation theory with the fireworks algorithm(FA). Thus the QFA is able to obtain the optimal solution and its convergence performance is proved. By using the new cooperation mechanism and computing algorithm, the proposed QFA-BCM method can achieve comparable maximal throughput in the new timeslot structure. Simulation results have proved that the QFA-BCM method is superior to previous non-cooperative and cooperative mechanisms.

A Novel Multiobjective Fireworks Algorithm and Its Applications to Imbalanced Distance Minimization Problems

Recently,multimodal multiobjective optimization problems(MMOPs)have received increasing attention.Their goal is to find a Pareto front and as many equivalent Pareto optimal solutions as possible.Although some evolutionary algorithms for them have been proposed,they mainly focus on the convergence rate in the decision space while ignoring solutions diversity.In this paper,we propose a new multiobjective fireworks algorithm for them,which is able to balance exploitation and exploration in the decision space.We first extend a latest single-objective fireworks algorithm to handle MMOPs.Then we make improvements by incorporating an adaptive strategy and special archive guidance into it,where special archives are established for each firework,and two strategies(i.e.,explosion and random strategies)are adaptively selected to update the positions of sparks generated by fireworks with the guidance of special archives.Finally,we compare the proposed algorithm with eight state-of-the-art multimodal multiobjective algorithms on all 22 MMOPs from CEC2019 and several imbalanced distance minimization problems.Experimental results show that the proposed algorithm is superior to compared algorithms in solving them.Also,its runtime is less than its peers'.

Finding Key Node Sets in Complex Networks Based on Improved Discrete Fireworks Algorithm

Finding out the key node sets that affect network robustness has great practical significance for network protection and network disintegration.In this paper,the problem of finding key node sets in complex networks is defined firstly.Because it is an NP-hard combinatorial optimization problem,discrete fireworks algorithm is introduced to search the optimal solution,which is a swarm intelligence algorithm and is improved by the prior information of networks.To verify the effect of improved discrete fireworks algorithm(IDFA),experiments are carried out on various model networks and real power grid.Results show that the proposed IDFA is obviously superior to the benchmark algorithms,and networks suffer more damage when the key node sets obtained by IDFA are removed from the networks.The key node sets found by IDFA contain a large number of non-central nodes,which provides the authors a new perspective that the seemingly insignificant nodes may also have an important impact on the robustness of the network.

Distributed resource scheduling in smart grid with electric vehicle deployment using fireworks algorithm

Global warming and climate change are two key probing issues in the present context.The electricity sector and transportation sector are two principle entities propelling both these issues.Emissions from these two sectors can be offset by switching to greener ways of transportation through the electric vehicle (EV) and renewable energy technologies (RET).Thus,effective scheduling of both resources holds the key to sustainable practice.This paper presents a scheduling scenario-based approach in the smart grid.Problem formulation with dual objective function including both emissions and cost is developed for conventional unit commitment with EV and RET deployment.In this work,the scheduling and commitment problem is solved using the fireworks algorithm which mimics explosion of fireworks in the sky to define search space and the distance between associated sparks to evaluate global minimum.Further,binary coded fireworks algorithm is developed for the proposed scheduling problem in the smart grid.Thereafter,possible scenarios inconventional as well as smart grid are put forward.Following that,the proposed methodology is simulated using a test system with thermal generators.

A Region Enhanced Discrete Multi-Objective Fireworks Algorithm for Low-Carbon Vehicle Routing Problem

A constrained multi-objective optimization model for the low-carbon vehicle routing problem(VRP)is established.A carbon emission measurement method considering various practical factors is introduced.It minimizes both the total carbon emissions and the longest time consumed by the sub-tours,subject to the limited number of available vehicles.According to the characteristics of the model,a region enhanced discrete multi-objective fireworks algorithm is proposed.A partial mapping explosion operator,a hybrid mutation for adjusting the sub-tours,and an objective-driven extending search are designed,which aim to improve the convergence,diversity,and spread of the non-dominated solutions produced by the algorithm,respectively.Nine low-carbon VRP instances with different scales are used to verify the effectiveness of the new strategies.Furthermore,comparison results with four state-of-the-art algorithms indicate that the proposed algorithm has better performance of convergence and distribution on the low-carbon VRP.It provides a promising scalability to the problem size.

Research and Application of a Multi-Field Co-Simulation Data Extraction Method Based on Adaptive Infinitesimal Element

Regarding the spatial profile extraction method of a multi-field co-simulation dataset,different extraction directions,locations,and numbers of profileswill greatly affect the representativeness and integrity of data.In this study,a multi-field co-simulation data extractionmethod based on adaptive infinitesimal elements is proposed.Themultifield co-simulation dataset based on related infinitesimal elements is constructed,and the candidate directions of data profile extraction undergo dimension reduction by principal component analysis to determine the direction of data extraction.Based on the fireworks algorithm,the data profile with optimal representativeness is searched adaptively in different data extraction intervals to realize the adaptive calculation of data extraction micro-step length.The multi-field co-simulation data extraction process based on adaptive microelement is established and applied to the data extraction process of the multi-field co-simulation dataset of the sintering furnace.Compared with traditional data extraction methods for multi-field co-simulation,the approximate model constructed by the data extracted from the proposed method has higher construction efficiency.Meanwhile,the relative maximum absolute error,root mean square error,and coefficient of determination of the approximationmodel are better than those of the approximation model constructed by the data extracted from traditional methods,indicating higher accuracy,it is verified that the proposed method demonstrates sound adaptability and extraction efficiency.

Crustal velocity structure of central Gansu Province from regional seismic waveform inversion using firework algorithm

The firework algorithm（FWA） is a novel swarm intelligence-based method recently proposed for the optimization of multi-parameter, nonlinear functions. Numerical waveform inversion experiments using a synthetic model show that the FWA performs well in both solution quality and efficiency. We apply the FWA in this study to crustal velocity structure inversion using regional seismic waveform data of central Gansu on the northeastern margin of the Qinghai-Tibet plateau. Seismograms recorded from the moment magnitude（MW） 5.4 Minxian earthquake enable obtaining an average crustal velocity model for this region. We initially carried out a series of FWA robustness tests in regional waveform inversion at the same earthquake and station positions across the study region,inverting two velocity structure models, with and without a low-velocity crustal layer; the accuracy of our average inversion results and their standard deviations reveal the advantages of the FWA for the inversion of regional seismic waveforms. We applied the FWA across our study area using three component waveform data recorded by nine broadband permanent seismic stations with epicentral distances ranging between 146 and 437 km. These inversion results show that the average thickness of the crust in this region is 46.75 km, while thicknesses of the sedimentary layer, and the upper, middle, and lower crust are 3.15,15.69, 13.08, and 14.83 km, respectively. Results also show that the P-wave velocities of these layers and the upper mantle are 4.47, 6.07, 6.12, 6.87, and 8.18 km/s,respectively.

Improvement of the Firework Algorithm for Classification Problems

Attracted numerous analysts’consideration,classification is one of the primary issues in Machine learning.Numerous evolutionary algorithms(EAs)were utilized to improve their global search ability.In the previous years,many scientists have attempted to tackle this issue,yet regardless of the endeavors,there are still a few inadequacies.Based on solving the classification problem,this paper introduces a new optimization classification model,which can be applied to the majority of evolutionary computing(EC)techniques.Firework algorithm(FWA)is one of the EC methods,Although the Firework algorithm(FWA)is a proficient algorithm for solving complex optimization issue.The proficient of the FWA isn't fulfilled when being utilized for solving the classification issues.In this paper we previously proposed optimization classification model according to the classification issue.At that point we legitimately utilize the model with FWA to solve the classification issue.Finally,to investigate the performance of our model,we select 4 datasets in the experiments,and the results indicate that an improved FWA can upgrade the classification accuracy by using this model.

A Hybrid Algorithm Based on Comprehensive Search Mechanisms for Job Shop Scheduling Problem

The research on complex workshop scheduling methods has important academic significance and has wide applications in industrial manufacturing.Aiming at the job shop scheduling problem,a hybrid algorithm based on comprehensive search mechanisms(HACSM)is proposed to optimize the maximum completion time.HACSM combines three search methods with different optimization scales,including fireworks algorithm(FW),extended Akers graphical method(LS1+_AKERS_EXT),and tabu search algorithm(TS).FW realizes global search through information interaction and resource allocation,ensuring the diversity of the population.LS1+_AKERS_EXT realizes compound movement with Akers graphical method,so it has advanced global and local search capabilities.In LS1+_AKERS_EXT,the shortest path is the core of the algorithm,which directly affects the encoding and decoding of scheduling.In order to find the shortest path,an effective node expansion method is designed to improve the node expansion efficiency.In the part of centralized search,TS based on the neighborhood structure is used.Finally,the effectiveness and superiority of HACSM are verified by testing the relevant instances in the literature.

Uncertain bilevel knapsack problem and its solution

This paper aims at providing an uncertain bilevel knapsack problem (UBKP) model, which is a type of BKPs involving uncertain variables. And then an uncertain solution for the UBKP is proposed by defining PE Nash equilibrium and PE Stackelberg Nash equilibrium. In order to improve the computational efficiency of the uncertain solution, several operators (binary coding distance, inversion operator, explosion operator and binary back learning operator) are applied to the basic fireworks algorithm to design the binary backward fireworks algorithm (BBFWA), which has a good performance in solving the BKP. As an illustration, a case study of the UBKP model and the P-E uncertain solution is applied to an armaments transportation problem.

An Optimal Over-frequency Generator Tripping Strategy for Regional Power Grid with High Penetration Level of Renewable Energy

This paper proposes an optimal over-frequency generator tripping strategy aiming at implementing the least amount of generator tripping for the regional power grid with high penetration level of wind/photovoltaic(PV),to handle the over-frequency problem in the sending-end power grid under large disturbances.A steady-state frequency abnormal index is defined to measure the degrees of generator over-tripping and under-tripping,and a transient frequency abnormal index is presented to assess the system abnormal frequency effect during the transient process,which reflects the frequency security margin during the generator tripping process.The scenariobased analysis method combined with the non-parametric kernel density estimation method is applied to model the uncertainty of the outgoing power caused by the stochastic fluctuations of wind/PV power and loads.Furthermore,an improved fireworks algorithm is utilized for the solution of the proposed optimization model.Finally,the simulations are performed on a real-sized regional power grid in Southern China to verify the effectiveness and adaptability of the proposed model and method.