New Evolutionary Genetic Algorithms for Combinatorial Optimization Problems
This paper deals with the NP-complete combinatorial optimization problems. A large number of papers has been devoted to them. A traditional approach of Operational Research has been used (Lawler et al. 1985). Kirkpatrick et al. (1983) used Simulated Annealing. Hopfield and Tank (1985) applied a neural networks for finding suboptimal solution for TSP. In recent years interest has raised to apply evolutionary algorithms to combinatorial optimization problems (Holland 1975; Brady 1985).
Unable to display preview. Download preview PDF.
- Goldberg, D.E., Lingle, R. (1985), Alleles, loci, and the traveling salesman problem. In Proc. Int. com. on Genetic Algorithms and their Applications. Carnegie Mellon University, Pittsburgh, pp. 154–159.Google Scholar
- Holland, J.H. (1975) Adaption in nature and artificial systems. University of Michigan Press, Ann Arbor.Google Scholar
- Hopfield, J.J., Tank, D.W. (1985), “Neural” computation of decisions in optimization problems. Biol cybern 52: 141–152.Google Scholar
- Lawler, E.L., Lenstra, J.K., Rinnooy, Kan A.H.G. (1985), The traveling salesman problem. Wiley, New York.Google Scholar