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

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

zbMATH Keywords

genetic algorithmheuristic algorithmtime complexitynatural selectionDarwinian evolutionfastest sorting schemenear-optimal solutions to the Traveling Salesman Problem

Mathematics Subject Classification ID

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 (5)

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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• ``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

This page was built for publication: Heuristic combinatorial optimization by simulated Darwinian evolution: A polynomial time algorithm for the traveling salesman problem