Heuristic combinatorial optimization by simulated Darwinian evolution: A polynomial time algorithm for the traveling salesman problem

DOI10.1007/BF00197287zbMath0722.92009MaRDI QIDQ757282

B. K. Ambati, J. Ambati, Mahmoud M. Mokhtar

Publication date: 1991

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

zbMATH Keywords

genetic algorithm; heuristic algorithm; time complexity; natural selection; Darwinian evolution; fastest sorting scheme; near-optimal solutions to the Traveling Salesman Problem

Mathematics Subject Classification ID

92D15: Problems related to evolution

68R05: Combinatorics in computer science

68R10: Graph theory (including graph drawing) in computer science

05C20: Directed graphs (digraphs), tournaments

Related Items

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, Applying evolutionary programming to selected control problems

Cites Work

• ``Neural computation of decisions in optimization problems
• Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item