Performance of Genetic Algorithm Used for Analysis of Call and Service Processing in Telecommunications
A genetic algorithm applied for finishing time determination in the simulation method used for analysis of call and service processing in telecommunications has been described. The evaluation of a performance of the genetic algorithm including influences of the initial string population size on the convergence, differences coming from crossover and mutation probabilities variation, relations between the number of processors and the convergence as well as termination criterion have been discussed.
KeywordsGenetic Algorithm Time Slot Mutation Probability Service Processing Precedence Relation
- 1.Sinkovic, V., I. Lovrek: Proceedings MPCS’94 Conference on Massively Parallel Computing Systems (MPCS): the Challenges of General Purpose and Special-Purpose Computing, Part II (Draft), May 2–6, 1994, Ischia, Italy, 373 (1994).Google Scholar