Multicast Routing Based on Genetic Algorithms
|
|
- Scott Baldwin
- 5 years ago
- Views:
Transcription
1 JOURNAL OF INFORMATION MULTICAST SCIENCE ROUTING AND ENGINEERING BASED ON GENETIC 16, ALGORITHMS (2000) 885 Multicast Routing Based on Genetic Algorithms Department of Computer Science and Information Engineering National Chung Cheng University Chiayi, Taiwan 621, R.O.C. Due to the advent of many new multimedia applications in high speed networks, the issue of multicast routing has become more and more important. The multicast routing problem in computer networks is also known as the Steiner tree problem which has been shown to be NP-complete. In this paper, we propose a new multicast routing algorithm based on Genetic Algorithms. To apply this algorithm to real networks, we also propose several methods for reducing the computational complexity. Computer simulations were conducted on a random graph to evaluate the performance of the proposed algorithm. Our numerical results show that the proposed algorithm is able to find a better solution than the RSR algorithm, a very promising heuristic algorithm for the Steiner tree problem proposed by Rayward-Smith. Finally, since many multimedia applications require multiple Quality of Service (QOS) constraints, such as delay, jitter, and loss probability, we also address how to extend the proposed algorithm to obtain multiple constrained multicast trees. Keywords: multicast, Steiner tree, genetic algorithm, routing, QOS 1. INTRODUCTION Due to rapid advances in the switching and communication technologies and the increased demand for various kinds of communication services, many new applications in networks require the support of multicast communication. Therefore, the issue of multicast routing has become more and more important. In the past, most multicast routing algorithms have been developed with the goal of minimizing the cost of the constructed multicast tree. The multicast tree with minimum cost is called a Steiner tree [1]. Unfortunately, the problem of finding a Steiner tree is known to be NP-complete [2], even if links have unit cost [3]. Thus, most previous researchers have focused on developing heuristic algorithms that take polynomial time and produce near optimal results [4-6]. Furthermore, these heuristic algorithms often guarantee that their solutions are within twice the cost of the optimal solution. More recently, the multicast routing problem has been formulated as a constrained Steiner tree problem in which either an end-to-end delay bound needs to be satisfied for each path in the tree [7] or there is a restriction on the number of packet copies per network node (switch) [8]. In this paper, we focus on the design of multicast algorithms which try to minimize the cost of the multicast tree and also take path delay into consideration; i.e., low path delay is preferred but not guaranteed. However, the proposed scheme can be easily extended to solve the Received February 16, 1998; revised May 4, 1998; accepted August 20, Communicated by Jean-Lien C. Wu. 885
2 886 multicast routing problem with multiple constraints, e.g., an end-to-end delay constraint and an end-to-end loss probability constraint. The details will be presented in a follow up paper [9]. In this paper, we present a novel heuristic multicast routing algorithm based on Genetic Algorithms. The Genetic Algorithms [10-12] provide robust and efficient search in complex spaces. Survival of the fittest genes and structured yet randomized genetic operations are the basic philosophies behind the algorithms. The main advantages of Genetic Algorithms include: (1) since solutions are coded as bit strings, referred to as chromosomes, large problems can be easily handled by using long strings; (2) genetic operations, such as crossover and mutation, are very easy to implement; (3) with a pool of chromosomes (candidate solutions), Genetic Algorithms search the solution space at different corners in parallel; therefore, the algorithm can be easily implemented on multi-processor machines to search in parallel; (4) randomized genetic operations, such as mutation, can keep the search from being trapped by local-optima. Genetic Algorithms have been successfully applied to control problems in ATM networks, such as bandwidth allocation [13] and buffer management [14]. Recently, they have been applied to point-to-point routing [15] and spanning tree problem [16] in communication networks. The performance of the proposed GA-based multicast routing algorithm, measured in terms of the cost of the multicast tree found, has been evaluated through simulations under different network topologies. Our simulation results show that the proposed algorithm is able to find a multicast tree with less cost than can the RSR algorithm [17, 18]. The remainder of this paper is organized as follows. Section 2 briefly describes the basics of the Genetic Algorithms. In section 3, the GA-based multicast routing algorithm is presented. In section 4, the performance of our multicast routing scheme is evaluated through simulations and compared to that of the RSR algorithm [17, 18], a very promising heuristic algorithm for the Steiner problem proposed by Rayward-Smith. One of the disadvantages of using Genetic Algorithms is that they require many iterations to converge. However, in section 5, we show that two methods can be used to significantly reduce the number of iterations. Finally, conclusions are given in section 6. Since many multimedia applications require multiple Quality of Service (QOS) constraints, such as delay, jitter, and loss probability, we also briefly discuss at the end of section 6 how the proposed scheme can be extended to solve the multicast routing problem with multiple constraints. 2. GENETIC ALGORITHMS The Genetic Algorithms(GAs) are used to solve an optimization problem based on the principle of evolution. A population of candidate solutions, called chromosomes, is maintained at each iteration of the evolution. Each chromosome consists of linearly arranged genes which are represented by binary strings. Three basic operations, namely, reproduction, crossover, and mutation, are adopted in the evolution to generate new offspring. Reproduction is based on the Darwinian survival of the fittest among strings generated. Samples (represented as bit strings) with larger fitness function values are selected to generate new offspring bit strings by means of crossover operations, and the offspring are converted into new parameter solutions. Intuitively, a bit string with a larger fitness function value should have a higher probability of contributing one or more offspring bit strings
3 MULTICAST ROUTING BASED ON GENETIC ALGORITHMS 887 in the next generation and vice versa. Crossover is used to cut individually two parent bit strings into two or more segments and to then combine the segments undergoing crossover to generate two offspring bit strings. Crossover can produce offspring that are radically different from their parents. Suppose the crossover operation is performed on the two bit strings, and , and that they are split at the second bit; then, two new bit strings, and are generated (see Fig. 1). There are other ways of implementing the crossover operation, e.g., arithmetic crossover [12] crossover parents Fig. 1. The crossover operation. offsprings Mutation is to perform random alternation on bit strings by means of some operations, such as bit shifting, inversion, rotation, etc. A mutation operation will create new offspring bit strings different from those generated by the reproduction and crossover operations. Mutation can extend the scope of the solution space and reduce the possibility of falling into local extremes. In the literature, has been suggested that the possibility of mutation should be set to a very low value. The genetic algorithms are typically implemented as follows: Step 1: Initialize a population of chromosomes (solutions). Step 2: Evaluate each chromosome in the population. Step 3: Create new chromosomes by mating current chromosomes and apply mutation, and recombination when the parent chromosomes mate. Step 4: Delete members of the population to make room for the new chromosomes. Step 5: Evaluate the new chromosomes, and insert them into the population. Step 6: If a stopping criterion is satisfied, then Stop and output the best chromosome (solution); otherwise, go to Step THE PROPOSED MULTICAST ROUTING ALGORITHM 3.1 Network Model and Problem Definition For a directed network graph, the problem of finding an optimal multicast tree with the least cost is formally defined as follows: GIVEN: A directed network G = (V, E, c) consists of a nonempty set V of ÍV Í vertices and a set E, E Õ V V, of ÍE Íedges connecting pairs of vertices. Each edge is associated with a cost function c:e Æ R. In addition, a non-empty set N = {v 0, u 1, u 2,..., u k } of terminals in G is given where N Õ V, v 0 is the source node, and D = {u 1, u 2,..., u k } is the set of destination nodes.
4 888 FIND: A subnetwork T G (N) = (V T, E T, c T ) of G such that: æ N Õ V T ; æ there is a path from the source node to each destination node; æ the cost of T G (N), Â e1 ŒE T c(e 1 ), is minimized. 3.2 Routing Table In the network graph, G = (V, E), there are ÍV Í (ÍV Í- 1) possible source-destination pairs. A source-destination pair can be connected by a set of links, which is called a route. There are usually many possible routes between any source-destination pair. For example, consider the network shown in Fig. 2; the possible routes between v 0 to v 4 include v 0 - v 4, v 0 - v 5 - v 4,..., and so on. V1 V2 V5 V0 V4 V3 Fig. 2. A simple 6-node network. Our GA-based multicast routing algorithm assumes that a routing table, consisting of R possible routes, has been constructed for each source-destination pair. For example, Fig. 3 shows the routing table for the source-destination pair (v 0, v 4 ). The size of the routing table, R, is a parameter of our algorithm. The possible routes in the routing table can be sorted according to their length (i.e., number of links) or delay such that to shorter paths are assigned smaller route numbers. (Preferring routes with smaller delay are preferred so as to take path delay into consideration in finding multicast trees.) V0 V4 Route No. Route lists 0 1 R-1 V0 V4 V0 V5 V4 V0 V5 V1 V2 V3 V4 Fig. 3. Example of a routing table.
5
6 890 Initialization [Initial generation] Gene pool Evaluation Discard Genetic operation Selection / Reproduction Crossover Mutation [Next generation] An outline of our GA-based multicast routing algorithm, schematically illustrated in Fig. 5, is given as follows Initialization of chromosomes Recall that a chromosome consists of a sequence of genes, each of which corresponds to a specific route of a routing table. The initial procedure generates P different chromosomes at random, which form the first generation. This set of chromosomes is called the chromosome pool (or population), and P is the size of the chromosome pool Evaluation of chromosomes Solution Fig. 5. The proposed Genetic Algorithm. The fitness value of a chromosome is the value of the objective (fitness) function for the solution (e.g., a multicast tree) represented by the chromosome. Given a chromosome pool H = {h 0, h 1,..., h p-1 }, the fitness value of each chromosome is computed as follows. Let C(h i )be the sum of the costs of the links of the graph represented by the chromosome h i and C(L)be the sum of the costs of all the links in the network. The fitness value of the chromosome h i, F(h i ), is given by Ch i F( hi ) = 1 ( ) CL ( ). (Note that 0 F(h i ) < 1.) After evaluating the fitness values of all the chromosomes, the chromosomes are then sorted according to their fitness values such that F(h 0 ) F(h 1 )... F(h p-1 ). (That is, the first chromosome in the pool is the best solution found so far.)
7 MULTICAST ROUTING BASED ON GENETIC ALGORITHMS Discard the duplicate chromosomes In the chromosome pool, there may exist two or more duplicate chromosomes. Applying some of the genetic operations, e.g., crossover, on two duplicate chromosomes will yield the same chromosome. Therefore, a large number of duplicate chromosomes in the chromosome pool will reduce the searching ability. Once this situation occurs, the duplicated chromosomes must be discarded. In our algorithm, they are replaced by new randomly generated chromosomes, as shown in Fig. 6. large D1 D1 Die off D1 D2 D2 C1 D2 Die off C2 fitness D2 C1 C3 C4 small C2 C3 C4 C5 Fill in randomly generated chromosomes C5 N1 N2 N3 Fig. 6. Discard duplication chromosomes Reproduction According to the computed fitness values, some of chromosomes are selected in order to generate more offspring through crossover and mutation operations, and others are removed from the chromosome pool. In this way, chromosomes with large fitness values will survive and reproduce more. On the other hand, chromosomes with small fitness values will die off. The reproduction process selects a certain number of chromosomes with the best fitness values from the current generation for reproduction. Another group of chromosomes, again with the best fitness values, is selected to reproduce offspring through the crossover operation. Note that the number of the chromosomes in the chromosome pool is always restricted to P, as illustrated in Fig. 7. large Reproduction fitness Crossoer and mutation Die off small Fig. 7. Select chromosomes for genetic operation.
8 Crossover In nature, genetic information between two chromosomes is exchanged through mating. The crossover operation is used to mimic the mating process. In this process, two chromosomes strings with larger fitness values are picked from the chromosome pool first. The start point and length of the portion to be exchanged are randomly selected. Two new offsprings are created and put back into the chromosome pool, as illustrated in Fig. 8. Crossover point exchange Fig. 8. Crossover operator Mutation The mutation operation is one kind of random change in the chromosome. In our algorithm, pointwise mutation is adopted, in which one bit in the chromosome string is changed with a certain probability, referred to as the mutation probability. (Changing a bit in a chromosome mimics the random change of chromosomes occurring in nature.) The mutation operation gives the Genetic Algorithm an opportunity to search for new, more feasible, chromosomes in new corners of the solution spaces. 4. NUMERICAL RESULTS In this section, the performance of the proposed multicast routing scheme will be evaluated via simulation results. The performance will then be compared with that of the heuristic algorithm proposed by Rayward-Smith [17,18], referred to as the RSR algorithm [18]. The RSR algorithm is summarized as follows. Recall that N is the set consisting of the source node and destination nodes of a multicast request. Let T be a set of trees which will be subgraphs of the final tree. Step 1: Initialize T such that T = { T1, T2,..., T N }, where Ti = { vi} v i N. Step 2: Find a vertex v Œ V which has the minimum value of the heuristic distance function f(v). The vertex v is th en used to unite two of the trees in T by joining each of these trees to v using the shortest path. Step 3: Repeat step 2 until there is only one tree in T. Step 4: Find the minimum spanning tree of the subgraph of the network induced by nodes found in step 3, and prune this tree to ensure that all leaves are in N. The heuristic distance function f(v) is given by
9 MULTICAST ROUTING BASED ON GENETIC ALGORITHMS 893 r dvv (, i ) f( v) = min { V1, V2,..., Vr are the vertex sets of trees in T}, 2 r T i= 1 r 1 where d(v, V i ) is the cost of the shortest path from node v to the set of vertex V i. 4.1 Network Model and Traffic Distribution The simulation results presented in this section were carried on a random graph in which V nodes were placed randomly on a V V lattice points in the plane, and the probability of a link existing between nodes depended on the distance between them [6] (see [8] for the details). In our simulations, a 20-node random graph was constructed as shown in Fig. 9. We assume that the network is well-dimensioned, and that the cost of a link is normalized to unity. The cost may represent the cost of carrying a connection on the link. For example, in [21], the routing problem is formulated as an Markov decision process (MDP) and the cost of a link, which is state dependent, represents the expected revenue loss due to carrying a new call. In the well-dimensioned network, we assume that the costs of the links are uniformly distributed between 0.3 to Computer Simulation Results Off-line setup Fig. 9. A 20-node random graph. In our proposed algorithm, the GA approach uses a gene to represent a route from the source node to one of the destinations. Hence, the routing table for each source-destination pair needs to be constructed first. Obviously, the number of possible routes between two nodes heavily depends on the network topology. If the network is densely connected or the size of the network is large, the number of possible routes of a source-destination pair becomes huge. Hence, it is impossible to list all the possible routings in the routing table. In the simulation, we set the size of routing table to 64. An algorithm was designed to automatically generate the shortest 64 routes for each O-D pair.
10 Parameter selection The parameters of the genetic algorithm, such as the size of the chromosome pool, the mutation rate, and the number of generations, must be properly selected to obtain the best performance. As described in the following, simulations were conducted to obtain proper values for these parameters. To obtain the value of each point shown in the following figures, 100 simulation runs were conducted. During each simulation, the link costs were randomly assigned according to the uniform distribution. Given the link costs assigned, 1000 multicast requests were then generated, in which the source node and destination nodes were randomly selected. Let us examine the effect of the number of generations on the performance of the algorithm. Fig. 10 shows the average cost yielded at each generation for multicast connections with 10 destination nodes. The mutation rate was set to 0.4. The three curves in Fig. 10 show the average cost yielded at each generation when the size of the chromosome pool (population) was set to 16, 32, and 64, respectively. We can observe that more generations were required to obtain stable results when N was small. However, when N was larger, more computation time was required for each generation. Therefore, there existed a tradeoff. When N was 64, about 200 generations were required to obtain a stable result. Fig. 10. The effect of the number of generations on the performance of the proposed algorithm. Fig. 11 shows the cost observed after 300 generations under different population sizes. The network configuration and other parameters were the same as above. As expected, larger population size led to better performance because more diverse chromosomes available in a large population could keep the genetic algorithm from falling into the local optimum. From Fig. 11, we can observe that the obtained cost did not decrease significantly when the population size was larger than 48. Fig. 12 shows the effect of the mutation rate on the performance of the genetic algorithm. The minimum cost obtained after 200 generations under various mutation rates is plotted, where the population size was set to 64. Although previous researches in genetic algorithms suggest that a small mutation rate usually yields better performance, we observe a contrary result. Fig. 12 suggests that any mutation rate that is larger than 0.1 will yield good performance while 0.4 seems to be best choice.
11 MULTICAST ROUTING BASED ON GENETIC ALGORITHMS 895 Fig. 11. The effect of the size of the chromosome pool on the performance of the proposed algorithm. Mutation rate Fig. 12. The effect of the mutation rate on the performance of the proposed algorithm Comparison of performance In this section, we evaluate the performance of the proposed multicast routing algorithm. Table 1 compares the performance of the proposed algorithm with that of the RSR algorithm under different sizes of the destination set. The size of the chromosome pool was set to 64, the mutation rate was set to 0.4, and the number of generations was 200. Again, 100 simulations were conducted to obtain each point in the table, and 1000 multicast requests were randomly generated during each simulation. As we can observe from Table 1, as many other simulation results shown in [20], the proposed algorithm is able to find a better multicast tree than the RSR algorithm in all cases. The improvement can be up to 5%. The performance of the RSR algorithm and our proposed algorithm under various network models (topologies) was also examined in [20]. The proposed algorithm yielded better performance than the RSR algorithm in most cases, similar to the results shown in Table 1. Although the performance of our proposed algorithm can be further improved if we increase the size of the chromosome pool or the number of generations, this will also increase the computation time. Therefore, in the next section, we propose two methods for reducing the computation time.
12 896 Table 1. Performance comparison of the proposed algorithm with RSR. Algorithm Performance RSR GA Improvement no. of destinations % % % % % % % % % % % % % % % % % % 5. REDUCING THE COMPUTATION REQUIREMENT Besides decreasing the size of the chromosome pool or the number of generations, we propose the following two methods for reducing the computation time of the GA-based routing algorithm. The first method modifies the initial procedure such that the chromosomes in the initial chromosome pool are generated with preference for genes that represent shorter routes. Since the routes in the routing tables are sorted according to their length, preference for shorter routes is equivalent for preference for genes with small values. Specifically, the value of a gene is generated at random from the range of (0, R/4) instead of (0,R), where R is the size of routing table. Fig. 13 shows the effect of this method. We can observe that when the initial chromosomes were generated with preference for genes of shorter routes, the proposed algorithm reached a good solution much faster than initialized randomly. The second method reuses the past solutions. In real networks, the solutions obtained for setting up a multicast connection can be reused as the initial chromosomes for the next multicast request, either with the same source and destination set or without. Since the
13 MULTICAST ROUTING BASED ON GENETIC ALGORITHMS 897 Fig. 13. The effect of the first speed up method: initialize the chromosome pool with shorter routes. network configuration (e.g., traffic on each link) will not change dramatically during a short period of time (e.g., the time between two consecutive multicast requests), chromosomes in the chromosome pool of the past-solution are very likely to still be good solutions. When two multicast connection requests have the same source node and destination set, the chromosomes in the past-solution pool can be copied directly to the new initial chromosome pool. However, if the number of chromosomes copied from the past-solution pool to the new initial pool is too large, the evolution process may not progress effectively. Therefore, we suggest that only the top 50% of the chromosomes from the past-solution pool be copied. Fig. 14 shows the effect of reusing the past solutions. The simulations were done with 5 destination nodes. The dashed line with triangle marks shows the costs of multicast trees obtained with preference for genes of shorter routes in the initial chromosome pool. The solid line with square marks shows the improvement in the convergence speed when the top 50% of the past solutions were reused as the initial chromosomes. The fluctuation of the network traffic was simulated by changing the cost of each link randomly to a value within the interval of (80%,120%) of the original link cost. The same method was adopted in the following simulations. Fig. 14. The effect of reusing past solutions (same source node and destination set).
14 898 If two multicast requests do not have the same destination set but have the same source node, the chromosomes in the past-solution pool can still be reused as follows. In particular, if the destination set of the current multicast request is a subset or superset of the previous request s destination set, the chromosomes can be reused as follows. If the current destination set is a superset of the previous destination set, the chromosomes are initialized such that genes that represent routes to destinations in the previous destination set are copied directly from the chromosomes in the past-solution pool while genes that represent new destinations are generated randomly (or with preference for shorter routes). Fig. 15 shows the effect of reusing past solutions when the current destination set (7 nodes) is a superset of the previous destination set (5 nodes). On the other hand, if the current destination set is a subset of the previous destination set, genes of initial chromosomes are copied directly from the corresponding genes in the past-solution pool. Fig. 16 shows the improvement obtained by reusing past solutions when the current destination set (5 nodes) is a subset of the previous destination set (7 nodes). Fig. 15. The effect of reusing past solutions (same source node, larger destination set). Fig. 16. The effect of reusing past solutions (same source node, smaller destination set).
15 MULTICAST ROUTING BASED ON GENETIC ALGORITHMS SUMMARY AND FUTURE WORK In this paper, we have proposed a new multicast routing algorithm based on GAs. Current existing multicast routing algorithms emphasis either the minimum cost or path delay. Our new multicast routing algorithm tries to minimize the multicast cost while maintaining a reasonable path delay. The number of generations required to reach a good solution has been reduced significantly by preferring shorter routes in initializing the chromosome pool and reusing the past solutions as the initial chromosomes for the new search. Our simultation results show that, with properly setting of the GA s parameters, such as the size of the chromosome pool and the number of generations, the proposed multicast routing algorithm is able to obtain a better solution than the RSR method in the random graph model studied in this paper as well as other network topologies studied in [20]. Furthermore, the time complexity of the our algorithm increases linearly as we increase the number of nodes of the network or the number of destinations of a multicast request. The proposed algorithm can be extended to multicast routing problems in future highspeed networks with multiple quality of service constraints. In ATM networks, an established connection is provided with a certain QOS guarantee. The QOS parameters may include the average/maximum end-to-end delay, delay jitter, cell loss probability, etc. That is, a connection may be guaranteed with multiple QOS parameters, e.g., the average end-toend delay and maximum cell loss probability. Although many researchers had studied the single constrained multicast problem, especially the delay constrained multicast problem, the multiple constrained multicast problem has been much less studied. The proposed algorithm can be easily extended to solve the multiple constrained multicast problem. Based on the proposed algorithm, the only thing we need to change is the fitness function in the second step (section 3.4.2). In the second step, all the chromosomes in the chromosome pool are evaluated using the following new fitness function. The fitness value of a chromosome h i, F(h i ), is the sum of the costs of the links of the graph represented by the chromosome h i if the QOS constraints can be satisfied; otherwise, the fitness value is set to infinity (or some huge number). This approach has many advantages. First, no matter how many QOS constraints need to be satisfied, the time complexity of the proposed algorithm will not grow exponentially. Actually, the additional time complexity required is very low. Second, no limitations need to be enforced when building routing tables. Finally, all the good features explored in this paper also apply to the new algorithm. Our preliminary simulation results show that the new proposed algorithm yields better performance than existing delay constrained multicast routing algorithms (e.g., [7]). Details will be presented in [9]. REFERENCES 1. S. L. Hakimi, Steiner s problem in graphs and its implications, Networks, Vol. 1, No. 1, 1971, pp R. M. Karp, Reducibility among combinatorial problems, Complexity of Computer Communications, R. E. Miller and J. W. Thatcher, Eds., Plenum, New York, 1972, pp
16 M. R. Gareg and D. S. Johnson, Computer and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York, C. H. Chow, On multicast path finding algorithms, IEEE INFOCOM 91, 1991, pp H. Takahashi and A. Mutsuyama, An approximate solution for the Steiner problem in graphs, Mathematic Japonica., Vol. 6, 1980, pp B. M. Waxman, Routing of multipoint connections, IEEE Journal on Selected Areas in Communications, Vol. 6, No. 9, 1988, pp V. P. Kompleea, J. C. Pasquale, and G. C. Polyzos, Multicast routing for multimedia communication, IEEE/ACM Transactions on Networking, Vol. 1, No. 3, 1993, pp H. Tode, Y. Sakai, M. Yamamoto, H. Okada, and Y. Tezuka, Multicast routing algorithm for nodal load balancing, IEEE INFOCOM 92, 1992, pp J. J. Wu and R.-H. Hwang, Multicast routing with multiple constraints, Information Sciences, Vol. 124, 2000, pp D. E. Goldberg, Genetic Algorithms: Search, Optimization and Machine Learning, Addison Wesley, Massachusetts, J. H. Holland, Adaption in Natural and Artificial Systems, Boston, MA: MIT Press, L. Davies, Genetic Algorithms and Simulated Annealing, Morgan Kaufmann, H. Pan and I. Y. Wang, The bandwidth allocation of ATM through genetic algorithm, IEEE GLOBECOM 91, 1991, pp L.-D. Chou and J.-L. C. Wu, Buffer management using genetic algorithms and neural networks, IEEE GLOBECOM 95, 1995, pp N. Shimamoto, A. Hiramatu, and K. Yamasaki, A dynamic routing control based on a genetic algorithm, 1993 IEEE International Conference on Neural Network, 1993, pp C. C. Palmer and A. Kershenbaum, Two algorithms for finding optimal communication spanning trees, Technical Report, IBM T. J. Watson Research Center, Yorktown Heights, NY, V. J. Rayward-Smith, The computation of nearly minimal Steiner trees in graphs, International Journal Mathematic Educational Science Technology, Vol. 14, No. 1, 1983, pp V. J. Rayward-Smith and A. Clare, On finding Steiner vertices, Networks, Vol. 16, 1986, pp C. C. Palmer and A. Kershenbaum, Representing trees in genetic algorithms, IEEE World Congress on Computational Intelligence, Vol. 1, 1993, pp W.-Y. Do, Multicast routing based on genetic algorithms, M.S. Thesis, Department of Computer Science and Information Engineering, National Chung Cheng University, T. J. Ott and K. R. Krishnan, State dependent routing of telephone traffic and the use of separable routing schemes, The 11th International Telecommunication Conference, 1985, pp
17 MULTICAST ROUTING BASED ON GENETIC ALGORITHMS 901 Ren-Hung Hwang ( ) ws born in Kaohsiung, Taiwan, in He received the B.S. degree in computer science and information engineering from National Taiwan University, Taipei, Taiwan, in 1985, and the M.S. and Ph.D. degrees in computer science from the University of Massachusetts, Amherst, Massachusetts, USA, in 1989 and 1993, respectively. He joined the Department of Computer Science and Information Engineering, National Chung Cheng University, Chiayi, Taiwan, in 1993, where he is now an associate professor. His research interests include high-speed computer networks, telecommunication networks, and multimedia communication systems. Wei-Yuan Do ( ) was born in Taoyuan, Taiwan in He received the B.S. degree in applied mathematics from National Chung Hsing University, Taichung, Taiwan, in 1994, and the M.S. degree in computer science and information engineering from National Chung Cheng University, Chiayi, Taiwan, in After graduation, he joined the Communication Network Lab., Technology Service Division, Institute for Information Industry, as an engineer. His current research interests include windowsbased network management tools and windows-based protocol analysis tools. Shyi-Chang Yang ( ) was born in Kaohsiung, Taiwan, R.O.C., in He received his B.S. degree in computer science from Chung Hua Polytechnic Institute, Chungli, Taiwan, in 1995, and the M.S. degree in computer science and information engineering from National Chung Cheng University, Chiayi, Taiwan, in He is now serving in the R.O.C. Army. Mr. Yang s research interests include computer networks and Internet application software.
18 902
QoS Constraints Multicast Routing for Residual Bandwidth Optimization using Evolutionary Algorithm
QoS Constraints Multicast Routing for Residual Bandwidth Optimization using Evolutionary Algorithm Sushma Jain* and J.D. Sharma Abstract For the real time multimedia applications, the routing algorithms
More informationNetwork Routing Protocol using Genetic Algorithms
International Journal of Electrical & Computer Sciences IJECS-IJENS Vol:0 No:02 40 Network Routing Protocol using Genetic Algorithms Gihan Nagib and Wahied G. Ali Abstract This paper aims to develop a
More informationDETERMINING MAXIMUM/MINIMUM VALUES FOR TWO- DIMENTIONAL MATHMATICLE FUNCTIONS USING RANDOM CREOSSOVER TECHNIQUES
DETERMINING MAXIMUM/MINIMUM VALUES FOR TWO- DIMENTIONAL MATHMATICLE FUNCTIONS USING RANDOM CREOSSOVER TECHNIQUES SHIHADEH ALQRAINY. Department of Software Engineering, Albalqa Applied University. E-mail:
More informationGrid Scheduling Strategy using GA (GSSGA)
F Kurus Malai Selvi et al,int.j.computer Technology & Applications,Vol 3 (5), 8-86 ISSN:2229-693 Grid Scheduling Strategy using GA () Dr.D.I.George Amalarethinam Director-MCA & Associate Professor of Computer
More informationAn Evolutionary Algorithm for the Multi-objective Shortest Path Problem
An Evolutionary Algorithm for the Multi-objective Shortest Path Problem Fangguo He Huan Qi Qiong Fan Institute of Systems Engineering, Huazhong University of Science & Technology, Wuhan 430074, P. R. China
More informationThe Genetic Algorithm for finding the maxima of single-variable functions
Research Inventy: International Journal Of Engineering And Science Vol.4, Issue 3(March 2014), PP 46-54 Issn (e): 2278-4721, Issn (p):2319-6483, www.researchinventy.com The Genetic Algorithm for finding
More informationDesign of Large-Scale Optical Networks Λ
Design of Large-Scale Optical Networks Λ Yufeng Xin, George N. Rouskas, Harry G. Perros Department of Computer Science, North Carolina State University, Raleigh NC 27695 E-mail: fyxin,rouskas,hpg@eos.ncsu.edu
More informationRole of Genetic Algorithm in Routing for Large Network
Role of Genetic Algorithm in Routing for Large Network *Mr. Kuldeep Kumar, Computer Programmer, Krishi Vigyan Kendra, CCS Haryana Agriculture University, Hisar. Haryana, India verma1.kuldeep@gmail.com
More informationAN EVOLUTIONARY APPROACH TO DISTANCE VECTOR ROUTING
International Journal of Latest Research in Science and Technology Volume 3, Issue 3: Page No. 201-205, May-June 2014 http://www.mnkjournals.com/ijlrst.htm ISSN (Online):2278-5299 AN EVOLUTIONARY APPROACH
More informationEvolutionary Computation Algorithms for Cryptanalysis: A Study
Evolutionary Computation Algorithms for Cryptanalysis: A Study Poonam Garg Information Technology and Management Dept. Institute of Management Technology Ghaziabad, India pgarg@imt.edu Abstract The cryptanalysis
More informationKhushboo Arora, Samiksha Agarwal, Rohit Tanwar
International Journal of Scientific & Engineering Research, Volume 7, Issue 1, January-2016 1014 Solving TSP using Genetic Algorithm and Nearest Neighbour Algorithm and their Comparison Khushboo Arora,
More informationAn Application of Genetic Algorithm for Auto-body Panel Die-design Case Library Based on Grid
An Application of Genetic Algorithm for Auto-body Panel Die-design Case Library Based on Grid Demin Wang 2, Hong Zhu 1, and Xin Liu 2 1 College of Computer Science and Technology, Jilin University, Changchun
More informationSuppose you have a problem You don t know how to solve it What can you do? Can you use a computer to somehow find a solution for you?
Gurjit Randhawa Suppose you have a problem You don t know how to solve it What can you do? Can you use a computer to somehow find a solution for you? This would be nice! Can it be done? A blind generate
More informationGenetic Algorithms For Vertex. Splitting in DAGs 1
Genetic Algorithms For Vertex Splitting in DAGs 1 Matthias Mayer 2 and Fikret Ercal 3 CSC-93-02 Fri Jan 29 1993 Department of Computer Science University of Missouri-Rolla Rolla, MO 65401, U.S.A. (314)
More informationThe Memetic Algorithm for The Minimum Spanning Tree Problem with Degree and Delay Constraints
The Memetic Algorithm for The Minimum Spanning Tree Problem with Degree and Delay Constraints Minying Sun*,Hua Wang* *Department of Computer Science and Technology, Shandong University, China Abstract
More informationGenetic Algorithm for Finding Shortest Path in a Network
Intern. J. Fuzzy Mathematical Archive Vol. 2, 2013, 43-48 ISSN: 2320 3242 (P), 2320 3250 (online) Published on 26 August 2013 www.researchmathsci.org International Journal of Genetic Algorithm for Finding
More informationA Genetic Algorithm for Graph Matching using Graph Node Characteristics 1 2
Chapter 5 A Genetic Algorithm for Graph Matching using Graph Node Characteristics 1 2 Graph Matching has attracted the exploration of applying new computing paradigms because of the large number of applications
More informationGENETIC ALGORITHM with Hands-On exercise
GENETIC ALGORITHM with Hands-On exercise Adopted From Lecture by Michael Negnevitsky, Electrical Engineering & Computer Science University of Tasmania 1 Objective To understand the processes ie. GAs Basic
More informationGenetic Algorithm for Dynamic Capacitated Minimum Spanning Tree
Genetic Algorithm for Dynamic Capacitated Minimum Spanning Tree Rahul Mathur M.Tech (Purs.) BU, AJMER IMRAN KHAN Assistant Professor AIT, Ajmer VIKAS CHOUDHARY Assistant Professor AIT, Ajmer ABSTRACT:-Many
More informationGENETIC ALGORITHM VERSUS PARTICLE SWARM OPTIMIZATION IN N-QUEEN PROBLEM
Journal of Al-Nahrain University Vol.10(2), December, 2007, pp.172-177 Science GENETIC ALGORITHM VERSUS PARTICLE SWARM OPTIMIZATION IN N-QUEEN PROBLEM * Azhar W. Hammad, ** Dr. Ban N. Thannoon Al-Nahrain
More informationExtending MATLAB and GA to Solve Job Shop Manufacturing Scheduling Problems
Extending MATLAB and GA to Solve Job Shop Manufacturing Scheduling Problems Hamidullah Khan Niazi 1, Sun Hou-Fang 2, Zhang Fa-Ping 3, Riaz Ahmed 4 ( 1, 4 National University of Sciences and Technology
More informationCHAPTER 6 REAL-VALUED GENETIC ALGORITHMS
CHAPTER 6 REAL-VALUED GENETIC ALGORITHMS 6.1 Introduction Gradient-based algorithms have some weaknesses relative to engineering optimization. Specifically, it is difficult to use gradient-based algorithms
More informationGenetic Algorithm for Circuit Partitioning
Genetic Algorithm for Circuit Partitioning ZOLTAN BARUCH, OCTAVIAN CREŢ, KALMAN PUSZTAI Computer Science Department, Technical University of Cluj-Napoca, 26, Bariţiu St., 3400 Cluj-Napoca, Romania {Zoltan.Baruch,
More informationMANY multimedia communication applications require
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, VOL. 3, NO. 1, APRIL 1999 53 An Orthogonal Genetic Algorithm for Multimedia Multicast Routing Qingfu Zhang and Yiu-Wing Leung, Senior Member, IEEE Abstract
More informationGenetic Algorithm for Dynamic Capacitated Minimum Spanning Tree
28 Genetic Algorithm for Dynamic Capacitated Minimum Spanning Tree 1 Tanu Gupta, 2 Anil Kumar 1 Research Scholar, IFTM, University, Moradabad, India. 2 Sr. Lecturer, KIMT, Moradabad, India. Abstract Many
More informationTopological Machining Fixture Layout Synthesis Using Genetic Algorithms
Topological Machining Fixture Layout Synthesis Using Genetic Algorithms Necmettin Kaya Uludag University, Mechanical Eng. Department, Bursa, Turkey Ferruh Öztürk Uludag University, Mechanical Eng. Department,
More informationIntroduction to Genetic Algorithms. Based on Chapter 10 of Marsland Chapter 9 of Mitchell
Introduction to Genetic Algorithms Based on Chapter 10 of Marsland Chapter 9 of Mitchell Genetic Algorithms - History Pioneered by John Holland in the 1970s Became popular in the late 1980s Based on ideas
More informationMINIMAL EDGE-ORDERED SPANNING TREES USING A SELF-ADAPTING GENETIC ALGORITHM WITH MULTIPLE GENOMIC REPRESENTATIONS
Proceedings of Student/Faculty Research Day, CSIS, Pace University, May 5 th, 2006 MINIMAL EDGE-ORDERED SPANNING TREES USING A SELF-ADAPTING GENETIC ALGORITHM WITH MULTIPLE GENOMIC REPRESENTATIONS Richard
More informationA Genetic Algorithm Applied to Graph Problems Involving Subsets of Vertices
A Genetic Algorithm Applied to Graph Problems Involving Subsets of Vertices Yaser Alkhalifah Roger L. Wainwright Department of Mathematical Department of Mathematical and Computer Sciences and Computer
More informationA Genetic Algorithm Approach to the Group Technology Problem
IMECS 008, 9- March, 008, Hong Kong A Genetic Algorithm Approach to the Group Technology Problem Hatim H. Sharif, Khaled S. El-Kilany, and Mostafa A. Helaly Abstract In recent years, the process of cellular
More informationV.Petridis, S. Kazarlis and A. Papaikonomou
Proceedings of IJCNN 93, p.p. 276-279, Oct. 993, Nagoya, Japan. A GENETIC ALGORITHM FOR TRAINING RECURRENT NEURAL NETWORKS V.Petridis, S. Kazarlis and A. Papaikonomou Dept. of Electrical Eng. Faculty of
More informationGA-Based Heuristic Algorithms for Bandwidth- Delay-Constrained Least-Cost Multicast Routing
GA-Based Heuristic Algorithms for Bandwidth- Delay-Constrained Least-Cost Multicast Routing A. T. Haghighat 1, K. Faez 2, M. Dehghan 3,4, A. Mowlaei 2, Y. Ghahremani 2 1 Atomic Energy Organization of Iran
More informationAdaptive Crossover in Genetic Algorithms Using Statistics Mechanism
in Artificial Life VIII, Standish, Abbass, Bedau (eds)(mit Press) 2002. pp 182 185 1 Adaptive Crossover in Genetic Algorithms Using Statistics Mechanism Shengxiang Yang Department of Mathematics and Computer
More informationRevision of a Floating-Point Genetic Algorithm GENOCOP V for Nonlinear Programming Problems
4 The Open Cybernetics and Systemics Journal, 008,, 4-9 Revision of a Floating-Point Genetic Algorithm GENOCOP V for Nonlinear Programming Problems K. Kato *, M. Sakawa and H. Katagiri Department of Artificial
More informationCHAPTER 4 GENETIC ALGORITHM
69 CHAPTER 4 GENETIC ALGORITHM 4.1 INTRODUCTION Genetic Algorithms (GAs) were first proposed by John Holland (Holland 1975) whose ideas were applied and expanded on by Goldberg (Goldberg 1989). GAs is
More informationREAL-CODED GENETIC ALGORITHMS CONSTRAINED OPTIMIZATION. Nedim TUTKUN
REAL-CODED GENETIC ALGORITHMS CONSTRAINED OPTIMIZATION Nedim TUTKUN nedimtutkun@gmail.com Outlines Unconstrained Optimization Ackley s Function GA Approach for Ackley s Function Nonlinear Programming Penalty
More informationTime Complexity Analysis of the Genetic Algorithm Clustering Method
Time Complexity Analysis of the Genetic Algorithm Clustering Method Z. M. NOPIAH, M. I. KHAIRIR, S. ABDULLAH, M. N. BAHARIN, and A. ARIFIN Department of Mechanical and Materials Engineering Universiti
More informationResearch Article Path Planning Using a Hybrid Evolutionary Algorithm Based on Tree Structure Encoding
e Scientific World Journal, Article ID 746260, 8 pages http://dx.doi.org/10.1155/2014/746260 Research Article Path Planning Using a Hybrid Evolutionary Algorithm Based on Tree Structure Encoding Ming-Yi
More informationJob Shop Scheduling Problem (JSSP) Genetic Algorithms Critical Block and DG distance Neighbourhood Search
A JOB-SHOP SCHEDULING PROBLEM (JSSP) USING GENETIC ALGORITHM (GA) Mahanim Omar, Adam Baharum, Yahya Abu Hasan School of Mathematical Sciences, Universiti Sains Malaysia 11800 Penang, Malaysia Tel: (+)
More informationQoS routing based on genetic algorithm
Computer Communications 22 (1999) 1392 1399 QoS routing based on genetic algorithm F. Xiang*, L. Junzhou, W. Jieyi, G. Guanqun Department of Computer Science and Engineering, Southeast University, Nanjing
More informationAN ALGORITHM OF LOW-COST MULTICAST BASED ON DELAY AND DELAY VARIATION CONSTRAINT
INTERNATIONAL JOURNAL OF INFORMATION AND SYSTEMS SCIENCES Volume 2, Number 1, Pages 51 58 c 2006 Institute for Scientific Computing and Information AN ALGORITHM OF LOW-COST MULTICAST BASED ON DELAY AND
More informationOptimal tree for Genetic Algorithms in the Traveling Salesman Problem (TSP).
Optimal tree for Genetic Algorithms in the Traveling Salesman Problem (TSP). Liew Sing liews_ryan@yahoo.com.sg April 1, 2012 Abstract In this paper, the author proposes optimal tree as a gauge for the
More informationA Genetic Algorithm Framework
Fast, good, cheap. Pick any two. The Project Triangle 3 A Genetic Algorithm Framework In this chapter, we develop a genetic algorithm based framework to address the problem of designing optimal networks
More informationApplication of a Genetic Algorithm to a Scheduling Assignement Problem
Application of a Genetic Algorithm to a Scheduling Assignement Problem Amândio Marques a and Francisco Morgado b a CISUC - Center of Informatics and Systems of University of Coimbra, 3030 Coimbra, Portugal
More informationSolving A Nonlinear Side Constrained Transportation Problem. by Using Spanning Tree-based Genetic Algorithm. with Fuzzy Logic Controller
Solving A Nonlinear Side Constrained Transportation Problem by Using Spanning Tree-based Genetic Algorithm with Fuzzy Logic Controller Yasuhiro Tsujimura *, Mitsuo Gen ** and Admi Syarif **,*** * Department
More informationFeeder Reconfiguration Using Binary Coding Particle Swarm Optimization
488 International Journal Wu-Chang of Control, Wu Automation, and Men-Shen and Systems, Tsai vol. 6, no. 4, pp. 488-494, August 2008 Feeder Reconfiguration Using Binary Coding Particle Swarm Optimization
More informationSimilarity Templates or Schemata. CS 571 Evolutionary Computation
Similarity Templates or Schemata CS 571 Evolutionary Computation Similarities among Strings in a Population A GA has a population of strings (solutions) that change from generation to generation. What
More informationSolving ISP Problem by Using Genetic Algorithm
International Journal of Basic & Applied Sciences IJBAS-IJNS Vol:09 No:10 55 Solving ISP Problem by Using Genetic Algorithm Fozia Hanif Khan 1, Nasiruddin Khan 2, Syed Inayatulla 3, And Shaikh Tajuddin
More informationIEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, VOL. 5, NO. 1, FEBRUARY
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, VOL. 5, NO. 1, FEBRUARY 2001 41 Brief Papers An Orthogonal Genetic Algorithm with Quantization for Global Numerical Optimization Yiu-Wing Leung, Senior Member,
More informationDesigning B-ISDN network topologies using the genetic algorithm
Title Designing B-ISDN network topologies using the genetic algorithm Author(s) Qin, Zhigang; Wu, Felix F; Law, Nathan Citation International Symposium on Modeling, Analysis, and Simulation of Computer
More informationA Modified Genetic Algorithm for Process Scheduling in Distributed System
A Modified Genetic Algorithm for Process Scheduling in Distributed System Vinay Harsora B.V.M. Engineering College Charatar Vidya Mandal Vallabh Vidyanagar, India Dr.Apurva Shah G.H.Patel College of Engineering
More informationGenetic Algorithm Performance with Different Selection Methods in Solving Multi-Objective Network Design Problem
etic Algorithm Performance with Different Selection Methods in Solving Multi-Objective Network Design Problem R. O. Oladele Department of Computer Science University of Ilorin P.M.B. 1515, Ilorin, NIGERIA
More informationDesign of a Route Guidance System with Shortest Driving Time Based on Genetic Algorithm
Design of a Route Guidance System with Shortest Driving Time Based on Genetic Algorithm UMIT ATILA 1, ISMAIL RAKIP KARAS 2, CEVDET GOLOGLU 3, BEYZA YAMAN 2, ILHAMI MUHARREM ORAK 2 1 Directorate of Computer
More informationHybrid of Genetic Algorithm and Continuous Ant Colony Optimization for Optimum Solution
International Journal of Computer Networs and Communications Security VOL.2, NO.1, JANUARY 2014, 1 6 Available online at: www.cncs.org ISSN 2308-9830 C N C S Hybrid of Genetic Algorithm and Continuous
More informationAutomatic Selection of GCC Optimization Options Using A Gene Weighted Genetic Algorithm
Automatic Selection of GCC Optimization Options Using A Gene Weighted Genetic Algorithm San-Chih Lin, Chi-Kuang Chang, Nai-Wei Lin National Chung Cheng University Chiayi, Taiwan 621, R.O.C. {lsch94,changck,naiwei}@cs.ccu.edu.tw
More informationMonika Maharishi Dayanand University Rohtak
Performance enhancement for Text Data Mining using k means clustering based genetic optimization (KMGO) Monika Maharishi Dayanand University Rohtak ABSTRACT For discovering hidden patterns and structures
More informationA Memetic Algorithm for Parallel Machine Scheduling
A Memetic Algorithm for Parallel Machine Scheduling Serafettin Alpay Eskişehir Osmangazi University, Industrial Engineering Department, Eskisehir, Turkiye Abstract - This paper focuses on the problem of
More informationUsing Genetic Algorithms to Solve the Box Stacking Problem
Using Genetic Algorithms to Solve the Box Stacking Problem Jenniffer Estrada, Kris Lee, Ryan Edgar October 7th, 2010 Abstract The box stacking or strip stacking problem is exceedingly difficult to solve
More informationA GENETIC ALGORITHM APPROACH TO OPTIMAL TOPOLOGICAL DESIGN OF ALL TERMINAL NETWORKS
A GENETIC ALGORITHM APPROACH TO OPTIMAL TOPOLOGICAL DESIGN OF ALL TERMINAL NETWORKS BERNA DENGIZ AND FULYA ALTIPARMAK Department of Industrial Engineering Gazi University, Ankara, TURKEY 06570 ALICE E.
More informationAN EFFICIENT ALGORITHM FOR SHORTEST PATH MULTICAST ROUTING UNDER DELAY AND DELAY VARIATION CONSTRAINTS
AN EFFICIENT ALGORITHM FOR SHORTEST PATH MULTICAST ROUTING UNDER DELAY AND DELAY VARIATION CONSTRAINTS Mohamed F. Mokbel Department of Computer Science Purdue University West Lafayette, Indiana 47907 e-mail:
More informationStructural Topology Optimization Using Genetic Algorithms
, July 3-5, 2013, London, U.K. Structural Topology Optimization Using Genetic Algorithms T.Y. Chen and Y.H. Chiou Abstract Topology optimization has been widely used in industrial designs. One problem
More informationGenetic Algorithms Variations and Implementation Issues
Genetic Algorithms Variations and Implementation Issues CS 431 Advanced Topics in AI Classic Genetic Algorithms GAs as proposed by Holland had the following properties: Randomly generated population Binary
More informationC 1 Modified Genetic Algorithm to Solve Time-varying Lot Sizes Economic Lot Scheduling Problem
C 1 Modified Genetic Algorithm to Solve Time-varying Lot Sizes Economic Lot Scheduling Problem Bethany Elvira 1, Yudi Satria 2, dan Rahmi Rusin 3 1 Student in Department of Mathematics, University of Indonesia,
More informationClustering-Based Distributed Precomputation for Quality-of-Service Routing*
Clustering-Based Distributed Precomputation for Quality-of-Service Routing* Yong Cui and Jianping Wu Department of Computer Science, Tsinghua University, Beijing, P.R.China, 100084 cy@csnet1.cs.tsinghua.edu.cn,
More informationGenetic-based Traffic Engineering in GMPLS networks
Genetic-based raffic Engineering in GMPLS networks FRANCESCO PALMIERI and UGO FIORE Centro Servizi Didattico Scientifico Università degli studi di Napoli Federico II Complesso Universitario di Monte S.
More informationSplitter Placement in All-Optical WDM Networks
plitter Placement in All-Optical WDM Networks Hwa-Chun Lin Department of Computer cience National Tsing Hua University Hsinchu 3003, TAIWAN heng-wei Wang Institute of Communications Engineering National
More informationA Modified Genetic Algorithm for Task Scheduling in Multiprocessor Systems
A Modified Genetic Algorithm for Task Scheduling in Multiprocessor Systems Yi-Hsuan Lee and Cheng Chen Department of Computer Science and Information Engineering National Chiao Tung University, Hsinchu,
More informationCHAPTER 6 ORTHOGONAL PARTICLE SWARM OPTIMIZATION
131 CHAPTER 6 ORTHOGONAL PARTICLE SWARM OPTIMIZATION 6.1 INTRODUCTION The Orthogonal arrays are helpful in guiding the heuristic algorithms to obtain a good solution when applied to NP-hard problems. This
More information1. Introduction. 2. Motivation and Problem Definition. Volume 8 Issue 2, February Susmita Mohapatra
Pattern Recall Analysis of the Hopfield Neural Network with a Genetic Algorithm Susmita Mohapatra Department of Computer Science, Utkal University, India Abstract: This paper is focused on the implementation
More informationAbstract. 1 Introduction
Shape optimal design using GA and BEM Eisuke Kita & Hisashi Tanie Department of Mechano-Informatics and Systems, Nagoya University, Nagoya 464-01, Japan Abstract This paper describes a shape optimization
More informationMulticast Routing with Multiple Constraints in High-Speed Networks Based on Genetic Algorithms
Multicast Routing with Multiple Constraints in High-Speed Networks Based on Genetic Algorithms 1.0 Introduction A. T. Haghighat ***, K. Faez *, M. Dehghan **, A. Mowlaei *, Y. Ghahremani * Dept. of Electrical
More informationAn Energy Efficient Multicast Routing Based On Genetic Algorithm for MANET
An Energy Efficient Multicast Routing Based On Genetic Algorithm for MANET P.Prasanna 1, D.Saravanan 2, RM.Chandrasekaran 3 PG scholar, Pavendar Bharathidasan College of Engg and Tech, Tiruchirappalli,
More informationA THREAD BUILDING BLOCKS BASED PARALLEL GENETIC ALGORITHM
www.arpapress.com/volumes/vol31issue1/ijrras_31_1_01.pdf A THREAD BUILDING BLOCKS BASED PARALLEL GENETIC ALGORITHM Erkan Bostanci *, Yilmaz Ar & Sevgi Yigit-Sert SAAT Laboratory, Computer Engineering Department,
More informationIntroduction to Genetic Algorithms
Advanced Topics in Image Analysis and Machine Learning Introduction to Genetic Algorithms Week 3 Faculty of Information Science and Engineering Ritsumeikan University Today s class outline Genetic Algorithms
More informationGenetic Algorithms. Kang Zheng Karl Schober
Genetic Algorithms Kang Zheng Karl Schober Genetic algorithm What is Genetic algorithm? A genetic algorithm (or GA) is a search technique used in computing to find true or approximate solutions to optimization
More informationEvolution Strategies in the Multipoint Connections Routing
408 L. KRULIKOVSKÁ, J. FILANOVÁ, J. PAVLOVIČ, EVOLUTION STRATEGIES IN THE MULTIPOINT CONNECTIONS ROUTING Evolution Strategies in the Multipoint Connections Routing Lenka KRULIKOVSKÁ, Jana FILANOVÁ, Juraj
More informationGenetic algorithm based on number of children and height task for multiprocessor task Scheduling
Genetic algorithm based on number of children and height task for multiprocessor task Scheduling Marjan Abdeyazdan 1,Vahid Arjmand 2,Amir masoud Rahmani 3, Hamid Raeis ghanavati 4 1 Department of Computer
More informationReducing Graphic Conflict In Scale Reduced Maps Using A Genetic Algorithm
Reducing Graphic Conflict In Scale Reduced Maps Using A Genetic Algorithm Dr. Ian D. Wilson School of Technology, University of Glamorgan, Pontypridd CF37 1DL, UK Dr. J. Mark Ware School of Computing,
More informationA HIGH PERFORMANCE ALGORITHM FOR SOLVING LARGE SCALE TRAVELLING SALESMAN PROBLEM USING DISTRIBUTED MEMORY ARCHITECTURES
A HIGH PERFORMANCE ALGORITHM FOR SOLVING LARGE SCALE TRAVELLING SALESMAN PROBLEM USING DISTRIBUTED MEMORY ARCHITECTURES Khushboo Aggarwal1,Sunil Kumar Singh2, Sakar Khattar3 1,3 UG Research Scholar, Bharati
More informationGENERATIONAL MODEL GENETIC ALGORITHM FOR REAL WORLD SET PARTITIONING PROBLEMS
International Journal of Electronic Commerce Studies Vol.4, No.1, pp. 33-46, 2013 doi: 10.7903/ijecs.1138 GENERATIONAL MODEL GENETIC ALGORITHM FOR REAL WORLD SET PARTITIONING PROBLEMS Chi-san Althon Lin
More informationHeuristic Optimisation
Heuristic Optimisation Part 10: Genetic Algorithm Basics Sándor Zoltán Németh http://web.mat.bham.ac.uk/s.z.nemeth s.nemeth@bham.ac.uk University of Birmingham S Z Németh (s.nemeth@bham.ac.uk) Heuristic
More informationADAPTATION OF REPRESENTATION IN GP
1 ADAPTATION OF REPRESENTATION IN GP CEZARY Z. JANIKOW University of Missouri St. Louis Department of Mathematics and Computer Science St Louis, Missouri RAHUL A DESHPANDE University of Missouri St. Louis
More informationComparison of TSP Algorithms
Comparison of TSP Algorithms Project for Models in Facilities Planning and Materials Handling December 1998 Participants: Byung-In Kim Jae-Ik Shim Min Zhang Executive Summary Our purpose in this term project
More informationBi-Objective Optimization for Scheduling in Heterogeneous Computing Systems
Bi-Objective Optimization for Scheduling in Heterogeneous Computing Systems Tony Maciejewski, Kyle Tarplee, Ryan Friese, and Howard Jay Siegel Department of Electrical and Computer Engineering Colorado
More informationA hierarchical network model for network topology design using genetic algorithm
A hierarchical network model for network topology design using genetic algorithm Chunlin Wang 1, Ning Huang 1,a, Shuo Zhang 2, Yue Zhang 1 and Weiqiang Wu 1 1 School of Reliability and Systems Engineering,
More informationOptimizing the Sailing Route for Fixed Groundfish Survey Stations
International Council for the Exploration of the Sea CM 1996/D:17 Optimizing the Sailing Route for Fixed Groundfish Survey Stations Magnus Thor Jonsson Thomas Philip Runarsson Björn Ævar Steinarsson Presented
More informationCONSTRUCTION AND EVALUATION OF MESHES BASED ON SHORTEST PATH TREE VS. STEINER TREE FOR MULTICAST ROUTING IN MOBILE AD HOC NETWORKS
CONSTRUCTION AND EVALUATION OF MESHES BASED ON SHORTEST PATH TREE VS. STEINER TREE FOR MULTICAST ROUTING IN MOBILE AD HOC NETWORKS 1 JAMES SIMS, 2 NATARAJAN MEGHANATHAN 1 Undergrad Student, Department
More informationDELAY-CONSTRAINED MULTICAST ROUTING ALGORITHM BASED ON AVERAGE DISTANCE HEURISTIC
DELAY-CONSTRAINED MULTICAST ROUTING ALGORITHM BASED ON AVERAGE DISTANCE HEURISTIC Zhou Ling 1, 2, Ding Wei-xiong 2 and Zhu Yu-xi 2 1 Department of Information Science and Engineer, Central South University,
More informationA Steady-State Genetic Algorithm for Traveling Salesman Problem with Pickup and Delivery
A Steady-State Genetic Algorithm for Traveling Salesman Problem with Pickup and Delivery Monika Sharma 1, Deepak Sharma 2 1 Research Scholar Department of Computer Science and Engineering, NNSS SGI Samalkha,
More informationTask Graph Scheduling on Multiprocessor System using Genetic Algorithm
Task Graph Scheduling on Multiprocessor System using Genetic Algorithm Amit Bansal M.Tech student DCSE, G.N.D.U. Amritsar, India Ravreet Kaur Asst. Professor DCSE, G.N.D.U. Amritsar, India Abstract Task
More informationGraph Coloring Algorithms for Assignment Problems in Radio Networks
c 1995 by Lawrence Erlbaum Assoc. Inc. Pub., Hillsdale, NJ 07642 Applications of Neural Networks to Telecommunications 2 pp. 49 56 (1995). ISBN 0-8058-2084-1 Graph Coloring Algorithms for Assignment Problems
More informationUsing Genetic Algorithm with Triple Crossover to Solve Travelling Salesman Problem
Proc. 1 st International Conference on Machine Learning and Data Engineering (icmlde2017) 20-22 Nov 2017, Sydney, Australia ISBN: 978-0-6480147-3-7 Using Genetic Algorithm with Triple Crossover to Solve
More informationHYBRID GENETIC ALGORITHM WITH GREAT DELUGE TO SOLVE CONSTRAINED OPTIMIZATION PROBLEMS
HYBRID GENETIC ALGORITHM WITH GREAT DELUGE TO SOLVE CONSTRAINED OPTIMIZATION PROBLEMS NABEEL AL-MILLI Financial and Business Administration and Computer Science Department Zarqa University College Al-Balqa'
More informationAutomatic Generation of Test Case based on GATS Algorithm *
Automatic Generation of Test Case based on GATS Algorithm * Xiajiong Shen and Qian Wang Institute of Data and Knowledge Engineering Henan University Kaifeng, Henan Province 475001, China shenxj@henu.edu.cn
More informationA Genetic Algorithm for Multiprocessor Task Scheduling
A Genetic Algorithm for Multiprocessor Task Scheduling Tashniba Kaiser, Olawale Jegede, Ken Ferens, Douglas Buchanan Dept. of Electrical and Computer Engineering, University of Manitoba, Winnipeg, MB,
More informationOptimal Virtual Path Routing Using a Parallel Annealed Genetic Algorithm *
Optimal Virtual Path Routing Using a Parallel Annealed Genetic Algorithm * Murat Eren Cem Ersoy Computer Networks Research Laboratory Computer Engineering Department Bogazici University, 80815 Bebek, Istanbul,
More informationA New Exam Timetabling Algorithm
A New Exam Timetabling Algorithm K.J. Batenburg W.J. Palenstijn Leiden Institute of Advanced Computer Science (LIACS), Universiteit Leiden P.O. Box 9512, 2300 RA Leiden, The Netherlands {kbatenbu, wpalenst}@math.leidenuniv.nl
More informationAn Improved Genetic Algorithm based Fault tolerance Method for distributed wireless sensor networks.
An Improved Genetic Algorithm based Fault tolerance Method for distributed wireless sensor networks. Anagha Nanoti, Prof. R. K. Krishna M.Tech student in Department of Computer Science 1, Department of
More informationCHAPTER 5 ENERGY MANAGEMENT USING FUZZY GENETIC APPROACH IN WSN
97 CHAPTER 5 ENERGY MANAGEMENT USING FUZZY GENETIC APPROACH IN WSN 5.1 INTRODUCTION Fuzzy systems have been applied to the area of routing in ad hoc networks, aiming to obtain more adaptive and flexible
More informationRadio Network Planning with Combinatorial Optimisation Algorithms
Author manuscript, published in "ACTS Mobile Telecommunications Summit 96, Granada : Spain (1996)" Radio Network Planning with Combinatorial Optimisation Algorithms P. Calégari, F. Guidec, P. Kuonen, EPFL,
More information