Skip to main content
SpringerLink
Log in

New evolutionary genetic algorithms for NP-complete combinatorial optimization problems

  • Published:
Biological Cybernetics Aims and scope Submit manuscript

Abstract

Evolutionary genetic algorithms have been proposed to solve NP-complete combinatorial optimization problems. A new crossover operator based on group theory has been created. Computational processes motivated by proposed evolutionary genetic algorithms were described as stochastic processes, using population dynamics and interactive markovian chains. The proposed algorithms were used in solving flowshop problems and an asymmetric traveling salesman problem. The experimental results showed the superiority of new evolutionary algorithms in comparison with the standard genetic algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Banzhaf W (1990) The “molecular” traveling salesman. Biol Cybern 64:7–14

    Google Scholar 

  • Boseniuk T, Ebeling W, Engel A (1987) Boltzmann and Darwin strategies in complex optimization. Phys Lett 125A:307–310

    Google Scholar 

  • Brady RM (1985) Optimization strategies leaned from natural evolution. Nature 317:804–806

    Google Scholar 

  • Fogel DB (1988) An evolutionary approach to the traveling salesman problem. Biol Cybern 60:139–144

    Google Scholar 

  • Fontana W, Schuster P (1987) A computer model of evolutionary optimization. Biophys Chem 26:123–147

    Google Scholar 

  • Goldberg DE, Lingle R (1985) Alleles, loci, and the traveling salesman problem. In: Proceedings of the International Conference on Genetic Algorithms and Their Applications. Carnegie Mellon University, Pittsburgh, ed. Grefenstette, Lawrence Erlbaum, Hillside, N. J. pp 154–159

    Google Scholar 

  • Grefenstette JJ, Gopal R, Rosmaita B, VanGucht D (1985) Genetic algorithms for the traveling salesman problem. In: Proceedings of the International Conference on Genetic Algorithms and Their Applications. Carnegie Mellon University, Pittsburgh, eed. Grefenstette, Lawrence Erlbaum, Hillside, N. J. pp 160–168

    Google Scholar 

  • Holland JH (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor

    Google Scholar 

  • Hopfield JJ, Tank DW (1985) “Neural” computation of decisions in optimization problems. Biol Cybern 52:141–152

    Google Scholar 

  • Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulates annealing. Science 220:671–680

    Google Scholar 

  • Lawler EL, Lenstra JK, Rinnooy Kan AHG (1985) The traveling salesman problem. Wiley, New York

    Google Scholar 

  • Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB (1989) Sequencing and scheduling. Algorithms and complexity. Report BS-R8909. Centre for Mathematics and Computer Science, Amsterdam

    Google Scholar 

  • Liepins GE, Hilliard MR (1989) Genetic algorithms. Foundations and applications. Ann Oper Res 21:31–58

    Google Scholar 

  • Lin S, Kernighan BW (1973) An effective heuristic algorithm for the raveling salesman problem. Oper Res 21:498–516

    Google Scholar 

  • Metropolis N, Resenbluth AW, Resenbluth MN, Teller AH, Teller EJ (1953) Equations of state calculations by fast computing machines. J Chem Phys 21:1087–1091

    Google Scholar 

  • Wang Q (1987) Optimization by simulating molecular evolution. Biol Cybern 57:95–101

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mendeleev Institute of Chemical Engineering, ul. Vilisa Lasisa, d. 21/1, 123480, Moscow, Russian Federation

    Fam Quang Bac & V. L. Perov

Authors
  1. Fam Quang Bac
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. L. Perov
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bac, F.Q., Perov, V.L. New evolutionary genetic algorithms for NP-complete combinatorial optimization problems. Biol. Cybern. 69, 229–234 (1993). https://doi.org/10.1007/BF00198963

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00198963

Keywords

Search

Navigation