Cover des Buches

"Evolutionäre Algorithmen - Verfahren, Operatoren, Hinweise aus der Praxis"

Hartmut Pohlheim
Berlin, Heidelberg, New York: Springer-Verlag
322 Seiten, 105 Abbildungen und Tabellen
mit Matlab-Toolbox auf CD-ROM (GEATbx 1.95, Vollversion)

ISBN 3-540-66413-0 (erschienen: Oktober 1999)
Preis: DM 98,- DM

(Kombinatorische Optimierung)

Kombinatorische Optimierung (TSP, Scheduling)

Aarts, E. and Verhoeven, M.: Evolutionary Computation in Practice: Genetic local search for the traveling salesman problem. In [HEC97], G9.5, pp. G9.5:1-G9.5:7, 1997.

Asveren, T. and Molitor, P.: New Crossover Methods For Sequencing Problems. In [PPSN4], pp. 290-299, 1996.

Bagchi, S., Uckun, S., Miyabe, Y. and Kawamura, K.: Exploring problem-specific recombination operators for job shop scheduling. In [ICGA4], pp. 10-17, 1991.

Bierwirth, C., Mattfeld, D. C. and Kopfer, H.: On Permutation Representations for Scheduling Problems. In [PPSN4], pp. 310-318, 1996.

Bruns, R.: Evolutionary Computation Applications: Scheduling. In [HEC97], F1.5, pp. F1.5:1-F1.5:9, 1997.

Davis, L.: Applying adaptive algorithms to epistatic domains. In Proc. Int. Joint Conf. on Artificial Intelligence, 1985.

Dzubera, J. and Whitley, D.: Advanced Correlation Analysis of Operators for the Traveling Salesman Problem. In [PPSN3], pp. 68-77, 1994.

Goldberg, D. and Lingle, R.: Alleles, loci, and the traveling salesman problem. In [ICGA1], 1985.


Gorges-Schleuter, M.: Asparagos96 and the Traveling Salesman Problem. In [ICEC97], pp. 171-174, 1997.

Gorges-Schleuter, M.: On the power of evolutionary optimization at the example of ATSP and large TSP Problems. In European Conference on Artificial Life `97, Brighton, U.K., 1997.

Lin, S. and Kernighan, B.: An efficient heuristic procedure for the traveling salesman problem. Operations Res. 21, pp. 498-516, 1973.

Mathias, K. and Whitley, D.: Genetic operators, the fitness landscape and the traveling salesman problem. In [PPSN2], pp. 219-228, 1992.

Mattfeld, D. C.: Evolutionary Search and the Job Shop: Investigations on Genetic Algorithms for Production Scheduling. Heidelberg: Physica-Verlag, 1996.



Nagata, Y. and Kobayashi, S.: Edge assembly crossover: A high-power genetic algorithm for the traveling salesman problem. In [ICGA7], pp. 450-457, 1997.

Nissen, V.: Evolutionary Computation in Practice: Quadratic assignment. In [HEC97], G9.10, pp. G9.10:1-G9.10:8, 1997.

Oliver, I. M., Smith, D. J. and Holland, J. R. C.: A study of permutation crossover operators on the traveling salesman problem. In [ICGA2], pp.224-230, 1987.

Ronald, S.: Routing and scheduling problems. In [Cha95], pp. 367-430, 1995.

Starkweather, T., McDaniel, S., Mathias, K., Whitley, D. and Whitley, C.: A Comparison of Genetic Sequencing Operators. In [ICGA4], pp. 69-76, 1991.

Syswerda, G.: Schedule Optimization Using Genetic Algorithms. In [Dav91], pp. 332-349, 1991.

Tao, G. and Michalewicz, Z.: Inver-over Operator for the TSP. In [PPSN5], pp. 803-812, 1998.

Moscato, P.: TSPBIB Home page. 1996.

TSPLIB - A Traveling Salesman Problem Library. 1995.

Watson, J. P., Ross, C., Eisele, V., Denton, J., Bins, J., Guerra, C., Whitley, D. and Howe, A.: The Traveling Salesrep Problem, Edge Assembly Crossover, and 2-opt. In [PPSN5], pp. 823-832, 1998.

Whitley, D., Starkweather, T. and Fuquay, D.: Scheduling Problems and Traveling Salesman: The Genetic Edge Recombination Operator. In [ICGA3], pp. 133-140, 1989.

Whitley, D., Starkweather, T. and Shaner, D.: Traveling Salesman and Sequence Scheduling: Quality Solutions Using Genetic Edge Recombination. In [Dav91], pp. 350-372, 1991.

Whitley, D. and Yoo, N.-W.: Modeling simple genetic algorithms for permutation problems. In [FGA3], pp. 163-184, 1995.

Whitley, D.: Search Operators: Mutation: Permutations. In [HEC97], C3.2.3, pp. C3.2:5-C3.2:7, 1997.

Whitley, D.: Search Operators: Recombination: Permutations. In [HEC97], C3.3.3, pp. C3.3:14-C3.3:20, 1997.

Whitley, D.: A free lunch proof for gray versus binary encodings. In [GEC99], pp. 726-733, 1999.

© 1998-2001 Hartmut Pohlheim,, (last update: 10/2001)