D.E. Goldberg and R. Lingle, Alleles, loci, and the traveling salesman problem, Proceedings of the International Conference on Genetic Algorithms and their Applications (John J. Gerenstette, ed.), Morgan Kaufmann Pulishers Inc., 1987.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....about t cities. An exact or heuristic method is then applied to each subproblem and the resulting subtours are finally patched together to yield a tour through all the cities. To date the best genetic algorithms designed for TSP problems have used permutation crossovers for example [Davis 1985] [Goldberg 1985], Smith 1985] or edge recombination operators [Whitley 1989] and required massive computing power to gain very good approximate solutions (often actually optimal) to problems with a few hundred cities [GorgesSchleuter 1990] Gorges Schleuter cleverly exploited the architecture of a transputer ....

D. E. Goldberg and R. Lingle. Alleles, loci, and the traveling salesman problem. Proceedings of an International Conference on Genetic Algorithms and Their Applications, pp154-159. Ed. J. Grefenstette, Lawrence Erlbaum Associates, Hillsdale, NJ, 1985.

....operators have been devised. The mutation operator simply exchanges two random bases on the chromosome with a given mutation rate pm (usually in the range of 0:001 0:01) One of the most prominent crossover operators for permutation encoding is the Partially Matched Crossover (PMX) proposed in [16]. Its basic mechanisms are presented in Figure 2. 3 2 1 4 5 6 0 0 5 2 3 6 1 4 4 1 2 3 6 5 0 0 6 1 4 5 2 3 Crossover Sites Offspring Parents Figure 2: Partially Matched Crossover (PMX) Generally, for crossover two parent chromosomes are selected, and crossover is performed according to a ....

David E. Goldberg and Robert Lingle. Alleles, Loci, and the Traveling Salesman Problem. In John J. Grefenstette, editor, Proceedings of the First International Conference on Genetic Algorithms and their Applications, pages 154-159. Texas Instruments, Inc. and Naval Research Laboratory, Lawrence Erlbaum Associates, 1985.

....at random. Notice that a simple exchange of the parts between the cut positions (as often applied to binary encoded EA problems) is not possible, since this would often produce invalid solutions. The three operators differ in the strategies to validate the offsprings after the exchange: PMX [11]: Construct the children by choosing the part between the cut positions from one parent and preserve the absolute position and order of as many variables as possible from the second parent. OX [2] Construct the children by choosing the part between the cut position from one parent and preserve ....

....cut position from one parent and preserve the relative position and order of as many variables as possible from the second parent. CX [17] A variable at a position of a child must retain from exactly the same position of one of the parents . For more details about the crossover operators see [11, 2, 17, 7]. Additionally, three different mutation operators are Mutation ( MUT) Select a parent element at random and choose one position. The value of the variable at this position is used to determine the position of the variable with which it is exchanged. 2 time Mutation ( MUT2) Perform MUT two ....

D.E. Goldberg and R. Lingle. Alleles, loci, and the traveling salesman problem. In Int'l Conference on Genetic Algorithms, pages 154--159, 1985.

....2, 1, 0) an application of one point crossover with a crossover point in the middle may result in two o#spring genotypes (0, 1, 1, 0) and (3, 2, 2, 3) both of which are not permutations. To ensure feasibility of the o#spring, specialized recombination and mutation operators have been designed [8, 10, 15, 21] that ensure that the o#spring are always permutations. Alternatively, a di#erent encoding of permutations can be used such that classical crossover operators can straightforwardly be applied to this encoding. The most prominent and successful example of such an encoding is the random keys ....

D. E. Goldberg and R. Lingle, Jr. Alleles, loci, and the traveling salesman problem. In J. J. Grefenstette, editor, Proceedings of the First International Conference on Genetic Algorithms and their Applications, pages 154--159. Lawrence Erlbaum Associates, 1985.

....slot corresponds to one chromosome s tness. The greater the chromosome s tness, the greater the slot size and the probability of the chromosome being selected. The only genetic operators we employ are crossover and mutation, as in [6] The crossover operator is Partially Mapped Crossover (PMX ) [9], which generates descendants permuting their parents. The mutation operators are Mutation (MUT ) 6] and its variants, MUT2 and extended 2 MUT N. The operator MUT2 performs MUT two times on the same parent. Originally, the MUTN operator performes MUT on a random initial position and its neighbor ....

