New evolutionary genetic algorithms for NP-complete combinatorial optimization problems

DOI10.1007/BF00198963MaRDI QIDQ1262019zbMATH OpenFDO

Authors Fam Quang Bac, V. L. Perov

Publication date 7 September 1993

Published in Biological Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF00198963

zbMATH Keywords

asymmetric traveling salesmancrossover operatorflowshopNP-complete combinatorial optimization

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60) Problems related to evolution (92D15)

Recommendations

• A new genetic algorithm applied to the traveling salesman problem
• Algorithmes génétiques hybrides pour l'optimisation combinatoire
• Heuristic combinatorial optimization by simulated Darwinian evolution: A polynomial time algorithm for the traveling salesman problem
• scientific article; zbMATH DE number 1728445
• A taxonomy of evolutionary algorithms in combinatorial optimization

Cites work

• ``Neural computation of decisions in optimization problems
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Genetic algorithms: Foundations and applications
• scientific article; zbMATH DE number 4104743 (Why is no real title available?)
• Optimization by simulated annealing
• The ``molecular traveling salesman

Cited in

(9)

• Metaheuristics: A bibliography
• Evolutionary operators for the Hamiltonian completion problem
• scientific article; zbMATH DE number 1728445 (Why is no real title available?)
• Scheduling semiconductor in-line steppers in new product/process introduction scenarios
• scientific article; zbMATH DE number 2102024 (Why is no real title available?)
• Scheduling of multiple in-line steppers for semiconductor wafer fabs
• Balanced-evolution genetic algorithm for combinatorial optimization problems: the general outline and implementation of balanced-evolution strategy based on linear diversity index
• Heuristic combinatorial optimization by simulated Darwinian evolution: A polynomial time algorithm for the traveling salesman problem
• A hybrid neural-genetic algorithm for the frequency assignment problem in satellite communications

This page was built for publication: New evolutionary genetic algorithms for NP-complete combinatorial optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1262019)