A Comparison of Genetic Sequencing Operators (1991) [72 citations — 3 self]
by
T. Starkweather
,
S. Mcdaniel
,
D. Whitley
,
K. Mathias
,
D. Whitley
,
Mechanical Engineering Dept
Proceedings of the fourth International Conference on Genetic Algorithms
Add To MetaCart
Abstract:
This work compares six sequencing operators that have been developed for use with genetic algorithms. An improved version of the edge recombination operator is presented, the concepts of adjacency, order, and position are reviewed in the context of these operators, and results are compared for a 30 city "Blind" Traveling Salesman Problem and a real world warehouse/shipping scheduling application.
Citations
| 5180 | Genetic Algorithms – Goldberg - 1989 |
| 122 | A study of permutation crossover operators on the travelling salesman problem – Oliver, Smith, et al. - 1987 |
| 115 | Alleles, loci, and the traveling salesman problem – Goldberg, Lingle - 1985 |
| 87 | Applying adaptive algorithms to epistatic domains – Davis - 1985 |
| 86 | Scheduling problems and travelling salesman: the genetic edge recombination operator – Whitley, Starkweather, et al. - 1989 |
| 71 | GENITOR: A Different Genetic Algorithm – Whitley, Kauth - 1988 |
| 67 | Genitor II: a Distributed Genetic Algorithm – Whitley, Starkweather - 1990 |
| 64 | Schedule optimization using genetic algorithms – Syswerda - 1990 |
| 49 | The Travelling Salesman and Sequence Scheduling: Quality Solutions Using Genetic Edge Recombination – Whitley, Starkweather, et al. - 1991 |
| 12 | Improving TSP Exchange Heuristics by Population Genetics – Ulder, Pesch, et al. - 1991 |

