Hydrocarbon gas huff-n-puff optimization of multiple horizontal wells with complex fracture networks in the M unconventional reservoir

The oil production of the multi-fractured horizontal wells(MFHWs) declines quickly in unconventional oil reservoirs due to the fast depletion of natural energy. Gas injection has been acknowledged as an effective method to improve oil recovery factor from unconventional oil reservoirs. Hydrocarbon gas huff-n-puff becomes preferable when the CO_(2) source is limited. However, the impact of complex fracture networks and well interference on the EOR performance of multiple MFHWs is still unclear. The optimal gas huff-n-puff parameters are significant for enhancing oil recovery. This work aims to optimize the hydrocarbon gas injection and production parameters for multiple MFHWs with complex fracture networks in unconventional oil reservoirs. Firstly, the numerical model based on unstructured grids is developed to characterize the complex fracture networks and capture the dynamic fracture features.Secondly, the PVT phase behavior simulation was carried out to provide the fluid model for numerical simulation. Thirdly, the optimal parameters for hydrocarbon gas huff-n-puff were obtained. Finally, the dominant factors of hydrocarbon gas huff-n-puff under complex fracture networks are obtained by fuzzy mathematical method. Results reveal that the current pressure of hydrocarbon gas injection can achieve miscible displacement. The optimal injection and production parameters are obtained by single-factor analysis to analyze the effect of individual parameter. Gas injection time is the dominant factor of hydrocarbon gas huff-n-puff in unconventional oil reservoirs with complex fracture networks. This work can offer engineers guidance for hydrocarbon gas huff-n-puff of multiple MFHWs considering the complex fracture networks.

Wild Gibbon Optimization Algorithm

Complex optimization problems hold broad significance across numerous fields and applications.However,as the dimensionality of such problems increases,issues like the curse of dimensionality and local optima trapping also arise.To address these challenges,this paper proposes a novel Wild Gibbon Optimization Algorithm(WGOA)based on an analysis of wild gibbon population behavior.WGOAcomprises two strategies:community search and community competition.The community search strategy facilitates information exchange between two gibbon families,generating multiple candidate solutions to enhance algorithm diversity.Meanwhile,the community competition strategy reselects leaders for the population after each iteration,thus enhancing algorithm precision.To assess the algorithm’s performance,CEC2017 and CEC2022 are chosen as test functions.In the CEC2017 test suite,WGOA secures first place in 10 functions.In the CEC2022 benchmark functions,WGOA obtained the first rank in 5 functions.The ultimate experimental findings demonstrate that theWildGibbonOptimization Algorithm outperforms others in tested functions.This underscores the strong robustness and stability of the gibbonalgorithm in tackling complex single-objective optimization problems.

A Line Complex-Based Evolutionary Algorithm for Many-Objective Optimization

In solving many-objective optimization problems(MaO Ps),existing nondominated sorting-based multi-objective evolutionary algorithms suffer from the fast loss of selection pressure.Most candidate solutions become nondominated during the evolutionary process,thus leading to the failure of producing offspring toward Pareto-optimal front with diversity.Can we find a more effective way to select nondominated solutions and resolve this issue?To answer this critical question,this work proposes to evolve solutions through line complex rather than solution points in Euclidean space.First,Plücker coordinates are used to project solution points to line complex composed of position vectors and momentum ones.Besides position vectors of the solution points,momentum vectors are used to extend the comparability of nondominated solutions and enhance selection pressure.Then,a new distance function designed for high-dimensional space is proposed to replace Euclidean distance as a more effective distancebased estimator.Based on them,a novel many-objective evolutionary algorithm(MaOEA)is proposed by integrating a line complex-based environmental selection strategy into the NSGAⅢframework.The proposed algorithm is compared with the state of the art on widely used benchmark problems with up to 15 objectives.Experimental results demonstrate its superior competitiveness in solving MaOPs.

Stochastic focusing search:a novel optimization algorithm for real-parameter optimization

