R. M. Brady, "Optimization Strategies Gleaned from Biological Evolution," Nature, vol. 317, pp. 804--806, 1985.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....popular method among conventional GA solutions of TSP will be reviewed. In section 3 an alternative solution will be introduced. A comparative experimental study will be covered in section 4 which is followed by the conclusion. 2 Conventional Approach The rst GA approach on TSP was by Brady [1] which was then followed by Grefenstette et al. 4] Goldberg and Linge [6] and Oliver et al. For a detailed discussion on TSP a good reference is the study of Lawler et al. 11] A perfect review article on GA for TSP is by Larranaga et al. 10] In the conventional approach a chromosome which ....

.... Order Crossover (OX1) Davis (1985) 2] Order Based Crossover (OX2) Syswerda (1991) 17] Position Based Crossover (POS) Syswerda (1991) 17] Heuristic Crossover (HX) Grefenstette (1987) 5] Edge Recombination Crossover (ER) Whitley et al. 1989) 18] Sorted Match Crossover (SMX) Brady (1985) [1] Maximal Preservative Crossover (MPX) M uhlenbein et al. 1988) 13] Voting Recombination Crossover (VR) M uhlenbein (1989) 14] Alternating Position Crossover (AP) Larranaga et al. 1996) 9] Among these PMX, ER and POS are quoted to be the fastest operators as far as the number of ....

Brady, R.M. \Optimization Strategies Gleaned from Biological Evolution." Nature 317, 1985, pp. 804.

.... In addition to this bioinformatical application, common intervals also relate to the consecutive arrangement problem [2, 7, 8] and to cross over operators for genetic algorithms solving sequencing problems such as the traveling salesman problem or the single machine scheduling problem [3, 15, 18]. Recently, Uno and Yagiura [26] presented an optimal O(n K) time and O(n) space algorithm for nding all K n 2 common intervals of two permutations 1 and 2 of n elements. We generalized this algorithm to a family = 1 ; k ) of k 2 permutations in optimal O(kn K) time ....

R. M. Brady. Optimization strategies gleaned from biological evolution. Nature, 317:804-806, 1985.

....consecutively. Finding all common intervals of a set of permutations reverses this problem. Some genetic algorithms using subtour exchange crossover based on common intervals have been proposed for sequencing problems such as the traveling salesman problem or the single machine scheduling problem [2, 5, 7]. In a bioinformatical context, common intervals can be used to detect possible functional associations between genes. It is supposed that genes occurring in different genomes in each other s neighborhood tend to encode Present address: Department of Computer Science Engineering, APM 3132, ....

R. M. Brady. Optimization strategies gleaned from biological evolution. Nature, 317:804--806, 1985.

....more fit individuals. This evolutionary approach have also been considered by G.E.P. Box [31] G.J. Friedman [84] W.W. Bledsoe [24] H.J. Bremermann [38] 39] L.J. Fogel [75] 76] 77] 78] D.B. Fogel [79] I. Rechenberg [156] 157] H. Schwefel [168] K.A. Dewdney [68] 69] and R.M. Brady [36]. In general, a GA is composed of three different operators: Reproduction, Crossover and Mutation. Usually, it underlies a string representation of individuals where generally this codes the parameter set, not the parameters themselves. It uses probabilistic rules to search. For example during ....

R.M. Brady, "Optimization Strategies Gleaned from Biological Evolution ", Nature 317, pp. 804 (1985).

....algorithm (abbreviated as GA; also called as evolutionary computation 1 ) 34, 68, 76, 94, 115, 149] simulated annealing (abbreviated as SA) 1, 3, 24, 86, 92] tabu search (abbreviated as TS) 55, 59, 62, 64, 75] and so on. Among variants of these are genetic local search (abbreviated as GLS) [17, 18, 49, 82, 95, 114, 146, 151], which incorporates LS into GA, greedy randomized adaptive search procedure (abbreviated as GRASP) 43, 45, 46, 47, 97, 99, 137] which uses randomized greedy methods to generate initial solutions for LS, iterated local search (abbreviated as ILS) 85, 110] which uses good solutions found in the ....

....generate initial solutions by combining them. As the word genetic algorithm (GA) is also used to mean the general framework including GLS, we use simple GA to denote the genetic algorithms which do not incorporate LS, if we want to distinguish them from GLS. The basic idea of GLS was proposed in [18]. Early references such as [34, 68, 82, 83, 111, 113, 114, 146, 151] have also mentioned the idea of GLS. To our knowledge, the word genetic local search rst appeared in [151] A similar but more general mechanism of generating initial solutions from many reference solutions is also proposed and ....

R.M. Brady, \Optimization strategies gleaned from biological evolution," Nature, vol.317, pp.804-806, 1985.