D. E. Goldberg and R. Lingle. Alleles, loci, and the traveling salesman problem. In Proceedings of the International Conference on Genetic Algorithms, pages 154159, 1985.

....ins ( and N swap ( are used as N ( the resulting mutations are denoted as INS and SWAP respectively. For algorithms GA and GLS, various rules of crossover, mutation and selection are possible. We examined the crossover operators such as order crossover [33, 114] partially mapped crossover [67], cycle crossover [120] and so on. The comparisons of these crossover operators are found in [156] For the mutation operator, we examined both operations INS and SWAP as in the case of ILS. In our experiment, the set of generated candidate solutions Q N (P ) is determined as follows. We use jQj ....

D.E. Goldberg and R. Lingle, \Alleles, loci, and the traveling salesman problem," Proc. 1st International Conference on Genetic Algorithms, pp.154-159, 1985.

....has been debated [Spears, 1993] it is not our purpose to be part of this debate. Our aim, instead, is to facilitate the complex interaction between mutation and crossover by means of classical sorting. In GAs, the concept of searching for permutations has been present since 1985 [Davis, 1985, Goldberg and Lingle, 1985]. Naively crossing or mutating the chromosomes of permutations can produce invalid representations, so compatible order based operators are designed to assure that the offspring is a valid representation of a permutation. However, there are several proposals for these order based operators. In the ....

....That is, our experiments are designed to illustrate that our mutation operator SORT achieves an hybridization with sorting methods that speeds up convergence to much better solutions. The operators and parameters of the GAs used in our experiments are summarized in Table 1. Operators like PMX [Goldberg and Lingle, 1985] are well known in the GA community when applied to optimization problems searching for permutations. We will skip PMX details here. Similarly, we skip description of the Inhibitive Selection and the details of Ranking Scaling [Wang et al. 1997] Parameter HGA sorting Encoding Scheme Integer ....

D. E. Goldberg and R. J. Lingle. Alleles, loci, and the traveling salesman problem. In J. Grefenstette, editor, Proceedings of an International Conference on Genetic Algorithms and Thei Applications, pages 154--159. Lawrence Erlbaum Associates, 1985.

....121, 122] Freisleben, Bernd, 54, 76] Fujikawa, H. 83] Fujikawa, Hideji, 49] Fukuda, Toshio, 58, 88] Fuquay, D Ann, 157] Gambardella, Luca M. 69] Gammack, John G. 117] Garigliano, Roberto, 141] Gause, Donald C. 21] Gen, Mitsuo, 23] Gold, S onke Sonnich, 150] Goldberg, David E. [123] Gopal, Rajeev, 124] Gorges Schleuter, Martina, 71] Graham, Paul, 35] Grefenstette, John J. 124] Guan, Shanguchuan, 125, 126, 136] Gucht, Dirk Van, 124, 128, 154] Guertin, Fran cois, 62] Gus eld, D. 65] Han, Seung Kee, 47] Haneda, H. 84] Hilliard, M. R. 135] Holland, J. R. C. ....

....[70] Larra naga, Pedro, 60] Larra naga, P. 93] Lee, Kang Ku, 47] Lee, Keon Myung, 86] Lee, Kyung Mi, 86] Lee, Seong Whan, 47] Leung, Henry, 52] Leung, K. S. 18] Lidd, Mark L. 134] Liepins, Gunar E. 126, 135, 136] Lin, Feng Tse, 116] Lin, Wei, 21, 43, 81] Lingle, Robert, Jr. [123] Litva, John, 52] Lo, Titus, 52] Lu, Chien Ying, 81] Lynch, Lucy A. 53] Maekawa, Keiji, 24] Magyar, G abor, 73] Maini, Harpal Singh, 29] Manderick, Bernard, 137] Martin, Juan, 49] Martin, O. C. 92, 98] Mathias, Keith E. 152, 159] Matsuo, S. 156] McDaniel, S. 152] Megherbi, ....

[Article contains additional citation context not shown here]