A novel optimization algorithm called stochastic focusing search （SFS） for the real-parameter optimization is proposed. The new algorithm is a swarm intelligence algorithm, which is based on simulating the act of human randomized searching, and the human searching behaviors. The algorithm＇s performance is studied using a challenging set of typically complex functions with comparison of differential evolution （DE） and three modified particle swarm optimization （PSO） algorithms, and the simulation results show that SFS is competitive to solve most parts of the benchmark problems and will become a promising candidate of search algorithms especially when the existing algorithms have some difficulties in solving certain problems.

Optimization of copper extraction for bioleaching of complex Cu-polymetallic concentrate by moderate thermophiles

Effects of initial pH, temperature, liquid volume, rotation speed, galvanic interaction （pyrite ratio） and pulp density on bioleaching of complex Cu-polymetallic concentrate were investigated. The results indicated that the copper extraction at pH 1.5 was 1.5 and 1.4 times that at pH 1.0 and pH 2.0 respectively. The copper extraction obtained at 45 ℃ was 1236.8%higher than that at 50 ℃. With the increase of rotation speed or the decrease of liquid volume, copper extraction was improved obviously. Copper extraction was improved gradually with the increase of pyrite ratio. However, when the ratio was higher than 20.0%, no further increase in copper extraction was observed. And the statistically significant interactive effects on copper extraction were found between temperature and pH, and temperature and pyrite ratio.

Time Complexity of Evolutionary Algorithms for Combinatorial Optimization:A Decade of Results

Computational time complexity analyzes of evolutionary algorithms （EAs） have been performed since the mid-nineties. The first results were related to very simple algorithms, such as the （1＋1）-EA, on toy problems. These efforts produced a deeper understanding of how EAs perform on different kinds of fitness landscapes and general mathematical tools that may be extended to the analysis of more complicated EAs on more realistic problems. In fact, in recent years, it has been possible to analyze the （1＋1）-EA on combinatorial optimization problems with practical applications and more realistic population-based EAs on structured toy problems. This paper presents a survey of the results obtained in the last decade along these two research lines. The most common mathematical techniques are introduced, the basic ideas behind them are discussed and their elective applications are highlighted. Solved problems that were still open are enumerated as are those still awaiting for a solution. New questions and problems arisen in the meantime are also considered.

Joint optimization scheduling for water conservancy projects incomplex river networks

In this study, we simulated water flow in a water conservancy project consisting of various hydraulic structures, such as sluices, pumping stations, hydropower stations, ship locks, and culverts, and developed a multi-period and multi-variable joint optimization scheduling model for flood control, drainage, and irrigation. In this model, the number of sluice holes, pump units, and hydropower station units to be opened were used as decision variables, and different optimization objectives and constraints were considered. This model was solved with improved genetic algorithms and verified using the Huaian Water Conservancy Project as an example. The results show that the use of the joint optimization scheduling led to a 10% increase in the power generation capacity and a 15% reduction in the total energy consumption. The change in the water level was reduced by 0.25 m upstream of the Yundong Sluice, and by 50% downstream of pumping stations No. 1, No. 2, and No. 4. It is clear that the joint optimization scheduling proposed in this study can effectively improve power generation capacity of the project, minimize operating costs and energy consumption, and enable more stable operation of various hydraulic structures. The results may provide references for the management of water conservancy projects in complex river networks.

Multi-parameter Sensitivity Analysis and Application Research in the Robust Optimization Design for Complex Nonlinear System

The current research of complex nonlinear system robust optimization mainly focuses on the features of design parameters, such as probability density functions, boundary conditions, etc. After parameters study, high-dimensional curve or robust control design is used to find an accurate robust solution. However, there may exist complex interaction between parameters and practical engineering system. With the increase of the number of parameters, it is getting hard to determine high-dimensional curves and robust control methods, thus it＇s difficult to get the robust design solutions. In this paper, a method of global sensitivity analysis based on divided variables in groups is proposed. By making relevant variables in one group and keeping each other independent among sets of variables, global sensitivity analysis is conducted in grouped variables and the importance of parameters is evaluated by calculating the contribution value of each parameter to the total variance of system response. By ranking the importance of input parameters, relatively important parameters are chosen to conduct robust design analysis of the system. By applying this method to the robust optimization design of a real complex nonlinear system-a vehicle occupant restraint system with multi-parameter, good solution is gained and the response variance of the objective function is reduced to 0.01, which indicates that the robustness of the occupant restraint system is improved in a great degree and the method is effective and valuable for the robust design of complex nonlinear system. This research proposes a new method which can be used to obtain solutions for complex nonlinear system robust design.

