Ant colony optimization is described and applied on two structural benchmark problems. The problems, being the gear ratio optimization and the geometrical optimization of a composite leaf spring, are chosen of discrete and continuous domain nature...

Ant colony optimization (ACO), a heuristic method formerly applied on combinatorial problems in the

field of applied mathematics and industrial engineering, is described and employed for the multiobjective

optimization of hybrid...

In this paper, after a beginning on the concept of ant algorithms, a brief survey of the ant-based methods proposed for optimization of problems with continuous design spaces is presented. As a common approach in continuous ...

. The objective is to minimize the figure of merit, which shows the relative cost of spring. Two heuristic algorithms, namely simulated annealing and ant colony optimization, are employed to optimize the spring. The results obtained by these methods are compared...

Multiprocessor scheduling belongs to a special

category ofNP-complete computational problems. The

purpose of scheduling is to scatter tasks among the

processors in such a way that the precedence.
...

An ant colony optimization algorithm for optimum design of symmetric hybrid laminates is described. The objective is simultaneous maximization of fundamental frequency and minimization of cost. Number of surface and core layers made of highstiffness...