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

    Zoning Search With Adaptive Resource Allocating Method for Balanced and Imbalanced Multimodal Multi-Objective Optimization

    2021-06-18 03:36:28QinqinFanandOkanErsoy
    IEEE/CAA Journal of Automatica Sinica 2021年6期

    Qinqin Fan and Okan K. Ersoy,

    Abstract—Maintaining population diversity is an important task in the multimodal multi-objective optimization. Although the zoning search (ZS) can improve the diversity in the decision space, assigning the same computational costs to each search subspace may be wasteful when computational resources are limited, especially on imbalanced problems. To alleviate the above-mentioned issue, a zoning search with adaptive resource allocating (ZS-ARA) method is proposed in the current study. In the proposed ZS-ARA, the entire search space is divided into many subspaces to preserve the diversity in the decision space and to reduce the problem complexity. Moreover, the computational resources can be automatically allocated among all the subspaces. The ZS-ARA is compared with seven algorithms on two different types of multimodal multi-objective problems(MMOPs), namely, balanced and imbalanced MMOPs. The results indicate that, similarly to the ZS, the ZS-ARA achieves high performance with the balanced MMOPs. Also, it can greatly assist a “regular” algorithm in improving its performance on the imbalanced MMOPs, and is capable of allocating the limited computational resources dynamically.

    I. INTRODUCTION

    MULTIMODAL multi-objective optimization problems(MMOPs) are commonly observed in the multiobjective optimization (MO) [1], [2]. Unlike general multiobjective optimization and multimodal optimization [3]-[9],the objectives of the multimodal multi-objective optimization(MMO) must not only achieve a good approximation in the objective space, but also locate enough equivalent Pareto optimal solutions in the decision space [10]. Therefore, maintaining the diversity in these two spaces is vital in the MMO [11],[12]. Until now, various multimodal multi-objective evolutionary algorithms (MMOEAs), which are called“regular” algorithms in this study, have been proposed and performed well on benchmark test suites. However, Liuet al.[13] have stated that existing “regular” MMOEAs may perform poor with the imbalanced MMOPs in which search complexities of Pareto optimal sets (PSs) are not the same in different regions. In other words, most proposed MMOEAs belong to convergence-first search methods, thus they may trap into easy regions and cannot find enough equivalent Pareto optimal solutions when these MMOPs are imbalanced.To alleviate the above-mentioned problem, Liuet al. [13]used a convergence-penalized density method to maintain the diversity in the decision space. Moreover, both exploitation and exploration strategies are used to improve the search efficiency. The results show that their proposed algorithm,called the “special” algorithm, performs better on these imbalanced MMOPs when compared with other “regular”algorithms.

    Recently, Fan and Yan [11] proposed a zoning search (ZS)method considered as a decision space decomposition strategy to solve the balanced MMOPs. Intuitively, such a search strategy may also be employed to solve the imbalanced MMOPs since the ZS can reduce the search difficulty of problems in each subspace, i.e., the degree of imbalance in each subspace can be reduced, and help MMOEAs improve the diversity in the decision space. However, the same amount of computational resource is allocated in each search subregion in [11], which may reduce the search efficiency and waste computational resources, especially when the distribution ofPSs is unsymmetrical in the decision space.

    To maintain the diversity in the decision space and take full use of limited computational resources, a zoning search with the adaptive resource allocating method (ZS-ARA) is proposed to solve the imbalanced and balanced MMOPs in the current study. In the ZS-ARA, the decision search space is divided into many subspaces for reducing the complexity ofPSs in each decision subspace, and computational resources can be automatically assigned among all the subspaces to improve their use efficiency. Results indicate that the ZSARA can perform well on both the balanced MMOPs and the imbalanced MMOPs. More importantly, the proposed algorithm can help a “regular” MMOEA (i.e., MO_Ring_PSO_SCD proposed by Yueet al. [14]) enhance its performance in solving the imbalanced MMOPs. Therefore, it can greatly reduce difficulties in the algorithm design.

    Main contributions of the current work are described as follows:

    1) Similarly to the ZS, the proposed ZS-ARA not only reduces search complexities of MMOPs in each subspace, but also reduces difficulties in designing improved algorithms,especially when MMOPs are imbalanced.

    2) Unlike the ZS, the ZS-ARA is capable of assigning computational resources among all the subspaces. It is important for the balanced and imbalanced MMOPs to improve the use efficiency of computational resources.Namely, the proposed algorithm is able to automatically allocate more computational resources to promising regions.

    The remaining sections of this paper are organized as follows: the MMO is introduced in Section II. Section III reviews the related works on MMO. Section IV presents the proposed algorithm. Experimental comparisons and analyses are reported in Section V. Section VI gives the conclusions and describes future works.

    II. IMBALANCED MULTIMODAL MULTI-OBJECTIVE OPTIMIZATION

    Compared with the imbalanced MMO, the balanced MMO has attracted more attention [13]. The former is introduced below.

    Similarly to multi-objective optimization problems (MOPs),the imbalanced MMOPs can be formulated as follows:

    A. Concepts of Multi-Objective Optimization

    In this subsection, some terminologies and concepts of the MO are described as follows [15]-[17]:

    B. Concepts of Imbalanced Multimodal Multi-Objective Optimization

    For an MMOP, there are two main features [11]: i) like an MOP, more than one objective is conflicting; ii) at least one point in thePFhas different equivalent Pareto optimal solutions. Besides the above features, an imbalanced MMOP has additional one or two of the following features:

    1) Search Stage:For a point in thePF, search complexities of at least two equivalent Pareto optimal solutions are different.

    2) Selection Stage:For a point in thePF, selection pressures of at least two equivalent Pareto optimal solutions are different.

    Compared with a general MO, preserving the population diversity may be more important in the MMO. This is because individuals in the population close to easy regions quickly when search complexities of points in the decision space are different.

    C. Performance Metric

    Achieving a goodPFapproximation (objective space) and locating sufficient equivalent Pareto optimal solutions(decision space) are equally important in the MMO. To demonstrate the effectiveness of the proposed algorithm, a Pareto sets proximity (PSP) [14], which is used to evaluate the similarity between the obtained solution set andPSs, is utilized on the balanced and imbalanced MMOPs. Moreover,an inverted generational distance-multi-modal (IGDM) [18],which can measure the quality of results both in the decision and objective spaces, is used to assess performances of MMOEAs on the imbalanced MMOPs.

    ThePSPcan be defined as follows [14]:

    III. RELATED WORK

    Compared with the MO, the MMO has attracted fewer researchers, but it is commonly found in different fields. In recent years, some MMO test suites [14], [19]-[23] have been proposed to investigate performances of MMOEAs. Because the diversity in the decision and objective spaces is important in the MMO, advanced diversity maintaining/improvement strategies have been incorporated into MMOEAs to find more Pareto optimal subsets. For example, an Omni-optimizer proposed by Deb and Tiwari [19] used a crowding distance to maintain the diversity in the decision and objective spaces.Their proposed algorithm can locate multiple equivalent Pareto optimal solutions. Shiret al. [24] proposed a niching covariance matrix adaptation (niching-CMA) wherein a dynamic niching method is employed to maintain the diversity in the decision space and the objective space. The results indicate that the niching-CMA performs better than other algorithms used in the comparison. In [25], a multi-objective particle swarm optimizer with self-organizing mechanism(SMPSO-MM) is introduced to solve MMOPs. In the SMPSO-MM, the self-organizing map, the elite learning strategy, and the non-dominated-sort method with special crowding distance are employed to improve the population diversity and the search capability. The results indicate that the SMPSO-MM can find more equivalent Pareto optimal solutions and obtain a well-distributedPFwhen compared with other four MMOEAs. Yueet al. [14] used a ring topology and a special crowding distance to assist a multiobjective particle swarm optimization (called as MO_Ring_PSO_SCD) in improving the population diversity.Their results show that the MO_Ring_PSO_SCD performs well on 11 MMOPs. A decomposition-based evolutionary algorithm with addition and deletion operators (MOEA/DAD) [26] introduced by Tanabe and Ishibuchi is proposed to solve MMOPs. In the MOEA/D-AD, a set of reference individuals are utilized to preserve the diversity in the objective space, and a niching method is employed to maintain the diversity in the decision space. The achieved results show that the MOEA/D-AD can locate more equivalent Pareto optimal solutions on seven MMOPs when compared with other MMOEAs. To find enough equivalent Pareto optimal solutions and achieve a good distributedPF,Liuet al. [27] proposed a double-niched evolutionary algorithm (DNEA), in which a double sharing function is utilized to calculate the density of each solution in both decision and objective spaces. Their experiments show that diversity maintenance in both spaces is necessary for solving MMOPs. A differential evolution for multimodal multiobjective problems, called the DE-TriM, is introduced in [28].In this algorithm, a novel mating pool selection approach and a computational resource allocation strategy based on a set of reference points are employed to enhance its search capability on MMOPs. In [29], a multi-objective hill-valley evolutionary algorithm, termed the MO-HillVallEA, is proposed to solve MMOPs. In the MO-HillVallEA, the hill-valley clustering method is incorporated into the MAMaLGaM. The results indicate that the MO-HillVallEA is competitive. Note that most above-mentioned studies are based on niching methods.Although these niching methods, termed “soft isolation” in[11], can preserve diversity, their performances may be limited due to high environmental pressure and complex shape of Pareto optimal sets. Therefore, Fan and Yan [11] used a decision space composition strategy (called the ZS) to improve the diversity in the decision space and reduce the problem complexity. The experimental results show that the ZS is an effective approach to solve MMOPs. Additionally,Tanabe and Ishibuchi [30] reviewed existing related works on the MMO. However, almost all of the above mentioned studies belong to “regular” algorithms and are used to solve the balanced MMOPs. Unlike previous studies, Liuet al. [13]recently proposed a set of the imbalanced MMOPs. Moreover,a “special” algorithm, i.e., an evolutionary algorithm using a convergence-penalized density method (CPDEA), is introduced to solve them. The results show that the CPDEA can locate more equivalent Pareto optimal solutions in the decision space, but some “regular” MMOEAs are easy to trap into easy regions.

    IV. ZONING SEARCH WITH ADAPTIVE RESOURCE ALLOCATING METHOD

    A. Motivation

    In [11], a decision space decomposition strategy, i.e., the ZS, is proposed to solve the balanced MMOPs. Moreover, the same computational resources are assigned to each search subspace. It may be helpful for some types of MMOPs whereinPSs are well distributed uniformly in the decision space. However, ifPSs in the decision space are not uniform or search complexities of the subspaces are different, using the same computational resources in each subspace will greatly waste limited computational resources. Therefore, assigning different computational resources in subspaces is an important task. To illustrate the above mentioned problems, two examples for the ZS-ARA without computational resource allocation (i.e., the ZS) are given as follows:

    Case 1 (Each Subspace Has Equivalent Pareto Optimal Solutions):Resource allocation of the ZS is shown in Fig. 1.We can observe from Fig. 1 that the number of equivalent Pareto optimal solutions in each search subspace is different.If the ZS is used to solve Case 1, i.e., computational resources allocated in four subspaces are the same, then easy subspaces may not require so many computational resources. Therefore,allocating the computational resources among all the subspaces optimally is a promising approach to enhance the use efficiency of the computational resources.

    Fig. 1. Resource allocation of the ZS (Case 1). The size of each circle denotes the used computational resource in each subspace. C1, C2, C3, and C4 (C1 = C2 = C3 = C4 in the ZS) denote the used computational resources in subspace-1, subspace-2, subspace-3, and subspace-4, respectively; C (C =C1 + C2 + C3 + C4) denotes the total computational resource.

    Case 2 (Not All Subspaces Have Equivalent Pareto Optimal Solutions):Resource allocation of this case is illustrated in Fig. 2. It can be seen from Fig. 2 that there are no equivalent Pareto optimal solutions in two subspaces. If each subspace consumes the same computational resources, then limited computational resources will be wasted in unpromising subspaces. Therefore, how to effectively assign the computational resources is necessary.

    Based on the above introductions, it can be concluded that allocating computational resources among all the subspaces is a promising method to improve the use efficiency of limited computational resources, especially with the imbalanced MMOPs. In other words, unlike the previously proposed zoning search [11] (i.e., each zoning is allocated the same computational resources), the ZS-ARA aims to allocate more computational resources to promising regions.

    B. Proposed Method

    Fig. 2. Resource allocation of the ZS (Case 2). The size of each circle denotes the used computational resource in each subspace. C1, C2, C3, and C4 (C1 = C2 = C3 = C4 in the ZS) denote the used computational resources in subspace-1, subspace-2, subspace-3, and subspace-4, respectively; C (C =C1 + C2 + C3 + C4) denotes the total computational resource.

    Fig. 3. Resource allocation of the ZS-SAR. The size of each circle denotes the used computational resources in each subspace. C1, C2, C3, and C4 denote the used computational resources in subspace-1, subspace-2, subspace-3, and subspace-4, respectively; C (C = C1 + C2 + C3 + C4) denotes the total computational resource.

    To alleviate the above-mentioned issue, the ZS-ARA is introduced to improve the use efficiency of limited computational resources. Unlike the ZS, the computational resources can be automatically assigned to different subspaces in the current study. To illustrate the ZS-ARA visually, its resource allocation process is shown in Fig. 3. It can be observed from Fig. 3 that the distributions of equivalent Pareto optimal solutions in all subspaces are different. For example, no equivalent Pareto optimal solutions are in the subspace-3, thus it is allocated less computational resources.However, the subspace-2 gives more computational resources to locate equivalent solutions. Namely, unlike the ZS, C2 is not equal to C3 in the proposed algorithm. Therefore, the use efficiency of the computational resources can be improved via the ZS-ARA, especially when the computational resources are limited.

    Fig. 4. Generic framework of ZS-ARA.

    The ZS-ARA can both maintain the population diversity and reduce the search difficulty in each subspace like the ZS,and make full use of the given computational resources.Additionally, the search space segmentation and the resource allocation are achieved in the ZS-ARA.

    1) Search Space Segmentation:Similarly to the previous study [11],h(1 ≤h≤D) (the number of selected variables)variables are chosen randomly and are divided intoq(q> 1)equal segments. The number of subspaces is equal tow=qh.

    2) Computational Resource Allocation:To implement automatic allocation of the computational resources, the quality of non-dominated individuals in each subspace is used to guide the selection probability updating of the selected MMOEA in the current study.

    The steps can be described as follows:

    Step 1:Obtain approximatePF, denoted as (Pi,i∈{1,2,...,w}), and its corresponding solutionsAi(in the decision space) in thei-th subspace.

    Step 2:Achieve thePFapproximation and theAin the entire space. Namely,P=Selection(P1∪P2···∪Pw) and its corresponding solution setAin the decision space. The number of objective vectors in thePis denoted asN.

    Step 3:Compute the number of objective points ofi-th subspace (denotedNi) in theP.

    Step 4:Update the selection probability of the selected MMOEA in thei-th subspace, denotedSPi. It can be calculated as follows:

    where Δpis a constant selection probability in each update.From Step 4, it can be observed that the computational resource can be automatically allocated among all the subspaces. In other words, if an MMOEA can find more nondominated individuals in the corresponding subspace, then it will be given more computational resources. Additionally, ifSPi> 1 orSPi< 0,SPi= 1 orSPi= 0.05, respectively.

    C. Overall Implementation of ZS-ARA

    Based on introductions in Sections IV-B-1) and IV-B-2), the overall implementation of the ZS-ARA is presented in Algorithm 1. The first step is dividing the entire search space into many subspaces (line 1). Subsequently, an MMOEA is used to find approximatePFandPSin each subspace based on its selection probability (lines 3-7). The selection probability of the selected MMOEA in each decision subspace is updated (lines 8-10) when the learning period (LP) is equal to a fixed number of generations. A largeLPvalue means that the selection probability updating of an MMOEA in each subspace is slower, i.e., the learning time is longer. Finally,PFapproximation andPSs are obtained in the entire search space.

    Apart from the pseudocode of the ZS-ARA shown in Algorithm 1, its generic framework is also illustrated in Fig. 4.It can be seen from Fig. 4 that other existing search space segmentation methods, self-adaptive resource allocation approaches, MMOEAs, and multi-objective handling methods can be utilized in the ZS-ARA. Moreover, its performance is affected by the above four parts. Additionally, assuming that the computational time complexity of the ZS-ARA, which includes the search space segmentation, the resource allocating method, and the optimization and selection operators, isO*. Clearly, theO*is mainly determined by the computational time complexity ofk-th MMOEA.

    Algorithm 1 ZS-ARA Input: S: entire search space;LP: learning period;w: number of subspaces;G: number of generations;SPi: the selection probability of MMOEA in the i-th subspace, .1: Search space segmentation (see Section IV-B-1)).2: while the stopping criterion is not satisfied do 3: for each subspace Si in {S1, S2,…, Sw}do 4: if SPi > rand then 5: Use an MMOEA to find approximate PFi and PSi;6: end if 7: end for 8: if LP∣G then 9: Update SPi (see Section IV-B-2));10: end if 11: end while S election(P1 ∪P2···∪Pw) S election(A1 ∪A2···∪Aw)i ∈{1,2,...,w}Output: P = and PSs =.

    From the perspective of sampling, the broad search means algorithms are capable of sampling uniformly in the entire search space, and the deep search represents the capability of algorithms to sample densely within a given search space.Therefore, the broad search can be implemented by segmenting the decision space and the deep search can be carried out via reduced subspaces in the ZS-ARA, i.e., the proposed algorithm can also balance the broad search and the deep search.

    V. EXPERIMENTAL RESULTS AND ANALYSES

    To assess the performance of the ZS-ARA, two different types of test suites, which include the balanced [14], [31] and imbalanced [13] MMOPs, are used in the current study. The ZS-ARA is compared with five other algorithms on balanced MMOPs and five other algorithms on imbalanced MMOPs.The competitors include ZS [11], MO_Ring_PSO_SCD [14],Omni-optimizer [32], DN-NSGAII [33], NSGAII [34],TriMOEA-TA&R [18], and CPDEA [13]. Except for the CPDEA, other algorithms can be considered as “regular”MMOEAS. Furthermore, the Pareto sets proximity (PSP)[14], which can measure the similarity is used to evaluate performances of all the compared algorithms on the balanced and imbalanced MMOPs, andIGDM[18] is employed to assess performances of all the compared algorithms on the imbalanced MMOPs.

    To analyze the achieved results, two non-parametric statistical tests, i.e., Wilcoxon’s rank sum test [35] and Friedman’s test [36], with a 0.05 significance level are used.Marks “+”, “-”, and “≈” denote that the ZS-ARA performs remarkably better, worse, and approximately the same as its competitor. Except for results with the imbalanced MMOPs,all results are obtained with MATLAB (R2016a) on a desktop computer with Windows 7 operating system (64 bit).

    A. Experimental Settings

    For the balanced MMOPs, population sizes of all the compared algorithms are set to 800 and the maximum number of function evaluations is set to 160 000. For the imbalanced MMOPs, population sizes of the proposed algorithm are set to 20 on two-objective problems and 60 on three-objective problems, respectively. Population sizes with other compared algorithms are the same as in [13], i.e., the population sizes of compared algorithms are set to 60 and 120 on two- and threeobjective imbalanced MMOPs, respectively. The maximum numbers of function evaluations are set to 18 000 on twoobjective problems and 36 000 on three-objective problems,respectively. Additionally, each compared algorithm is executed for 40 independent times on the balanced and the imbalanced test suites. Besides the above parameter settings,other parameters of all compared algorithms are set as suggested in their original studies. Note that four-objective problems in the imbalanced MMOPs are not used in the current study. The main reason is that the MO_Ring_PSO_SCD considered as a “regular” algorithm performs poorly on imbalanced multimodal many-objective problems. Finally,bothhandqare set to 2, i.e., the number of subspaces is 4 on all MMOPs.

    B. ZS-ARA With Balanced MMOPs

    To demonstrate the performance of the ZS-ARA, 22 balanced MMOPs are used in this experiment. Moreover, it is compared with four other algorithms and the ZS. The mean and standard deviation values ofPSPare reported in Table I.Moreover, the best results are shown in bold and the Wilcoxon’s rank sum test is used to analyze the results obtained by all compared algorithms in a statistical way.Similarly to the ZS, Table I indicates that the performance of the proposed algorithm is significantly better than those of four MMOEAs. Therefore, it can be concluded that the ZSARA is able to assist other MMOEAs in locating more equivalent solutions. It is also interesting to observe from Table I that the overall performance of the ZS-ARAMO_Ring_PSO_SCD is slightly better than that of the ZSMO_Ring_PSO_SCD. This is because the search difficulty of the equivalent optimal subset is almost the same in each subspace, i.e., the performance difference between the ZSMO_Ring_PSO_SCD and the ZS-ARA-MO_Ring_PSO_SCD is small on the balanced MMOPs. However, except for the functions MMF2, MMF11, and MMF12, the ZSMO_Ring_PSO_SCD cannot outperform the ZS-ARAMO_Ring_PSO_SCD on any balanced MMOPs in terms of the mean values. Clearly, allocating computational resources in the ZS can further improve the search efficiency of MMOEAs.

    Overall, similarly to the ZS, the ZS-ARA is also an effective approach to assist MMOEAs in improving their performances on the balanced MMOPs.

    C. ZS-ARA With Imbalanced MMOPs

    To further testify the performance of the ZS-ARA, four two-objective and four three-objective imbalanced MMOPs are utilized in this experiment. Note that four four-objective MMOPs have not been selected in this subsection. This is because the ZS can only assist MMOEAs in finding more equivalent Pareto optimal solutions in the decision space, and the MO_Ring_PSO_SCD cannot perform well on manyobjective optimization problems.

    Table II reports the meanIGDMvalues and the statistical analysis results obtained by the Wilcoxon’s rank sum test, and the best result is shown in bold. As observed in Table II,compared with four “regular” MMOEAs, i.e., MO_Ring_PSO_SCD, TriMOEA-TA&R, DN-NSGAII, and DNEA, the ZSARA can assist the “regular” MMOEA, i.e., MO_Ring_PSO_SCD, in finding more equivalent optimal solutions with all the imbalanced MMOPs. The main reason is that the ZS-ARA both improves the broad search capability and preserves the population diversity to avoid premature convergence, and reduces the unbalancedness of the imbalanced MMOPs in each subspace. Table II also shows that the performance of the ZS-ARA -MO_Ring_PSO_SCD is better than that of the ZSARA-MO_Ring_PSO_SCD since the former can automatically assign the computational resource to reduce waste of resources in useless search regions. It should be noted that the CPDEA considered as a “special” MMOEA is also used to solve the imbalanced MMOPs, but the proposed ZS-ARA-MO_Ring_PSO_SCD produces better results on all the functions in a statistical way, except for two functions IDMPM2-T1 and IDMP-M3-T4. It can be concluded that the ZSARA can greatly improve the performance of the “regular”algorithm in solving the imbalanced MMOPs. In other words,the proposed algorithm may be a promising approach to help“regular” and “special” MMOEAs locate more equivalent optimal solutions, especially in the decision space. For the IDMP-M2-T1 and the IDMP-M3-T4, Table II indicates that,although the ZS-ARA can reduce the complexity of problems and enhance the allocation capability of computational resources, it is inevitable that some computational resources will be wasted during the entire selection process. Therefore,both the ZS-ARA and the selected MMOEA are equally important in solving the imbalanced MMOPs.

    TABLE I MEAN AND STANDARD DEVIATION VALUES OF ALL COMPARED ALGORITHMS WITH RESPECT TO PSP

    Besides the achievedIGDMvalues, thePSPis utilized to evaluate all compared algorithms in the decision space and the results (including the mean values and statistical analysis results) are given in Table III. It can be observed from Table III that the ZS-ARA-MO_Ring_PSO_SCD outperforms the TriMOEA-TA&R, the DN-NSGAII, and the ZS-MO_Ring_PSO_SCD on all imbalanced MMOPs in a statistical method.Moreover, the proposed algorithm performs better than the CPDEA on all imbalanced MMOPs except for the IDMP-M2-T1 and the IDMP-M3-T4. For the IDMP-M2-T1, the reasons may be twofold: 1) The CPDEA is a “special” algorithm to solve imbalanced MMOPs, while the MO_Ring_PSO_SCD selected in the proposed algorithm is a “regular” algorithm.Therefore, it may be reasonable that the performance of the ZS-ARA-MO_Ring_PSO_SCD is worse than that of the CPDEA. However, Table III shows that the proposed method can significantly improve the performance of the MO_Ring_PSO_SCD on this problem. 2) The computational resource allocation method may not be optimal since it must balance the greedy selection and the random selection on different types of imbalanced MMOPs. This is analyzed in Section V-D-1). For the IDMP-M3-T4, it is a difficult imbalanced MMOP to be solved, thus “special” algorithms can locate more equivalent solutions. Compared with the MO_Ring_PSO_SCD, the proposed algorithm performs better on all imbalanced MMOPs except for the IDMP-M3-T4. It means that the ZS-ARA is capable of assisting the MO_Ring_PSO_SCD in locating more equivalent solutions.For the IDMP-M3-T4, Table III indicates that the MO_Ring_PSO_SCD outperforms the ZS-ARA-MO_Ring_PSO_SCD. This is because the IDMP-M3-T4 has many local optimal regions. Moreover, the existence of the standard deviation value of the proposed algorithm on the IDMP-M3-T4 means that the performance of the proposed algorithm is not robust when problems are difficult to solve.

    TABLE II MEAN VALUES OF ALL COMPARED ALGORITHMS WITH RESPECT TO IGDM

    TABLE III MEAN VALUES OF ALL COMPARED ALGORITHMS WITH RESPECT TO PSP

    Fig. 5. Performance rankings of different combinations of SP and LP on eight imbalanced MMOPs (Ellipse denotes the best performance ranking for each LP value).

    Based on the above analyses, it can be concluded that the ZS-ARA can help other “regular” MMOEAs find more equivalent solutions on imbalanced MMOPs. Moreover, how to allocate computational resources or improve learning efficiency is still an important and difficult task.

    D. Parameter Sensitive Analysis

    1) Impacts ofΔp and LP:Generally, a greedy or random resource allocating strategy may not always be effective to solve different types of problems. In the ZS-ARA, the learning period (LP) and the selection probability ( Δp) greatly influence its allocation efficiency of the computational resource. Namely, a large value ofLPwill provide a longer time for the ZS-ARA to distinguish which subspaces should be given more computational resources. In contrast, a smaller value of Δpwill give more time for the ZS-ARA to avoid false selection. Eight imbalanced MMOPs are utilized to investigate these two parameters in the ZS-ARA. For each function, the experiments are independently run 20 times. Moreover, values of ΔpandLPare selected from the sets {0.1, 0.2, 0.3, 0.4, 0.5}and {5, 10, 15, 20, 25, 30}, respectively. Therefore, the number of combinations of ΔpandLPis 30.

    The performance rankings obtained by the Friedman’s test are plotted in Fig.5. The combinations of (5, 0.1), (5, 0.2), (5,0.3), …, (30, 0.5) are numbered as 1, 2, 3, …, 30 in Fig. 5.From Figs. 5(a)-5(c), it can be seen that a smaller value ofLPcan assist the ZS-ARA in producing better results. Similarly toLP, a larger value of Δpis capable of improving the performance of the ZS-ARA. Therefore, we can conclude that the greedy resource assigning strategy should be adopted to solve simple imbalanced MMOPs. In Figs. 5(d), 5(f), and 5(h), it can be observed that a larger value ofLPand a smaller value of Δpcan help the ZS-ARA to locate more equivalent Pareto optimal solutions and obtain a well-distributedPF. In other words, giving more learning time for the ZS-ARA is necessary when optimization problems are complex.Additionally, Figs. 5(e) and 5(g) show that a large value ofLPcan improve the search capability of the ZS-ARA, but the value of Δpis hard to determine for differentLPvalues.

    Based on the above observations, it can be concluded that there are no fixedLPand Δpvalues for the proposed algorithm to maintain its optimal performance on all types of the imbalanced MMOPs. To further investigate theLP, the overall performance rankings of allLPvalues are illustrated in Fig. 6. Clearly,LP= 25 performs the best among allLPvalues. Therefore,LP= 25 is chosen with the ZS-ARA.Moreover, a dynamic adjustment strategy is used to balance the greedy and the random selection, i.e., Δp= 0.1 +0.4G/Gmax(Gdenotes the current generation andGmaxdenotes the maximal number of generations) is chosen in the current study.

    Fig. 6. Overall performance rankings of different LP values.

    2) Impact of Population Size:In addition to the two parameters investigated in Section V-D-1), the population size in the ZS-ARA is also investigated with eight imbalanced MMOPs in this subsection. Because two different population sizes are used on two-objective and tri-objective imbalanced MMOPs [13], the population sizes are chosen from the set{20, 40, 60, 80, 100, 120} on two-objective problems and the set {60, 80, 100, 120, 140, 160} on tri-objective problems.The influences of different population sizes on the ZS-ARA are illustrated in Fig. 7. Fig. 7(a) shows that the performance of the proposed algorithm decreases with the increased population size. Namely, a small population size can help the ZS-ARA find more equivalent optimal solutions and achieve a well-distributedPF. This is because a smaller population size can provide more generations to assist the selected MMOEA in finding equivalentPSs. It can be also seen from Fig. 7(b)that using a small population size in each subspace improves the performance of the ZS-ARA on functions IDMP-M3-T1,IDMP-M3-T2, and IDMP-M3-T3.NP= 80 produces the best result on the function IDMP-M3-T4. Therefore, too small population size in each subspace may negatively influence the performance of the ZS-ARA when solving complex optimization problems. Overall, a small population size used in each subspace can produce better results when compared with a large population size, but the setting of population size in the ZS-ARA should be based on the problem complexity of each application.

    Based on the above analysis, the population size is set to 20 on two-objective imbalanced MMOPs and 60 on tri-objective imbalanced MMOPs.

    E. More Computational Resources on Imbalanced MMOPs

    As stated in [37], [38], it is possible that an algorithm cannot find a good solution, even if more computational resources are provided. Therefore, the effectiveness of the ZSARA is further investigated with eight imbalanced MMOPs in this subsection. Moreover, two compared algorithms MO_Ring_PSO_SCD and CPDEA are used in the experiment.

    The maximum number of function evaluations, which is double in Section V-C, is set to 36 000 on two-objective imbalanced MMOPs and 72 000 on tri-objective imbalanced MMOPs. The compared algorithms are named as MO_Ring_PSO_SCDX2, CPDEAX2, and ZS-ARA-MO_Ring_PSO_SCDX2. Their population sizes are the same as in Section VC.

    The mean and standard deviation values ofIGDMare presented in Table IV. Note that the results of the MO_Ring_PSO_SCD, the CPDEA, and the ZS-ARAMO_Ring_PSO_SCD are directly taken from Table II. It can be observed from Table IV that the performances of three algorithms can be improved when more computational resources are given. Additionally, the MO_Ring_PSO_SCDX2l and CPDEAX2 can achieve better results on all problems, but the ZS-ARA can assist the MO_Ring_PSO_SCD in producing much better results, especially on four difficult three-objective imbalanced MMOPs. Therefore, it can be concluded that if more computational resources are given, the ZS-ARA is a more effective and promising approach to solve imbalanced MMOPs.

    F. Obtained PSs and Resource Allocation Rates in Each Subspace

    The study in [13] reported that the “regular” MMOEA, i.e.,MO_Ring_PSO_SCD, could not find allPSs on the imbalanced MMOPs since the MO_Ring_PSO_SCD lacked good diversity maintaining capability, whereas their proposed algorithm is capable of locating allPSregions in the decision space. To visually testify the effectiveness of the ZS-ARA,eight imbalanced MMOPs are used in this experiment. The obtainedPSs of the proposed algorithm in a single run are plotted in Figs. 8 and 9. From Figs. 8(a)-8(d), we observe that the ZS-ARA assists the “regular” algorithm in finding two well-distributed equivalent optimal subsets. For four triobjective problems, Figs. 9(a)-9(d) exhibit that the ZS-ARA is capable of helping the MO_Ring_PSO_SCD locate allPSs.The proposed algorithm can also find more equivalent optimal solutions in easy regions, such as subspaces 1 and 3. Note that the difficulties in finding equivalent optimal solutions are increasing in subspaces 1, 3, 4, and 2. The main reason is that the MO_Ring_PSO_SCD does not belong to “special” algorithms, which can locate enough equivalent optimal solutions in difficult regions. Moreover, because each subspace has an equivalent Pareto optimal subset, the computational resource is evenly allocated. Namely, the computational resource may not be enough to find more equivalent Pareto optimal solutions in difficult regions. Overall, the ZS-ARA is a promising approach to help MMOEAs find more equivalent optimal subsets.

    Fig. 7. Influence of different population sizes.

    TABLE IV MEAN VALUES OF ALL COMPARED ALGORITHMS WITH RESPECT TO IGDM

    Besides the obtainedPSs, the resource allocation rate in each subspace is also illustrated in Figs. 8 and 9. We observe from Figs. 8(a)-8(d) that the ZS-ARA can assign more computational resources in promising regions. Therefore, the proposed algorithm can allocate the computational resource more effectively when compared with the ZS. Of course, it is inevitable that some computational resources would be wasted to determine which regions contain equivalent Pareto optimal solutions. Additionally, Figs. 9(a)-9(d) shows that each subspace almost uses the same computational resource since each of them has equivalent optimal solutions. Therefore, the ZS-ARA is capable of automatically allocating the computational resources based on the obtainedPSs of each subspace.

    VI. CONCLUSIONS AND FUTURE STUDY

    A zoning search with adaptive resource allocation (ZSARA) is proposed in the present work. In the ZS-ARA, the entire decision space is divided into many search subspaces to reduce the problem complexity and the computational resources are automatically allocated in each subspace to effectively use the limited computational resources. The ZSARA is compared with a “special” algorithm and eight“regular” algorithms on the balanced and imbalanced MMOPs. The experimental results show that the proposed algorithm is capable of maintaining its performance on the balanced MMOPs as the ZS and assists a “regular” algorithm in improving its performance on the imbalanced MMOPs. It should be noted that the proposed ZS-ARA-MO_Ring_PSO_SCD can perform better than a “special” MMOEA (i.e.,CPEEA) on most imbalanced MMOPs.

    The sensitivities of Δp,LP, and population size are analyzed in Section V-D. The results indicate that the performance of the ZS-ARA is influenced by these parameter settings. The ZS-ARA is compared with the MO_Ring_PSO_SCD in Section V-E when more computational resources are provided. The experimental results show that giving more computational costs does not mean that the MMOEA can find more equivalent Pareto optimal solutions in the decision space on the imbalanced MMOPs. However, the ZS-ARA can help“regular” MMOEAs enhance their performances. The obtainedPSs and resource allocation rates are investigated in Section V-F. The results show that the ZS-ARA can help the MO_Ring_PSO_SCD locate all thePSregions and allocate more computational resources in promising regions.

    Fig. 8. Obtained PSs and resource allocation rate in each space on four 2-D imbalanced MMOPs in a single run.

    Fig. 9. Obtained PSs and resource allocation rate in each space on four 3-D imbalanced MMOPs in a single run.

    Although the ZS-ARA is an effective approach to solve low-dimensional balanced and imbalanced MMOPs, it still has the following problems: 1) How to generate subspaces is a challenging task when the search space is high-dimensional;2) How to effectively allocate the computational resources when the number of subspaces is much greater than four.Moreover, improving the allocation efficiency of computational resources is still an important task; 3) The results show that the performance of the ZS-ARA is greatly influenced by selected MMOEAs, thus it is important to further design more advanced MMOEAs. In our future work,principal decision variables will be specially selected.Moreover, balancing short-term and long-term learning methods will be studied to improve the resource allocation efficiency. Finally, high-performance computing methods such as parallel computing and cloud computing will be used with the ZS-ARA to save the computational time.

    午夜视频精品福利| 久久人人爽av亚洲精品天堂| 日本三级黄在线观看| 淫妇啪啪啪对白视频| 国产成+人综合+亚洲专区| 国产精品亚洲一级av第二区| 欧美在线黄色| 69av精品久久久久久| 免费在线观看黄色视频的| 久久久国产一区二区| 黑人操中国人逼视频| 国产精品综合久久久久久久免费 | 伊人久久大香线蕉亚洲五| 亚洲精品一二三| cao死你这个sao货| 欧美中文综合在线视频| 777久久人妻少妇嫩草av网站| 美女大奶头视频| 久久久久久大精品| 后天国语完整版免费观看| 精品久久久久久成人av| 日韩国内少妇激情av| 亚洲精品在线观看二区| 俄罗斯特黄特色一大片| 亚洲人成伊人成综合网2020| 美国免费a级毛片| www.自偷自拍.com| 久久久久久大精品| 亚洲免费av在线视频| 日日夜夜操网爽| 动漫黄色视频在线观看| 午夜福利,免费看| 色精品久久人妻99蜜桃| 搡老乐熟女国产| 国产精品一区二区精品视频观看| 免费少妇av软件| 国产精品av久久久久免费| 在线观看免费午夜福利视频| 亚洲国产欧美网| 国产欧美日韩一区二区三区在线| 欧美在线黄色| 国产精品久久视频播放| 久久久国产一区二区| 成人永久免费在线观看视频| 免费少妇av软件| 日本a在线网址| 亚洲免费av在线视频| 咕卡用的链子| 波多野结衣高清无吗| 久久香蕉国产精品| 日本vs欧美在线观看视频| 久久国产亚洲av麻豆专区| 麻豆久久精品国产亚洲av | 国产成人免费无遮挡视频| 亚洲精品中文字幕在线视频| 亚洲av电影在线进入| 欧美日韩福利视频一区二区| 国产亚洲精品综合一区在线观看 | 黄色片一级片一级黄色片| 看免费av毛片| 国产亚洲精品第一综合不卡| 天堂中文最新版在线下载| 免费不卡黄色视频| 亚洲专区字幕在线| 免费少妇av软件| 亚洲av成人av| 99久久国产精品久久久| 最近最新中文字幕大全电影3 | 精品午夜福利视频在线观看一区| 欧美日韩av久久| 国产又爽黄色视频| 国产精品九九99| 黄色 视频免费看| 日韩成人在线观看一区二区三区| 999久久久国产精品视频| 看免费av毛片| 热99国产精品久久久久久7| 欧美中文日本在线观看视频| 黄片播放在线免费| 真人做人爱边吃奶动态| 亚洲精品一卡2卡三卡4卡5卡| 夜夜看夜夜爽夜夜摸 | av欧美777| 国产午夜精品久久久久久| 国产精品 国内视频| 精品一区二区三区四区五区乱码| 在线av久久热| 亚洲情色 制服丝袜| 免费观看精品视频网站| 成人特级黄色片久久久久久久| 午夜福利,免费看| 大香蕉久久成人网| 在线观看免费日韩欧美大片| 操出白浆在线播放| 一级片免费观看大全| 国产欧美日韩一区二区三| 亚洲av片天天在线观看| 日韩精品中文字幕看吧| 日韩大尺度精品在线看网址 | 亚洲一区二区三区欧美精品| 久久亚洲真实| 国产av又大| 亚洲欧美精品综合久久99| 高清av免费在线| 中文字幕高清在线视频| 欧美不卡视频在线免费观看 | 丰满的人妻完整版| 中文字幕另类日韩欧美亚洲嫩草| 日韩有码中文字幕| 成人影院久久| 成人永久免费在线观看视频| 大型黄色视频在线免费观看| 成人三级黄色视频| 视频区欧美日本亚洲| 老司机午夜十八禁免费视频| 亚洲va日本ⅴa欧美va伊人久久| 波多野结衣av一区二区av| 久久精品国产亚洲av高清一级| 欧美一级毛片孕妇| 国产亚洲av高清不卡| 免费av毛片视频| 一个人观看的视频www高清免费观看 | 91成年电影在线观看| av免费在线观看网站| 亚洲av片天天在线观看| 国产激情欧美一区二区| 欧美乱色亚洲激情| 国产成+人综合+亚洲专区| 久久精品亚洲熟妇少妇任你| 国产成人精品久久二区二区免费| 日日夜夜操网爽| 99国产精品一区二区三区| 日本黄色视频三级网站网址| 日韩免费av在线播放| 国产亚洲欧美在线一区二区| 夜夜夜夜夜久久久久| 欧美成人免费av一区二区三区| 亚洲av成人一区二区三| 一本综合久久免费| 国产午夜精品久久久久久| 亚洲国产欧美日韩在线播放| 国产片内射在线| 久99久视频精品免费| 夜夜躁狠狠躁天天躁| 午夜两性在线视频| 搡老岳熟女国产| 日韩精品中文字幕看吧| 亚洲欧美精品综合久久99| 麻豆一二三区av精品| 日韩中文字幕欧美一区二区| 黑人操中国人逼视频| 午夜视频精品福利| 国产成人系列免费观看| 亚洲精品粉嫩美女一区| 岛国视频午夜一区免费看| 国产精品成人在线| 国产国语露脸激情在线看| 亚洲五月婷婷丁香| 午夜老司机福利片| 色综合欧美亚洲国产小说| 怎么达到女性高潮| 激情在线观看视频在线高清| 99国产极品粉嫩在线观看| 国产午夜精品久久久久久| 中文欧美无线码| aaaaa片日本免费| 久久久久久久久免费视频了| 亚洲自偷自拍图片 自拍| 午夜福利影视在线免费观看| 国产免费男女视频| 亚洲午夜理论影院| 热re99久久精品国产66热6| 每晚都被弄得嗷嗷叫到高潮| 丝袜在线中文字幕| 国产又色又爽无遮挡免费看| 日韩三级视频一区二区三区| 国产亚洲欧美在线一区二区| 亚洲成a人片在线一区二区| 在线观看免费高清a一片| 欧美日韩精品网址| 亚洲成人免费av在线播放| 国产精品自产拍在线观看55亚洲| 久久中文字幕一级| 亚洲五月婷婷丁香| 免费在线观看日本一区| 天天躁夜夜躁狠狠躁躁| 国产在线观看jvid| 久久久水蜜桃国产精品网| 别揉我奶头~嗯~啊~动态视频| 亚洲五月婷婷丁香| 国产精华一区二区三区| av天堂久久9| 老熟妇乱子伦视频在线观看| 一a级毛片在线观看| 久久天躁狠狠躁夜夜2o2o| 91老司机精品| 777久久人妻少妇嫩草av网站| 丁香欧美五月| 国产成年人精品一区二区 | 精品熟女少妇八av免费久了| 久久影院123| 一区二区三区激情视频| 老汉色av国产亚洲站长工具| 国产精品成人在线| www.精华液| 中文字幕精品免费在线观看视频| 999久久久国产精品视频| 国产成年人精品一区二区 | 亚洲一区二区三区不卡视频| 婷婷精品国产亚洲av在线| 黄色视频不卡| 国产欧美日韩一区二区精品| 夜夜爽天天搞| 亚洲第一欧美日韩一区二区三区| 亚洲中文日韩欧美视频| 在线观看66精品国产| 国产在线观看jvid| 高清黄色对白视频在线免费看| 可以免费在线观看a视频的电影网站| 精品国产国语对白av| 99国产极品粉嫩在线观看| 狠狠狠狠99中文字幕| 美女扒开内裤让男人捅视频| 国产乱人伦免费视频| ponron亚洲| 欧美日本亚洲视频在线播放| 黄片小视频在线播放| 国产精品一区二区三区四区久久 | www.熟女人妻精品国产| 一级毛片精品| 99久久综合精品五月天人人| 国产亚洲欧美精品永久| 婷婷丁香在线五月| 一级毛片精品| 天天躁夜夜躁狠狠躁躁| 日韩视频一区二区在线观看| 老司机午夜十八禁免费视频| 午夜91福利影院| 91成人精品电影| 亚洲狠狠婷婷综合久久图片| 成人18禁在线播放| 大型黄色视频在线免费观看| 丝袜人妻中文字幕| 久久 成人 亚洲| 亚洲精品在线美女| 欧美激情久久久久久爽电影 | 亚洲精品国产精品久久久不卡| 久久天堂一区二区三区四区| 老鸭窝网址在线观看| 国产黄色免费在线视频| 国产麻豆69| 国产亚洲精品一区二区www| 色在线成人网| 欧美日韩亚洲综合一区二区三区_| x7x7x7水蜜桃| 老司机深夜福利视频在线观看| 夜夜看夜夜爽夜夜摸 | 国产高清国产精品国产三级| 久久欧美精品欧美久久欧美| 后天国语完整版免费观看| 欧美日韩av久久| 久久精品人人爽人人爽视色| 男女高潮啪啪啪动态图| 啦啦啦免费观看视频1| 国产极品粉嫩免费观看在线| 黄色 视频免费看| 人成视频在线观看免费观看| 久久国产亚洲av麻豆专区| 国产欧美日韩一区二区三| 欧美中文日本在线观看视频| 日韩欧美国产一区二区入口| 久9热在线精品视频| 欧美激情久久久久久爽电影 | 国产精品秋霞免费鲁丝片| 久久国产精品影院| 一级片免费观看大全| 好看av亚洲va欧美ⅴa在| 99热只有精品国产| 天堂影院成人在线观看| 精品国产亚洲在线| 淫秽高清视频在线观看| 怎么达到女性高潮| 在线观看一区二区三区| av超薄肉色丝袜交足视频| 欧美乱码精品一区二区三区| 黄色视频不卡| 免费在线观看日本一区| 国产精品二区激情视频| 精品第一国产精品| 国产蜜桃级精品一区二区三区| 久久久国产成人精品二区 | 一级片'在线观看视频| av天堂在线播放| 国产成人精品无人区| 亚洲精品国产一区二区精华液| 啪啪无遮挡十八禁网站| 亚洲成人免费电影在线观看| 老熟妇乱子伦视频在线观看| 一边摸一边做爽爽视频免费| 亚洲av成人av| 桃色一区二区三区在线观看| 一本大道久久a久久精品| 久久精品国产亚洲av香蕉五月| 真人一进一出gif抽搐免费| 欧美最黄视频在线播放免费 | 三上悠亚av全集在线观看| 亚洲欧美日韩高清在线视频| 老司机深夜福利视频在线观看| www.自偷自拍.com| 国产黄a三级三级三级人| 这个男人来自地球电影免费观看| 欧美一级毛片孕妇| 亚洲欧美一区二区三区久久| 乱人伦中国视频| 电影成人av| 日韩大尺度精品在线看网址 | 中文亚洲av片在线观看爽| 男人舔女人的私密视频| 亚洲人成电影观看| 日韩中文字幕欧美一区二区| 亚洲五月婷婷丁香| 亚洲 欧美 日韩 在线 免费| 在线观看午夜福利视频| 亚洲午夜精品一区,二区,三区| 淫秽高清视频在线观看| 91精品国产国语对白视频| 在线免费观看的www视频| 国产激情久久老熟女| 搡老岳熟女国产| 欧美丝袜亚洲另类 | 欧美在线黄色| 成人亚洲精品av一区二区 | 欧美大码av| 美女大奶头视频| 亚洲免费av在线视频| 亚洲av成人不卡在线观看播放网| 午夜精品久久久久久毛片777| 妹子高潮喷水视频| 国产精品成人在线| 日本黄色视频三级网站网址| 国产色视频综合| 国产精品免费视频内射| 这个男人来自地球电影免费观看| 国产亚洲精品久久久久久毛片| a级毛片在线看网站| 亚洲一区中文字幕在线| 国产成人精品无人区| 国产精品乱码一区二三区的特点 | 三级毛片av免费| 色婷婷久久久亚洲欧美| 黄色成人免费大全| 亚洲精品国产区一区二| 99久久人妻综合| 亚洲人成77777在线视频| 精品日产1卡2卡| 精品国产超薄肉色丝袜足j| 一个人免费在线观看的高清视频| 成熟少妇高潮喷水视频| 国产欧美日韩一区二区三区在线| 国内毛片毛片毛片毛片毛片| 精品国内亚洲2022精品成人| 美女大奶头视频| 国产一区二区三区综合在线观看| 咕卡用的链子| 99精品在免费线老司机午夜| 精品国产亚洲在线| 91麻豆精品激情在线观看国产 | 成人精品一区二区免费| 精品国产一区二区三区四区第35| a在线观看视频网站| 咕卡用的链子| 久久人人97超碰香蕉20202| 亚洲七黄色美女视频| 不卡av一区二区三区| 亚洲av第一区精品v没综合| 免费在线观看视频国产中文字幕亚洲| 日韩视频一区二区在线观看| 国产精品久久久久成人av| 一个人免费在线观看的高清视频| 女人爽到高潮嗷嗷叫在线视频| 动漫黄色视频在线观看| 精品福利永久在线观看| 国产亚洲av高清不卡| 国产成人影院久久av| 亚洲熟女毛片儿| www.www免费av| 久久国产精品影院| 一个人观看的视频www高清免费观看 | 伊人久久大香线蕉亚洲五| 深夜精品福利| 日韩一卡2卡3卡4卡2021年| 欧美乱色亚洲激情| 一区二区日韩欧美中文字幕| 波多野结衣一区麻豆| 激情在线观看视频在线高清| 亚洲第一青青草原| 成年女人毛片免费观看观看9| 精品一区二区三区视频在线观看免费 | 亚洲精品一二三| 亚洲人成伊人成综合网2020| 9191精品国产免费久久| 丁香欧美五月| 久久精品91无色码中文字幕| 99国产精品一区二区三区| 亚洲,欧美精品.| 亚洲avbb在线观看| 日本五十路高清| 国产欧美日韩综合在线一区二区| 欧美亚洲日本最大视频资源| 露出奶头的视频| 精品欧美一区二区三区在线| 99久久久亚洲精品蜜臀av| 久久精品成人免费网站| 色婷婷久久久亚洲欧美| 久久中文字幕一级| 色综合婷婷激情| 成年人免费黄色播放视频| 精品第一国产精品| 伊人久久大香线蕉亚洲五| 午夜福利免费观看在线| 欧美丝袜亚洲另类 | 国产成人欧美| 啦啦啦 在线观看视频| 国产亚洲欧美精品永久| 在线观看免费视频网站a站| 国产av一区在线观看免费| 国产免费av片在线观看野外av| √禁漫天堂资源中文www| 18禁国产床啪视频网站| 亚洲精品av麻豆狂野| 久久精品人人爽人人爽视色| 99国产精品一区二区三区| 久久亚洲真实| 欧美日韩黄片免| 99久久国产精品久久久| 亚洲第一av免费看| 国产精品一区二区在线不卡| 国产精品九九99| 久久 成人 亚洲| 欧美日韩亚洲综合一区二区三区_| 国产精品乱码一区二三区的特点 | 免费久久久久久久精品成人欧美视频| 亚洲第一青青草原| 男男h啪啪无遮挡| 99国产综合亚洲精品| 两性午夜刺激爽爽歪歪视频在线观看 | 欧美中文综合在线视频| 亚洲男人天堂网一区| 日日夜夜操网爽| 极品教师在线免费播放| 国产精品国产高清国产av| 久久精品91无色码中文字幕| 女人被躁到高潮嗷嗷叫费观| 操美女的视频在线观看| 久久精品国产亚洲av香蕉五月| 人人澡人人妻人| 国产免费现黄频在线看| 999久久久精品免费观看国产| 91国产中文字幕| 亚洲一区二区三区色噜噜 | 在线观看www视频免费| 国产精品美女特级片免费视频播放器 | 欧美国产精品va在线观看不卡| 久久香蕉国产精品| 亚洲欧美日韩高清在线视频| 免费在线观看完整版高清| 美女扒开内裤让男人捅视频| 免费少妇av软件| 亚洲一区高清亚洲精品| 身体一侧抽搐| 午夜免费激情av| 水蜜桃什么品种好| 黄频高清免费视频| 女人爽到高潮嗷嗷叫在线视频| 国产精品免费一区二区三区在线| 欧美日韩亚洲国产一区二区在线观看| 午夜影院日韩av| av福利片在线| 久久人人精品亚洲av| 亚洲欧美精品综合久久99| 亚洲精品一二三| 美女福利国产在线| 日韩av在线大香蕉| 国产成人欧美| 成年女人毛片免费观看观看9| 欧美午夜高清在线| 在线观看免费高清a一片| 中文字幕人妻丝袜制服| 久久香蕉精品热| 午夜老司机福利片| 久久精品aⅴ一区二区三区四区| 午夜免费鲁丝| 国产亚洲精品久久久久5区| 欧美精品亚洲一区二区| 欧美日韩福利视频一区二区| 美女午夜性视频免费| 久久午夜综合久久蜜桃| 久久久精品欧美日韩精品| 亚洲色图av天堂| 欧美人与性动交α欧美精品济南到| 国产精品影院久久| 色尼玛亚洲综合影院| 女生性感内裤真人,穿戴方法视频| 亚洲一区二区三区不卡视频| 99riav亚洲国产免费| 日韩欧美国产一区二区入口| 久久伊人香网站| 国产精品九九99| 女性被躁到高潮视频| 香蕉国产在线看| 日本五十路高清| 男女高潮啪啪啪动态图| 久久久久久大精品| 激情在线观看视频在线高清| 亚洲一卡2卡3卡4卡5卡精品中文| 日本欧美视频一区| 久久人人爽av亚洲精品天堂| 丝袜美腿诱惑在线| 天堂俺去俺来也www色官网| 日本撒尿小便嘘嘘汇集6| 久久亚洲精品不卡| 亚洲情色 制服丝袜| 亚洲人成77777在线视频| 欧美国产精品va在线观看不卡| 日韩大码丰满熟妇| 神马国产精品三级电影在线观看 | 午夜日韩欧美国产| 亚洲国产欧美一区二区综合| 亚洲精品中文字幕在线视频| 日本vs欧美在线观看视频| 天天影视国产精品| 欧洲精品卡2卡3卡4卡5卡区| 亚洲,欧美精品.| 99久久99久久久精品蜜桃| 大型av网站在线播放| 夜夜看夜夜爽夜夜摸 | 欧美日韩国产mv在线观看视频| 精品免费久久久久久久清纯| 高清av免费在线| 午夜a级毛片| 国产成人av激情在线播放| 国产一区二区三区在线臀色熟女 | 黄频高清免费视频| 国产视频一区二区在线看| 99精品久久久久人妻精品| 久久久国产欧美日韩av| 国产高清videossex| 人人妻人人爽人人添夜夜欢视频| 99久久99久久久精品蜜桃| 日韩av在线大香蕉| 久久久久久人人人人人| 国产97色在线日韩免费| 黄色女人牲交| 免费一级毛片在线播放高清视频 | 欧美日韩亚洲综合一区二区三区_| 老司机在亚洲福利影院| 中亚洲国语对白在线视频| 每晚都被弄得嗷嗷叫到高潮| 自拍欧美九色日韩亚洲蝌蚪91| 国产不卡一卡二| 夜夜躁狠狠躁天天躁| 丝袜美腿诱惑在线| 精品少妇一区二区三区视频日本电影| 一进一出抽搐动态| 成人三级黄色视频| 亚洲欧美日韩高清在线视频| 国内毛片毛片毛片毛片毛片| 一级a爱视频在线免费观看| 欧美日韩一级在线毛片| 欧美在线黄色| 黄色怎么调成土黄色| 中文字幕另类日韩欧美亚洲嫩草| 黑人巨大精品欧美一区二区mp4| bbb黄色大片| 日本欧美视频一区| 国产成人啪精品午夜网站| 国产黄a三级三级三级人| 国产精品久久久久成人av| 一区二区三区精品91| 色在线成人网| 久久国产精品人妻蜜桃| 99国产综合亚洲精品| 亚洲欧美日韩另类电影网站| 午夜老司机福利片| 80岁老熟妇乱子伦牲交| 美女福利国产在线| 免费人成视频x8x8入口观看| 久热爱精品视频在线9| 国产成人影院久久av| 老熟妇仑乱视频hdxx| 婷婷丁香在线五月| 在线免费观看的www视频| 人人妻人人添人人爽欧美一区卜| 国产精品一区二区三区四区久久 | 亚洲av美国av| 久久精品亚洲精品国产色婷小说| 嫁个100分男人电影在线观看| www.自偷自拍.com| www.熟女人妻精品国产| 90打野战视频偷拍视频| 一级a爱视频在线免费观看| 视频区图区小说| 欧美黑人精品巨大| 美女福利国产在线| 丝袜人妻中文字幕| 免费看a级黄色片| 午夜成年电影在线免费观看| 亚洲精品美女久久av网站| 咕卡用的链子| 黄片大片在线免费观看| 国产精品久久久av美女十八| 午夜免费鲁丝| 免费观看人在逋| 精品国产超薄肉色丝袜足j| 欧美成人免费av一区二区三区|