Optimization-based topology identification of complex networks

In many cases, the topological structures of a complex network are unknown or uncertain, and it is of significance to identify the exact topological structure. An optimization-based method of identifying the topological structure of a complex network is proposed in this paper. Identification of the exact network topological structure is converted into a minimal optimization problem by using the estimated network. Then, an improved quantum-behaved particle swarm optimization algorithm is used to solve the optimization problem. Compared with the previous adaptive synchronization- based method, the proposed method is simple and effective and is particularly valid to identify the topological structure of synchronization complex networks. In some cases where the states of a complex network are only partially observable, the exact topological structure of a network can also be identified by using the proposed method. Finally, numerical simulations are provided to show the effectiveness of the proposed method.

Improved Multi-objective Ant Colony Optimization Algorithm and Its Application in Complex Reasoning

The problem of fault reasoning has aroused great concern in scientific and engineering fields.However,fault investigation and reasoning of complex system is not a simple reasoning decision-making problem.It has become a typical multi-constraint and multi-objective reticulate optimization decision-making problem under many influencing factors and constraints.So far,little research has been carried out in this field.This paper transforms the fault reasoning problem of complex system into a paths-searching problem starting from known symptoms to fault causes.Three optimization objectives are considered simultaneously: maximum probability of average fault,maximum average importance,and minimum average complexity of test.Under the constraints of both known symptoms and the causal relationship among different components,a multi-objective optimization mathematical model is set up,taking minimizing cost of fault reasoning as the target function.Since the problem is non-deterministic polynomial-hard(NP-hard),a modified multi-objective ant colony algorithm is proposed,in which a reachability matrix is set up to constrain the feasible search nodes of the ants and a new pseudo-random-proportional rule and a pheromone adjustment mechinism are constructed to balance conflicts between the optimization objectives.At last,a Pareto optimal set is acquired.Evaluation functions based on validity and tendency of reasoning paths are defined to optimize noninferior set,through which the final fault causes can be identified according to decision-making demands,thus realize fault reasoning of the multi-constraint and multi-objective complex system.Reasoning results demonstrate that the improved multi-objective ant colony optimization(IMACO) can realize reasoning and locating fault positions precisely by solving the multi-objective fault diagnosis model,which provides a new method to solve the problem of multi-constraint and multi-objective fault diagnosis and reasoning of complex system.

Complexity analysis of interior-point algorithm based on a new kernel function for semidefinite optimization

Interior-point methods （IPMs） for linear optimization （LO） and semidefinite optimization （SDO） have become a hot area in mathematical programming in the last decades. In this paper, a new kernel function with simple algebraic expression is proposed. Based on this kernel function, a primal-dual interior-point methods （IPMs） for semidefinite optimization （SDO） is designed. And the iteration complexity of the algorithm as O（n^3/4 log n/ε） with large-updates is established. The resulting bound is better than the classical kernel function, with its iteration complexity O（n log n/ε） in large-updates case.

Self-Organized Optimization of Transport on Complex Networks

We propose a self-organized optimization mechanism to improve the transport capacity of complex gradient networks. We find that, regardless of network topology, the congestion pressure can be strongly reduced by the self-organized optimization mechanism. Furthermore, the random scale-free topology is more efficient to reduce congestion compared with the random Poisson topology under the optimization mechanism. The reason is that the optimization mechanism introduces the correlations between the gradient field and the local topology of the substrate network. Due to the correlations, the cutoff degree of the gradient network is strongly reduced and the number of the nodes exerting their maximal transport capacity consumedly increases. Our work presents evidence supporting the idea that scale-free networks can efficiently improve their transport capacity by self- organized mechanism under gradient-driven transport mode.