....Operational Research Society, 395, 542] Journal of Visualization and Computer Animation, 700] Knowledge Based Systems (UK) 164] Kybernetes, 549] Meas Sci Technol, 181] Microelectron. J. 176] Microprocessors and Microsystems, 283] Microprocessors and Microsystems (UK) 91] Nature, [481, 482, 484] Neural Computing and Applications, 683] Neural Computing Applications, 30] Neural Networks (USA) 306] New Scientist, 604, 673] Nuclear Engineer, 663] Online and CD ROM Review, 40] Parallel Computing, 589] Pattern Recognition Letters, 343] Power Syst. Technol. China) 285] ....

....I. M. 387] Booker, Peter, 654] Bostock, Richard T. J. 101] Bounds, D. G. 483] Bounds, David G. 481, 482] Bounds, David, 101] Bourset, F. 358] Boyd, Ian D. 18] Bradbeer, P. V. G. 335] Bradbeer, Peter V. G. 50, 451] Bradshaw, A. 199] Bradshaw, J. 635] Brady, R. M. [484] Bramer, M. A. 458] Brandon, J. A. 697] Bright, M. S. 383, 388] Brind, C. 185] Brown, M. 430] Brown, N. S. 400] Brown, Robert D. 77, 133, 551] Bull, D. R. 177, 263, 286] Bull, David R. 17, 106, 139, 152, 477, 478, 479, 480] Bull, Lawrence, 19, 140, 143, 153, 186, 375, ....

[Article contains additional citation context not shown here]

R. M. Brady. Optimization strategies gleaned from biological evolution. Nature, 317(?):804--806, 31. November 1985. ga:Brady85.

....Numerous heuristic algorithms have been developed for the TSP. Many of them are described in Lawler et al. 32] Kirkpatrick et al. 31] were the rst who tried to solve the TSP with simulated annealing. The rst to tackle the Travelling Salesman Problem with genetic algorithms was Brady [7]. His example was followed by Grefenstette et al. 23] Goldberg and Lingle [20] Oliver et al. 44] and many others. Other evolutionary algorithms have been applied to the TSP by, amongst others, Fogel [14] Banzhaf [4] and Ambati et al. 2] For an extensive discussion on the TSP we refer to ....

....1 : 1 0 0 0 1 1 0 0 0 1 0 0 1 0 1; parent 2 : 0 1 0 1 0 0 1 0 1 1 0 0 0 0 1; o spring: 0 0 0 1 1 1 0 0 1 1 0 0 1 0 0: The edge (5,6) occurred in both parents. However, it was not passed on to the o spring. 4.4. 6 Sorted Match Crossover The sorted match crossover operator was proposed by Brady [7]. It (see also M uhlenbein et al. 40] searches for subtours in both the parent tours which have the same length, which start in the same city, which end in the same city and which contain the same set of cities. If such subtours are found the cost of these substrings are determined. The o spring ....

Brady, R.M. (1985), Optimization Strategies Gleaned From Biological Evolution, Nature, 317, pp. 804-806.

....pockets in our approach. The TSP has been addressed by people in the GA community like Goldberg and Grefenstette [58] 60] 61] Jog, Van Gucht and coworkers [75] 76] 128] H. Muhlenbein and M. Gorges Schleuter [59] D. Whitley and coworkers [133] 134] 126] and references therein) and others [15] [88] 106] 122] 13] 118] 41] 42] 43] 1] 2] 62] 92] 34] 46] 74] Among them, some researchers started to depart from the application of traditional genetic algorithms and started to introduce periods of local search in their strategies for the TSP. Some of them defined this ....

R.M. Brady, Optimization Strategies Gleaned from Biological Evolution, Nature, 317 (1985) 804-806.

....as shown. By themselves, these operations give rise to the well known 2 Opt and 3 Opt algorithms. In more complicated combinations, they give rise to the famous Lin Kernighan algorithm [23] and provide the basic engines for most applications of simulated annealing [5,17,19] genetic algorithms [4,25,26], and tabu search [11] to the TSP. Two of the authors of the current paper have been involved in an extended study [3,14] of the 2 Opt, 3 Opt, and Lin Kernighan algorithms [22,23] and how they can be adapted to very large instances. Many applications give rise to instances with between 10,000 and ....

