New crossover methods for sequencing problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1141, Issue , 1996, Pages 290-299

  Aşveren, Tolga ^a   Molitor, Paul ^a  

^a MARTIN LUTHER UNIVERSITY HALLE WITTENBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY DECISION DIAGRAMS;

CROSSOVER METHODS; CROSSOVER OPERATOR; LOCAL INFORMATION; NEIGHBORHOOD INFORMATION; OPTIMAL VARIABLES; SCHEDULING PROBLEM; SEQUENCING PROBLEMS;

PROBLEM SOLVING;

EID: 84958976172     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61723-X_993     Document Type: Conference Paper

References (16)

1. Goldberg, D.E.: Genetic and Evolutionary Algorithms Come of Age. CACM, volume 37(3), 1994.
2. Goldberg, D.E., Lingle J.R.: Alleles, Loci and the Traveling Salesman Problem. First Int’l Conf. on Genetic Algorithms and Their Applications, Erlbaum Associates, 1985.
3. Oliver, I.M., Smith, D.J., Holland, J.R.: A Study of Permutation Crossover Operators on the Traveling Salesman Problem. Second Int’l Conf. on Genetic Algorithms and Their Applications, 1987.
4. Prasanna, J., Jung, Y.S., Gucht, D.V.: The Effects of Population Size, Heuristic Crossover and Local Improvement on a Genetic Algorithm for the Traveling Salesman Problem. Third Int’l Conf. on Genetic Algorithms, 1989.
5. Whitley, D., Starkweather, T., Fuquay, D.: Scheduling Problems and Traveling Salesman: The Genetic Edge Recombination operator. Third Int’l Conf. on Genetic Algorithms, 1989.
6. Mathias, K., Whitley, D.: Genetic Operators, The Fitness Landscape and the Traveling Salesman Problem. Second Int’l Conf. on Parallel Problem Solving from Nature, pp.221-230, 1992.
7. Ulder, N., Aarts, E., Bandelt, H., van Laarhoven, P., Pesch, E.: Genetic Local Search Algorithms for the Traveling Salesman Problem. First Int’l Conf. on Parallel Problem Solving from Nature, pp.109-116, 1990.
8. Schleuter, M.G.: ASPARAGOS: An Asynchronous Parallel Genetic Optimization Strategy. Third Int’l Conf. on Genetic Algorithms, 1989.
9. Fogarty, T., Huang, R.: Implementing the Genetic Algorithm on Transputer Based Parallel Processing Systems. First Int’l Conf. on Parallel Problem Solving from Nature, pp.145-149, 1990.
10. Maruyma, T., Kanagaya, A., Konishi, I.: An Asynchronous Fine-Grained Parallel Genetic Algorithm. Second Int’l Conf. on Parallel Problem Solving from Nature, pp.561-570, 1992.
11. Geist, A., Beguelin, A., Dongorra, J., Jiang, W., Manchek, R., Sunderam, V.: PVM3 Users’s Guide and Reference Manual. Technical Report, Oak Ridge National Lab, 1994.
12. Mühlenbein, H.: Evolution in Time and Space, the Parallel Genetic Algorithm. Foundations of Genetic Algorithms, Morgan Kaufmann, 1991.
13. Eshelman, L.J.: The CHC Adaptive Search Algorithm. Foundations of Genetic Algorithms, Morgan Kaufmann, 1991.
14. Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison Wesley, 1989.
15. Bixby, B., Reinelt, G.: TSPLIB, A Traveling Salesman Problem Library. ORSA Journal on Computing 3, pp.376-384, 1991. Access via http://ftp.zip- berlin.de/pub/mp-testdata/tsp/index.html.
16. Fox, B.R., McMahon, M.B.: Genetic Operators for Sequencing Problems. Foundations of Genetic Algorithms, Morgan Kaufmann, 1991.