Response surface methodology-based hybrid robust design optimization for complex product under mixed uncertainties

Minimizing the impact of the mixed uncertainties(i.e.,the aleatory uncertainty and the epistemic uncertainty) for a complex product of compliant mechanism(CPCM) quality improvement signifies a fascinating research topic to enhance the robustness.However, most of the existing works in the CPCM robust design optimization neglect the mixed uncertainties, which might result in an unstable design or even an infeasible design. To solve this issue, a response surface methodology-based hybrid robust design optimization(RSM-based HRDO) approach is proposed to improve the robustness of the quality characteristic for the CPCM via considering the mixed uncertainties in the robust design optimization. A bridge-type amplification mechanism is used to manifest the effectiveness of the proposed approach. The comparison results prove that the proposed approach can not only keep its superiority in the robustness, but also provide a robust scheme for optimizing the design parameters.

Recent progress on equation-oriented optimization of complex chemical processes

Process optimization in equation-oriented(EO)modeling environments favors the gradient-based optimization algorithms by their abilities to provide accurate Jacobian matrices via automatic or symbolic differentiation.However,computational inefficiencies including that in initial-point-finding for Newton type methods have significantly limited its application.Recently,progress has been made in using a pseudo-transient(PT)modeling method to address these difficulties,providing a fresh way forward in EO-based optimization.Nevertheless,research in this area remains open,and challenges need to be addressed.Therefore,understanding the state-of-the-art research on the PT method,its principle,and the strategies in composing effective methodologies using the PT modeling method is necessary for further developing EO-based methods for process optimization.For this purpose,the basic concepts for the PT modeling and the optimization framework based on the PT model are reviewed in this paper.Several typical applications,e.g.,complex distillation processes,cryogenic processes,and optimizations under uncertainty,are presented as well.Finally,we identify several main challenges and give prospects for the development of the PT based optimization methods.

Towards complex scenes: A deep learning-based camouflaged people detection method for snapshot multispectral images

Camouflaged people are extremely expert in actively concealing themselves by effectively utilizing cover and the surrounding environment. Despite advancements in optical detection capabilities through imaging systems, including spectral, polarization, and infrared technologies, there is still a lack of effective real-time method for accurately detecting small-size and high-efficient camouflaged people in complex real-world scenes. Here, this study proposes a snapshot multispectral image-based camouflaged detection model, multispectral YOLO(MS-YOLO), which utilizes the SPD-Conv and Sim AM modules to effectively represent targets and suppress background interference by exploiting the spatial-spectral target information. Besides, the study constructs the first real-shot multispectral camouflaged people dataset(MSCPD), which encompasses diverse scenes, target scales, and attitudes. To minimize information redundancy, MS-YOLO selects an optimal subset of 12 bands with strong feature representation and minimal inter-band correlation as input. Through experiments on the MSCPD, MS-YOLO achieves a mean Average Precision of 94.31% and real-time detection at 65 frames per second, which confirms the effectiveness and efficiency of our method in detecting camouflaged people in various typical desert and forest scenes. Our approach offers valuable support to improve the perception capabilities of unmanned aerial vehicles in detecting enemy forces and rescuing personnel in battlefield.

Optimizing Connections:Applied Shortest Path Algorithms for MANETs

