Heuristic combinatorial optimization by simulated Darwinian evolution: A polynomial time algorithm for the traveling salesman problem
From MaRDI portal
Publication:757282
DOI10.1007/BF00197287zbMath0722.92009OpenAlexW1995107402MaRDI QIDQ757282
J. Ambati, B. K. Ambati, Mahmoud M. Mokhtar
Publication date: 1991
Published in: Biological Cybernetics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00197287
genetic algorithmheuristic algorithmtime complexitynatural selectionDarwinian evolutionfastest sorting schemenear-optimal solutions to the Traveling Salesman Problem
Problems related to evolution (92D15) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20)
Related Items
Applying evolutionary programming to selected control problems ⋮ ASYMPTOTIC CONVERGENCE PROPERTIES OF GENETIC ALGORITHMS AND EVOLUTIONARY PROGRAMMING: ANALYSIS AND EXPERIMENTS ⋮ Drift analysis and average time complexity of evolutionary algorithms ⋮ Optimization by hierarchical mutant production ⋮ Genetic algorithms for the traveling salesman problem based on a heuristic crossover operation
Cites Work