David E. Goldberg and Jr. Robert Lingle. Alleles, loci, and the traveling salesman problem. In Grefenstette

....is equally a synonym for an atomic information unit in biology. 6 two random bases on the chromosome with a given mutation rate pm (usually in the range of 0:001 0:01) One of the most prominent crossover operators for permutation encoding is the Partially Matched Crossover (PMX) proposed in (Goldberg and Lingle, 1985). Its basic mechanisms are presented in Figure 2. 3 2 1 4 5 6 0 0 5 2 3 6 1 4 4 1 2 3 6 5 0 0 6 1 4 5 2 3 Crossover Sites Offspring Parents Fig. 2. Partially Matched Crossover (PMX) Generally, for crossover two parent chromosomes are selected, and crossover is performed according to a ....

Goldberg, D. E. and Lingle, R. (1985). Alleles, Loci, and the Traveling Salesman Problem.

....were used for the reproduction process: MUT: Select one parent element. Exchange two randomly chosen variables. INV: Select one parent element. Invert the order of all variables between two randomly selected cutpoints (see Figure 2) PMX: Perform the partially matched crossover (PMX) operator (Goldberg Lingle, 1985) on two selected parents. 1 More sophisticated methods to generate an initial population are possible. However, the main focus of this paper is to present techniques to speed up the computation time. All operators are used with equal probabilities. Linear ranking was used to select the parents ....

Goldberg, D.E., & Lingle, R. 1985. Alleles, Loci, and the Traveling Salesman Problem. Pages 154--159 of: Int'l Conference on Genetic Algorithms.

....does not. Voting recombination is a highly disruptive recombination with a high degree of implicit mutations. The SAGA algorithm proposed in [9] incorporates simulated annealing instead of a simple 2 opt local search. Recombination is performed similarly to the PMX crossover proposed in [33] for the TSP. A sequence of assignments between two randomly chosen crossover points is copied from the rst parent to the o spring. Additional assignments are made that are found in the second parent while maintaining feasibility. The remaining unassigned facilities are randomly allocated. Hence, ....

D. E. Goldberg and J. R. Lingle, \Alleles, Loci, and the Traveling Salesman Problem," in Proceedings of an International Conference on Genetic Algorithms and their Applications, pp. 154-159, Carnegie Mellon publishers, 1985.

....of multi modal functions. Goldberg [14, 15] expanded the theoretical foundations of GA, as well as the range of applications. GA methods have been successfully extended to classical combinatorial optimization problems, including job shop scheduling [37] the Traveling Salesman Problem (TSP) [16, 22, 42], VLSI component placement [7] quadratic assignment problems [21, 38] and others. This paper discusses previous approaches using GA search for constrained optimization problems, then introduces the general adaptive penalty approach. The adaptive penalty is demonstrated to be both effective and ....

D. E. Goldberg and R. Lingle, 1985, Alleles, Loci, and the Traveling Salesman Problem, Proceedings of the International Conference on Genetic Algorithms and Their Applications, J. J. Grefenstette (ed.), 154-159. 20

....the crossover and mutation operators and then make some kind of genetic repair that changes the infeasible solutions to feasible ones through the use of a filtering algorithm. In the traveling salesman case the most successful approaches have been the introduction of a new crossover operator [18] and the application of genetic repair [24] The redefinition of mutation is in this case particularly straightforward: it is sufficient to exchange the position of two cities in the string. In the TTP on the other hand, even after the redefinition of both crossover and mutation, it has been ....

D.E. GOLDBERG and R. LINGLE, 1985. Alleles, loci, and the traveling salesman problem, Proceedings of the First International Conference on Genetic Algorithms and Their Applications, Lawrence-Erlbaum.

....at random. Notice that a simple exchange of the parts between the cut positions (as often applied to binary encoded GA problems) is not possible, since this would often produce invalid solutions. The three operators differ in the strategies to validate the children after the exchange: PMX [10]: Construct the children by choosing the part between the cut positions from one parent and preserve the absolute position and order of as many variables as possible from the second parent. OX [3] Construct the children by choosing the part between the cut position from one parent and preserve ....

