Goldberg D and Lingle R. Alleles, Loci, and the Travelling Salesman Problem. In Grefenstette J. editor. Proceedings of the First International Reference on Genetic Algorithms and their Applications, Hillsdale New Jersey: Lawrence Erlbaum Associates Publishers, 1985:154-159.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....for example, all instances of the tasks need their worst case execution time to nish. In this study, we decided to use the technique of GAs because it has already been extensively used for solving scheduling problems such as Job Shop [12, 43, 18, 15, 46] the Travelling Salesman problem [45, 25], instruction scheduling [8, 7] or scheduling on multiprocessor en4 vironments [30, 48, 16, 33, 11, 17, 53] and has proven to be successful. GA performances have been compared with other optimisation techniques such as Tabu Search [6] or Simulated Annealing [51] and the results show that GAs are ....

....becomes with i = 1. 5. Go to step 3 if the two mates have not been selected yet. Once two mates C0 and C1 have been selected, we propose to apply a 2 point crossover operator inspired from the Partially Mapped X (PMX) operator proposed by Goldberg and Lingle for the travelling salesman problem [25]. The crossover of individuals C0 and C1 creates one o spring C2 as follows : 1. Choose randomly two integers 1 , 2 such that 1 6 1 6 2 6 n. 2. crossover applies between genes 1 and 2 as follows : for i : 1 to 2 do begin if prio(C0 ; i) not xed then C2 [i] prio : random(C0 ....

D.E. Goldberg and R. Lingle. Alleles, loci, and the travelling salesman problem. In Proceedings of the First Int. Conf. on Genetic Algorithms, pages 154159, 1985.

....The R 3 operator is presented more as a useful starting point from which to design new operators than as a useful tool in itself. The crossover operators for permutation problems described here are given in [76] Partially Mapped Crossover (PMX) PMX was first proposed by Goldberg and Lingle [28]. PMX maps a randomly selected section of one parent directly onto an offspring by a sequence of transpositions on the other parent. The PMX algorithm is given in figure 5.2. PMX can be written in terms of transpositions on a parent. A transposition is a permutation where two elements are swapped ....

D. Goldberg and R. Lingle. Alleles, loci, and the Travelling Salesman Problem. In Grefenstette [33].

....cities in a distance chart and in others they are constructed from a random graph. Regardless of the data, both approaches experience the problem of invalid tours. A tour is invalid in the TSP when a city is visited more than once. One solution has been the PMX partially matched crossover system [12]. This technique reduces the effect of crossover by matching a section in each individual and then performing a limited crossover. This technique is restrictive and results have only been published for 10 and 33 city tours. It is for this reason that a new form of check is required so as to manage ....

D. Goldberg & R. Lingle, Alleles, Loci, and the Travelling Salesman Problem, Proceedings of an International Conference on Genetic Algorithms and their Applications, 1985, 154-159.

....steepest ascent, but this leaves open the possibility that an individual would have negative fitness (i.e. c worst is not a global maximum) which violates the definition of fitness. The crossover operator is a version of the partially matched crossover (PMX) operator by Goldberg and Lingle [27] . Given two parents structures, the operator copies a substring of the labels from the first parent directly into corresponding positions in the offspring and fills in the remaining positions with the unused labels in the order they appear in the second parent. Figure 5 shows an application of ....

D. Goldberg and R. Lingle, 1985. Alleles, Loci, and the Travelling Salesman Problem, In Proceedings of an International Conference on Genetic Algorithms and their Applications, 154-159.

....Operators: Instead of creating invalid chromosomes the GA operators are modified to generate only valid chromosomes. Falling into the third category and concerning permutationrespecting crossover operators, the following operators are worth to mention: ffl Partially mapped crossover (PMX) [1] ffl Order crossover (OX) 2] ffl Edge recombination crossover (ERX) 3] All of the above mentioned works are solutions to the genetic handling of n permutations of n objects problem. The proposed technique is an alternative to these and is a solution to a more general problem. In the ....

D.E. Goldberg and R. Lingle, Alleles, Loci, and the Travelling Salesman Problem, in:J.J. Grefenstette (ed), Proceedings of the First International Conference on Genetic Algorithms and Their Application, Lawrence Erlbaum Associates, Hillsdale, NJ, 1985, pp. 154-159

....for a time tabling problem, where classes are grouped into periods, and crossover is carried out separately for each period. Genetic Algorithms and grouping problems Genetic algorithms(GAs) have been applied to a number of ordering problems, ranging from the Travelling Salesperson Problem [Goldberg 85] to job shop scheduling [Davis 85] Typically these problems have been mapped by representing the solutions as ordered lists of alleles, each allele representing an item. Falkenauer [Falken 91] has defined a sub set of these problems as grouping problems. Such problems require the grouping of ....

Goldberg, D.E. and Lingle, R. Alleles, Loci, and the Travelling Salesman Problem. Proceedings of an International Conference on Genetic Algorithms and their Applications pp 154-159, 1985

No context found.

Goldberg D and Lingle R. Alleles, Loci, and the Travelling Salesman Problem. In Grefenstette J. editor. Proceedings of the First International Reference on Genetic Algorithms and their Applications, Hillsdale New Jersey: Lawrence Erlbaum Associates Publishers, 1985:154-159.

No context found.

D.E. Goldberg and R. Lingle. Alleles, loci, and the travelling salesman problem. In Proceedings of the First Int. Conf. on Genetic Algorithms, pages 154159, 1985.

No context found.

Goldberg D and Lingle R (1985). Alleles, Loci, and the Travelling Salesman Problem. In Grefenstette J. editor. Proceedings of the First International Reference on Genetic Algorithms and their Applications, Hillsdale New Jersey: Lawrence Erlbaum Associates Publishers, pp 154-159.

No context found.

D.E. Goldberg and R. Lingle, Alleles, Loci, and the Travelling Salesman Problem, in:J.J. Grefenstette (ed), Proceedings of the First International Conference on Genetic Algorithms and Their Application, Lawrence Erlbaum Associates, Hillsdale, NJ, 1985, pp. 154-159

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