• <tr id="yyy80"></tr>
  • <sup id="yyy80"></sup>
  • <tfoot id="yyy80"><noscript id="yyy80"></noscript></tfoot>
  • 99热精品在线国产_美女午夜性视频免费_国产精品国产高清国产av_av欧美777_自拍偷自拍亚洲精品老妇_亚洲熟女精品中文字幕_www日本黄色视频网_国产精品野战在线观看 ?

    A Novel MILP Model Based on the Topology of a Network Graph for Process Planning in an Intelligent Manufacturing System

    2021-11-26 03:45:40QihaoLiuXinyuLiLiangGao
    Engineering 2021年6期

    Qihao Liu, Xinyu Li*, Liang Gao

    State Key Laboratory of Digital Manufacturing Equipment and Technology, School of Mechanical Science and Engineering, Huazhong University of Science and Technology,Wuhan 430074, China

    Keywords:

    ABSTRACT Intelligent process planning(PP)is one of the most important components in an intelligent manufacturing system and acts as a bridge between product designing and practical manufacturing. PP is a nondeterministic polynomial-time(NP)-hard problem and,as existing mathematical models are not formulated in linear forms, they cannot be solved well to achieve exact solutions for PP problems. This paper proposes a novel mixed-integer linear programming(MILP)mathematical model by considering the network topology structure and the OR nodes that represent a type of OR logic inside the network. Precedence relationships between operations are discussed by raising three types of precedence relationship matrices. Furthermore, the proposed model can be programmed in commonly-used mathematical programming solvers, such as CPLEX, Gurobi, and so forth, to search for optimal solutions for most open problems. To verify the effectiveness and generality of the proposed model, five groups of numerical experiments are conducted on well-known benchmarks. The results show that the proposed model can solve PP problems effectively and can obtain better solutions than those obtained by the state-ofthe-art algorithms.

    1. Introduction

    Intelligent manufacturing involves intelligent manufacturing technology and intelligent manufacturing systems [1–3]. Intelligent process planning(PP)is one of the most important intelligent manufacturing technologies and plays a crucial role in intelligent manufacturing systems[4,5].PP can effectively shorten production cycle and improve product quality, and further, reduce the consumption for resources and energy[6].Hence,PP has gained a considerable amount of attention in industrial applications.Nevertheless, due to the extensive internal flexibility within PP,it is very difficult to solve for an optimal process plan in practical production scenarios [7].

    Solving a traditional PP problem usually involves three steps:process selection, resource allocation, and operation sequencing[5]. The first step is to fix the process selection, afterwards, the length of a process route can be determined because the number of operations varies from different process approaches. Next, the allocation of resources, including machines and tools, should be configured for all the operations. Sequencing the operations is the last and most critical step for obtaining a feasible process route that obeys the precedence constraints[8].For example,milling and grinding must be arranged before fine milling and fine grinding operations,and tapping for a hole thread must be carried out after the operation of drilling a hole [9].

    PP problems have been proved to be nondeterministic polynomial-time (NP)-hard [6,10] meaning that it is difficult to solve by only relying on the traditional gradient descent methods,graph theory methods, or simulation-based methods. Therefore,most researchers attempt to introduce meta-heuristics [11] to study PP problems.The main research approaches for PP problems include genetic algorithm (GA) [7,12], tabu search (TS) [13], particle swarm optimization (PSO) [8], ant colony optimization (ACO)[14], and honey-bees mating optimization (HBMO) [10], which aim to find high-quality solutions within less computational cost,and attach more importance to the efficiency, rather than the optimality.

    In this background, optimal solutions for many open PP problems[8,15] have not been found yet.One important reason is that recent studies have paid more attention to improving the performance of intelligent algorithms than to the modification of current mathematical models, especially mixed-integer linear programming (MILP) mathematical models [14]. An effective MILP model can be solved by a mathematical programming solver, such as CPLEX,Gurobi,and so forth,and the optimal solution of a PP problem may be stably obtained under certain conditions.However,the solving effect of an MILP model is highly related to the problem scale. Once the scale becomes larger, the solving effect of the model deteriorates rapidly, and the model may even fail to find a feasible solution within a long computation time [16]. Therefore,current research work for PP does not focus on MILP models. In fact, the research status of MILP models is in a state of ‘‘compromise” because almost all reported PP models are feature-based[8,14,17]. These models convert an original network graph into a tabular form to simplify process representations.This kind of conversion, to some extent, changes the original process information of the network.(Discussions on this situation are presented in Section 3.3.) In addition, although there are other modeling methods that can avoid the abovementioned situation,they require complicated preprocessing, such as the generation of combinations of all possible processing operations,in order to eliminate and substitute OR nodes that represent a type of OR logic inside the network[18].This preprocessing procedure is complicated, in particular, the presence of too many OR nodes or a complex topological structure will greatly increase the complexity and computational time of a PP problem.

    In order to fill in the gap of recently reported research work, a novel MILP model is proposed based on the PP network topological structure. The main contributions of this paper are as follows:

    (1) This paper proposes a new OR-node-based MILP model for PP problems with no need for any feature conversion or other preprocessing.

    (2)The precedence relationships of the operations are discussed in detail, and three types of precedence relationship matrices are presented to illustrate the precedence relationship constraints.

    (3) Coded in the general algebraic modeling system (GAMS)/CPLEX solver,this MILP model successfully finds new optimal solutions for open problems in the literature [8,15,16].

    The rest of this paper is organized as follows. Section 2 introduces the related work, while Section 3 proposes the model and discusses the related analysis mentioned above in detail.Section 4 presents several groups of comparative experiments to verify the advantage of the proposed model. Section 5 provides conclusions and outlines some future work.

    2. Related work

    The related work on PP can be divided into two categories:algorithms and mathematical models. Xu et al. [6] and Leo Kumar [4]have both provided good reviews of PP problems. Intelligent algorithms such as GA, simulated annealing (SA) algorithms, TS algorithms, and PSO algorithms have shown sufficient advantages and have been widely applied in PP problems[6].To solve PP problems with complex prismatic parts, Li et al. [19] proposed a good hybrid algorithm comprising a GA and a SA algorithm. The local search capability of the hybrid algorithm was enhanced by a strategy of searching and selecting solutions based on the Hamming distance between alternative routes. Hua et al. [20] proposed a synthesis algorithm based on a GA to search for the global or near-global optimal solution in PP problems.Li et al.[15]proposed an effective genetic programming (GP) algorithm, which performed genetic operations on OR-node branches in the network graph. Taking into account manufacturing resources such as tool selection and feed direction, Shin et al. [21] proposed a symbiotic evolutionary algorithm to optimize three objectives, including balancing the machine workload, minimizing part movements,and minimizing tool changes. Wang et al. [22] put forward a PSO combining two local search strategies to solve the PP problem.Subsequently, Li et al. [8] presented a modified PSO to solve PP problems considering the transmission time between machines.Liu et al. [14] combined ACO with the constraint matrix and the state matrix of the problem,and applied it to solve the PP problem of two prismatic parts.

    Although some achievements have been made in applying intelligent algorithms to solve PP problems,the solution quality can be further improved in most of the existing PP instances,since metaheuristic algorithms cannot guarantee the optimality of the solutions.Besides,as a method of describing problems,a mathematical model can help researchers to understand and comprehend problems more deeply and thoroughly [23]. Therefore, research on PP mathematical models is very meaningful.Floudas and Lin[24]analyzed several mixed-integer programming (MIP) models of PP problems on the methods of time representation, and then proposed several effective optimization approaches to improve the computational efficiency of the model.In view of the complementarity of PP and scheduling, Li et al. [25] established a mathematical model to integrate a PP problem and shop scheduling problem.Xia et al. [26] proposed a feature-based mathematical model for a reconfigurable PP problem. Similarly, based on features, Jin and Zhang [16] established MILP models for PP considering the transmission time between machines.

    To the best of our knowledge,mathematical models for PP problems are always feature-based [8,14,17]. Although this kind of modeling method can describe most kinds of jobs,it is still inevitable that some direct precedence constraints must be added,which do not exist in the original network [16]. Therefore, the network graph method is more capable of describing different manufacturing flexibilities than a feature-based method.This paper proposes a novel MILP model directly based on the topology of the network graph; it can describe all types of manufacturing flexibilities of PP without adding or omitting any constraints.By solving the proposed model, new optimal solutions of some famous benchmarks in previous publications are successfully obtained.

    3. The proposed MILP model for PP

    3.1. Problem description

    The types of flexibilities in PP include process flexibility,machine selection flexibility, and operation sequencing flexibility.There are several approaches to describe PP problems,such as Petri nets [27], feature tables [28], AND/OR graphs, and networks[29,30]. In Fig. 1, the manufacturing flexibilities are represented in the form of a network graph. This network graph is composed of five types of nodes: The starting node, which is virtual, represents the start of a part’s production; the ending node, which is also virtual, indicates the end of a part’s production; intermediate nodes represent operations; and the OR node, combined with the fifth type of node,the JOIN node,represents the process flexibilities[15]. An intermediate node contains three pieces of information:the operation number in the solid circle, the alternative machine number in { }, and the corresponding processing time in [ ]. For example, the intermediate node 6 indicates that operation 6 can be processed on any machine out of the three alternative machines 3, 7, and 13, and the required processing time is 44, 48, and 49,respectively.The time unit in the paper is omitted just like original data. Arrows connecting pairs of nodes in the network indicate precedence relationship constraints between operations [21]. For example, the arrow between operations 2 and 3 declares that operation 2 must be processed before operation 3. There are no fixed precedence constraints between operations not connected by an arrow. Only one link connected to the OR node will be selected. The operations contained in the link with other operations compose a feasible operation combination for the part [29].Take Fig.1 as an example:If operations 2 →3 are selected between OR node 1 and JOIN node 1,and if operation 7 is selected between OR node 2 and JOIN node 2,then one of the complete feasible process routes is 1 →2 →3 →5 →6 →7 →9 →10.

    Fig. 1. A flexible process plan network. OR1, OR2, JOIN1, and JOIN2 represent OR node 1, OR node 2, JOIN node 1, and JOIN node 2, respectively.

    3.2. Precedence relationship between operations

    According to the definitions of binary variables, there are three modeling methods for PP problems [31]:

    For the large amount of variables and constraints, the binary variable θjtbased on time periods is rarely mentioned in PP problem modeling.In the existing literature,the definition ρjtdescribes the operation sequence by the position of operation j [16,32,33],which is widely used in the current literature [24,34,35]. In this paper, the proposed MILP model for PP is established based on the third method, qjj?, for the first time.

    As shown in Fig. 2, a feasible operation sequence of this part is 1 →2 →3 →4 →5 →6 →7 →8 →9.Operation 1 is in front of all the other eight operations; thus, according to the definition, q1j?=1,where j?=2, ..., 9. Operation 2 is processed before all the other seven operations, so q2j?=1, where j?=3, ..., 9. The number of‘‘1”s in the matrix Q=[qjj?] can be obtained as (n–1)n/2, where n stands for the total number of operations,which is also the length of the operation sequence. Fig. 3 shows the precedence relationship transformation from a sequence to a Q matrix.

    For a sequence that has been ordered, every two operations have a sequential relationship. Therefore, the priority relation can be represented by an n×n matrix. The Q matrix contains all the precedence relationships of an operation sequence. The Q matrix can be regarded as a completely expressing matrix (CEM) for the precedence relationships of an operation sequence. Through the observation and analysis, the characteristic constraints of CEM Q can be concluded as follows:

    (1) The diagonal elements of CEM Q are equal to 0:

    (2) The sum of the two elements symmetrical about the diagonal is equal to 1:

    (3) The sum of the elements in any two different columns is not equal:

    Fig. 2. A process plan network.

    Fig. 3. The transformation of the precedence relationship.

    Eq. (1) indicates that precedence relationships only exist between different operations. In Eq. (2), qjj?=1 makes qj?j=0,whereas qjj?=0 makes qj?j=1, because there is only one precedence relationship between the two operations. Eq. (3) is established because the sum of the column elements corresponds to the position that is unique in the operation sequence. The Q matrix contains all the precedence relationships between operations.According to the corresponding Q matrix, it can be quickly and easily determined whether a sequence satisfies the precedence constraints in a network.

    The notation sjj?is defined to represent the precedence constraints in Fig. 2:

    The corresponding constraint matrix S=[sjj?] is shown in Fig. 4,where each‘‘1”in the S matrix corresponds to an arrow in the network, representing a precedence constraint. If a sequence satisfies all the precedence constraints,its CEM Q is supposed to contain all the precedence values shown in matrix S,which can be formulated as follows:

    Matrix S can be generated from the network graph, but the matrix Q is unknown because the operation sequence has not been determined yet. Therefore, Eq. (4) can be regarded as the constraint.

    Fig. 4. Precedence constraints in a network and the corresponding matrix S.

    The number of ‘‘1”s in CEM Q is (n–1)n/2. However, the least number of ‘‘1”s required to determine an operation sequence in a matrix is (n–1). For example, to determine the sequence 1 →2 →3 →4 →5 →6 →7 →8 →9, it only needs to set eight variables as‘‘1,”which are q12,q23,q34,q45,q56,q67,q78,and q89.From this point,it is helpful to define a notation vjj?whose corresponding matrix V=[vjj?]contains the least number of variables equal to 1.The matrix V can be regarded as an exactly expressing matrix (EEM) of the precedence relationships of the sequence,which contains the exact and least number of ‘‘1”s. The EEM V of the above operation sequence is shown in Fig. 5.

    The EEM matrix can also be directly called the precedence matrix, since it just contains the precedence relationship of the two directly adjacent operations. According to the direct precedence relationships, it is simple to obtain an operation sequence by sequentially identifying the elements of the EEM V. The EEM matrix has several characteristic constraints as follows:

    (1) The number of variables that equal to 1 in the EEM V is(n–1):

    (2) Each row or column of the EEM V has at most one element equal to 1:

    Fig. 5. The EEM V of the sequence.

    (3) The relationship between matrix Q and matrix V is expressed as follows:

    Matrix V is a simplified representation of matrix Q, and both of them can determine a unique operation sequence. However,matrix S cannot determine a unique operation sequence due to its incomplete representation of the precedence relationships of a determined sequence. Therefore, matrix S is named the partly expressing matrix (PEM) in this paper. More than one sequence can satisfy the precedence constraints expressed by an S matrix.CEM Q, EEM V, and PEM S are shown in Fig. 6.

    3.3. A discussion on feature-based and network-based process representations

    In the current literature, all the mathematical models for PP problems are feature-based. For example, an instance adopted in the literature [8,16] is shown in feature tabular form in Fig. 7(a).In fact, this instance is derived from the 18th example in Ref.[29], as shown in Fig. 7(b). Therefore, Figs. 7(a) and (b) illustrate the same instance expressed in two different representation forms.

    In the feature table[8,16],features F2,F5,and F9have alternative operations or operation sets, corresponding to the three OR nodes OR1, OR2, and OR3 in the network graph. However, in the tabular form,the operation sets under the same feature are constrained by direct precedence relationships that do not exist in the corresponding network graph. For example, if O4–O5is chosen for feature F2,then O5must be processed directly after O4. However, O5does not have to be processed immediately after O4according to the original network graph Fig. 7(b). As a result, the solution space might be changed,leading to the failure to obtain the optimal solution.Table 1 shows two optimal solutions respectively obtained by solving a feature-based model and a network-based model with the GAMS/CPLEX solver. The letter M with number subscript in the bracket means the allocated machine, and it is the same in the follow-up tables.

    Observed from Table 1,the main distinction between these two sequences is that the sequence obtained by the network-based method does not have the direct precedence constraint of O4–O5.In addition, the production time of 356 obtained by the networkbased method is superior to the value of 357 obtained by the feature-based method. Therefore, the method of building a model directly on the basis of the network is superior to the featurebased method.

    Fig. 6. Three types of precedence relationship matrices: (a) CEM Q, (b) EEM V, and (c) PEM S.

    Fig. 7. Two representation forms of the same instance: (a) feature tabular form and (b) network graph.

    Table 1 Two optimal solutions obtained by using the feature-based model and the network-based model.

    The process flexibility of the feature-based representation is implemented through alternative operations or operation sets for features. For the network-based representation, the process flexibility is expressed by selecting the links of OR nodes.The links refer to the arrow connected to the OR nodes.Each link of the OR nodes corresponds to a choice for the process flexibility.In Fig.8,according to the order from the top to bottom and the left to right,the OR nodes and their links are numbered as shown.If link 1 of OR node 1 is selected, then operations 2, 3, and 4 will be selected. Additionally, whether link 1 or 2 of OR node 2 is selected, operations 6 and 7 will not be selected. The reason is that, in addition to OR node 2,operations 5,6,7,and 8 are controlled by link 2 of OR node 1. The selection performed by the OR node is valid only if the link at which this OR node lies is selected.

    A binary parameter wjrlis introduced to describe the control function of OR nodes on the operations. The definition of the parameter wjrlis stated as follows:

    For the example in Fig. 8, the corresponding values of wjrlare shown in Table 2.

    Hence,the controlling function of the OR node can be concluded as:Operation j will be selected only under the condition that all the controlling links of operation j are selected.On the contrary,operation j will not be selected as long as one of its controlling links is not selected. A binary variable urlis introduced to describe the choice of the links, and another binary variable xjis used to describe the operation choosing state. The definitions of urland xjare given as follows:

    The model established in Section 3.4 is based on these two variables, urland xj, and on a parameter, wjrl.

    3.4. Mathematical model for PP

    The proposed MILP model is precedence-based and OR-nodebased. Most of the process optimization objective functions are time related [8] or cost related [14,18]. In this paper, with the objective of minimizing the production time,the transmission time between machines is taken into account in the model. The sets,subscripts, parameters, and variables of the model are introduced below (Table 3).

    The total production time as the objective can be formulated as follows:

    On the right side,the first part of Eq.(9)refers to the total transmission time,and the second is the total processing time.The constraints of the model are displayed as follows:

    (1) OR-node controlling constraints:

    Fig. 8. An example of a controlling discussion.

    The constraint in Eq. (10) indicates the ‘‘unselected” condition:Operation j will not be selected as long as one of all operation j’s controlling links is not selected. The constraint in Eq. (11) is the‘‘selected” condition. The constraint in Eq. (12) means that only one link of an OR node can be chosen.

    (2) Precedence constraints:

    Eqs.(13)–(18)refer to the constraints in the precedence relationships.Unlike Eqs.(1)–(4),the operation selecting condition is added to this group of constraints.Eq.(13)corresponds to Eq.(1).Eqs.(14)and(15)correspond to Eq.(2),on the condition that operation j and j? are selected. Under the same condition, the constraint in Eq. (16)corresponds to Eq.(3).As for Eq.(17),the meaning is that the precedence relationships qjj?and qj?jshould be set as 0 if operation j is unselected. The constraint in Eq. (18) guarantees that the selected operation sequence obeys the precedence constraints.

    (3) EEM V and CEM Q constraints:

    Since a matrix V contains the precedence relationships between the two adjacent operations, the transmission time can easily be calculated. The constraints in Eqs. (19)–(21) describe the property of matrix V. Because matrix V is derived from matrix Q, Eq. (22) is presented.

    (4) Machine selection constraint:

    Eq. (23) means that there is only one machine that can be assigned for the selected operation, and there is no need to assign any machine for an unselected operation.

    Eqs.(24)and(25)formulate the transmission time of operation j from the current processing machine to the next machine.

    4. Experiments and discussions

    To verify the proposed model, five groups of comparative experiments are carried out based on famous benchmarks. All the experiments are directly compared with the results of other reported methods. On a personal computer (PC) with 3.7 GHz and 16 GB random-access memory(RAM),the proposed model is coded in the GAMS, and the solver CPLEX is used to solve the PP problems. In this paper, the parameter Gap (%) is also introduced to evaluate the proposed model and the computation results. The Gap value represents the relative tolerance of the obtained solution;its definition is (BF–BP)/BP,where BF is the current bestsolution of the objective function, and BP is the lower bound. The smaller the Gap value is, the closer the current solution is to the optimal solution. The computation time of GAMS/CPLEX is set as 3600 s. If the optimal solution is not found within the time limit,the computation will be terminated and the best known solution will be output. The transmission time between machines adopted by the cases in experiments 1,2,4,and 5 is shown in Table 4[8,18].

    Table 2 The values of parameter wjrl.

    Table 3 Definitions of the sets, subscripts, parameters, and variables of the mathematical model for PP.

    4.1. Experiment 1

    The three cases in experiment 1 are adopted from Jin and Zhang[16], where a dynamic programming (DP)-like heuristic algorithm is applied to solve the PP problem. The results obtained by the proposed MILP model and the DP-like heuristic are presented in Table 5. The production time of case 1 obtained by the MILP method is 357, which is better than the 360 provided by the DP-like heuristic. Furthermore, all three optimal solutions to the cases are found by the MILP model.

    4.2. Experiment 2

    The four cases in experiment 2 are from different publications:Case 1 comes from Zhang and Nee[36],and cases 2–4 come from Li and McMahon[37].The detailed information of these cases can be found in the corresponding papers. Computational results from a modified PSO algorithm are given in the work of Li et al. [8]. The modified PSO algorithm is one of the state-of-the-art algorithms that are used to solve combinatorial optimization problems. The comparison between PSO and MILP is given in Table 6. It can be observed that the MILP model obtains the better solution in case 1. Furthermore, the optimal solutions for cases 2–4 are found by the MILP model method within short computational time (less than one second).

    4.3. Experiment 3

    The two cases in experiment 3 are adopted from Li et al. [15],and the machine transmission time matrix is shown in Table 7.These two cases employed the same part from Li et al. [15]. The only distinction between the two cases is that machine 2 is assumed to be broken down in case 2. The comparative results are listed in Table 8. Both the GP algorithm and the MILP model are able to find the optimal solutions of the two instances.

    4.4. Experiment 4

    The 17 cases in experiment 4 are adopted from the well-known Kim dataset [29], which consists of 18 parts, and the comparative calculation results are from Ref. [8]. Because there are some problems regarding the data of part 4 from Ref.[8],it is not selected here.The results obtained by the modified PSO algorithm,the simple GA,and the simple SA are presented in Table 9. Within a reasonable computational time,the proposed MILP model can find 13 optimal solutions out of 17 cases. For the cases that the optimal solutions are not found, the MILP model still obtains better solutions compared to the other algorithms,such as cases 3,6,12,and 15.

    4.5. Experiment 5

    The 11 cases in experiment 5 are adopted from another famous Shin benchmark [21], and the comparative calculation results are from Li et al. [8]. Because there are some problems regarding the data of some parts in Ref. [8], 11 parts (omitting parts 9, 10, 12,13,15,17,and 18)are selected in this experiment group.The solutions obtained by the modified PSO algorithm, the simple GA, and the simple SA are presented in Table 10.Within a reasonable computational time, the proposed MILP model can find nine optimal solutions out of 11 instances. For the cases that the optimal solutions are not found, the MILP model still obtains better solutions,such as case 3.

    Table 4 The transmission time matrix [8,18].

    Table 5 Comparative results of experiment 1.

    Table 6 Comparative results of experiment 2.

    Table 7 Transmission time between the machines.

    4.6. Discussion

    The proposed MILP model obtained 28 optimal solutions out of 37 instances within acceptable calculation time. The solutions found by the MILP model are better than those obtained by the high-performance heuristic [16] and meta-heuristic algorithms [8,15]. Experiments 4 and 5 were carried out on two widely-used benchmarks [21,29], and the better results suggest the superiority of the proposed model.

    As shown in Table 11, the proposed model contains four types of subscripts, that is, operation, machine, OR node, and links, while the model reported in Ref. [16] contains six types of subscripts, that is, feature, operation set, operation, machine,position, and place. Fewer subscripts in the proposed model make the computation more effective than that of the model developed by Ref. [16]. Furthermore, the OR-node-based modeling method makes the proposed model more universal for solving different types of PP problems. This is why most optimalsolutions can be obtained for both of the Kim [29] and Shin[21] benchmarks.

    Table 8 Comparative results of experiment 3.

    5. Conclusions and future work

    Considering the topology of network graph,this paper proposed a new MILP mathematical model based on OR nodes. Firstly, for precedence relationships between operations, three precedence matrices were introduced.Secondly,for better generality,the notations wjrl, url, and xjwere introduced to describe the controlling function of the OR nodes. Finally, the proposed MILP model were coded in the mathematical programming solver CPLEX and tested on public benchmarks. The extensive comparative results verified the correctness and superiority of the proposed model.

    In this work,an OR-node-based modeling method was proposed for the first time,demonstrating a new perspective for PP problems and their extension research.The analyses of the three precedence matrices in the paper also revealed the essence of the operation sequencing sub-problem,which is beneficial for further comprehension of the PP problem.However,there are still some limitations in this PP model research. Optimal solutions cannot be found for the minorityof instances,and the computationalefficiency is not always satisfactory,which implies that the proposed approaches can be further improved. Some simplification and speed-up strategies are urgently required for the further research work.

    Table 9 Comparative results of experiment 4.

    Table 10 Comparative results of experiment 5.

    Table 11 The subscripts of the models.

    Acknowledgements

    This work is supported in part by the National Natural Science Foundation of China (51825502 and 51775216), and in part by the Program for Huazhong University of Science and Technology(HUST) Academic Frontier Youth Team (2017QYTD04).

    Compliance with ethics guidelines

    Qihao Liu, Xinyu Li, and Liang Gao declare that they have no conflict of interest or financial conflicts to disclose.

    欧美亚洲 丝袜 人妻 在线| 一区二区av电影网| 一级片免费观看大全| 在线亚洲精品国产二区图片欧美| 欧美精品av麻豆av| 亚洲国产精品一区二区三区在线| 国产高清三级在线| 国内精品宾馆在线| 久久ye,这里只有精品| 99香蕉大伊视频| 国产不卡av网站在线观看| 99久久人妻综合| 亚洲国产av影院在线观看| videosex国产| 99热这里只有是精品在线观看| av一本久久久久| 亚洲av中文av极速乱| 久久久久久久亚洲中文字幕| 免费大片18禁| 国产 一区精品| 精品人妻在线不人妻| 国语对白做爰xxxⅹ性视频网站| 少妇的丰满在线观看| 只有这里有精品99| 免费女性裸体啪啪无遮挡网站| 麻豆乱淫一区二区| 精品久久久精品久久久| 亚洲欧美日韩卡通动漫| 国产精品人妻久久久影院| 91aial.com中文字幕在线观看| 最近中文字幕2019免费版| www.av在线官网国产| 在线观看免费视频网站a站| 新久久久久国产一级毛片| 久久人人97超碰香蕉20202| 少妇人妻精品综合一区二区| 精品少妇久久久久久888优播| 菩萨蛮人人尽说江南好唐韦庄| 亚洲精品aⅴ在线观看| 五月开心婷婷网| 亚洲国产看品久久| 飞空精品影院首页| 亚洲综合精品二区| 各种免费的搞黄视频| 欧美精品一区二区大全| 国产免费现黄频在线看| 国产一区二区三区综合在线观看 | 97超碰精品成人国产| 亚洲欧美清纯卡通| 日日撸夜夜添| 国产精品国产三级专区第一集| 久久精品国产亚洲av涩爱| 新久久久久国产一级毛片| 亚洲欧美日韩另类电影网站| 国产高清国产精品国产三级| 日韩精品有码人妻一区| 国产免费一级a男人的天堂| 内地一区二区视频在线| 韩国av在线不卡| av不卡在线播放| 国产亚洲欧美精品永久| 久久人人爽人人爽人人片va| 久久人妻熟女aⅴ| 精品亚洲成国产av| 欧美国产精品一级二级三级| 国产永久视频网站| 黄色一级大片看看| 久久av网站| 亚洲精品一区蜜桃| 中文字幕av电影在线播放| 五月玫瑰六月丁香| 国产熟女午夜一区二区三区| 中文字幕另类日韩欧美亚洲嫩草| 18+在线观看网站| 中文字幕亚洲精品专区| 18禁在线无遮挡免费观看视频| 国产精品免费大片| 91国产中文字幕| 国产精品 国内视频| 欧美激情 高清一区二区三区| av不卡在线播放| 啦啦啦中文免费视频观看日本| 搡女人真爽免费视频火全软件| 欧美亚洲 丝袜 人妻 在线| 精品福利永久在线观看| 精品国产一区二区三区久久久樱花| 日韩欧美一区视频在线观看| 两个人免费观看高清视频| 国产一区有黄有色的免费视频| 美女中出高潮动态图| 中文字幕亚洲精品专区| 久久久久久人人人人人| 少妇 在线观看| 久久精品久久精品一区二区三区| 少妇人妻 视频| 九色成人免费人妻av| 亚洲天堂av无毛| 在线看a的网站| 美女中出高潮动态图| 老熟女久久久| 一本大道久久a久久精品| 中国国产av一级| 亚洲av国产av综合av卡| 成人亚洲精品一区在线观看| 国产色爽女视频免费观看| 国产无遮挡羞羞视频在线观看| www日本在线高清视频| 成年人午夜在线观看视频| videossex国产| 男男h啪啪无遮挡| 日日爽夜夜爽网站| 国产熟女欧美一区二区| 亚洲国产精品专区欧美| 99香蕉大伊视频| www.色视频.com| 午夜福利在线观看免费完整高清在| 午夜福利,免费看| 亚洲国产精品国产精品| 狂野欧美激情性bbbbbb| 国产1区2区3区精品| 国产麻豆69| 国产精品偷伦视频观看了| 亚洲,欧美,日韩| 秋霞伦理黄片| 国产精品国产av在线观看| 国内精品宾馆在线| 欧美 亚洲 国产 日韩一| 亚洲欧美清纯卡通| 丰满少妇做爰视频| 免费观看性生交大片5| 免费不卡的大黄色大毛片视频在线观看| 亚洲熟女精品中文字幕| 黄片无遮挡物在线观看| 狠狠婷婷综合久久久久久88av| 亚洲经典国产精华液单| a级片在线免费高清观看视频| 日日啪夜夜爽| 国产深夜福利视频在线观看| 韩国精品一区二区三区 | 国产69精品久久久久777片| 国产亚洲一区二区精品| 国产精品嫩草影院av在线观看| 欧美日韩视频高清一区二区三区二| av一本久久久久| 视频区图区小说| 亚洲欧美成人综合另类久久久| 少妇人妻 视频| 一本—道久久a久久精品蜜桃钙片| 亚洲av男天堂| 国产亚洲午夜精品一区二区久久| 97在线视频观看| 午夜激情久久久久久久| 大片电影免费在线观看免费| 久久久久视频综合| 日本vs欧美在线观看视频| 中文精品一卡2卡3卡4更新| 五月伊人婷婷丁香| 久久av网站| 在线观看一区二区三区激情| 亚洲三级黄色毛片| 欧美激情极品国产一区二区三区 | 色网站视频免费| 免费女性裸体啪啪无遮挡网站| 熟女电影av网| 日韩精品免费视频一区二区三区 | videos熟女内射| 在线观看人妻少妇| 99久久人妻综合| 精品视频人人做人人爽| 男人添女人高潮全过程视频| 午夜视频国产福利| 一本大道久久a久久精品| 亚洲成人手机| 夜夜骑夜夜射夜夜干| 五月天丁香电影| 我要看黄色一级片免费的| 色视频在线一区二区三区| 国产日韩一区二区三区精品不卡| 2018国产大陆天天弄谢| 欧美bdsm另类| 久久久久久久久久人人人人人人| 国产在线视频一区二区| 国产免费一级a男人的天堂| 国产淫语在线视频| 人妻一区二区av| 成年人免费黄色播放视频| 精品酒店卫生间| 免费在线观看完整版高清| 国产一区二区三区综合在线观看 | 精品一区二区免费观看| 日本wwww免费看| 日韩三级伦理在线观看| 一本色道久久久久久精品综合| xxx大片免费视频| 2018国产大陆天天弄谢| 大片电影免费在线观看免费| 我的女老师完整版在线观看| 精品国产一区二区三区久久久樱花| 免费大片黄手机在线观看| 亚洲中文av在线| 肉色欧美久久久久久久蜜桃| 99香蕉大伊视频| 国产亚洲欧美精品永久| 日韩成人av中文字幕在线观看| 久久精品国产综合久久久 | 午夜福利视频在线观看免费| 欧美日韩亚洲高清精品| 天天躁夜夜躁狠狠躁躁| 亚洲国产看品久久| 国产精品一区二区在线观看99| 人体艺术视频欧美日本| 国产成人精品久久久久久| 男女啪啪激烈高潮av片| 两性夫妻黄色片 | 欧美少妇被猛烈插入视频| 亚洲精品国产色婷婷电影| 久久韩国三级中文字幕| 亚洲欧美中文字幕日韩二区| 日韩 亚洲 欧美在线| 免费黄色在线免费观看| 亚洲国产成人一精品久久久| 极品少妇高潮喷水抽搐| 久久毛片免费看一区二区三区| 国产在线免费精品| 久久精品人人爽人人爽视色| 国产女主播在线喷水免费视频网站| 成人国产麻豆网| 中文精品一卡2卡3卡4更新| 男女国产视频网站| 午夜91福利影院| 免费看av在线观看网站| 亚洲第一av免费看| videosex国产| 视频在线观看一区二区三区| 亚洲精品日韩在线中文字幕| 日本与韩国留学比较| 一本色道久久久久久精品综合| 日韩成人av中文字幕在线观看| 精品少妇内射三级| 春色校园在线视频观看| 亚洲欧美中文字幕日韩二区| 天堂俺去俺来也www色官网| 18禁观看日本| 成年女人在线观看亚洲视频| 在线精品无人区一区二区三| 亚洲久久久国产精品| 人人妻人人澡人人爽人人夜夜| 成人亚洲精品一区在线观看| 久久久久久久久久成人| 伊人亚洲综合成人网| 中文字幕人妻丝袜制服| 亚洲激情五月婷婷啪啪| 亚洲av.av天堂| 国产男女内射视频| 又粗又硬又长又爽又黄的视频| 国产成人免费无遮挡视频| 亚洲欧美一区二区三区国产| 最近最新中文字幕免费大全7| 精品国产一区二区久久| 亚洲国产欧美在线一区| 99久久精品国产国产毛片| 亚洲高清免费不卡视频| av不卡在线播放| 51国产日韩欧美| 女人被躁到高潮嗷嗷叫费观| 老司机亚洲免费影院| 国产精品嫩草影院av在线观看| 2021少妇久久久久久久久久久| 女性被躁到高潮视频| 女的被弄到高潮叫床怎么办| 亚洲人成网站在线观看播放| 久久国产精品大桥未久av| 哪个播放器可以免费观看大片| 久久影院123| 国产成人aa在线观看| 欧美日韩亚洲高清精品| 熟女av电影| 午夜福利在线观看免费完整高清在| 欧美xxⅹ黑人| 日本av免费视频播放| www.熟女人妻精品国产 | av电影中文网址| 最近手机中文字幕大全| 日韩 亚洲 欧美在线| 蜜桃国产av成人99| 伊人久久国产一区二区| 一本一本久久a久久精品综合妖精 国产伦在线观看视频一区 | 国产成人av激情在线播放| 天美传媒精品一区二区| 草草在线视频免费看| 亚洲欧洲精品一区二区精品久久久 | a级片在线免费高清观看视频| 夫妻性生交免费视频一级片| 成人毛片a级毛片在线播放| 欧美日韩精品成人综合77777| 美女国产视频在线观看| 狂野欧美激情性xxxx在线观看| 午夜免费鲁丝| 国产成人精品无人区| 亚洲经典国产精华液单| 熟女电影av网| 日本av免费视频播放| 少妇的逼好多水| 精品卡一卡二卡四卡免费| 欧美日韩亚洲高清精品| 国产一区二区三区综合在线观看 | 久久精品国产综合久久久 | 汤姆久久久久久久影院中文字幕| 多毛熟女@视频| 免费日韩欧美在线观看| 自线自在国产av| 成人免费观看视频高清| 中文字幕人妻熟女乱码| 久久99热这里只频精品6学生| 妹子高潮喷水视频| 精品人妻在线不人妻| 男的添女的下面高潮视频| 日韩av免费高清视频| 国产片特级美女逼逼视频| 亚洲第一av免费看| 精品国产一区二区三区久久久樱花| 午夜福利在线观看免费完整高清在| 日本午夜av视频| 亚洲精品久久午夜乱码| 国产无遮挡羞羞视频在线观看| 久久久久久久久久成人| 香蕉国产在线看| 精品卡一卡二卡四卡免费| 精品亚洲成a人片在线观看| 国产伦理片在线播放av一区| 肉色欧美久久久久久久蜜桃| 免费播放大片免费观看视频在线观看| 在线观看国产h片| 黄片播放在线免费| 亚洲精品成人av观看孕妇| 美女中出高潮动态图| 久久国产精品大桥未久av| 精品国产乱码久久久久久小说| 亚洲,一卡二卡三卡| 久久精品久久久久久久性| kizo精华| 蜜臀久久99精品久久宅男| 色哟哟·www| 97人妻天天添夜夜摸| 国产淫语在线视频| 男女免费视频国产| 亚洲国产av影院在线观看| 啦啦啦视频在线资源免费观看| 热re99久久精品国产66热6| 亚洲丝袜综合中文字幕| 高清黄色对白视频在线免费看| 日韩大片免费观看网站| 国产免费一区二区三区四区乱码| 亚洲国产精品成人久久小说| 国产爽快片一区二区三区| 伦理电影大哥的女人| 最黄视频免费看| av卡一久久| 伊人久久国产一区二区| 亚洲经典国产精华液单| 欧美人与性动交α欧美精品济南到 | 国产成人a∨麻豆精品| 老熟女久久久| videosex国产| 人人妻人人澡人人看| 9191精品国产免费久久| 内地一区二区视频在线| 久久精品国产亚洲av涩爱| 亚洲美女黄色视频免费看| 亚洲国产精品一区三区| 青春草国产在线视频| 日韩在线高清观看一区二区三区| 国产永久视频网站| 男女边吃奶边做爰视频| 99热6这里只有精品| 久久久久久久国产电影| 日本免费在线观看一区| 亚洲国产欧美在线一区| av不卡在线播放| kizo精华| 欧美日韩成人在线一区二区| 久久久精品94久久精品| 精品久久久精品久久久| 午夜福利视频在线观看免费| 黄色配什么色好看| 久久99精品国语久久久| 精品第一国产精品| 国产精品蜜桃在线观看| 国产白丝娇喘喷水9色精品| 国产成人91sexporn| 2021少妇久久久久久久久久久| 欧美97在线视频| 高清黄色对白视频在线免费看| 国产国拍精品亚洲av在线观看| 一级毛片我不卡| 亚洲国产精品国产精品| 国产福利在线免费观看视频| 色哟哟·www| 一边摸一边做爽爽视频免费| 97超碰精品成人国产| 欧美日韩视频精品一区| 亚洲色图综合在线观看| 久久久久久久国产电影| 色94色欧美一区二区| 亚洲av.av天堂| 欧美人与性动交α欧美软件 | 18在线观看网站| 有码 亚洲区| 国产av国产精品国产| 99热这里只有是精品在线观看| 99re6热这里在线精品视频| 18禁裸乳无遮挡动漫免费视频| 日韩一区二区三区影片| 国产不卡av网站在线观看| www.色视频.com| 三级国产精品片| 精品熟女少妇av免费看| 亚洲情色 制服丝袜| 亚洲av在线观看美女高潮| 亚洲成人av在线免费| 伦理电影免费视频| 中文字幕亚洲精品专区| 国产成人精品无人区| 日本av手机在线免费观看| 国产亚洲精品第一综合不卡 | 久久国产精品男人的天堂亚洲 | 免费观看无遮挡的男女| 成年av动漫网址| 精品国产露脸久久av麻豆| 成人漫画全彩无遮挡| 伊人久久国产一区二区| 天天躁夜夜躁狠狠久久av| 黄色怎么调成土黄色| 一个人免费看片子| 在线观看免费日韩欧美大片| 免费观看无遮挡的男女| 午夜福利乱码中文字幕| 波多野结衣一区麻豆| 纵有疾风起免费观看全集完整版| 美女脱内裤让男人舔精品视频| 男女国产视频网站| 十八禁高潮呻吟视频| 亚洲精品自拍成人| 亚洲高清免费不卡视频| 不卡视频在线观看欧美| 七月丁香在线播放| 九色亚洲精品在线播放| 夫妻性生交免费视频一级片| 男女边吃奶边做爰视频| 久久久久久人妻| 精品福利永久在线观看| 人人澡人人妻人| 新久久久久国产一级毛片| 蜜臀久久99精品久久宅男| 欧美日韩国产mv在线观看视频| 国产又色又爽无遮挡免| 少妇人妻 视频| 亚洲五月色婷婷综合| 老司机影院毛片| 精品一区在线观看国产| 亚洲国产精品国产精品| 1024视频免费在线观看| 一本久久精品| 久久久国产精品麻豆| 搡老乐熟女国产| av线在线观看网站| 日产精品乱码卡一卡2卡三| 春色校园在线视频观看| 亚洲,欧美精品.| 亚洲精品乱久久久久久| 国产亚洲一区二区精品| 久久久久久久久久久免费av| 午夜久久久在线观看| 国产又爽黄色视频| 2022亚洲国产成人精品| 下体分泌物呈黄色| 久久女婷五月综合色啪小说| 久久久精品94久久精品| 亚洲图色成人| av播播在线观看一区| 国产在视频线精品| 97超碰精品成人国产| 国产欧美另类精品又又久久亚洲欧美| 欧美3d第一页| 国产福利在线免费观看视频| 一本大道久久a久久精品| 女性生殖器流出的白浆| 一级毛片电影观看| 男人舔女人的私密视频| 在线看a的网站| 在现免费观看毛片| 欧美激情 高清一区二区三区| 一级毛片电影观看| 久久毛片免费看一区二区三区| 亚洲欧洲精品一区二区精品久久久 | 亚洲美女搞黄在线观看| 精品福利永久在线观看| 午夜福利影视在线免费观看| 最近中文字幕2019免费版| 成人无遮挡网站| 亚洲av电影在线进入| 啦啦啦中文免费视频观看日本| 80岁老熟妇乱子伦牲交| 中国三级夫妇交换| 亚洲国产精品国产精品| 午夜av观看不卡| 水蜜桃什么品种好| 99精国产麻豆久久婷婷| 日韩成人av中文字幕在线观看| 欧美97在线视频| 久久久久精品久久久久真实原创| 欧美xxxx性猛交bbbb| 99精国产麻豆久久婷婷| 欧美日韩视频高清一区二区三区二| 亚洲第一av免费看| 国产极品粉嫩免费观看在线| 亚洲欧美日韩另类电影网站| 一级毛片黄色毛片免费观看视频| 国产视频首页在线观看| 少妇精品久久久久久久| 又大又黄又爽视频免费| 欧美日韩av久久| 波野结衣二区三区在线| 久久综合国产亚洲精品| 成年女人在线观看亚洲视频| 精品久久久久久电影网| 人妻少妇偷人精品九色| 插逼视频在线观看| 免费大片18禁| 亚洲国产看品久久| 国产激情久久老熟女| 亚洲国产看品久久| 久久人人爽人人爽人人片va| 亚洲国产精品国产精品| 久久久久久伊人网av| 狠狠精品人妻久久久久久综合| 亚洲美女黄色视频免费看| 性色av一级| 制服诱惑二区| 欧美丝袜亚洲另类| av播播在线观看一区| 99热这里只有是精品在线观看| 精品一区二区三卡| 亚洲激情五月婷婷啪啪| 国产黄色视频一区二区在线观看| 日本-黄色视频高清免费观看| 欧美人与性动交α欧美软件 | 最新中文字幕久久久久| 亚洲国产欧美日韩在线播放| 人成视频在线观看免费观看| 久久国内精品自在自线图片| 久久精品国产亚洲av涩爱| 成人漫画全彩无遮挡| 免费看光身美女| 男女高潮啪啪啪动态图| 另类亚洲欧美激情| 综合色丁香网| 精品一区二区免费观看| 国产欧美日韩一区二区三区在线| 久久这里只有精品19| 国产深夜福利视频在线观看| 精品国产一区二区久久| 三级国产精品片| 18在线观看网站| 99热6这里只有精品| 久久免费观看电影| 午夜激情av网站| 汤姆久久久久久久影院中文字幕| 欧美丝袜亚洲另类| 亚洲av日韩在线播放| 亚洲婷婷狠狠爱综合网| 免费大片黄手机在线观看| 人人妻人人添人人爽欧美一区卜| 少妇精品久久久久久久| 亚洲av男天堂| 精品亚洲成国产av| 成人国语在线视频| 少妇精品久久久久久久| 精品久久蜜臀av无| 日韩精品免费视频一区二区三区 | 欧美精品av麻豆av| 伦精品一区二区三区| 人人妻人人添人人爽欧美一区卜| 一本一本久久a久久精品综合妖精 国产伦在线观看视频一区 | 波多野结衣一区麻豆| 精品久久久精品久久久| 人体艺术视频欧美日本| 最后的刺客免费高清国语| 精品熟女少妇av免费看| 国产精品嫩草影院av在线观看| 纵有疾风起免费观看全集完整版| 国内精品宾馆在线| 亚洲一码二码三码区别大吗| 下体分泌物呈黄色| 国产免费一级a男人的天堂| 亚洲欧美中文字幕日韩二区| 亚洲av国产av综合av卡| 亚洲精品中文字幕在线视频| 亚洲熟女精品中文字幕| 久久久久久久国产电影| 菩萨蛮人人尽说江南好唐韦庄| 久久精品国产鲁丝片午夜精品| 日韩不卡一区二区三区视频在线| 新久久久久国产一级毛片| 黑人高潮一二区| 精品视频人人做人人爽| √禁漫天堂资源中文www| 巨乳人妻的诱惑在线观看| 九色成人免费人妻av| 国产精品不卡视频一区二区| 免费观看性生交大片5| 国产欧美亚洲国产| 国产成人免费无遮挡视频| 精品少妇黑人巨大在线播放| 亚洲欧美日韩卡通动漫|