....] for each pair of integers h , j such that 0 h k and 1 j 2 k h = M 2 h , where update U[h , j ] says to complement the bits in positions ( j 1)2 h 1 through j 2 h . For instance, U[0 , j ] says to complement the jth bit, U[k , 1] says to complement the entire string, and U[3 , 4] says to complement the bits in positions 25 through 32. For technical reasons we also include a vacuous update U[0] whose effect is to leave the current bit vector unchanged, for an overall total of 2M update operations. In what follows it will be useful to think of each update operation U[h , j ....

R. M. BRADY, "Optimization strategies gleaned from biological evolution," Nature 317 (October 31, 1985), 804-806.

....networks [30] simulated annealing [21] and tabu search [9] The results published in the literature indicate that it is necessary to combine some of these methods in order to arrive at high quality solutions, particularly for large problem instances. For example, local search has been used in [7], 8] 18] 33] 34] to improve genetic algorithms (GAs) for the TSP. As a consequence, Gorges Schleuter and M uhlenbein [15] 16] 27] have proposed a GA where all individuals of the population are local minima with respect to the embedded local search method. Ulder et al. 35] compared this ....

R. M. Brady, "Optimization Strategies Gleaned from Biological Evolution," Nature, vol. 317, pp. 804--806, 1985.

....]g: 1) The length of a common interval ( x A ; y A ] x B ; y B ] is de ned to be y A xA 1. Some genetic algorithms based on common intervals have been proposed for sequencing problems (e.g. traveling salesman problem, single machine scheduling problem, etc. and have exhibited good prospect [1, 2, 3, 4]. In this paper, we consider enumeration of all common intervals of length 2 to n. Three algorithms are proposed, which are improved versions of a simple O(n 2 ) time algorithm proposed in [5] 1. A simple O(n 2 ) time algorithm (called LHP) whose expected running time becomes O(n) for two ....

R. M. Brady, Optimization Strategies Gleaned from Biological Evolution, Nature, 317 (1985), 804-806.

....for graph in the class of difficult instances GBui (100; 4; 10) The number of unique local minima plotted is 2,343. For each solution, we plot its cost against its average distance, in terms of single vertex moves shift moves , to all 2,499 other solutions. with local search strategies, [4] [25] 24] 29] showed that improved results were possible for the Traveling Salesman Problem (TSP) and partitioning. The basic approach in these works allow an iterative algorithm to improve each individual, either before or while being combined with other individuals to form new solution ....

R.M. Brady, "Optimization Strategies Gleaned from Biological Evolution," Nature 317 (1985), pp. 804--806.

....appear to be many possible strands of evidence supporting this model. It is widely recognised that the genetic material (DNA) in the chromosome contains much more enough information to create an organism; a large percentage of the chromosome of higher organisms is junk i. e has no apparent function (Brady, 1985). Mechanisms also exist for switching on and off the gene activity of structural genes (Brown, 1989) Biologists realised (Beardsley, 1991) almost 50 years ago that as cells differentiate they switch some genes on and others off, making it possible for a single fertilized egg to unfold into a ....

....one approach may be to generate an initial population in such a way that high level sections have required active bits set and the low level randomly generated. Then one could use restricted mutations on the high level bits to the closure of shift to the left or right (or using local mutation (Brady, 1985) which swaps the position of two high level genes) Though this approach is ad hoc, but it can avoid both under and overspecification problem in encoding (Smith and Goldberg, 1992) An alternative and more general approach may be to use randomly generated population and scan each individual from ....

Brady, R. M. (1985). Optimization strategies gleaned from biological evolution.

....attracted researchers to this new technique. By the end of 1986, the GA had been applied to a significant number of difficult engineering tasks. Goldberg[24] and Kuo[26] used the GA for designing pump pipeline systems; Brady used the method to attack the infamous Traveling Salesman Problem [9]; Minga[47] and Goldberg Samtani[27] attacked structural optimization problems in aircraft and trusses; and Fourman[23] Davis, and Smith[18] used GAs to compact and layout VLSI circuits. These were very difficult tasks, especially when considering the modest computing power available in 1986 ....

R. M. Brady. Optimization strategies gleaned from biological evolution. Nature, 317:804--806, 1985.

....[6] 7] allows large variations in the phenotype while maintaining high viability by allowing multiple simultaneous genetic changes. It is therefore able to function well in complex changing environments. The central feature of sGA is its use of genetic redundancy (as in biological systems [2]) and hierarchical genomic structures in its chromosome. The primary mechanism for resolving the conflict of redundancy is through regulatory genes [3] which act as switching (or dominance) operators to turn genes on (active) and off (passive) respectively. It is analogous to the controlled ....

R. M. Brady. Optimization strategies gleaned from biological evolution. Nature,

No context found.

R. M. Brady, "Optimization Strategies Gleaned from Biological Evolution," Nature, vol. 317, pp. 804--806, 1985.

No context found.

R. M. Brady, \Optimization Strategies Gleaned from Biological Evolution, " Nature, 317, (1985), 804-806.

No context found.

R. M. Brady. Optimization strategies gleaned from biological evolution. Nature, 317:804-806, 1985.

No context found.

Brady, R.M. (1985). Optimization Strategies Gleaned From Biological Evolution, Nature, 317, pp. 804806.

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