Algorithmic approach to discrete fracture network flow modeling in consideration of realistic connections in large-scale fracture networks

Analyzing rock mass seepage using the discrete fracture network(DFN)flow model poses challenges when dealing with complex fracture networks.This paper presents a novel DFN flow model that incorporates the actual connections of large-scale fractures.Notably,this model efficiently manages over 20,000 fractures without necessitating adjustments to the DFN geometry.All geometric analyses,such as identifying connected fractures,dividing the two-dimensional domain into closed loops,triangulating arbitrary loops,and refining triangular elements,are fully automated.The analysis processes are comprehensively introduced,and core algorithms,along with their pseudo-codes,are outlined and explained to assist readers in their programming endeavors.The accuracy of geometric analyses is validated through topological graphs representing the connection relationships between fractures.In practical application,the proposed model is employed to assess the water-sealing effectiveness of an underground storage cavern project.The analysis results indicate that the existing design scheme can effectively prevent the stored oil from leaking in the presence of both dense and sparse fractures.Furthermore,following extensive modification and optimization,the scale and precision of model computation suggest that the proposed model and developed codes can meet the requirements of engineering applications.

Algorithm for cavity flow in a new-born goaf and experimental verification

Prevention and control measures of spontaneous combustion of coal and gas accumulation in a goaf require an accurate description of its gas flow state.However,the commonly used fluid dynamics in porous media is not suitable for the new-born goaf with fracture cavity combination,multi-scale,and large blocks.In this study,we propose a cavity flow algorithm to accurately describe the gas flow state in the new-born goaf.The genetic algorithm(GA)is used to randomly generate the binary matrix of a goaf caving shape.The difference between the gas flow state calculated by the lattice Boltzmann method(LBM)and the measured data at the boundary or internal measuring points of the real goaf is taken as the GA fitness value,and the real goaf caving shape and the gas flow state are quickly addressed by GA.The experimental model of new-born goaf is established,and the laser Doppler anemometry(LDA)experiment is carried out.The results show that the Jaccard similarity coefficient between the reconstructed caving shape and the real caving shape is 0.7473,the mean square error between the calculated wind speed and the LDA-measured value is 0.0244,and the R2 coefficient is 0.8986,which verify the feasibility of the algorithm.

Traffic flow of connected and automated vehicles at lane drop on two-lane highway: An optimization-based control algorithm versus a heuristic rules-based algorithm

This paper investigates traffic flow of connected and automated vehicles at lane drop on two-lane highway. We evaluate and compare performance of an optimization-based control algorithm(OCA) with that of a heuristic rules-based algorithm(HRA). In the OCA, the average speed of each vehicle is maximized. In the HRA, virtual vehicle and restriction of the command acceleration caused by the virtual vehicle are introduced. It is found that(i) capacity under the HRA(denoted as C_(H)) is smaller than capacity under the OCA;(ii) the travel delay is always smaller under the OCA, but driving is always much more comfortable under the HRA;(iii) when the inflow rate is smaller than C_(H), the HRA outperforms the OCA with respect to the fuel consumption and the monetary cost;(iv) when the inflow rate is larger than C_(H), the HRA initially performs better with respect to the fuel consumption and the monetary cost, but the OCA would become better after certain time. The spatiotemporal pattern and speed profile of traffic flow are presented, which explains the reason underlying the different performance. The study is expected to help for better understanding of the two different types of algorithm.

Predicting Traffic Flow Using Dynamic Spatial-Temporal Graph Convolution Networks

Traffic flow prediction plays a key role in the construction of intelligent transportation system.However,due to its complex spatio-temporal dependence and its uncertainty,the research becomes very challenging.Most of the existing studies are based on graph neural networks that model traffic flow graphs and try to use fixed graph structure to deal with the relationship between nodes.However,due to the time-varying spatial correlation of the traffic network,there is no fixed node relationship,and these methods cannot effectively integrate the temporal and spatial features.This paper proposes a novel temporal-spatial dynamic graph convolutional network(TSADGCN).The dynamic time warping algorithm(DTW)is introduced to calculate the similarity of traffic flow sequence among network nodes in the time dimension,and the spatiotemporal graph of traffic flow is constructed to capture the spatiotemporal characteristics and dependencies of traffic flow.By combining graph attention network and time attention network,a spatiotemporal convolution block is constructed to capture spatiotemporal characteristics of traffic data.Experiments on open data sets PEMSD4 and PEMSD8 show that TSADGCN has higher prediction accuracy than well-known traffic flow prediction algorithms.

