KMITL

Permanent URI for this communityhttps://dspace.kmitl.ac.th/handle/123456789/1

Browse

Search Results

Now showing 1 - 2 of 2
  • Some of the metrics are blocked by your 
    Item type:Publication,
    Swarm optimization algorithm based on the ant colony life cycle
    (2019-01-01)
    Kiatwuthiamorn, Jiraporn
    ;
    Thammano, Arit
    Optimization is very important to the success of any business. One technique for solving optimization is swarm intelligence; it has been successfully applied to solve a wide range of optimization problems. We devised a new swarm intelligence optimization algorithm based on the cooperative behavior of three different kinds of ants in a colony. Our algorithm consists of both exploration and exploitation processes to achieve better search performance. A new local search, inspired by the foraging of desert ants, was introduced to help the search move away from the local optima. Performance was evaluated on 23 standard benchmark functions of varying complexity. Our algorithm was able to find the global optima in more than 80 percent of the test functions, whereas the second-place algorithm only found around 10 percent of the functions tested.
  • Some of the metrics are blocked by your 
    Item type:Publication,
    A novel optimization algorithm based on the natural behavior of the ant colonies
    (2013-01-01)
    Kiatwuthiamorn, Jiraporn
    ;
    Thammano, Arit
    Optimization problem is one of the most challenging problems that has received considerable attention over the last decade. Many metaheuristic methods have been proposed and successfully applied to find the optimal solution. Each technique has its good and bad points. A new optimization technique based on the natural behavior of the ant colonies is proposed in this paper. In this proposed algorithm, the foraging behavior of worker ants is employed for locally searching for better solution while the marriage, breeding, and feeding behaviors are used in reproduction of the new generation. The proposed algorithm has been evaluated on several benchmark problems. The experimental results demonstrate the effectiveness of the proposed algorithm. © 2013 The Authors. Published by Elsevier B.V.