....cut position from one parent and preserve the relative position and order of as many variables as possible from the second parent. CX [14] A variable at a position of a child must retain from exactly the same position of one of the parents 2 . For more details about the crossover operators see [10, 3, 14, 6]. 1 In our approach the internal controlling of GM is adapted in a way, that nondeterministic decisions in the algorithm are influenced by parameters. Therefore we can get various data orderings after applying GM. 2 The name derives from the fact, that for the construction of the children ....

D.E. Goldberg and R. Lingle. Alleles, loci, and the traveling salesman problem. In Int'l Conference on Genetic Algorithms, pages 154--159, 1985.

....positions at random. Notice that a simple exchange of the parts between the cut positions (as often applied to binary coded GA problems) is not possible, since this would often produce invalid solutions. The three operators differ in the strategie to validate the children after the exchange: PMX [9]: Construct the children by choosing the part between the cut positions from one parent and preserve the absolute position and order of as many variables as possible from the second parent. OX [2] Construct the children by choosing the part between the cut position from one parent and preserve ....

D.E. Goldberg and R. Lingle. Alleles, loci, and the traveling salesman problem. In Proceedings of ICGA, pages 154--159, 1985.

....utility of the inversion operator and like Rosenberg reported that inversion is too slow and not very effective. Holland (Holland 1975) also realized the role of linkage learning and suggested that the use of inversion operator despite its reported failure in earlier studies. Goldberg and Lingle (Goldberg Lingle 1985) introduced a new PMX crossover operator that could combine the ordering information of the selected regions of the parent chromosomes. They concluded that this approach has more potential then the earlier approaches. Schaffer and Morishima (Schaffer Morishima 1987) introduced a set of flags in ....

Goldberg, D. E., and Lingle, R. 1985. Alleles, loci, and the traveling salesman problem. In Grefenstette, J. J., ed., Proceedings of an International Conference on Genetic Algorithms and Their Applications. 154-- 159.

....through learning , we employed a genetic algorithm technique to search the families for good replacement policies. Genetic algorithms have been used successfully in a wide variety of applications including VLSI circuit layout [8, 22] adaptive filter design [12] the travelling salesman problem [14, 27], iterated prisoner s dilemma [4] and job shop scheduling [7] Other areas of application range from cellular biology to demographics [15] The basic notion in our a genetic algorithm approach is to mimic evolution s mechanisms in the search for a good replacement policy. For example take our ....

D. E. Goldberg and R. Lingle. Alleles, loci, and the traveling salesman problem. In Proceedings of the International Conference on Genetic Algorithms and Their Applications, pages 154--159, 1985.

No context found.

D.E. Goldberg and R. Lingle, Alleles, loci, and the traveling salesman problem, Proceedings of the International Conference on Genetic Algorithms and their Applications (John J. Gerenstette, ed.), Morgan Kaufmann Pulishers Inc., 1987.

No context found.

D. E. Goldberg and R. Lingle. Alleles, Loci, and the Traveling Salesman Problem. In [21], 1985.

No context found.

D.E. Goldberg and R. Lingle. Alleles, loci, and the traveling salesman problem. In Int'l Conference on Genetic Algorithms, pages 154--159, 1985.

No context found.

D. E. Goldberg and J. R. Lingle, \Alleles, Loci, and the Traveling Salesman Problem," in Proceedings of an International Conference on Genetic Algorithms and their Applications, (Carnegie Mellon Publishers, 1985).

No context found.

D. Goldberg and R. Lingle R., 1985, Alleles, loci, and the traveling salesman problem. Proceedings of the of the International Conference on Genetic Algorithms and Their Applications, Carnegie Mellon University, 162-164, 1985.

No context found.

D. Goldberg and R. Lingle. Alleles, loci, and the traveling salesman problem. In International Conference on Genetic Algorithms and their Applications, 1985.

No context found.

Goldberg, David E. and Robert Lingle, Jr. (1985). Alleles, Loci, and the Traveling Salesman Problem, Proc. Int'l Conference on Genetic Algorithms and their Applications.

No context found.

Goldberg, David E. and Robert Lingle, Jr. (1985). Alleles, Loci, and the Traveling Salesman Problem, Proc. Int'l Conference on Genetic Algorithms and their Applications.

First 50 documents

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC