A newly proposed competent population-based optimization algorithm called RUN,which uses the principle of slope variations calculated by applying the Runge Kutta method as the key search mechanism,has gained wider int...A newly proposed competent population-based optimization algorithm called RUN,which uses the principle of slope variations calculated by applying the Runge Kutta method as the key search mechanism,has gained wider interest in solving optimization problems.However,in high-dimensional problems,the search capabilities,convergence speed,and runtime of RUN deteriorate.This work aims at filling this gap by proposing an improved variant of the RUN algorithm called the Adaptive-RUN.Population size plays a vital role in both runtime efficiency and optimization effectiveness of metaheuristic algorithms.Unlike the original RUN where population size is fixed throughout the search process,Adaptive-RUN automatically adjusts population size according to two population size adaptation techniques,which are linear staircase reduction and iterative halving,during the search process to achieve a good balance between exploration and exploitation characteristics.In addition,the proposed methodology employs an adaptive search step size technique to determine a better solution in the early stages of evolution to improve the solution quality,fitness,and convergence speed of the original RUN.Adaptive-RUN performance is analyzed over 23 IEEE CEC-2017 benchmark functions for two cases,where the first one applies linear staircase reduction with adaptive search step size(LSRUN),and the second one applies iterative halving with adaptive search step size(HRUN),with the original RUN.To promote green computing,the carbon footprint metric is included in the performance evaluation in addition to runtime and fitness.Simulation results based on the Friedman andWilcoxon tests revealed that Adaptive-RUN can produce high-quality solutions with lower runtime and carbon footprint values as compared to the original RUN and three recent metaheuristics.Therefore,with its higher computation efficiency,Adaptive-RUN is a much more favorable choice as compared to RUN in time stringent applications.展开更多
In this note, we first derive an exponential generating function of the alternating run polynomials. We then deduce an explicit formula of the alternating run polynomials in terms of the partial Bell polynomials.
The upgrading of diesel oil to produce ethylene rich cracking feedstock is an important and promising technical route to reduce the ratio of diesel to gasoline. In the present work, a hydrocracking catalyst suitable f...The upgrading of diesel oil to produce ethylene rich cracking feedstock is an important and promising technical route to reduce the ratio of diesel to gasoline. In the present work, a hydrocracking catalyst suitable for selective hydrocracking of straight run diesel oil to produce high-quality ethylene cracking feedstock at low cost was developed, by optimizing the composition of catalyst support materials, using amorphous silicon aluminum and aluminum oxide with high mesopore content as the main support, and modified Y zeolite with excellent aromatic ring opening selectivity as the acidic component. The catalyst has in-depth characterized by X-ray diffraction, transmission electron microscopy, scanning electron microscopy, N<sub>2</sub>-low temperature adsorption-desorption, NH<sub>3</sub>-temperature-programmed desorption, and IR techniques. And its catalytic cracking straight run diesel oil performance was evaluated. The results show that the prepared catalyst has high polycyclic aromatic hydrocarbon ring opening cracking selectivity. However, alkanes retained in diesel distillates can achieve the goal of producing more ethylene cracking feedstocks with low BMCI value under low and moderate pressure conditions. This work may shed significant technical insight for oil refining transformation.展开更多
文摘A newly proposed competent population-based optimization algorithm called RUN,which uses the principle of slope variations calculated by applying the Runge Kutta method as the key search mechanism,has gained wider interest in solving optimization problems.However,in high-dimensional problems,the search capabilities,convergence speed,and runtime of RUN deteriorate.This work aims at filling this gap by proposing an improved variant of the RUN algorithm called the Adaptive-RUN.Population size plays a vital role in both runtime efficiency and optimization effectiveness of metaheuristic algorithms.Unlike the original RUN where population size is fixed throughout the search process,Adaptive-RUN automatically adjusts population size according to two population size adaptation techniques,which are linear staircase reduction and iterative halving,during the search process to achieve a good balance between exploration and exploitation characteristics.In addition,the proposed methodology employs an adaptive search step size technique to determine a better solution in the early stages of evolution to improve the solution quality,fitness,and convergence speed of the original RUN.Adaptive-RUN performance is analyzed over 23 IEEE CEC-2017 benchmark functions for two cases,where the first one applies linear staircase reduction with adaptive search step size(LSRUN),and the second one applies iterative halving with adaptive search step size(HRUN),with the original RUN.To promote green computing,the carbon footprint metric is included in the performance evaluation in addition to runtime and fitness.Simulation results based on the Friedman andWilcoxon tests revealed that Adaptive-RUN can produce high-quality solutions with lower runtime and carbon footprint values as compared to the original RUN and three recent metaheuristics.Therefore,with its higher computation efficiency,Adaptive-RUN is a much more favorable choice as compared to RUN in time stringent applications.
文摘In this note, we first derive an exponential generating function of the alternating run polynomials. We then deduce an explicit formula of the alternating run polynomials in terms of the partial Bell polynomials.
文摘The upgrading of diesel oil to produce ethylene rich cracking feedstock is an important and promising technical route to reduce the ratio of diesel to gasoline. In the present work, a hydrocracking catalyst suitable for selective hydrocracking of straight run diesel oil to produce high-quality ethylene cracking feedstock at low cost was developed, by optimizing the composition of catalyst support materials, using amorphous silicon aluminum and aluminum oxide with high mesopore content as the main support, and modified Y zeolite with excellent aromatic ring opening selectivity as the acidic component. The catalyst has in-depth characterized by X-ray diffraction, transmission electron microscopy, scanning electron microscopy, N<sub>2</sub>-low temperature adsorption-desorption, NH<sub>3</sub>-temperature-programmed desorption, and IR techniques. And its catalytic cracking straight run diesel oil performance was evaluated. The results show that the prepared catalyst has high polycyclic aromatic hydrocarbon ring opening cracking selectivity. However, alkanes retained in diesel distillates can achieve the goal of producing more ethylene cracking feedstocks with low BMCI value under low and moderate pressure conditions. This work may shed significant technical insight for oil refining transformation.
