New evolutionary genetic algorithms for NP-complete combinatorial optimization problems

DOI10.1007/BF00198963zbMath0793.90058MaRDI QIDQ1262019

Fam Quang Bac, V. L. Perov

Publication date: 7 September 1993

Published in: Biological Cybernetics (Search for Journal in Brave)

zbMATH Keywords

flowshopcrossover operatorasymmetric traveling salesmanNP-complete combinatorial optimization

Mathematics Subject Classification ID

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

Related Items (4)

Scheduling semiconductor in-line steppers in new product/process introduction scenarios ⋮ Metaheuristics: A bibliography ⋮ Scheduling of multiple in-line steppers for semiconductor wafer fabs ⋮ A hybrid neural-genetic algorithm for the frequency assignment problem in satellite communications

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• The ``molecular traveling salesman
• ``Neural computation of decisions in optimization problems
• Genetic algorithms: Foundations and applications
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

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