Multi-group ant colony algorithm based on simulated annealing method

2010 ◽  
Vol 14 (6) ◽  
pp. 464-468 ◽  
Author(s):  
Jing-wei Zhu ◽  
Ting Rui ◽  
Ming Liao ◽  
Jin-lin Zhang
Soft Matter ◽  
2021 ◽  
Author(s):  
Zhiyao Liu ◽  
Zheng Wang ◽  
Yuhua Yin ◽  
Run Jiang ◽  
Baohui Li

Phase behavior of ABC star terpolymers confined between two identical parallel surfaces is systematically studied with a simulated annealing method. Several phase diagrams are constructed for systems with different bulk...


1993 ◽  
Vol 115 (3) ◽  
pp. 312-321 ◽  
Author(s):  
Tien-Sheng Chang ◽  
E. B. Magrab

A methodology to attain the highest fundamental natural frequency of a printed wiring board by rearranging its components has been developed. A general two-dimensional rearrangement algorithm is developed by which the rearrangement of the component-lead-board (CLB) assemblies is performed automatically for any combination of equal size, unequal size, movable and immovable CLBs. This algorithm is also capable of incorporating two design restrictions: fixed (immovable) components and prohibited (non-swappable) areas. A highly computationally efficient objective function for the evaluation of the automatic rearrangement process is introduced, which is a linear function of the size of the individual CLBs that have been selected for each interchange. The simulated annealing method is adapted to solve the combinatorial rearrangement of the CLBs. Using 61 combinations of boundary conditions, equal and unequal sized CLBs, movable and immovable CLBs, various CLB groupings and sets of material properties, it is found that, when compared to the exact solution obtained by an exhaustive search method, the simulated annealing method obtained the highest fundamental natural frequency within 1 percent for 87 percent of the cases considered, within 0.5 percent for 72 percent of the cases and the true maximum in 43 percent of them. To further increase the fundamental natural frequency the introduction of a single interior point support is analyzed. Depending on the boundary conditions an additional increase in the maximum fundamental natural frequency of 44 to 198 percent can be obtained.


2014 ◽  
Vol 11 (2) ◽  
pp. 339-350
Author(s):  
Khadidja Bouali ◽  
Fatima Kadid ◽  
Rachid Abdessemed

In this paper a design methodology of a magnetohydrodynamic pump is proposed. The methodology is based on direct interpretation of the design problem as an optimization problem. The simulated annealing method is used for an optimal design of a DC MHD pump. The optimization procedure uses an objective function which can be the minimum of the mass. The constraints are both of geometrics and electromagnetic in type. The obtained results are reported.


2021 ◽  
pp. 08-25
Author(s):  
Mustafa El .. ◽  
◽  
◽  
Aaras Y Y.Kraidi

The crowd-creation space is a manifestation of the development of innovation theory to a certain stage. With the creation of the crowd-creation space, the problem of optimizing the resource allocation of the crowd-creation space has become a research hotspot. The emergence of cloud computing provides a new idea for solving the problem of resource allocation. Common cloud computing resource allocation algorithms include genetic algorithms, simulated annealing algorithms, and ant colony algorithms. These algorithms have their obvious shortcomings, which are not conducive to solving the problem of optimal resource allocation for crowd-creation space computing. Based on this, this paper proposes an In the cloud computing environment, the algorithm for optimizing resource allocation for crowd-creation space computing adopts a combination of genetic algorithm and ant colony algorithm and optimizes it by citing some mechanisms of simulated annealing algorithm. The algorithm in this paper is an improved genetic ant colony algorithm (HGAACO). In this paper, the feasibility of the algorithm is verified through experiments. The experimental results show that with 20 tasks, the ant colony algorithm task allocation time is 93ms, the genetic ant colony algorithm time is 90ms, and the improved algorithm task allocation time proposed in this paper is 74ms, obviously superior. The algorithm proposed in this paper has a certain reference value for solving the creative space computing optimization resource allocation.


Sign in / Sign up

Export Citation Format

Share Document