This paper proposes an adaptive chaos quantum honey bee algorithm(CQHBA)for solving chance-constrained program-ming in random fuzzy environment based on random fuzzy simulations.Random fuzzy simulation is designed to ...This paper proposes an adaptive chaos quantum honey bee algorithm(CQHBA)for solving chance-constrained program-ming in random fuzzy environment based on random fuzzy simulations.Random fuzzy simulation is designed to estimate the chance of a random fuzzy event and the optimistic value to a random fuzzy variable.In CQHBA,each bee carries a group of quantum bits representing a solution.Chaos optimization searches space around the selected best-so-far food source.In the marriage process,random interferential discrete quantum crossover is done between selected drones and the queen.Gaussian quantum mutation is used to keep the diversity of whole population.New methods of computing quantum rotation angles are designed based on grads.A proof of con-vergence for CQHBA is developed and a theoretical analysis of the computational overhead for the algorithm is presented.Numerical examples are presented to demonstrate its superiority in robustness and stability,efficiency of computational complexity,success rate,and accuracy of solution quality.CQHBA is manifested to be highly robust under various conditions and capable of handling most random fuzzy programmings with any parameter settings,variable initializations,system tolerance and confidence level,perturbations,and noises.展开更多
This work investigates a simple and practical bio-immune optimization approach to solve a kind of chance-constrained programming problem without known noisy attributes, after probing into a lower bound estimate of sam...This work investigates a simple and practical bio-immune optimization approach to solve a kind of chance-constrained programming problem without known noisy attributes, after probing into a lower bound estimate of sample size for any random variable. Such approach mainly consists of sample allocation, evaluation, proliferation and mutation. The former two, depending on a lower bound estimate acquired, not only decide the sample size of random variable and the importance level of each evolving B cell, but also ensure that such B cell is evaluated with low computational cost; the third makes diverse B cells participate in evolution and suppresses the influence of noise; the last, which associates with the information on population diversity and fitness inheritance, creates diverse and high-affinity B cells. Under such approach, three similar immune algorithms are derived after selecting different mutation rules. The experiments, by comparison against two valuable genetic algorithms, have illustrated that these immune algorithms are competitive optimizers capable of effectively executing noisy compensation and searching for the desired optimal reliable solution.展开更多
Energy harvesting has been recognized as a promising technique with which to effectively reduce carbon emis-sions and electricity expenses of base stations.However,renewable energy is inherently stochastic and inter-m...Energy harvesting has been recognized as a promising technique with which to effectively reduce carbon emis-sions and electricity expenses of base stations.However,renewable energy is inherently stochastic and inter-mittent,imposing formidable challenges on reliably satisfying users'time-varying wireless traffic demands.In addition,the probability distribution of the renewable energy or users’wireless traffic demand is not always fully known in practice.In this paper,we minimize the total energy cost of a hybrid-energy-powered cellular network by jointly optimizing the energy sharing among base stations,the battery charging and discharging rates,and the energy purchased from the grid under the constraint of a limited battery size at each base station.In solving the formulated non-convex chance-constrained stochastic optimization problem,a new ambiguity set is built to characterize the uncertainties in the renewable energy and wireless traffic demands according to interval sets of the mean and covariance.Using this ambiguity set,the original optimization problem is transformed into a more tractable second-order cone programming problem by exploiting the distributionally robust optimization approach.Furthermore,a low-complexity distributionally robust chance-constrained energy management algo-rithm,which requires only interval sets of the mean and covariance of stochastic parameters,is proposed.The results of extensive simulation are presented to demonstrate that the proposed algorithm outperforms existing methods in terms of the computational complexity,energy cost,and reliability.展开更多
Multiple objective stochastic linear programming is a relevant topic. As a matter of fact, many practical problems ranging from portfolio selection to water resource management may be cast into this framework. Severe ...Multiple objective stochastic linear programming is a relevant topic. As a matter of fact, many practical problems ranging from portfolio selection to water resource management may be cast into this framework. Severe limitations on objectivity are encountered in this field because of the simultaneous presence of randomness and conflicting goals. In such a turbulent environment, the mainstay of rational choice cannot hold and it is virtually impossible to provide a truly scientific foundation for an optimal decision. In this paper, we resort to the bounded rationality principle to introduce satisfying solution for multiobjective stochastic linear programming problems. These solutions that are based on the chance-constrained paradigm are characterized under the assumption of normality of involved random variables. Ways for singling out such solutions are also discussed and a numerical example provided for the sake of illustration.展开更多
Geological surface modeling is typically based on seismic data, well data, and models of regional geology. However, structural interpretation of these data is error-prone, especially in the absence of structural morph...Geological surface modeling is typically based on seismic data, well data, and models of regional geology. However, structural interpretation of these data is error-prone, especially in the absence of structural morphology information, Existing geological surface models suffer from high levels of uncertainty, which exposes oil and gas exploration and development to additional risk. In this paper, we achieve a reconstruction of the uncertainties associated with a geological surface using chance-constrained programming based on multisource data. We also quantifi ed the uncertainty of the modeling data and added a disturbance term to the objective function. Finally, we verifi ed the applicability of the method using both synthetic and real fault data. We found that the reconstructed geological models met geological rules and reduced the reconstruction uncertainty.展开更多
A deterministic linear programming model which optimizes the abatement of each SO2 emission source, is extended into a CCP form by introducing equations of probabilistic constrained through the incorporation of uncert...A deterministic linear programming model which optimizes the abatement of each SO2 emission source, is extended into a CCP form by introducing equations of probabilistic constrained through the incorporation of uncertainty in the source-receptor-specific transfer coefficients. Based on the calculation of SO2 and sulfate average residence time for Liuzhou City, a sulfur deposition model has been developed and the distribution of transfer coefficients have been found to be approximately log-normal. Sulfur removal minimization of the model shows that the abatement of emission sources in the city is more effective, while control cost optimization provides the lowest cost programmes for source abatement at each allowable deposition limit under varied environmental risk levels. Finally a practicable programme is recommended.展开更多
Fuzzy C-means (FCM) is simple and widely used for complex data pattern recognition and image analyses. However, selecting an appropriate fuzzifier (m) is crucial in identifying an optimal number of patterns and achiev...Fuzzy C-means (FCM) is simple and widely used for complex data pattern recognition and image analyses. However, selecting an appropriate fuzzifier (m) is crucial in identifying an optimal number of patterns and achieving higher clustering accuracy, which few studies have investigated. Built upon two existing methods on selecting fuzzifier, we developed an integrated fuzzifier evaluation and selection algorithm and tested it using real datasets. Our findings indicate that the consistent optimal number of clusters can be learnt from testing different fuzzifiers for each dataset and the fuzzifier with the lowest value for this consistency should be selected for clustering. Our evaluation also shows that the fuzzifier impacts the clustering accuracy. For longitudinal data with missing values, m = 2 could be an empirical rule to start fuzzy clustering, and the best clustering accuracy was achieved for tested data, especially using our multiple-imputation based fuzzy clustering.展开更多
Multi-view clustering is a critical research area in computer science aimed at effectively extracting meaningful patterns from complex,high-dimensional data that single-view methods cannot capture.Traditional fuzzy cl...Multi-view clustering is a critical research area in computer science aimed at effectively extracting meaningful patterns from complex,high-dimensional data that single-view methods cannot capture.Traditional fuzzy clustering techniques,such as Fuzzy C-Means(FCM),face significant challenges in handling uncertainty and the dependencies between different views.To overcome these limitations,we introduce a new multi-view fuzzy clustering approach that integrates picture fuzzy sets with a dual-anchor graph method for multi-view data,aiming to enhance clustering accuracy and robustness,termed Multi-view Picture Fuzzy Clustering(MPFC).In particular,the picture fuzzy set theory extends the capability to represent uncertainty by modeling three membership levels:membership degrees,neutral degrees,and refusal degrees.This allows for a more flexible representation of uncertain and conflicting data than traditional fuzzy models.Meanwhile,dual-anchor graphs exploit the similarity relationships between data points and integrate information across views.This combination improves stability,scalability,and robustness when handling noisy and heterogeneous data.Experimental results on several benchmark datasets demonstrate significant improvements in clustering accuracy and efficiency,outperforming traditional methods.Specifically,the MPFC algorithm demonstrates outstanding clustering performance on a variety of datasets,attaining a Purity(PUR)score of 0.6440 and an Accuracy(ACC)score of 0.6213 for the 3 Sources dataset,underscoring its robustness and efficiency.The proposed approach significantly contributes to fields such as pattern recognition,multi-view relational data analysis,and large-scale clustering problems.Future work will focus on extending the method for semi-supervised multi-view clustering,aiming to enhance adaptability,scalability,and performance in real-world applications.展开更多
The fuzzy comfortability of a wind-sensitive super-high tower crane is critical to guarantee occupant health and improve construction efficiency.Therefore,the wind-resistant fuzzy comfortability of a super-high tower ...The fuzzy comfortability of a wind-sensitive super-high tower crane is critical to guarantee occupant health and improve construction efficiency.Therefore,the wind-resistant fuzzy comfortability of a super-high tower crane in the Ma’anshan Yangtze River(MYR)Bridge site is analyzed in this paper.First,the membership function model that represents fuzzy comfortability is introduced in the probability density evolution method(PDEM).Second,based on Fechner’s law,the membership function curves are constructed according to three acceleration thresholds in ISO 2631.Then,the fuzzy comfortability for the super-high tower crane under stochastic wind loads is assessed on the basis of different cut-set levelsλ.Results show that the comfortability is over 0.9 under the required maximum operating wind velocity.The low sensitivity toλcan be observed in the reliability curves of ISOⅡandⅢmembership functions.The reliability of the ISOⅠmembership function is not sensitive toλwhenλ<0.7,whereas it becomes sensitive toλwhenλ>0.7.展开更多
基金supported by National High Technology Research and Development Program of China(863 Program)(No.2007AA041603)National Natural Science Foundation of China(No.60475035)+2 种基金Key Technologies Research and Development Program Foundation of Hunan Province of China(No.2007FJ1806)Science and Technology Research Plan of National University of Defense Technology(No.CX07-03-01)Top Class Graduate Student Innovation Sustentation Fund of National University of Defense Technology(No.B070302.)
文摘This paper proposes an adaptive chaos quantum honey bee algorithm(CQHBA)for solving chance-constrained program-ming in random fuzzy environment based on random fuzzy simulations.Random fuzzy simulation is designed to estimate the chance of a random fuzzy event and the optimistic value to a random fuzzy variable.In CQHBA,each bee carries a group of quantum bits representing a solution.Chaos optimization searches space around the selected best-so-far food source.In the marriage process,random interferential discrete quantum crossover is done between selected drones and the queen.Gaussian quantum mutation is used to keep the diversity of whole population.New methods of computing quantum rotation angles are designed based on grads.A proof of con-vergence for CQHBA is developed and a theoretical analysis of the computational overhead for the algorithm is presented.Numerical examples are presented to demonstrate its superiority in robustness and stability,efficiency of computational complexity,success rate,and accuracy of solution quality.CQHBA is manifested to be highly robust under various conditions and capable of handling most random fuzzy programmings with any parameter settings,variable initializations,system tolerance and confidence level,perturbations,and noises.
基金supported in part by National Natural Science Foundation of China(Nos.61563009 and 61065010)Doctoral Fund of Ministry of Education of China(No.20125201110003)
文摘This work investigates a simple and practical bio-immune optimization approach to solve a kind of chance-constrained programming problem without known noisy attributes, after probing into a lower bound estimate of sample size for any random variable. Such approach mainly consists of sample allocation, evaluation, proliferation and mutation. The former two, depending on a lower bound estimate acquired, not only decide the sample size of random variable and the importance level of each evolving B cell, but also ensure that such B cell is evaluated with low computational cost; the third makes diverse B cells participate in evolution and suppresses the influence of noise; the last, which associates with the information on population diversity and fitness inheritance, creates diverse and high-affinity B cells. Under such approach, three similar immune algorithms are derived after selecting different mutation rules. The experiments, by comparison against two valuable genetic algorithms, have illustrated that these immune algorithms are competitive optimizers capable of effectively executing noisy compensation and searching for the desired optimal reliable solution.
基金supported in part by the National Natural Science Foundation of China under grants 61971080,61901367in part by the Natural Science Foundation of Shaanxi Province under grant 2020JQ-844in part by the open-end fund of the Engineering Research Center of Intelligent Air-ground Integrated Vehicle and Traffic Control(ZNKD2021-001)。
文摘Energy harvesting has been recognized as a promising technique with which to effectively reduce carbon emis-sions and electricity expenses of base stations.However,renewable energy is inherently stochastic and inter-mittent,imposing formidable challenges on reliably satisfying users'time-varying wireless traffic demands.In addition,the probability distribution of the renewable energy or users’wireless traffic demand is not always fully known in practice.In this paper,we minimize the total energy cost of a hybrid-energy-powered cellular network by jointly optimizing the energy sharing among base stations,the battery charging and discharging rates,and the energy purchased from the grid under the constraint of a limited battery size at each base station.In solving the formulated non-convex chance-constrained stochastic optimization problem,a new ambiguity set is built to characterize the uncertainties in the renewable energy and wireless traffic demands according to interval sets of the mean and covariance.Using this ambiguity set,the original optimization problem is transformed into a more tractable second-order cone programming problem by exploiting the distributionally robust optimization approach.Furthermore,a low-complexity distributionally robust chance-constrained energy management algo-rithm,which requires only interval sets of the mean and covariance of stochastic parameters,is proposed.The results of extensive simulation are presented to demonstrate that the proposed algorithm outperforms existing methods in terms of the computational complexity,energy cost,and reliability.
文摘Multiple objective stochastic linear programming is a relevant topic. As a matter of fact, many practical problems ranging from portfolio selection to water resource management may be cast into this framework. Severe limitations on objectivity are encountered in this field because of the simultaneous presence of randomness and conflicting goals. In such a turbulent environment, the mainstay of rational choice cannot hold and it is virtually impossible to provide a truly scientific foundation for an optimal decision. In this paper, we resort to the bounded rationality principle to introduce satisfying solution for multiobjective stochastic linear programming problems. These solutions that are based on the chance-constrained paradigm are characterized under the assumption of normality of involved random variables. Ways for singling out such solutions are also discussed and a numerical example provided for the sake of illustration.
基金by National Science and Technology Major Project(Grant No.2017ZX05018004004)the National Natural Science Foundation of China (No.U1562218 & 41604107).
文摘Geological surface modeling is typically based on seismic data, well data, and models of regional geology. However, structural interpretation of these data is error-prone, especially in the absence of structural morphology information, Existing geological surface models suffer from high levels of uncertainty, which exposes oil and gas exploration and development to additional risk. In this paper, we achieve a reconstruction of the uncertainties associated with a geological surface using chance-constrained programming based on multisource data. We also quantifi ed the uncertainty of the modeling data and added a disturbance term to the objective function. Finally, we verifi ed the applicability of the method using both synthetic and real fault data. We found that the reconstructed geological models met geological rules and reduced the reconstruction uncertainty.
文摘A deterministic linear programming model which optimizes the abatement of each SO2 emission source, is extended into a CCP form by introducing equations of probabilistic constrained through the incorporation of uncertainty in the source-receptor-specific transfer coefficients. Based on the calculation of SO2 and sulfate average residence time for Liuzhou City, a sulfur deposition model has been developed and the distribution of transfer coefficients have been found to be approximately log-normal. Sulfur removal minimization of the model shows that the abatement of emission sources in the city is more effective, while control cost optimization provides the lowest cost programmes for source abatement at each allowable deposition limit under varied environmental risk levels. Finally a practicable programme is recommended.
文摘Fuzzy C-means (FCM) is simple and widely used for complex data pattern recognition and image analyses. However, selecting an appropriate fuzzifier (m) is crucial in identifying an optimal number of patterns and achieving higher clustering accuracy, which few studies have investigated. Built upon two existing methods on selecting fuzzifier, we developed an integrated fuzzifier evaluation and selection algorithm and tested it using real datasets. Our findings indicate that the consistent optimal number of clusters can be learnt from testing different fuzzifiers for each dataset and the fuzzifier with the lowest value for this consistency should be selected for clustering. Our evaluation also shows that the fuzzifier impacts the clustering accuracy. For longitudinal data with missing values, m = 2 could be an empirical rule to start fuzzy clustering, and the best clustering accuracy was achieved for tested data, especially using our multiple-imputation based fuzzy clustering.
基金funded by the Research Project:THTETN.05/24-25,VietnamAcademy of Science and Technology.
文摘Multi-view clustering is a critical research area in computer science aimed at effectively extracting meaningful patterns from complex,high-dimensional data that single-view methods cannot capture.Traditional fuzzy clustering techniques,such as Fuzzy C-Means(FCM),face significant challenges in handling uncertainty and the dependencies between different views.To overcome these limitations,we introduce a new multi-view fuzzy clustering approach that integrates picture fuzzy sets with a dual-anchor graph method for multi-view data,aiming to enhance clustering accuracy and robustness,termed Multi-view Picture Fuzzy Clustering(MPFC).In particular,the picture fuzzy set theory extends the capability to represent uncertainty by modeling three membership levels:membership degrees,neutral degrees,and refusal degrees.This allows for a more flexible representation of uncertain and conflicting data than traditional fuzzy models.Meanwhile,dual-anchor graphs exploit the similarity relationships between data points and integrate information across views.This combination improves stability,scalability,and robustness when handling noisy and heterogeneous data.Experimental results on several benchmark datasets demonstrate significant improvements in clustering accuracy and efficiency,outperforming traditional methods.Specifically,the MPFC algorithm demonstrates outstanding clustering performance on a variety of datasets,attaining a Purity(PUR)score of 0.6440 and an Accuracy(ACC)score of 0.6213 for the 3 Sources dataset,underscoring its robustness and efficiency.The proposed approach significantly contributes to fields such as pattern recognition,multi-view relational data analysis,and large-scale clustering problems.Future work will focus on extending the method for semi-supervised multi-view clustering,aiming to enhance adaptability,scalability,and performance in real-world applications.
基金The National Natural Science Foundation of China(No.52108274,52208481,52338011)State Scholarship Fund of China Scholarship Council(No.202306090285).
文摘The fuzzy comfortability of a wind-sensitive super-high tower crane is critical to guarantee occupant health and improve construction efficiency.Therefore,the wind-resistant fuzzy comfortability of a super-high tower crane in the Ma’anshan Yangtze River(MYR)Bridge site is analyzed in this paper.First,the membership function model that represents fuzzy comfortability is introduced in the probability density evolution method(PDEM).Second,based on Fechner’s law,the membership function curves are constructed according to three acceleration thresholds in ISO 2631.Then,the fuzzy comfortability for the super-high tower crane under stochastic wind loads is assessed on the basis of different cut-set levelsλ.Results show that the comfortability is over 0.9 under the required maximum operating wind velocity.The low sensitivity toλcan be observed in the reliability curves of ISOⅡandⅢmembership functions.The reliability of the ISOⅠmembership function is not sensitive toλwhenλ<0.7,whereas it becomes sensitive toλwhenλ>0.7.