This study is trying to address the critical need for efficient routing in Mobile Ad Hoc Networks(MANETs)from dynamic topologies that pose great challenges because of the mobility of nodes.Themain objective was to delve into and refine the application of the Dijkstra’s algorithm in this context,a method conventionally esteemed for its efficiency in static networks.Thus,this paper has carried out a comparative theoretical analysis with the Bellman-Ford algorithm,considering adaptation to the dynamic network conditions that are typical for MANETs.This paper has shown through detailed algorithmic analysis that Dijkstra’s algorithm,when adapted for dynamic updates,yields a very workable solution to the problem of real-time routing in MANETs.The results indicate that with these changes,Dijkstra’s algorithm performs much better computationally and 30%better in routing optimization than Bellman-Ford when working with configurations of sparse networks.The theoretical framework adapted,with the adaptation of the Dijkstra’s algorithm for dynamically changing network topologies,is novel in this work and quite different from any traditional application.The adaptation should offer more efficient routing and less computational overhead,most apt in the limited resource environment of MANETs.Thus,from these findings,one may derive a conclusion that the proposed version of Dijkstra’s algorithm is the best and most feasible choice of the routing protocol for MANETs given all pertinent key performance and resource consumption indicators and further that the proposed method offers a marked improvement over traditional methods.This paper,therefore,operationalizes the theoretical model into practical scenarios and also further research with empirical simulations to understand more about its operational effectiveness.

Complex coordinate rotation method based on gradient optimization

In atomic,molecular,and nuclear physics,the method of complex coordinate rotation is a widely used theoretical tool for studying resonant states.Here,we propose a novel implementation of this method based on the gradient optimization(CCR-GO).The main strength of the CCR-GO method is that it does not require manual adjustment of optimization parameters in the wave function;instead,a mathematically well-defined optimization path can be followed.Our method is proven to be very efficient in searching resonant positions and widths over a variety of few-body atomic systems,and can significantly improve the accuracy of the results.As a special case,the CCR-GO method is equally capable of dealing with bound-state problems with high accuracy,which is traditionally achieved through the usual extreme conditions of energy itself.

Complex Problems Solution as a Service Based on Predictive Optimization and Tasks Orchestration in Smart Cities

Smart cities have different contradicting goals having no apparent solution.The selection of the appropriate solution,which is considered the best compromise among the candidates,is known as complex problem-solving.Smart city administrators face different problems of complex nature,such as optimal energy trading in microgrids and optimal comfort index in smart homes,to mention a few.This paper proposes a novel architecture to offer complex problem solutions as a service(CPSaaS)based on predictive model optimization and optimal task orchestration to offer solutions to different problems in a smart city.Predictive model optimization uses a machine learning module and optimization objective to compute the given problem’s solutions.The task orchestration module helps decompose the complex problem in small tasks and deploy them on real-world physical sensors and actuators.The proposed architecture is hierarchical and modular,making it robust against faults and easy to maintain.The proposed architecture’s evaluation results highlight its strengths in fault tolerance,accuracy,and processing speed.

Improved Particle Swarm Optimization for Solving Transient Nonlinear Inverse Heat Conduction Problem in Complex Structure

Accurately solving transient nonlinear inverse heat conduction problems in complex structures is of great importance to provide key parameters for modeling coupled heat transfer process and the structure’s optimization design.The finite element method in ABAQUS is employed to solve the direct transient nonlinear heat conduction problem.Improved particle swarm optimization(PSO)method is developed and used to solve the transient nonlinear inverse problem.To investigate the inverse performances,some numerical tests are provided.Boundary conditions at inaccessible surfaces of a scramjet combustor with the regenerative cooling system are inversely identified.The results show that the new methodology can accurately and efficiently determine the boundary conditions in the scramjet combustor with the regenerative cooling system.By solving the transient nonlinear inverse problem,the improved particle swarm optimization for solving the transient nonlinear inverse heat conduction problem in a complex structure is verified.

A COMPLEX OF TWO OPTIMIZATION IDEAS IN OPTICAL AUTOMATIC DESIGN

ＡＣＯＭＰＬＥＸＯＦＴＷＯＯＰＴＩＭＩＺＡＴＩＯＮＩＤＥＡＳＩＮＯＰＴＩＣＡＬＡＵＴＯＭＡＴＩＣＤＥＳＩＧＮＷａｎｇＹｏｎｇｚｈｏｎｇ（ＤｅｐａｒｔｍｅｎｔｏｆＡｐｐｌｉｅｄＰｈｙｓｉｃｓ，ＮＵＤＴ，Ｃｈａｎｇｓｈａ，４１００７３）Ａｂｓｔｒａｃｔ：...