Time Requirements of Optimization of a Genetic Algorithm for Road Traffic Network Division Using a Distributed Genetic Algorithm

Part of the Studies in Computational Intelligence book series (SCI, volume 559)


This paper describes the optimization of a dividing genetic algorithm (DGA). It is used for division of road traffic networks into sub-networks of a distributed road traffic simulation. The optimization is performed by finding optimal settings of the DGA parameters using a distributed optimizing genetic algorithm (distributed OGA). Since the distributed OGA is expected to be extremely time-consuming, the paper is focused on a determination of the total time necessary for the OGA computation. It is determined, performing tests, that the OGA can be completed in range of days at least for lower numbers of OGA generations on a distributed computer consisting of nearly 100 processor cores.


  1. Ahmed ZH (2010) Genetic algorithm for the traveling salesman problem using sequential constructive crossover operator. Int J Biom Bioinform 3(6):96–105Google Scholar
  2. Bäck T (1996) Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms. Oxford University Press, New YorkMATHGoogle Scholar
  3. Baker JE (1987) Reducing bias and inefficiency in the selection algorithm. In: Proceedings of the second international conference on genetic algorithms and their application, pp 14–21Google Scholar
  4. Farshbaf M, Feizi-Darakhshi M (2009) Multi-objective optimization of graph partitioning using genetic algorithms. In: 2009 third international conference on advanced engineering computing and applications in sciences, Sliema, pp 1–6Google Scholar
  5. Grosu D, Chronopoulos AT, Leung MY (2008) Cooperative load balancing in distributed systems. Concurr Comput Pract Exp 20(16):1953–1976CrossRefGoogle Scholar
  6. Menouar B (2010) Genetic algorithm encoding representations for graph partitioning problems. In: 2010 international conference on machine and web intelligence, Algiers, pp 288–291Google Scholar
  7. Poli R, Langdon WB, McPhee NF (2008) A field guide to genetic programming. Published via and freely available at (with contributions by Koza JR)
  8. Potuzak T (2011) Suitability of a genetic algorithm for road traffic network division. In: KDIR 2011—proceedings of the international conference on knowledge discovery and information retrieval, Paris, pp 448–451Google Scholar
  9. Potuzak T (2012a) Methods for division of road traffic networks focused on load-balancing. Adv Comput 2(4):42–53CrossRefGoogle Scholar
  10. Potuzak T (2012b) Issues of optimization of a genetic algorithm for traffic network division using a genetic algorithm. In: Proceedings of the international conference on knowledge discovery and information retrieval, Barcelona, pp 340–343Google Scholar
  11. Potuzak T (2013a) Methods for division of road traffic network for distributed simulation performed on heterogeneous clusters. Comput Sci Inf Syst 10(1):321–348CrossRefGoogle Scholar
  12. Potuzak T (2013b) Feasibility study of optimization of a genetic algorithm for traffic network division for distributed road traffic simulation. In: Proceedings of the 6th international conference on human system interaction, pp 372–379Google Scholar
  13. Xie H, Zhang M (2013) Parent selection pressure auto-tuning for tournament selection in genetic programming. IEEE Trans Evol Comput 17(1):1–18CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  1. 1.Department of Computer Science and Engineering, Faculty of Applied SciencesUniversity of West BohemiaPlzenCzech Republic

Personalised recommendations