Hybrid evolutionary algorithm for no-wait flow shops to minimize makespan and total flowtime

The NP-hard no-wait flow shop scheduling problems with makespan and total flowtime minimization are considered. Objective increment properties of the problems are analyzed. A non-dominated classification method is introduced to class population individuals into Pareto fronts to improve searching efficiency. Besides investigating the crowding distance and the elitist solution strategy, two effective bi-criteria local search procedures based on objective increments are presented to improve searching effectiveness. Based on the properties and methods, a hybrid evolutionary algorithm is proposed for the considered problems and compared with the best existing algorithms. Experimental results show that the proposed algorithm is effective with high efficiency.

Expressway traffic flow prediction using chaos cloud particle swarm algorithm and PPPR model

Aiming at the real-time fluctuation and nonlinear characteristics of the expressway short-term traffic flow forecasting the parameter projection pursuit regression PPPR model is applied to forecast the expressway traffic flow where the orthogonal Hermite polynomial is used to fit the ridge functions and the least square method is employed to determine the polynomial weight coefficient c.In order to efficiently optimize the projection direction a and the number M of ridge functions of the PPPR model the chaos cloud particle swarm optimization CCPSO algorithm is applied to optimize the parameters. The CCPSO-PPPR hybrid optimization model for expressway short-term traffic flow forecasting is established in which the CCPSO algorithm is used to optimize the optimal projection direction a in the inner layer while the number M of ridge functions is optimized in the outer layer.Traffic volume weather factors and travel date of the previous several time intervals of the road section are taken as the input influencing factors. Example forecasting and model comparison results indicate that the proposed model can obtain a better forecasting effect and its absolute error is controlled within [-6,6] which can meet the application requirements of expressway traffic flow forecasting.

A Discrete Artificial Bee Colony Algorithm for Minimizing the Total Flow Time in the Blocking Flow Shop Scheduling

A discrete artificial bee colony algorithm is proposed for solving the blocking flow shop scheduling problem with total flow time criterion. Firstly, the solution in the algorithm is represented as job permutation. Secondly, an initialization scheme based on a variant of the NEH (Nawaz-Enscore-Ham) heuristic and a local search is designed to construct the initial population with both quality and diversity. Thirdly, based on the idea of iterated greedy algorithm, some newly designed schemes for employed bee, onlooker bee and scout bee are presented. The performance of the proposed algorithm is tested on the well-known Taillard benchmark set, and the computational results demonstrate the effectiveness of the discrete artificial bee colony algorithm. In addition, the best known solutions of the benchmark set are provided for the blocking flow shop scheduling problem with total flow time criterion.

Effective Iterated Greedy Algorithm for Flow-Shop Scheduling Problems with Time lags

Flow shop scheduling problem with time lags is a practical scheduling problem and attracts many studies. Permutation problem（PFSP with time lags） is concentrated but non-permutation problem（non-PFSP with time lags） seems to be neglected. With the aim to minimize the makespan and satisfy time lag constraints, efficient algo- rithms corresponding to PFSP and non-PFSP problems are proposed, which consist of iterated greedy algorithm for permutation（IGTLP） and iterated greedy algorithm for non-permutation （IGTLNP）. The proposed algorithms are verified using well-known simple and complex instances of permutation and non-permutation problems with various time lag ranges. The permutation results indicate that the proposed IGTLP can reach near optimal solution within nearly 11% computational time of traditional GA approach. The non-permutation results indicate that the proposed IG can reach nearly same solution within less than 1% com- putational time compared with traditional GA approach. The proposed research combines PFSP and non-PFSP together with minimal and maximal time lag consideration, which provides an interesting viewpoint for industrial implementation.

A Genetic Algorithm to Solve Capacity Assignment Problem in a Flow Network

Computer networks and power transmission networks are treated as capacitated flow networks.A capacitated flow network may partially fail due to maintenance.Therefore,the capacity of each edge should be optimally assigned to face critical situations-i.e.,to keep the network functioning normally in the case of failure at one or more edges.The robust design problem(RDP)in a capacitated flow network is to search for the minimum capacity assignment of each edge such that the network still survived even under the edge’s failure.The RDP is known as NP-hard.Thus,capacity assignment problem subject to system reliability and total capacity constraints is studied in this paper.The problem is formulated mathematically,and a genetic algorithm is proposed to determine the optimal solution.The optimal solution found by the proposed algorithm is characterized by maximum reliability and minimum total capacity.Some numerical examples are presented to illustrate the efficiency of the proposed approach.

