Bibliography

Aarts and Stehouwer, 1993

Aarts, E. H. L. and Stehouwer, H. P. (1993).
Neural networks and the traveling salesman problem.
In Proc. Int. Conf. on Artifical Neural Networks. Spring Verlog.

Banzhaf, 1997

Banzhaf, W. (1997).
Interactive Evolution.
IOP Publishing Ltd and Oxford University Press.

Crowder and Padberg, 1980

Crowder, H. and Padberg, M. W. (1980).
Solving large scale symmetric traveling salesman problems to optimality.
In Management Science, 26:495-509.

Davis, 1985

Davis, L. (1985).
Job shop scheduling with genetic algorithms.
In Proceedings of the Second International Conference on Genetic Algorithms. Lawrence Eribaum Associates, Mahwah, NJ.

Eshelman, 1991

Eshelman, L. J. (1991).
The CHC Adaptive Search Algorithm: How to Have Safe Search When Engaging in Nontraditional Genetic Recombination.
Morgan Kauffman.

Garey and Johnson, 1979

Garey, M. R. and Johnson, D. S. (1979).
Computers and interactability: a guide to the theory of NP-completeness.
Freeman San Francisco.

Goldberg and Lingle, 1985

Goldberg, D. and Lingle, R. (1985).
Alleles, loci and the traveling salesman problem.
In Proceedings of the Second International Conference on Genetic Algorithms, Mahwah, NJ. Lawrence Eribaum Associate.

Grefenstette et al., 1985

Grefenstette, J., Gopal, R., Rosmaita, R., and Gucht., D. (1985).
Genetic algorithms for the traveling salesman problem.
In In Proceedings of the Second International Conference on Genetic Algorithms. Lawrence Eribaum Associates, Mahwah, NJ.

Hamaifar et al., 1993

Hamaifar, L., Guan, C., and Liepins, G. (1993).
A new approach to the traveling salesman problem by genetic algorithms.
In Proceedings of the Fifth International Conference on Genetic Algorithms. Los Altos, CA:Morgan Kaufmann Pulbishers.

Holland, 1975

Holland, J. (1975).
Adaptation In Natural and Artificial Systems.
The University of Michigan Press, Ann Arbor.

Jog et al., 1989

Jog, P., Suh, J. Y., and Gucht, D. V. (1989).
The effect of population size, heuristic crossover and local improvement on a genetic algorithm for the traveling salesman problem.
In Proceedings of the Third International Conference on Genetic Algorithms. Los Altos, CA:Morgan Kaufmann Pulbishers.

Jog et al., 1991

Jog, P., Suh, J. Y., and Gucht, D. V. (1991).
Parallel genetic algorithms applied to the traveling salesman problem.
In SIAM J. Optimization 1:515-529.

Kirkpatrick and Toulouse, 1985

Kirkpatrick, S. and Toulouse, G. (1985).
Configuration space analysis of travelling salesman problems.
In Journal de Physiqu 46(8):1277-1292.

Learhoven and Aarts, 1987

Learhoven, P. V. and Aarts, E. H. L. (1987).
Simulated Annealing:The Theory and Application.
Kluwer Academic Publishers.

Lin and Kernighan, 1973

Lin, S. and Kernighan, B. (1973).
An effective heuristic algorithm for the travelling-salesman problem.
In Operations Research, 21(2):498-516.

Louis, 1993

Louis, S. J. (1993).
Genetic algorithms as a computational tool for design.
In PhD thesis. Indiana University, Indiana University.

Martin et al., 1991

Martin, O., Otto, S., and Felten, E. (1991).
Large-step markov chains for the traveling salesman problem.
In Complex Systems, 5(3):299-326.

Oliver et al., 1987

Oliver, I. M., Smith, D. J., and Holland, J. R. (1987).
A study of permutation crossover operators on the traveling salesman prolbem.
In Proceedings of the Third International Conference on Genetic Algorithms. London: Lawrence Eribaum Associates.

Padberg and Rinaldi, 1987

Padberg, M. and Rinaldi (1987).
Optimization of a 532-city symmetric traveling salesman problem by branch and cut.
In Operations Research Letters 6(1):1-7.

Reinelt, 1996

Reinelt, G. (1996).
http://www.iwr.uni-heidelberg.de/ iwr/comopt/soft/tsplib95/tsplib.html.

Schmitt and Amini, 1998

Schmitt, L. J. and Amini, M. N. (1998).
Performance characteristics of alternative genetic algorithmic approaches to the traveling salesman problem using path representation: An empirical study.
In European Journal of Operational Research 108: 551-570.

Starkweather et al., 1991

Starkweather, T., Whitley, D., Whitley, C., and Mathial, K. (1991).
A comparison of genetic sequencing operators.
In Proceedings of the Fourth International Conference on Genetic Algorithms. Los Altos, CA:Morgan Kaufmann Pulbishers.

Valenzuela, 1995

Valenzuela, C. L. (1995).
Evolutionary Divide and Conquer: a novel genetic approach to th e TSP.
PhD thesis, Imperial College, University of London, London, England.

Whitley et al., 1991

Whitley, C., Starkweather, T., and Shaner, D. (1991).
The traveling salesman and sequence scheduling quality solutions using genetic edge recombination.
In Handbook of Genetic Algorithms. New York:Van Nostrand Reinhold.

Whitley et al., 1989

Whitley, D., Starkweather, T., and Fuquay, D. (1989).
Scheduling problems and traveling salesman: The genetic edge recombination operator.
In Proceedings of the Third International Conference on Genetic Algorithms. Los Altos, CA:Morgan Kaufmann Pulbishers.