The Journal of Supercomputing

, Volume 63, Issue 3, pp 757–772 | Cite as

Multi-core implementation of the differential ant-stigmergy algorithm for numerical optimization

  • Peter Korošec
  • Marian Vajteršic
  • Jurij Šilc
  • Rade Kutil
Article
  • 182 Downloads

Abstract

Numerical optimization techniques are applied to a variety of engineering problems. The cost-function evaluation is an important part of any numerical optimization and is usually realized as a black-box simulator. For the efficient solving of the numerical optimization problem on multi-core systems, new shared-memory and distributed-memory approaches are proposed. The algorithms are based on an ant-stigmergy meta-heuristics, where indirect coordination between the ants drives the search procedure toward the optimal solution. Indirect coordination offers a high degree of parallelism and therefore relatively straightforward shared-memory and distributed-memory implementations. The Intel-OpenMP 3.0 and MPICH2 libraries are used for the inter-thread and inter-process communications, respectively. It is shown that speed-up strongly depends on the simulation time. This is especially evident in a distributed-memory implementation. Therefore, the algorithms’ performances, according to the simulator’s time complexity, are experimentally evaluated and discussed.

Keywords

Numerical optimization Differential ant-stigmergy algorithm Parallelization Multi-core processor 

References

  1. 1.
    Nocedal J, Wright SJ (2006) Numerical optimization, 2nd edn. Springer, Berlin MATHGoogle Scholar
  2. 2.
    Wright AH (1991) Genetic algorithms for real parameter optimization. In: Foundations of genetic algorithms—1. Morgan Kaufman, San Mateo, pp 205–218 Google Scholar
  3. 3.
    Deb K, Anand A, Joshi D (2002) A computationally efficient evolutionary algorithm for real-parameter optimization. Evol Comput 10:371–395. doi:10.1162/106365602760972767 CrossRefGoogle Scholar
  4. 4.
    Storn R, Price KV (1997) Differential evolution—a fast and efficient heuristic for global optimization over continuous spaces. J Glob Optim 11:341–359. doi:10.1023/A:1008202821328 MathSciNetMATHCrossRefGoogle Scholar
  5. 5.
    Kennedy J, Eberhart RC (1995) Particle swarm optimization. In: IEEE international conference on neural networks, vol 4, pp 1942–1948. doi:10.1109/ICNN.1995.488968 Google Scholar
  6. 6.
    Cutello V, Narzisi G, Nicosia G, Pavone M (2006) An immunological algorithm for global numerical optimization. In: Lect notes comput sc, vol 3871, pp 284–295. doi:10.1007/11740698_25 Google Scholar
  7. 7.
    Karaboga D, Basturk B (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J Glob Optim 39:459–459171. doi:10.1007/s10898-007-9149-x MathSciNetMATHCrossRefGoogle Scholar
  8. 8.
    Socha K, Dorigo M (2008) Ant colony optimization for continuous domains. Eur J Oper Res 185:1155–1173. doi:10.1016/j.ejor.2006.06.046 MathSciNetMATHCrossRefGoogle Scholar
  9. 9.
    Dorigo M, Bonabeau E, Theraulaz G (2000) Ant algorithms and stigmergy. Future Gener Comput Syst 16:851–871. doi:10.1016/S0167-739X(00)00042-X CrossRefGoogle Scholar
  10. 10.
    Blum C (2005) Ant colony optimization: introduction and recent trends. Phys Life Rev 2:353–373. doi:10.1016/j.plrev.2005.10.001 CrossRefGoogle Scholar
  11. 11.
    Monmarché N, Venturini G, Slimane M (2000) On how Pachycondyla apicalis ants suggest a new search algorithm. Future Gener Comput Syst 16:937–946. doi:10.1016/S0167-739X(00)00047-9 CrossRefGoogle Scholar
  12. 12.
    Duran Toksari D (2006) Ant colony optimization for finding the global minimum. Appl Math Comput 176:308–316. doi:10.1016/j.amc.2005.09.043 MathSciNetMATHCrossRefGoogle Scholar
  13. 13.
    Pedemonte M, Nesmachnow S, Cancela H (2011) A survey on parallel ant colony optimization. Appl Soft Comput 11:5181–5197. doi:10.1016/j.asoc.2011.05.042 CrossRefGoogle Scholar
  14. 14.
    Korošec P, Šilc J, Filipič B (2012) The differential ant-stigmergy algorithm. Inf Sci 192(1):82–97. doi:10.1016/j.ins.2010.05.002 CrossRefGoogle Scholar
  15. 15.
    Šilc J, Korošec P (2006) The distributed stigmergic algorithm for multi-parameter optimization. In: Lect notes comput sc, vol 3911, pp 92–99. doi:10.1007/11752578_12 Google Scholar
  16. 16.
    Lin Y, Cai H-C, Xiao J, Zhang J (2007) Pseudo parallel ant colony optimization for continuous functions. In: 3rd international conference on natural computation (ICNC), pp 494–500. doi:10.1109/ICNC.2007.585 CrossRefGoogle Scholar
  17. 17.
    Korošec P, Šilc J (2009) A distributed ant-based algorithm for numerical optimization. In: Workshop on bio-inspired algorithms for distributed systems (BADS), pp 37–44. doi:10.1145/1555284.1555291 Google Scholar
  18. 18.
    Korošec P, Vajteršic M, Šilc J, Kutil R (2011) A shared-memory ACO-based algorithm for numerical optimization. In: IEEE international symposium on parallel and distributed computing (IPDPS), pp 347–352. doi:10.1109/IPDPS.2011.176 Google Scholar
  19. 19.
    Geer D (2005) Chip makers turn to multicore processors. Computer 38(5):11–13. doi:10.1109/MC.2005.160 CrossRefGoogle Scholar
  20. 20.
    Frost Gorder P (2007) Multicore processors for science and engineering. Comput Sci Eng 9(2):3–7. doi:10.1109/MCSE.2007.35 CrossRefGoogle Scholar
  21. 21.
    Chapman B, Jost G, van der Pas R (2007) Using OpenMP portable shared memory parallel programming. MIT Press, Cambridge Google Scholar
  22. 22.
    Gropp W, Lusk E, Thakur R (1999) Using MPI-2: advanced features of the message-passing interface. MIT Press, Cambridge Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2012

Authors and Affiliations

  • Peter Korošec
    • 1
  • Marian Vajteršic
    • 2
  • Jurij Šilc
    • 1
  • Rade Kutil
    • 2
  1. 1.Computer Systems DepartmentJožef Stefan InstituteLjubljanaSlovenia
  2. 2.Department of Scientific ComputingUniversity of SalzburgSalzburgAustria

Personalised recommendations