Totally Coded Method for Signal Flow Graph Algorithm

After a code-table has been established by means of node association information from signal flow graph, the totally coded method (TCM) is applied merely in the domain of code operation beyond any figure-earching algorithm. The code-series (CS) have the holo-information nature, so that both the content and the sign of each gain-term can be determined via the coded method. The principle of this method is simple and it is suited for computer programming. The capability of the computer-aided analysis for switched current network (SIN) can be enhanced.

Application of a Genetic Algorithm Based on the Immunity for Flow Shop under Uncertainty

The uncertain duration of each job in each machine in flow shop problem was regarded as an independent random variable and was described by mathematical expectation.And then,an immune based partheno-genetic algorithm was proposed by making use of concepts and principles introduced from immune system and genetic system in nature.In this method,processing se- quence of products could be expressed by the character encoding and each antibody represents a feasible schedule.Affinity was used to measure the matching degree between antibody and antigen.Then several antibodies producing operators,such as swopping,mov- ing,inverting,etc,were worked out.This algorithm was combined with evolution function of the genetic algorithm and density mechanism in organisms immune system.Promotion and inhibition of antibodies were realized by expected propagation ratio of an- tibodies,and in this way,premature convergence was improved.The simulation proved that this algorithm is effective.

Energy-Saving Scheduling in a Flexible Flow Shop Using a Hybrid Genetic Algorithm

Many researches discussing reduced energy consumption for environmental protection focus on machine efficiency or process redesign. To optimize the machine operation time can also save the energy, and these researches have received great interests in recent years. This study considers three different states of machines, among processing there are two different speeds, to solve the problem of minimizing energy costs under time-of-use tariff with no tardy jobs in flexible flow shop. This problem is basically NP-hard, we proposed a hybrid genetic algorithm (GA) to solve problems in reasonable timeliness. The result shows that to optimize different states of machines under time-of use tariff can reduce energy costs significantly in on-time delivery.

Convergence and stability of the Newton-Like algorithm with estimation error in optimization flow control

The Newton-Like algorithm with price estimation error in optimization flow control in network is analyzed. The estimation error is treated as inexactness of the gradient and the inexact descent direction is analyzed. Based on the optimization theory, a sufficient condition for convergence of this algorithm with bounded price estimation error is obtained. Furthermore, even when this sufficient condition doesn＇t hold, this algorithm can also converge, provided a modified step size, and an attraction region is obtained. Based on Lasalle＇s invariance principle applied to a suitable Lyapunov function, the dynamic system described by this algorithm is proved to be global stability if the error is zero. And the Newton-Like algorithm with bounded price estimation error is also globally stable if the error satisfies the sufficient condition for convergence. All trajectories ultimately converge to the equilibrium point.

A New Explicit Algorithm for Bi-Phasic Mixture Flow in MIM

Metal injection moulding (MIM) is a new technology to manufacture small intricate parts in large quantity. Numerical simulation plays an important role in its development. To predict the specific segregation effect in MIM injection, mixture theory is adopted to model the injection flow by a bi-phasic model. This model conducts to the solution of two-coupled Stokes equations. It is an extremely computational consuming solution in the scope of the traditional algorithms, which induce a serious challenge to cost-effectivity of the MIM simulation. Referred to some methods proposed by Lewis in mono-phasic simulation and the implicit algorithms in MIM simulation, a new explicit algorithm is proposed and realized to perform efficiently this type of bi-phasic flow. Numerically this algorithm is devised to perform the simulation in a fully uncoupled manner except for a global solution of the pressure field in each time step. The physical coupling is taken into account in a sequential pattern by fractional steps.

An effective discrete artificial bee colony algorithm for flow shop scheduling problem with intermediate buffers

An effective discrete artificial bee colony(DABC) algorithm is proposed for the flow shop scheduling problem with intermediate buffers(IBFSP) in order to minimize the maximum completion time(i.e makespan). The effective combination of the insertion and swap operator is applied to producing neighborhood individual at the employed bee phase. The tournament selection is adopted to avoid falling into local optima, while, the optimized insert operator embeds in onlooker bee phase for further searching the neighborhood solution to enhance the local search ability of algorithm. The tournament selection with size 2 is again applied and a better selected solution will be performed destruction and construction of iterated greedy(IG) algorithm, and then the result replaces the worse one. Simulation results show that our algorithm has a better performance compared with the HDDE and CHS which were proposed recently. It provides the better known solutions for the makespan criterion to flow shop scheduling problem with limited buffers for the Car benchmark by Carlier and Rec benchmark by Reeves. The convergence curves show that the algorithm not only has faster convergence speed but also has better convergence value.

