Seismic anisotropy provides important constraints on deformation patterns of Earth＇s material. Rayleigh wave dispersion data with azimuthal anisotropy can be used to invert for depth-dependent shear wavespeed azimuth...Seismic anisotropy provides important constraints on deformation patterns of Earth＇s material. Rayleigh wave dispersion data with azimuthal anisotropy can be used to invert for depth-dependent shear wavespeed azimuthal anisotropy, therefore reflecting depth-varying deformation patterns in the crust and upper mantle. In this study, we propose a two-step method that uses the Neighborhood Algorithm （NA） for the point-wise inversion of depth-dependent shear wavespeeds and azimuthal anisotropy from Rayleigh wave azimuthally anisotropic dispersion data. The first step employs the NA to estimate depth- dependent Vsv （or the elastic parameter L） as well as their uncertainties from the isotropic part Rayleigh wave dispersion data. In the second step, we first adopt a difference scheme to compute approximate Rayleigh-wave phase velocity sensitivity kernels to azimuthally anisotropic parameters with respect to the velocity model obtained in the first step. Then we perform the NA to estimate the azimuthally anisotropic parameters Gc/L and Gs/L at depths separately from the corresponding cosine and sine terms of the azimuthally anisotropic dispersion data. Finally, we compute the depth-dependent magnitude and fast polariza- tion azimuth of shear wavespeed azimuthal anisotropy. The use of the global search NA and Bayesian analysis allows for more reliable estimates of depth-dependent shear wavespeeds and azimuthal anisotropy as well as their uncertainties.We illustrate the inversion method using the azimuthally anisotropic dispersion data in SE Tibet, where we find apparent changes of fast axes of shear wavespeed azimuthal anisotropy between the crust and uppermost mantle.展开更多
This paper presents a parallel composite local search algorithm based on multiple search neighborhoods to solve a special kind of timetable problem. The new algorithm can also effectively solve those problems that can...This paper presents a parallel composite local search algorithm based on multiple search neighborhoods to solve a special kind of timetable problem. The new algorithm can also effectively solve those problems that can be solved by general local search algorithms. Experimental results show that the new algorithm can generate better solutions than general local search algorithms.展开更多
To provide the supplier with the minimizum vehicle travel distance in the distribution process of goods in three situations of new customer demand,customer cancellation service,and change of customer delivery address,...To provide the supplier with the minimizum vehicle travel distance in the distribution process of goods in three situations of new customer demand,customer cancellation service,and change of customer delivery address,based on the ideas of pre-optimization and real-time optimization,a two-stage planning model of dynamic demand based vehicle routing problem with time windows was established.At the pre-optimization stage,an improved genetic algorithm was used to obtain the pre-optimized distribution route,a large-scale neighborhood search method was integrated into the mutation operation to improve the local optimization performance of the genetic algorithm,and a variety of operators were introduced to expand the search space of neighborhood solutions;At the real-time optimization stage,a periodic optimization strategy was adopted to transform a complex dynamic problem into several static problems,and four neighborhood search operators were used to quickly adjust the route.Two different scale examples were designed for experiments.It is proved that the algorithm can plan the better route,and adjust the distribution route in time under the real-time constraints.Therefore,the proposed algorithm can provide theoretical guidance for suppliers to solve the dynamic demand based vehicle routing problem.展开更多
For neighborhood rough set attribute reduction algorithms based on dependency degree,a neighborhood computation method incorporating attribute weight values and a neighborhood rough set attribute reduction algorithm u...For neighborhood rough set attribute reduction algorithms based on dependency degree,a neighborhood computation method incorporating attribute weight values and a neighborhood rough set attribute reduction algorithm using discernment as the heuristic information was proposed.The reduction algorithm comprehensively considers the dependency degree and neighborhood granulation degree of attributes,allowing for a more accurate measurement of the importance degrees of attributes.Example analyses and experimental results demonstrate the feasibility and effectiveness of the algorithm.展开更多
基金supported by National Natural Science Foundation of China (Grant number 41222028)China National Special Fund for Earthquake Scientific Research in Public Interest (Grant number 201508008)the Fundamental Research Funds for the Central Universities (WK2080000053)
文摘Seismic anisotropy provides important constraints on deformation patterns of Earth＇s material. Rayleigh wave dispersion data with azimuthal anisotropy can be used to invert for depth-dependent shear wavespeed azimuthal anisotropy, therefore reflecting depth-varying deformation patterns in the crust and upper mantle. In this study, we propose a two-step method that uses the Neighborhood Algorithm （NA） for the point-wise inversion of depth-dependent shear wavespeeds and azimuthal anisotropy from Rayleigh wave azimuthally anisotropic dispersion data. The first step employs the NA to estimate depth- dependent Vsv （or the elastic parameter L） as well as their uncertainties from the isotropic part Rayleigh wave dispersion data. In the second step, we first adopt a difference scheme to compute approximate Rayleigh-wave phase velocity sensitivity kernels to azimuthally anisotropic parameters with respect to the velocity model obtained in the first step. Then we perform the NA to estimate the azimuthally anisotropic parameters Gc/L and Gs/L at depths separately from the corresponding cosine and sine terms of the azimuthally anisotropic dispersion data. Finally, we compute the depth-dependent magnitude and fast polariza- tion azimuth of shear wavespeed azimuthal anisotropy. The use of the global search NA and Bayesian analysis allows for more reliable estimates of depth-dependent shear wavespeeds and azimuthal anisotropy as well as their uncertainties.We illustrate the inversion method using the azimuthally anisotropic dispersion data in SE Tibet, where we find apparent changes of fast axes of shear wavespeed azimuthal anisotropy between the crust and uppermost mantle.
文摘This paper presents a parallel composite local search algorithm based on multiple search neighborhoods to solve a special kind of timetable problem. The new algorithm can also effectively solve those problems that can be solved by general local search algorithms. Experimental results show that the new algorithm can generate better solutions than general local search algorithms.
基金supported by Natural Science Foundation Project of Gansu Provincial Science and Technology Department(No.1506RJZA084)Gansu Provincial Education Department Scientific Research Fund Grant Project(No.1204-13).
文摘To provide the supplier with the minimizum vehicle travel distance in the distribution process of goods in three situations of new customer demand,customer cancellation service,and change of customer delivery address,based on the ideas of pre-optimization and real-time optimization,a two-stage planning model of dynamic demand based vehicle routing problem with time windows was established.At the pre-optimization stage,an improved genetic algorithm was used to obtain the pre-optimized distribution route,a large-scale neighborhood search method was integrated into the mutation operation to improve the local optimization performance of the genetic algorithm,and a variety of operators were introduced to expand the search space of neighborhood solutions;At the real-time optimization stage,a periodic optimization strategy was adopted to transform a complex dynamic problem into several static problems,and four neighborhood search operators were used to quickly adjust the route.Two different scale examples were designed for experiments.It is proved that the algorithm can plan the better route,and adjust the distribution route in time under the real-time constraints.Therefore,the proposed algorithm can provide theoretical guidance for suppliers to solve the dynamic demand based vehicle routing problem.
基金Anhui Provincial University Research Project(Project Number:2023AH051659)Tongling University Talent Research Initiation Fund Project(Project Number:2022tlxyrc31)+1 种基金Tongling University School-Level Scientific Research Project(Project Number:2021tlxytwh05)Tongling University Horizontal Project(Project Number:2023tlxyxdz237)。
文摘For neighborhood rough set attribute reduction algorithms based on dependency degree,a neighborhood computation method incorporating attribute weight values and a neighborhood rough set attribute reduction algorithm using discernment as the heuristic information was proposed.The reduction algorithm comprehensively considers the dependency degree and neighborhood granulation degree of attributes,allowing for a more accurate measurement of the importance degrees of attributes.Example analyses and experimental results demonstrate the feasibility and effectiveness of the algorithm.
