Multi-group ant colony algorithm based on simulated annealing method

To overcome the default of single search tendency, the ants in the colony are divided into several sub-groups. The ants in different subgroups have different trail information and expectation coefficients. The simulated annealing method is introduced to the algorithm. Through setting the temperature changing with the iterations, after each turn of tours, the solution set obtained by the ants is taken as the candidate set. The update set is obtained by adding the solutions in the candidate set to the previous update set with the probability determined by the temperature. The solutions in the candidate set are used to update the trail information. In each turn of updating, the current best solution is also used to enhance the trail information on the current best route. The trail information is reset when the algorithm is in stagnation state. The computer experiments demonstrate that the proposed algorithm has higher stability and convergence speed.

Ranking important nodes in complex networks by simulated annealing

In this paper, based on simulated annealing a new method to rank important nodes in complex networks is presented.First, the concept of an importance sequence（IS） to describe the relative importance of nodes in complex networks is defined. Then, a measure used to evaluate the reasonability of an IS is designed. By comparing an IS and the measure of its reasonability to a state of complex networks and the energy of the state, respectively, the method finds the ground state of complex networks by simulated annealing. In other words, the method can construct a most reasonable IS. The results of experiments on real and artificial networks show that this ranking method not only is effective but also can be applied to different kinds of complex networks.

On the “Onion Husk” Algorithm for Approximate Solution of the Traveling Salesman Problem

The paper describes some implementation aspects of an algorithm for approximate solution of the traveling salesman problem based on the construction of convex closed contours on the initial set of points (“cities”) and their subsequent combination into a closed path (the so-called contour algorithm or “onion husk” algorithm). A number of heuristics related to the different stages of the algorithm are considered, and various variants of the algorithm based on these heuristics are analyzed. Sets of randomly generated points of different sizes (from 4 to 90 and from 500 to 10,000) were used to test the algorithms. The numerical results obtained are compared with the results of two well-known combinatorial optimization algorithms, namely the algorithm based on the branch and bound method and the simulated annealing algorithm. .

Optimization of Shanghai marine environment monitoring sites by integrating spatial correlation and stratified heterogeneity

The water quality grades of phosphate（PO4-P） and dissolved inorganic nitrogen（DIN） are integrated by spatial partitioning to fit the global and local semi-variograms of these nutrients. Leave-one-out cross validation is used to determine the statistical inference method. To minimize absolute average errors and error mean squares,stratified Kriging（SK） interpolation is applied to DIN and ordinary Kriging（OK） interpolation is applied to PO4-P.Ten percent of the sites is adjusted by considering their impact on the change in deviations in DIN and PO4-P interpolation and the resultant effect on areas with different water quality grades. Thus, seven redundant historical sites are removed. Seven historical sites are distributed in areas with water quality poorer than Grade IV at the north and south branches of the Changjiang（Yangtze River） Estuary and at the coastal region north of the Hangzhou Bay. Numerous sites are installed in these regions. The contents of various elements in the waters are not remarkably changed, and the waters are mixed well. Seven sites that have been optimized and removed are set to water with quality Grades III and IV. Optimization and adjustment of unrestricted areas show that the optimized and adjusted sites are mainly distributed in regions where the water quality grade undergoes transition.Therefore, key sites for adjustment and optimization are located at the boundaries of areas with different water quality grades and seawater.

Simulated annealing optimization and experiments of a five-bar aerating mechanism for vertically aerating on salt-affected lands

Current agronomic improving treatments for soil salinization are faced with challenges of heavy workload,high cost,etc.,which may seriously restrict agricultural productivity and sustainability on a large scale.Aerator has been applied to loosen soil and enhance soil permeability.In this research,aiming to realize vertically aerating,an aerator with a five-bar aerating mechanism was proposed to improve the aerating performance for saline-alkali land.The five-bar structure of aerating mechanism was designed based on analysis of the aerator on saline-alkali land.The kinematic model was established to describe the aerating process,and the key parameters of the aerating mechanism were obtained by satisfying the motion trajectory conditions.Subsequently,the related parameters were optimized by a simulated annealing method.Furthermore,numerical modeling was simulated to verify the perpendicularity performance after aerating head hitting into the soil.The simulation results indicated that the optimized five-bar aerating mechanism could decrease swinging extreme value by 24%compared with the initial parameters.Finally,the physical prototype of the aerator was tested in the field and performed as expected,producing<7 mm depth tolerances and<3.3°angle tolerances,which met the design requirement.

The Notched Filtering Characteristics of Stratified Volume Holographic Grating

Utilizing the tool of beam propagation method (BPM) to calculate the zeroth order diffraction beam intensity, we find SVHG displays notched diffraction response as a function of the readout wavelength. Using the method of SA and considering the variance of refractive index as the readout wavelength changes, a practiced notch filter can be designed and the period of the filter is discussed.