Research on the Active DDoS Filtering Algorithm Based on IP Flow

Distributed Denial-of-Service (DDoS) attacks against public web servers are increasingly common. Countering DDoS attacks are becoming ever more challenging with the vast resources and techniques increasingly available to attackers. It is impossible for the victim servers to work on the individual level of on-going traffic flows. In this paper, we establish IP Flow which is used to select proper features for DDoS detection. The IP flow statistics is used to allocate the weights for traffic routing by routers. Our system protects servers from DDoS attacks without strong client authentication or allowing an attacker with partial connectivity information to repeatedly disrupt communications. The new algorithm is thus proposed to get efficiently maximum throughput by the traffic filtering, and its feasibility and validity have been verified in a real network circumstance. The experiment shows that it is with high average detection and with low false alarm and miss alarm. Moreover, it can optimize the network traffic simultaneously with defending against DDoS attacks, thus eliminating efficiently the global burst of traffic arising from normal traffic.

Volume Flow Rate Optimization of an Axial Fan by Artificial Neural Network and Genetic Algorithm

The present study is to improve the volume flow rate of an axial fan through optimizing the blade shape under the demand for a specified static pressure. Fourteen design variables were selected to control the blade camber lines and the stacking line and the values of these variables were determined by using the experimental design method of the Latin Hypercube Sampling (LHS) to generate forty designs. The optimization was carried out using the genetic algorithm (GA) coupled with the artificial neural network (ANN) to increase the volume flow rate of the axial fan under the constraint of a specific motor power and a required static pressure. Differences in the aerodynamic performance and the flow characteristics between the original model and the optimal model were analyzed in detail. The results showed that the volume flow rate of the optimal model increased by 33%. The chord length, the installation angle and the cascade turning angle changed considerably. The forward leaned blade was beneficial to improve the volume flow rate of the axial fan. The axial velocity distribution and the static pressure distribution on the blade surface were improved after optimization.

A novel hybrid estimation of distribution algorithm for solving hybrid flowshop scheduling problem with unrelated parallel machine

The hybrid flow shop scheduling problem with unrelated parallel machine is a typical NP-hard combinatorial optimization problem, and it exists widely in chemical, manufacturing and pharmaceutical industry. In this work, a novel mathematic model for the hybrid flow shop scheduling problem with unrelated parallel machine(HFSPUPM) was proposed. Additionally, an effective hybrid estimation of distribution algorithm was proposed to solve the HFSPUPM, taking advantage of the features in the mathematic model. In the optimization algorithm, a new individual representation method was adopted. The(EDA) structure was used for global search while the teaching learning based optimization(TLBO) strategy was used for local search. Based on the structure of the HFSPUPM, this work presents a series of discrete operations. Simulation results show the effectiveness of the proposed hybrid algorithm compared with other algorithms.

An Algorithm for Traffic Equilibrium Flow with Capacity Constraints of Arcs

In the traffic equilibrium problem, we introduce capacity constraints of arcs, extend Beckmann’s formula to include these constraints, and give an algorithm for traffic equilibrium flows with capacity constraints on arcs. Using an example, we illustrate the application of the algorithm and show that Beckmann’s formula is a sufficient condition only, not a necessary condition, for traffic equilibrium with capacity constraints of arcs.

Improved multi-objective artificial bee colony algorithm for optimal power flow problem

The artificial bee colony(ABC) algorithm is improved to construct a hybrid multi-objective ABC algorithm, called HMOABC, for resolving optimal power flow(OPF) problem by simultaneously optimizing three conflicting objectives of OPF, instead of transforming multi-objective functions into a single objective function. The main idea of HMOABC is to extend original ABC algorithm to multi-objective and cooperative mode by combining the Pareto dominance and divide-and-conquer approach. HMOABC is then used in the 30-bus IEEE test system for solving the OPF problem considering the cost, loss, and emission impacts. The simulation results show that the HMOABC is superior to other algorithms in terms of optimization accuracy and computation robustness.