An improved estimation of distribution algorithm(IEDA)is proposed in this paper for efficient design of metamaterial absorbers.This algorithm establishes a probability model through the selected dominant groups and sa...An improved estimation of distribution algorithm(IEDA)is proposed in this paper for efficient design of metamaterial absorbers.This algorithm establishes a probability model through the selected dominant groups and samples from the model to obtain the next generation,avoiding the problem of building-blocks destruction caused by crossover and mutation.Neighboring search from artificial bee colony algorithm(ABCA)is introduced to enhance the local optimization ability and improved to raise the speed of convergence.The probability model is modified by boundary correction and loss correction to enhance the robustness of the algorithm.The proposed IEDA is compared with other intelligent algorithms in relevant references.The results show that the proposed IEDA has faster convergence speed and stronger optimization ability,proving the feasibility and effectiveness of the algorithm.展开更多
In order to improve the efficiency of operating rooms,reduce the costs for hospitals and improve the level of service qualities, a scheduling method was developed based on an estimation of distribution algorithm（ EDA...In order to improve the efficiency of operating rooms,reduce the costs for hospitals and improve the level of service qualities, a scheduling method was developed based on an estimation of distribution algorithm（ EDA）. First, a scheduling problem domain is described. Based on assignment constraints and resource capacity constraints, the mathematical programming models are set up with an objective function to minimize the system makespan. On the basis of the descriptions mentioned above, a solution policy of generating feasible scheduling solutions is established. Combined with the specific constraints of operating theatres, the EDA-based algorithm is put forward to solve scheduling problems. Finally, simulation experiments are designed to evaluate the scheduling method. The orthogonal table is chosen to determine the parameters in the proposed method. Then the genetic algorithm and the particle swarm optimization algorithm are chosen for comparison with the EDA-based algorithm, and the results indicate that the proposed method can decrease the makespan of the surgical system regardless of the size of operations. Moreover, the computation time of the EDA-based algorithm is only approximately 5 s when solving the large scale problems, which means that the proposed algorithm is suitable for carrying out an on-line scheduling optimization of the patients.展开更多
A transonic airfoil designed by means of classical point-optimization may result in its dramatically inferior performance under off-design conditions. To overcome this shortcoming, robust design is proposed to find ou...A transonic airfoil designed by means of classical point-optimization may result in its dramatically inferior performance under off-design conditions. To overcome this shortcoming, robust design is proposed to find out the optimal profile of an airfoil to maintain its performance in an uncertain environment. The robust airfoil optimization is aimed to minimize mean values and variances of drag coefficients while satisfying the lift and thickness constraints over a range of Mach numbers. A multi-objective estimation of distribution algorithm is applied to the robust airfoil optimization on the base of the RAE2822 benchmark airfoil. The shape of the airfoil is obtained through superposing ten Hick-Henne shape functions upon the benchmark airfoil. A set of design points is selected according to a uniform design table for aerodynamic evaluation. A Kriging model of drag coefficient is constructed with those points to reduce computing costs. Over the Mach range from 0.7 to 0.8, the airfoil generated by the robust optimization has a configuration characterized by supercritical airfoil with low drag coefficients. The small fluctuation in its drag coefficients means that the performance of the robust airfoil is insensitive to variation of Mach number.展开更多
Compared with single-domain unmanned swarms,cross-domain unmanned swarms continue to face new challenges in terms of platform performance and constraints.In this paper,a joint unmanned swarm target assignment and miss...Compared with single-domain unmanned swarms,cross-domain unmanned swarms continue to face new challenges in terms of platform performance and constraints.In this paper,a joint unmanned swarm target assignment and mission trajectory planning method is proposed to meet the requirements of cross-domain unmanned swarm mission planning.Firstly,the different performances of cross-domain heterogeneous platforms and mission requirements of targets are characterised by using a collection of operational resources.Secondly,an algorithmic framework for joint target assignment and mission trajectory planning is proposed,in which the initial planning of the trajectory is performed in the target assignment phase,while the trajectory is further optimised afterwards.Next,the estimation of the distribution algorithms is combined with the genetic algorithm to solve the objective function.Finally,the algorithm is numerically simulated by specific cases.Simulation results indicate that the proposed algorithm can perform effective task assignment and trajectory planning for cross-domain unmanned swarms.Furthermore,the solution performance of the hybrid estimation of distribution algorithm(EDA)-genetic algorithm(GA)algorithm is better than that of GA and EDA.展开更多
This paper presents an all-parametric model of radar target in optic region, in which the localized scattering center's frequency and aspect angle dependent scattering level, distance and azimuth locations are mod...This paper presents an all-parametric model of radar target in optic region, in which the localized scattering center's frequency and aspect angle dependent scattering level, distance and azimuth locations are modeled as the feature vectors. And the traditional TLS-Prony algorithm is modified to extract these feature vectors. The analysis of Cramer-Rao bound shows that the modified algorithm not only improves the restriction of high signal-to-noise ratio(SNR)threshold of traditional TLS-Prony algorithm, but also is suitable to the extraction of big damped coefficients and high-resolution estimation of near separation poles. Finally, an illustrative example is presented to verify its practicability in the applications. The experimental results show that the method developed can not only recognize two airplane-like targets with similar shape at low SNR, but also compress the original radar data with high fidelity.展开更多
Focused crawling is an important technique for topical resource discovery on the Web.The key issue in focused crawling is to prioritize uncrawled uniform resource locators(URLs) in the frontier to focus the crawling o...Focused crawling is an important technique for topical resource discovery on the Web.The key issue in focused crawling is to prioritize uncrawled uniform resource locators(URLs) in the frontier to focus the crawling on relevant pages.Traditional focused crawlers mainly rely on content analysis.Link-based techniques are not effectively exploited despite their usefulness.In this paper,we propose a new frontier prioritizing algorithm,namely the on-line topical importance estimation(OTIE) algorithm.OTIE combines link-and content-based analysis to evaluate the priority of an uncrawled URL in the frontier.We performed real crawling experiments over 30 topics selected from the Open Directory Project(ODP) and compared harvest rate and target recall of the four crawling algorithms:breadth-first,link-context-prediction,on-line page importance computation(OPIC) and our OTIE.Experimental results showed that OTIE significantly outperforms the other three algorithms on the average target recall while maintaining an acceptable harvest rate.Moreover,OTIE is much faster than the traditional focused crawling algorithm.展开更多
The artificial bee colony （ABC） algorithm is a com- petitive stochastic population-based optimization algorithm. How- ever, the ABC algorithm does not use the social information and lacks the knowledge of the proble...The artificial bee colony （ABC） algorithm is a com- petitive stochastic population-based optimization algorithm. How- ever, the ABC algorithm does not use the social information and lacks the knowledge of the problem structure, which leads to in- sufficiency in both convergent speed and searching precision. Archimedean copula estimation of distribution algorithm （ACEDA） is a relatively simple, time-economic and multivariate correlated EDA. This paper proposes a novel hybrid algorithm based on the ABC algorithm and ACEDA called Archimedean copula estima- tion of distribution based on the artificial bee colony （ACABC） algorithm. The hybrid algorithm utilizes ACEDA to estimate the distribution model and then uses the information to help artificial bees to search more efficiently in the search space. Six bench- mark functions are introduced to assess the performance of the ACABC algorithm on numerical function optimization. Experimen- tal results show that the ACABC algorithm converges much faster with greater precision compared with the ABC algorithm, ACEDA and the global best （gbest）-guided ABC （GABC） algorithm in most of the experiments.展开更多
The multi-compartment electric vehicle routing problem(EVRP)with soft time window and multiple charging types(MCEVRP-STW&MCT)is studied,in which electric multi-compartment vehicles that are environmentally friendl...The multi-compartment electric vehicle routing problem(EVRP)with soft time window and multiple charging types(MCEVRP-STW&MCT)is studied,in which electric multi-compartment vehicles that are environmentally friendly but need to be recharged in course of transport process,are employed.A mathematical model for this optimization problem is established with the objective of minimizing the function composed of vehicle cost,distribution cost,time window penalty cost and charging service cost.To solve the problem,an estimation of the distribution algorithm based on Lévy flight(EDA-LF)is proposed to perform a local search at each iteration to prevent the algorithm from falling into local optimum.Experimental results demonstrate that the EDA-LF algorithm can find better solutions and has stronger robustness than the basic EDA algorithm.In addition,when comparing with existing algorithms,the result shows that the EDA-LF can often get better solutions in a relatively short time when solving medium and large-scale instances.Further experiments show that using electric multi-compartment vehicles to deliver incompatible products can produce better results than using traditional fuel vehicles.展开更多
This paper summaries our recent work on combining estimation of distribution algorithms （EDA） and other techniques for solving hard search and optimization problems： a） guided mutation, an offspring generator in w...This paper summaries our recent work on combining estimation of distribution algorithms （EDA） and other techniques for solving hard search and optimization problems： a） guided mutation, an offspring generator in which the ideas from EDAs and genetic algorithms are combined together, we have shown that an evolutionary algorithm with guided mutation outperforms the best GA for the maximum clique problem, b） evolutionary algorithms refining a heuristic, we advocate a strategy for solving a hard optimization problem with complicated data structure, and c） combination of two different local search techniques and EDA for numerical global optimization problems, its basic idea is that not all the new generated points are needed to be improved by an expensive local search.展开更多
In order to reduce the computation of complex problems, a new surrogate-assisted estimation of distribution algorithm with Gaussian process was proposed. Coevolution was used in dual populations which evolved in paral...In order to reduce the computation of complex problems, a new surrogate-assisted estimation of distribution algorithm with Gaussian process was proposed. Coevolution was used in dual populations which evolved in parallel. The search space was projected into multiple subspaces and searched by sub-populations. Also, the whole space was exploited by the other population which exchanges information with the sub-populations. In order to make the evolutionary course efficient, multivariate Gaussian model and Gaussian mixture model were used in both populations separately to estimate the distribution of individuals and reproduce new generations. For the surrogate model, Gaussian process was combined with the algorithm which predicted variance of the predictions. The results on six benchmark functions show that the new algorithm performs better than other surrogate-model based algorithms and the computation complexity is only 10% of the original estimation of distribution algorithm.展开更多
A novel estimation algorithm is introduced to handle the popular undersea problem called torpedo tracking with angle-only measurements with a better approach compared to the existing filters. The new algorithm produce...A novel estimation algorithm is introduced to handle the popular undersea problem called torpedo tracking with angle-only measurements with a better approach compared to the existing filters. The new algorithm produces a better estimate from the outputs produced by the traditional nonlinear approaches with the assistance of simple noise minimizers like maximum likelihood filter or any other algorithm which belongs to their family. The introduced method is extended to the higher version in two ways. The first approach extracts a better estimate and covariance by enhancing the count of the intermediate filters, while the second approach accepts more inputs so as to attain improved performance without enhancement of the intermediate filter count. The ideal choice of the placement of towed array sensors to improve the performance of the proposed method further is suggested as the one where the line of sight and the towed array are perpendicular. The results could get even better by moving the ownship in the direction of reducing range. All the results are verified in the MATLAB environment.展开更多
The hybrid flow shop scheduling problem with unrelated parallel machine is a typical NP-hard combinatorial optimization problem, and it exists widely in chemical, manufacturing and pharmaceutical industry. In this wor...The hybrid flow shop scheduling problem with unrelated parallel machine is a typical NP-hard combinatorial optimization problem, and it exists widely in chemical, manufacturing and pharmaceutical industry. In this work, a novel mathematic model for the hybrid flow shop scheduling problem with unrelated parallel machine(HFSPUPM) was proposed. Additionally, an effective hybrid estimation of distribution algorithm was proposed to solve the HFSPUPM, taking advantage of the features in the mathematic model. In the optimization algorithm, a new individual representation method was adopted. The(EDA) structure was used for global search while the teaching learning based optimization(TLBO) strategy was used for local search. Based on the structure of the HFSPUPM, this work presents a series of discrete operations. Simulation results show the effectiveness of the proposed hybrid algorithm compared with other algorithms.展开更多
Underwater sensor network can achieve the unmanned environmental monitoring and military monitoring missions.Underwater acoustic sensor node cannot rely on the GPS to position itself,and the traditional indirect posit...Underwater sensor network can achieve the unmanned environmental monitoring and military monitoring missions.Underwater acoustic sensor node cannot rely on the GPS to position itself,and the traditional indirect positioning methods used in Ad Hoc networks are not fully applicable to the localization of underwater acoustic sensor networks.In this paper,we introduce an improved underwater acoustic network localization algorithm.The algorithm processes the raw data before localization calculation to enhance the tolerance of random noise.We reduce the redundancy of the calculation results by using a more accurate basic algorithm and an adjusted calculation strategy.The improved algorithm is more suitable for the underwater acoustic sensor network positioning.展开更多
Internal temperature is crucial to plant growth in the greenhouse. We investigated the patterns of constructing and managing greenhouses in Chongqing, and developed an algorithm of heating temperature for closed winte...Internal temperature is crucial to plant growth in the greenhouse. We investigated the patterns of constructing and managing greenhouses in Chongqing, and developed an algorithm of heating temperature for closed winter plastic greenhouses under the conditions of no man-made illumination, no ventilation and hot wind machine as the heating equipment, which are the most adopted pattern of greenhouses in Chongqing area. The algorithm includes two functions of temperature outside the greenhouse, which calculate the values of the warming estimation coefficient (WEC) and the gap between temperatures inside and outside the greenhouse with the measured data of outside temperature, and then give the value of internal temperature; the heat rating of heating facilities required by a greenhouse can be determined by this algorithm with given values of floor area and internal temperature, measured outside temperature and calculated WEC. Verification of the algorithm demonstrates a desirable accuracy of estimation. Algorithms of computing heating temperature for greenhouses of different constructing and managing patterns and in different geographic conditions can also be derived in a similar way. This research presents a paradigm for developing a feasible method to fit out greenhouses with appropriate heating facilities, aiming at energy efficient and cost efficient production.展开更多
In order to improve the scheduling efficiency of photolithography,bottleneck process of wafer fabrications in the semiconductor industry,an effective estimation of distribution algorithm is proposed for scheduling pro...In order to improve the scheduling efficiency of photolithography,bottleneck process of wafer fabrications in the semiconductor industry,an effective estimation of distribution algorithm is proposed for scheduling problems of parallel litho machines with reticle constraints,where multiple reticles are available for each reticle type.First,the scheduling problem domain of parallel litho machines is described with reticle constraints and mathematical programming formulations are put forward with the objective of minimizing total weighted completion time.Second,estimation of distribution algorithm is developed with a decoding scheme specially designed to deal with the reticle constraints.Third,an insert-based local search with the first move strategy is introduced to enhance the local exploitation ability of the algorithm.Finally,simulation experiments and analysis demonstrate the effectiveness of the proposed algorithm.展开更多
Discrete choice models are widely used in multiple sectors such as transportation, health, energy, and marketing, etc., where the model estimation is usually carried out by using commercial software. Nonetheless, tail...Discrete choice models are widely used in multiple sectors such as transportation, health, energy, and marketing, etc., where the model estimation is usually carried out by using commercial software. Nonetheless, tailored computer codes offer modellers greater flexibility and control of unique modelling situation. Aligned with empirically tailored computing environment, this research discusses the relative performance of six different algorithms of a discrete choice model using three key performance measures： convergence time, number of iterations, and iteration time. The computer codes are developed by using Visual Basic Application （VBA）. Maximum likelihood function （MLF） is formulated and the mathematical relationships of gradient and Hessian matrix are analytically derived to carry out the estimation process. The estimated parameter values clearly suggest that convergence criterion and initial guessing of parameters are the two critical factors in determining the overall estimation performance of a custom-built discrete choice model.展开更多
This paper proposes a self-position estimate algorithm for the multiple mobile robots; each robot uses two omnidirectional cameras and an accelerometer. In recent years, the Great East Japan Earthquake and large-scale...This paper proposes a self-position estimate algorithm for the multiple mobile robots; each robot uses two omnidirectional cameras and an accelerometer. In recent years, the Great East Japan Earthquake and large-scale disasters have occurred frequently in Japan. From this, development of the searching robot which supports the rescue team to perform a relief activity at a large-scale disaster is indispensable. Then, this research has developed the searching robot group system with two or more mobile robots. In this research, the searching robot equips with two omnidirectional cameras and an accelerometer. In order to perform distance measurement using two omnidirectional cameras, each parameter of an omnidirectional camera and the position and posture between two omnidirectional cameras have to be calibrated in advance. If there are few mobile robots, the calibration time of each omnidirectional camera does not pose a problem. However, if the calibration is separately performed when using two or more robots in a disaster site, etc., it will take huge calibration time. Then, this paper proposed the algorithm which estimates a mobile robot＇s position and the parameter of the position and posture between two omnidirectional cameras simultaneously. The algorithm proposed in this paper extended Nonlinear Transformation （NLT） Method. This paper conducted the simulation experiment to check the validity of the proposed algorithm. In some simulation experiments, one mobile robot moves and observes the circumference of another mobile robot which has stopped at a certain place. This paper verified whether the mobile robot can estimate position using the measurement value when the number of observation times becomes 10 times in n/18 of observation intervals. The result of the simulation shows the effectiveness of the algorithm.展开更多
Real-time and accurate fault detection is essential to enhance the aircraft navigation system’s reliability and safety. The existent detection methods based on analytical model draws back at simultaneously detecting ...Real-time and accurate fault detection is essential to enhance the aircraft navigation system’s reliability and safety. The existent detection methods based on analytical model draws back at simultaneously detecting gradual and sudden faults. On account of this reason, we propose an online detection solution based on non-analytical model. In this article, the navigation system fault detection model is established based on belief rule base （BRB）, where the system measuring residual and its changing rate are used as the inputs of BRB model and the fault detection function as the output. To overcome the drawbacks of current parameter optimization algorithms for BRB and achieve online update, a parameter recursive estimation algorithm is presented for online BRB detection model based on expectation maximization （EM） algorithm. Furthermore, the proposed method is verified by navigation experiment. Experimental results show that the proposed method is able to effectively realize online parameter evaluation in navigation system fault detection model. The output of the detection model can track the fault state very well, and the faults can be diagnosed in real time and accurately. In addition, the detection ability, especially in the probability of false detection, is superior to offline optimization method, and thus the system reliability has great improvement.展开更多
This paper presents a Markov random field （MRP） approach to estimating and sampling the probability distribution in populations of solutions. The approach is used to define a class of algorithms under the general he...This paper presents a Markov random field （MRP） approach to estimating and sampling the probability distribution in populations of solutions. The approach is used to define a class of algorithms under the general heading distribution estimation using Markov random fields （DEUM）. DEUM is a subclass of estimation of distribution algorithms （EDAs） where interaction between solution variables is represented as an undirected graph and the joint probability of a solution is factorized as a Gibbs distribution derived from the structure of the graph. The focus of this paper will be on describing the three main characteristics of DEUM framework, which distinguishes it from the traditional EDA. They are： 1） use of MRF models, 2） fitness modeling approach to estimating the parameter of the model and 3） Monte Carlo approach to sampling from the model.展开更多
Based on the major gene and polygene mixed inheritance model for multiple correlated quantitative traits, the authors proposed a new joint segregation analysis method of major gene controlling multiple correlated quan...Based on the major gene and polygene mixed inheritance model for multiple correlated quantitative traits, the authors proposed a new joint segregation analysis method of major gene controlling multiple correlated quantitative traits, which include major gene detection and its effect and variation estimation. The effect and variation of major gene are estimated by the maximum likelihood method implemented via expectation-maximization （EM） algorithm. Major gene is tested with the likelihood ratio （LR） test statistic. Extensive simulation studies showed that joint analysis not only increases the statistical power of major gene detection but also improves the precision and accuracy of major gene effect estimates. An example of the plant height and the number of tiller of F2 population in rice cross Duonieai x Zhonghua 11 was used in the illustration. The results indicated that the genetic difference of these two traits in this cross refers to only one pleiotropic major gene. The additive effect and dominance effect of the major gene are estimated as -21.3 and 40.6 cm on plant height, and 22.7 and -25.3 on number of tiller, respectively. The major gene shows overdominance for plant height and close to complete dominance for number of tillers.展开更多
基金supported by the National Key Research and Development Program(2021YFB3502500).
文摘An improved estimation of distribution algorithm(IEDA)is proposed in this paper for efficient design of metamaterial absorbers.This algorithm establishes a probability model through the selected dominant groups and samples from the model to obtain the next generation,avoiding the problem of building-blocks destruction caused by crossover and mutation.Neighboring search from artificial bee colony algorithm(ABCA)is introduced to enhance the local optimization ability and improved to raise the speed of convergence.The probability model is modified by boundary correction and loss correction to enhance the robustness of the algorithm.The proposed IEDA is compared with other intelligent algorithms in relevant references.The results show that the proposed IEDA has faster convergence speed and stronger optimization ability,proving the feasibility and effectiveness of the algorithm.
基金The National Natural Science Foundation of China(No.61273035,71471135)
文摘In order to improve the efficiency of operating rooms,reduce the costs for hospitals and improve the level of service qualities, a scheduling method was developed based on an estimation of distribution algorithm（ EDA）. First, a scheduling problem domain is described. Based on assignment constraints and resource capacity constraints, the mathematical programming models are set up with an objective function to minimize the system makespan. On the basis of the descriptions mentioned above, a solution policy of generating feasible scheduling solutions is established. Combined with the specific constraints of operating theatres, the EDA-based algorithm is put forward to solve scheduling problems. Finally, simulation experiments are designed to evaluate the scheduling method. The orthogonal table is chosen to determine the parameters in the proposed method. Then the genetic algorithm and the particle swarm optimization algorithm are chosen for comparison with the EDA-based algorithm, and the results indicate that the proposed method can decrease the makespan of the surgical system regardless of the size of operations. Moreover, the computation time of the EDA-based algorithm is only approximately 5 s when solving the large scale problems, which means that the proposed algorithm is suitable for carrying out an on-line scheduling optimization of the patients.
基金National Natural Science Foundation of China (10377015)
文摘A transonic airfoil designed by means of classical point-optimization may result in its dramatically inferior performance under off-design conditions. To overcome this shortcoming, robust design is proposed to find out the optimal profile of an airfoil to maintain its performance in an uncertain environment. The robust airfoil optimization is aimed to minimize mean values and variances of drag coefficients while satisfying the lift and thickness constraints over a range of Mach numbers. A multi-objective estimation of distribution algorithm is applied to the robust airfoil optimization on the base of the RAE2822 benchmark airfoil. The shape of the airfoil is obtained through superposing ten Hick-Henne shape functions upon the benchmark airfoil. A set of design points is selected according to a uniform design table for aerodynamic evaluation. A Kriging model of drag coefficient is constructed with those points to reduce computing costs. Over the Mach range from 0.7 to 0.8, the airfoil generated by the robust optimization has a configuration characterized by supercritical airfoil with low drag coefficients. The small fluctuation in its drag coefficients means that the performance of the robust airfoil is insensitive to variation of Mach number.
文摘Compared with single-domain unmanned swarms,cross-domain unmanned swarms continue to face new challenges in terms of platform performance and constraints.In this paper,a joint unmanned swarm target assignment and mission trajectory planning method is proposed to meet the requirements of cross-domain unmanned swarm mission planning.Firstly,the different performances of cross-domain heterogeneous platforms and mission requirements of targets are characterised by using a collection of operational resources.Secondly,an algorithmic framework for joint target assignment and mission trajectory planning is proposed,in which the initial planning of the trajectory is performed in the target assignment phase,while the trajectory is further optimised afterwards.Next,the estimation of the distribution algorithms is combined with the genetic algorithm to solve the objective function.Finally,the algorithm is numerically simulated by specific cases.Simulation results indicate that the proposed algorithm can perform effective task assignment and trajectory planning for cross-domain unmanned swarms.Furthermore,the solution performance of the hybrid estimation of distribution algorithm(EDA)-genetic algorithm(GA)algorithm is better than that of GA and EDA.
文摘This paper presents an all-parametric model of radar target in optic region, in which the localized scattering center's frequency and aspect angle dependent scattering level, distance and azimuth locations are modeled as the feature vectors. And the traditional TLS-Prony algorithm is modified to extract these feature vectors. The analysis of Cramer-Rao bound shows that the modified algorithm not only improves the restriction of high signal-to-noise ratio(SNR)threshold of traditional TLS-Prony algorithm, but also is suitable to the extraction of big damped coefficients and high-resolution estimation of near separation poles. Finally, an illustrative example is presented to verify its practicability in the applications. The experimental results show that the method developed can not only recognize two airplane-like targets with similar shape at low SNR, but also compress the original radar data with high fidelity.
基金Project (No.2007C23086) supported by the Science and Technology Plan of Zhejiang Province,China
文摘Focused crawling is an important technique for topical resource discovery on the Web.The key issue in focused crawling is to prioritize uncrawled uniform resource locators(URLs) in the frontier to focus the crawling on relevant pages.Traditional focused crawlers mainly rely on content analysis.Link-based techniques are not effectively exploited despite their usefulness.In this paper,we propose a new frontier prioritizing algorithm,namely the on-line topical importance estimation(OTIE) algorithm.OTIE combines link-and content-based analysis to evaluate the priority of an uncrawled URL in the frontier.We performed real crawling experiments over 30 topics selected from the Open Directory Project(ODP) and compared harvest rate and target recall of the four crawling algorithms:breadth-first,link-context-prediction,on-line page importance computation(OPIC) and our OTIE.Experimental results showed that OTIE significantly outperforms the other three algorithms on the average target recall while maintaining an acceptable harvest rate.Moreover,OTIE is much faster than the traditional focused crawling algorithm.
基金supported by the National Natural Science Foundation of China(61201370)the Special Funding Project for Independent Innovation Achievement Transform of Shandong Province(2012CX30202)the Natural Science Foundation of Shandong Province(ZR2014FM039)
文摘The artificial bee colony （ABC） algorithm is a com- petitive stochastic population-based optimization algorithm. How- ever, the ABC algorithm does not use the social information and lacks the knowledge of the problem structure, which leads to in- sufficiency in both convergent speed and searching precision. Archimedean copula estimation of distribution algorithm （ACEDA） is a relatively simple, time-economic and multivariate correlated EDA. This paper proposes a novel hybrid algorithm based on the ABC algorithm and ACEDA called Archimedean copula estima- tion of distribution based on the artificial bee colony （ACABC） algorithm. The hybrid algorithm utilizes ACEDA to estimate the distribution model and then uses the information to help artificial bees to search more efficiently in the search space. Six bench- mark functions are introduced to assess the performance of the ACABC algorithm on numerical function optimization. Experimen- tal results show that the ACABC algorithm converges much faster with greater precision compared with the ABC algorithm, ACEDA and the global best （gbest）-guided ABC （GABC） algorithm in most of the experiments.
基金supported by the National Natural Science Foundation of China(71571076)the National Key R&D Program for the 13th-Five-Year-Plan of China(2018YFF0300301).
文摘The multi-compartment electric vehicle routing problem(EVRP)with soft time window and multiple charging types(MCEVRP-STW&MCT)is studied,in which electric multi-compartment vehicles that are environmentally friendly but need to be recharged in course of transport process,are employed.A mathematical model for this optimization problem is established with the objective of minimizing the function composed of vehicle cost,distribution cost,time window penalty cost and charging service cost.To solve the problem,an estimation of the distribution algorithm based on Lévy flight(EDA-LF)is proposed to perform a local search at each iteration to prevent the algorithm from falling into local optimum.Experimental results demonstrate that the EDA-LF algorithm can find better solutions and has stronger robustness than the basic EDA algorithm.In addition,when comparing with existing algorithms,the result shows that the EDA-LF can often get better solutions in a relatively short time when solving medium and large-scale instances.Further experiments show that using electric multi-compartment vehicles to deliver incompatible products can produce better results than using traditional fuel vehicles.
文摘This paper summaries our recent work on combining estimation of distribution algorithms （EDA） and other techniques for solving hard search and optimization problems： a） guided mutation, an offspring generator in which the ideas from EDAs and genetic algorithms are combined together, we have shown that an evolutionary algorithm with guided mutation outperforms the best GA for the maximum clique problem, b） evolutionary algorithms refining a heuristic, we advocate a strategy for solving a hard optimization problem with complicated data structure, and c） combination of two different local search techniques and EDA for numerical global optimization problems, its basic idea is that not all the new generated points are needed to be improved by an expensive local search.
基金Project(2009CB320603)supported by the National Basic Research Program of ChinaProject(IRT0712)supported by Program for Changjiang Scholars and Innovative Research Team in University+1 种基金Project(B504)supported by the Shanghai Leading Academic Discipline ProgramProject(61174118)supported by the National Natural Science Foundation of China
文摘In order to reduce the computation of complex problems, a new surrogate-assisted estimation of distribution algorithm with Gaussian process was proposed. Coevolution was used in dual populations which evolved in parallel. The search space was projected into multiple subspaces and searched by sub-populations. Also, the whole space was exploited by the other population which exchanges information with the sub-populations. In order to make the evolutionary course efficient, multivariate Gaussian model and Gaussian mixture model were used in both populations separately to estimate the distribution of individuals and reproduce new generations. For the surrogate model, Gaussian process was combined with the algorithm which predicted variance of the predictions. The results on six benchmark functions show that the new algorithm performs better than other surrogate-model based algorithms and the computation complexity is only 10% of the original estimation of distribution algorithm.
文摘A novel estimation algorithm is introduced to handle the popular undersea problem called torpedo tracking with angle-only measurements with a better approach compared to the existing filters. The new algorithm produces a better estimate from the outputs produced by the traditional nonlinear approaches with the assistance of simple noise minimizers like maximum likelihood filter or any other algorithm which belongs to their family. The introduced method is extended to the higher version in two ways. The first approach extracts a better estimate and covariance by enhancing the count of the intermediate filters, while the second approach accepts more inputs so as to attain improved performance without enhancement of the intermediate filter count. The ideal choice of the placement of towed array sensors to improve the performance of the proposed method further is suggested as the one where the line of sight and the towed array are perpendicular. The results could get even better by moving the ownship in the direction of reducing range. All the results are verified in the MATLAB environment.
基金Projects(61573144,61773165,61673175,61174040)supported by the National Natural Science Foundation of ChinaProject(222201717006)supported by the Fundamental Research Funds for the Central Universities,China
文摘The hybrid flow shop scheduling problem with unrelated parallel machine is a typical NP-hard combinatorial optimization problem, and it exists widely in chemical, manufacturing and pharmaceutical industry. In this work, a novel mathematic model for the hybrid flow shop scheduling problem with unrelated parallel machine(HFSPUPM) was proposed. Additionally, an effective hybrid estimation of distribution algorithm was proposed to solve the HFSPUPM, taking advantage of the features in the mathematic model. In the optimization algorithm, a new individual representation method was adopted. The(EDA) structure was used for global search while the teaching learning based optimization(TLBO) strategy was used for local search. Based on the structure of the HFSPUPM, this work presents a series of discrete operations. Simulation results show the effectiveness of the proposed hybrid algorithm compared with other algorithms.
基金performed in the Project "The Research of Cluster Structure Based Underwater Acoustic Communication Network Topology Algorithm"supported by National Natural Science Foundation of China(No.61101164)
文摘Underwater sensor network can achieve the unmanned environmental monitoring and military monitoring missions.Underwater acoustic sensor node cannot rely on the GPS to position itself,and the traditional indirect positioning methods used in Ad Hoc networks are not fully applicable to the localization of underwater acoustic sensor networks.In this paper,we introduce an improved underwater acoustic network localization algorithm.The algorithm processes the raw data before localization calculation to enhance the tolerance of random noise.We reduce the redundancy of the calculation results by using a more accurate basic algorithm and an adjusted calculation strategy.The improved algorithm is more suitable for the underwater acoustic sensor network positioning.
基金a grant from the Major Programs of the Ministry of Science and Technology during the 10th Five-Year Plan Period from (2001BA04A)
文摘Internal temperature is crucial to plant growth in the greenhouse. We investigated the patterns of constructing and managing greenhouses in Chongqing, and developed an algorithm of heating temperature for closed winter plastic greenhouses under the conditions of no man-made illumination, no ventilation and hot wind machine as the heating equipment, which are the most adopted pattern of greenhouses in Chongqing area. The algorithm includes two functions of temperature outside the greenhouse, which calculate the values of the warming estimation coefficient (WEC) and the gap between temperatures inside and outside the greenhouse with the measured data of outside temperature, and then give the value of internal temperature; the heat rating of heating facilities required by a greenhouse can be determined by this algorithm with given values of floor area and internal temperature, measured outside temperature and calculated WEC. Verification of the algorithm demonstrates a desirable accuracy of estimation. Algorithms of computing heating temperature for greenhouses of different constructing and managing patterns and in different geographic conditions can also be derived in a similar way. This research presents a paradigm for developing a feasible method to fit out greenhouses with appropriate heating facilities, aiming at energy efficient and cost efficient production.
基金Supported by the National High Technology Research and Development Programme of China(No.2009AA043000)the National Natural Science Foundation of China(No.61273035,71471135)
文摘In order to improve the scheduling efficiency of photolithography,bottleneck process of wafer fabrications in the semiconductor industry,an effective estimation of distribution algorithm is proposed for scheduling problems of parallel litho machines with reticle constraints,where multiple reticles are available for each reticle type.First,the scheduling problem domain of parallel litho machines is described with reticle constraints and mathematical programming formulations are put forward with the objective of minimizing total weighted completion time.Second,estimation of distribution algorithm is developed with a decoding scheme specially designed to deal with the reticle constraints.Third,an insert-based local search with the first move strategy is introduced to enhance the local exploitation ability of the algorithm.Finally,simulation experiments and analysis demonstrate the effectiveness of the proposed algorithm.
文摘Discrete choice models are widely used in multiple sectors such as transportation, health, energy, and marketing, etc., where the model estimation is usually carried out by using commercial software. Nonetheless, tailored computer codes offer modellers greater flexibility and control of unique modelling situation. Aligned with empirically tailored computing environment, this research discusses the relative performance of six different algorithms of a discrete choice model using three key performance measures： convergence time, number of iterations, and iteration time. The computer codes are developed by using Visual Basic Application （VBA）. Maximum likelihood function （MLF） is formulated and the mathematical relationships of gradient and Hessian matrix are analytically derived to carry out the estimation process. The estimated parameter values clearly suggest that convergence criterion and initial guessing of parameters are the two critical factors in determining the overall estimation performance of a custom-built discrete choice model.
文摘This paper proposes a self-position estimate algorithm for the multiple mobile robots; each robot uses two omnidirectional cameras and an accelerometer. In recent years, the Great East Japan Earthquake and large-scale disasters have occurred frequently in Japan. From this, development of the searching robot which supports the rescue team to perform a relief activity at a large-scale disaster is indispensable. Then, this research has developed the searching robot group system with two or more mobile robots. In this research, the searching robot equips with two omnidirectional cameras and an accelerometer. In order to perform distance measurement using two omnidirectional cameras, each parameter of an omnidirectional camera and the position and posture between two omnidirectional cameras have to be calibrated in advance. If there are few mobile robots, the calibration time of each omnidirectional camera does not pose a problem. However, if the calibration is separately performed when using two or more robots in a disaster site, etc., it will take huge calibration time. Then, this paper proposed the algorithm which estimates a mobile robot＇s position and the parameter of the position and posture between two omnidirectional cameras simultaneously. The algorithm proposed in this paper extended Nonlinear Transformation （NLT） Method. This paper conducted the simulation experiment to check the validity of the proposed algorithm. In some simulation experiments, one mobile robot moves and observes the circumference of another mobile robot which has stopped at a certain place. This paper verified whether the mobile robot can estimate position using the measurement value when the number of observation times becomes 10 times in n/18 of observation intervals. The result of the simulation shows the effectiveness of the algorithm.
基金the National High-tech Research and Development Program of China(No.2011AA7053016)National Natural Science Foundation of China(No.61174030)
文摘Real-time and accurate fault detection is essential to enhance the aircraft navigation system’s reliability and safety. The existent detection methods based on analytical model draws back at simultaneously detecting gradual and sudden faults. On account of this reason, we propose an online detection solution based on non-analytical model. In this article, the navigation system fault detection model is established based on belief rule base （BRB）, where the system measuring residual and its changing rate are used as the inputs of BRB model and the fault detection function as the output. To overcome the drawbacks of current parameter optimization algorithms for BRB and achieve online update, a parameter recursive estimation algorithm is presented for online BRB detection model based on expectation maximization （EM） algorithm. Furthermore, the proposed method is verified by navigation experiment. Experimental results show that the proposed method is able to effectively realize online parameter evaluation in navigation system fault detection model. The output of the detection model can track the fault state very well, and the faults can be diagnosed in real time and accurately. In addition, the detection ability, especially in the probability of false detection, is superior to offline optimization method, and thus the system reliability has great improvement.
文摘This paper presents a Markov random field （MRP） approach to estimating and sampling the probability distribution in populations of solutions. The approach is used to define a class of algorithms under the general heading distribution estimation using Markov random fields （DEUM）. DEUM is a subclass of estimation of distribution algorithms （EDAs） where interaction between solution variables is represented as an undirected graph and the joint probability of a solution is factorized as a Gibbs distribution derived from the structure of the graph. The focus of this paper will be on describing the three main characteristics of DEUM framework, which distinguishes it from the traditional EDA. They are： 1） use of MRF models, 2） fitness modeling approach to estimating the parameter of the model and 3） Monte Carlo approach to sampling from the model.
基金This research was supported by the National Natural Science Foundation of China to Xu Chenwu （39900080, 30270724 and 30370758）.
文摘Based on the major gene and polygene mixed inheritance model for multiple correlated quantitative traits, the authors proposed a new joint segregation analysis method of major gene controlling multiple correlated quantitative traits, which include major gene detection and its effect and variation estimation. The effect and variation of major gene are estimated by the maximum likelihood method implemented via expectation-maximization （EM） algorithm. Major gene is tested with the likelihood ratio （LR） test statistic. Extensive simulation studies showed that joint analysis not only increases the statistical power of major gene detection but also improves the precision and accuracy of major gene effect estimates. An example of the plant height and the number of tiller of F2 population in rice cross Duonieai x Zhonghua 11 was used in the illustration. The results indicated that the genetic difference of these two traits in this cross refers to only one pleiotropic major gene. The additive effect and dominance effect of the major gene are estimated as -21.3 and 40.6 cm on plant height, and 22.7 and -25.3 on number of tiller, respectively. The major gene shows overdominance for plant height and close to complete dominance for number of tillers.
